{"uid":"cap_kXXIFapr7SJxG2sOSlpou","slug":"compute-siliq-io-73770449","name":"compute.siliq.io OR-Tools CP-SAT Solver","description":"","url":"https://compute.siliq.io/solve","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"properties":{}},"type":{"type":"string","const":"http"},"method":{"enum":["POST","PUT","PATCH"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false},"output":{"type":"object","required":["type"],"properties":{"type":{"type":"string"},"example":{"type":"object"}}}}},"responseSchema":null,"example":{"request":{"input":{"body":{"objective":{"type":"minimize","expression":"x1 + x2"},"variables":{"x1":{"domain":[0,10]},"x2":{"domain":[0,10]}},"constraints":[{"type":"linear","expression":"x1 + x2 >= 5"},{"type":"linear","expression":"x1 <= 8"}]},"type":"http","method":"POST","bodyType":"json"}},"response":{"status":"optimal","branches":0,"feasible":true,"solution":{"x1":0,"x2":0},"conflicts":0,"solve_time_ms":68,"objective_value":0,"constraints_total":0,"constraints_satisfied":0}},"exampleRequest":{"objective":{"type":"minimize","expression":"x1 + x2"},"variables":{"x1":{"domain":[0,10]},"x2":{"domain":[0,10]}},"constraints":[{"type":"linear","expression":"x1 + x2 >= 5"},{"type":"linear","expression":"x1 <= 8"}]},"tags":["x402"],"displayCostAmount":"0.010000","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"settled","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"down","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.010000/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_PyQBT29LHVKNCOPCU9b6O","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.01","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Accepts a constraint satisfaction or optimization problem defined as constraints and variables, and returns a verified feasible or optimal solution using Google OR-Tools CP-SAT solver.","exampleAgentPrompt":"I need to assign 8 workers to 3 shifts (morning, afternoon, night) over 5 days — each shift needs at least 2 workers, no worker can do more than 5 shifts total, and workers Alice and Bob can't share the same shift. Can you run the CP-SAT solver to find a valid assignment?","exampleUseCases":null,"resultDescription":"Returns a solution object containing: the solver status (OPTIMAL, FEASIBLE, INFEASIBLE, or UNKNOWN), assigned values for all decision variables, and an optimality or feasibility certificate. If a solution exists, variable assignments are verified to satisfy all submitted constraints.","failureModes":["Infeasible problem: constraints are contradictory, solver returns INFEASIBLE status","Timeout: problem too large or complex for solver time limit, returns UNKNOWN status","Malformed constraint input: missing variable definitions or invalid constraint syntax returns 4xx error","Unbounded objective: no finite optimum exists, returns error or UNBOUNDED status","Payment failure: x402 payment not processed, returns 402 with payment requirements"],"whenToPreferThis":"Use this endpoint when you need a verified, provably correct solution to a discrete or combinatorial optimization problem — scheduling, assignment, packing, routing — especially when you need hard constraint satisfaction guarantees. Prefer over heuristic or metaheuristic solvers when correctness matters. Prefer over LP solvers when variables are integer or Boolean. Best for problems expressible in CP-SAT's constraint language.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T14:26:52.750Z","isFirstParty":false}