mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
54 lines
1.5 KiB
Python
54 lines
1.5 KiB
Python
###############################################################################
|
|
# Top contributors (to current version):
|
|
# Alex Ozdemir
|
|
#
|
|
# This file is part of the cvc5 project.
|
|
#
|
|
# Copyright (c) 2009-2025 by the authors listed in the file AUTHORS
|
|
# in the top-level source directory and their institutional affiliations.
|
|
# All rights reserved. See the file COPYING in the top-level source
|
|
# directory for licensing information.
|
|
# #############################################################################
|
|
#
|
|
# A simple demonstration of the capabilities of cvc5
|
|
#
|
|
# A simple demonstration of how to use uninterpreted functions, combining this
|
|
# with arithmetic, and extracting a model at the end of a satisfiable query.
|
|
# The model is displayed using getValue().
|
|
##
|
|
from cvc5.pythonic import *
|
|
|
|
if __name__ == "__main__":
|
|
|
|
U = DeclareSort("U")
|
|
x, y = Consts("x y", U)
|
|
|
|
f = Function("f", U, IntSort())
|
|
p = Function("p", IntSort(), BoolSort())
|
|
|
|
assumptions = [f(x) >= 0, f(y) >= 0, f(x) + f(y) <= 1, Not(p(0)), p(f(y))]
|
|
|
|
prove(Implies(And(assumptions), x != y))
|
|
|
|
s = Solver()
|
|
s.add(assumptions)
|
|
assert sat == s.check()
|
|
m = s.model()
|
|
|
|
def print_val(t):
|
|
print("{}: {}".format(t, m[t]))
|
|
|
|
# print the of some terms
|
|
print_val(f(x))
|
|
print_val(f(y))
|
|
print_val(f(x) + f(y))
|
|
print_val(p(0))
|
|
print_val(p(f(y)))
|
|
|
|
# print value of *all* terms
|
|
def print_all_subterms(t):
|
|
print_val(t)
|
|
for c in t.children():
|
|
print_all_subterms(c)
|
|
print_all_subterms(And(assumptions))
|