mirror of
https://github.com/Z3Prover/z3
synced 2025-11-04 05:19:11 +00:00
Fix some PEP-8 violations in Python code (#5295)
* reformat python code using autopep8 * manually wrap some too long lines and adjust some checks * run autopep8 in aggressive mode * run autopep8 in very aggressive mode * manually reformat z3types.py * unify: use double quotes * use sys.version_info instead of sys.version * drop accidentally commited src/util/z3_version.h
This commit is contained in:
Gram
GitHub
parent
f1545b04d2
commit
3d8865d925
7 changed files with 1669 additions and 910 deletions
File diff suppressed because it is too large
Load diff
|
|
@ -12,12 +12,14 @@ from fractions import Fraction
|
|||
|
||||
from .z3 import _get_ctx
|
||||
|
||||
|
||||
def _to_numeral(num, ctx=None):
|
||||
if isinstance(num, Numeral):
|
||||
return num
|
||||
else:
|
||||
return Numeral(num, ctx)
|
||||
|
||||
|
||||
class Numeral:
|
||||
"""
|
||||
A Z3 numeral can be used to perform computations over arbitrary
|
||||
|
|
@ -85,6 +87,7 @@ class Numeral:
|
|||
[2.8538479564?]
|
||||
|
||||
"""
|
||||
|
||||
def __init__(self, num, ctx=None):
|
||||
if isinstance(num, Ast):
|
||||
self.ast = num
|
||||
|
|
@ -151,7 +154,6 @@ class Numeral:
|
|||
assert(self.is_rational())
|
||||
return Numeral(Z3_get_numerator(self.ctx_ref(), self.as_ast()), self.ctx)
|
||||
|
||||
|
||||
def is_irrational(self):
|
||||
""" Return True if the numeral is irrational.
|
||||
|
||||
|
|
@ -169,7 +171,7 @@ class Numeral:
|
|||
|
||||
"""
|
||||
assert(self.is_integer())
|
||||
if sys.version_info[0] >= 3:
|
||||
if sys.version_info.major >= 3:
|
||||
return int(Z3_get_numeral_string(self.ctx_ref(), self.as_ast()))
|
||||
else:
|
||||
return long(Z3_get_numeral_string(self.ctx_ref(), self.as_ast()))
|
||||
|
|
@ -440,7 +442,6 @@ class Numeral:
|
|||
"""
|
||||
return self < other
|
||||
|
||||
|
||||
def __le__(self, other):
|
||||
""" Return True if `self <= other`.
|
||||
|
||||
|
|
@ -523,6 +524,7 @@ class Numeral:
|
|||
def ctx_ref(self):
|
||||
return self.ctx.ref()
|
||||
|
||||
|
||||
def eval_sign_at(p, vs):
|
||||
"""
|
||||
Evaluate the sign of the polynomial `p` at `vs`. `p` is a Z3
|
||||
|
|
@ -547,6 +549,7 @@ def eval_sign_at(p, vs):
|
|||
_vs[i] = vs[i].ast
|
||||
return Z3_algebraic_eval(p.ctx_ref(), p.as_ast(), num, _vs)
|
||||
|
||||
|
||||
def isolate_roots(p, vs=[]):
|
||||
"""
|
||||
Given a multivariate polynomial p(x_0, ..., x_{n-1}, x_n), returns the
|
||||
|
|
@ -573,5 +576,4 @@ def isolate_roots(p, vs=[]):
|
|||
for i in range(num):
|
||||
_vs[i] = vs[i].ast
|
||||
_roots = AstVector(Z3_algebraic_roots(p.ctx_ref(), p.as_ast(), num, _vs), p.ctx)
|
||||
return [ Numeral(r) for r in _roots ]
|
||||
|
||||
return [Numeral(r) for r in _roots]
|
||||
|
|
|
|||
|
|
@ -8,6 +8,7 @@
|
|||
|
||||
from .z3 import *
|
||||
|
||||
|
||||
def subresultants(p, q, x):
|
||||
"""
|
||||
Return the non-constant subresultants of 'p' and 'q' with respect to the "variable" 'x'.
|
||||
|
|
@ -29,6 +30,7 @@ def subresultants(p, q, x):
|
|||
"""
|
||||
return AstVector(Z3_polynomial_subresultants(p.ctx_ref(), p.as_ast(), q.as_ast(), x.as_ast()), p.ctx)
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
import doctest
|
||||
if doctest.testmod().failed:
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load diff
|
|
@ -14,26 +14,31 @@ from .z3core import *
|
|||
from .z3printer import *
|
||||
from fractions import Fraction
|
||||
|
||||
|
||||
def _to_rcfnum(num, ctx=None):
|
||||
if isinstance(num, RCFNum):
|
||||
return num
|
||||
else:
|
||||
return RCFNum(num, ctx)
|
||||
|
||||
|
||||
def Pi(ctx=None):
|
||||
ctx = z3.get_ctx(ctx)
|
||||
return RCFNum(Z3_rcf_mk_pi(ctx.ref()), ctx)
|
||||
|
||||
|
||||
def E(ctx=None):
|
||||
ctx = z3.get_ctx(ctx)
|
||||
return RCFNum(Z3_rcf_mk_e(ctx.ref()), ctx)
|
||||
|
||||
|
||||
def MkInfinitesimal(name="eps", ctx=None):
|
||||
# Todo: remove parameter name.
|
||||
# For now, we keep it for backward compatibility.
|
||||
ctx = z3.get_ctx(ctx)
|
||||
return RCFNum(Z3_rcf_mk_infinitesimal(ctx.ref()), ctx)
|
||||
|
||||
|
||||
def MkRoots(p, ctx=None):
|
||||
ctx = z3.get_ctx(ctx)
|
||||
num = len(p)
|
||||
|
|
@ -50,6 +55,7 @@ def MkRoots(p, ctx=None):
|
|||
r.append(RCFNum(_rs[i], ctx))
|
||||
return r
|
||||
|
||||
|
||||
class RCFNum:
|
||||
def __init__(self, num, ctx=None):
|
||||
# TODO: add support for converting AST numeral values into RCFNum
|
||||
|
|
|
|||
|
|
@ -8,123 +8,234 @@
|
|||
|
||||
import ctypes
|
||||
|
||||
|
||||
class Z3Exception(Exception):
|
||||
def __init__(self, value):
|
||||
self.value = value
|
||||
|
||||
def __str__(self):
|
||||
return str(self.value)
|
||||
|
||||
|
||||
class ContextObj(ctypes.c_void_p):
|
||||
def __init__(self, context): self._as_parameter_ = context
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, context):
|
||||
self._as_parameter_ = context
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Config(ctypes.c_void_p):
|
||||
def __init__(self, config): self._as_parameter_ = config
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, config):
|
||||
self._as_parameter_ = config
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Symbol(ctypes.c_void_p):
|
||||
def __init__(self, symbol): self._as_parameter_ = symbol
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, symbol):
|
||||
self._as_parameter_ = symbol
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Sort(ctypes.c_void_p):
|
||||
def __init__(self, sort): self._as_parameter_ = sort
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, sort):
|
||||
self._as_parameter_ = sort
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class FuncDecl(ctypes.c_void_p):
|
||||
def __init__(self, decl): self._as_parameter_ = decl
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, decl):
|
||||
self._as_parameter_ = decl
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Ast(ctypes.c_void_p):
|
||||
def __init__(self, ast): self._as_parameter_ = ast
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, ast):
|
||||
self._as_parameter_ = ast
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Pattern(ctypes.c_void_p):
|
||||
def __init__(self, pattern): self._as_parameter_ = pattern
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, pattern):
|
||||
self._as_parameter_ = pattern
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Model(ctypes.c_void_p):
|
||||
def __init__(self, model): self._as_parameter_ = model
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, model):
|
||||
self._as_parameter_ = model
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Literals(ctypes.c_void_p):
|
||||
def __init__(self, literals): self._as_parameter_ = literals
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, literals):
|
||||
self._as_parameter_ = literals
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Constructor(ctypes.c_void_p):
|
||||
def __init__(self, constructor): self._as_parameter_ = constructor
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, constructor):
|
||||
self._as_parameter_ = constructor
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class ConstructorList(ctypes.c_void_p):
|
||||
def __init__(self, constructor_list): self._as_parameter_ = constructor_list
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, constructor_list):
|
||||
self._as_parameter_ = constructor_list
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class GoalObj(ctypes.c_void_p):
|
||||
def __init__(self, goal): self._as_parameter_ = goal
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, goal):
|
||||
self._as_parameter_ = goal
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class TacticObj(ctypes.c_void_p):
|
||||
def __init__(self, tactic): self._as_parameter_ = tactic
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, tactic):
|
||||
self._as_parameter_ = tactic
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class ProbeObj(ctypes.c_void_p):
|
||||
def __init__(self, probe): self._as_parameter_ = probe
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, probe):
|
||||
self._as_parameter_ = probe
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class ApplyResultObj(ctypes.c_void_p):
|
||||
def __init__(self, obj): self._as_parameter_ = obj
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, obj):
|
||||
self._as_parameter_ = obj
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class StatsObj(ctypes.c_void_p):
|
||||
def __init__(self, statistics): self._as_parameter_ = statistics
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, statistics):
|
||||
self._as_parameter_ = statistics
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class SolverObj(ctypes.c_void_p):
|
||||
def __init__(self, solver): self._as_parameter_ = solver
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, solver):
|
||||
self._as_parameter_ = solver
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class SolverCallbackObj(ctypes.c_void_p):
|
||||
def __init__(self, solver): self._as_parameter_ = solver
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, solver):
|
||||
self._as_parameter_ = solver
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class FixedpointObj(ctypes.c_void_p):
|
||||
def __init__(self, fixedpoint): self._as_parameter_ = fixedpoint
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, fixedpoint):
|
||||
self._as_parameter_ = fixedpoint
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class OptimizeObj(ctypes.c_void_p):
|
||||
def __init__(self, optimize): self._as_parameter_ = optimize
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, optimize):
|
||||
self._as_parameter_ = optimize
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class ModelObj(ctypes.c_void_p):
|
||||
def __init__(self, model): self._as_parameter_ = model
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, model):
|
||||
self._as_parameter_ = model
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class AstVectorObj(ctypes.c_void_p):
|
||||
def __init__(self, vector): self._as_parameter_ = vector
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, vector):
|
||||
self._as_parameter_ = vector
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class AstMapObj(ctypes.c_void_p):
|
||||
def __init__(self, ast_map): self._as_parameter_ = ast_map
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, ast_map):
|
||||
self._as_parameter_ = ast_map
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class Params(ctypes.c_void_p):
|
||||
def __init__(self, params): self._as_parameter_ = params
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, params):
|
||||
self._as_parameter_ = params
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class ParamDescrs(ctypes.c_void_p):
|
||||
def __init__(self, paramdescrs): self._as_parameter_ = paramdescrs
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, paramdescrs):
|
||||
self._as_parameter_ = paramdescrs
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class FuncInterpObj(ctypes.c_void_p):
|
||||
def __init__(self, f): self._as_parameter_ = f
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, f):
|
||||
self._as_parameter_ = f
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class FuncEntryObj(ctypes.c_void_p):
|
||||
def __init__(self, e): self._as_parameter_ = e
|
||||
def from_param(obj): return obj
|
||||
def __init__(self, e):
|
||||
self._as_parameter_ = e
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
||||
|
||||
class RCFNumObj(ctypes.c_void_p):
|
||||
def __init__(self, e): self._as_parameter_ = e
|
||||
def from_param(obj): return obj
|
||||
|
||||
|
||||
def __init__(self, e):
|
||||
self._as_parameter_ = e
|
||||
|
||||
def from_param(obj):
|
||||
return obj
|
||||
|
|
|
|||
|
|
@ -14,6 +14,7 @@ import common_z3 as CM_Z3
|
|||
import ctypes
|
||||
from .z3 import *
|
||||
|
||||
|
||||
def vset(seq, idfun=None, as_list=True):
|
||||
# This functions preserves the order of arguments while removing duplicates.
|
||||
# This function is from https://code.google.com/p/common-python-vu/source/browse/vu_common.py
|
||||
|
|
@ -32,7 +33,7 @@ def vset(seq, idfun=None, as_list=True):
|
|||
d_[s] = None
|
||||
yield s
|
||||
|
||||
def _uniq_idfun(seq,idfun):
|
||||
def _uniq_idfun(seq, idfun):
|
||||
d_ = {}
|
||||
for s in seq:
|
||||
h_ = idfun(s)
|
||||
|
|
@ -43,7 +44,7 @@ def vset(seq, idfun=None, as_list=True):
|
|||
if idfun is None:
|
||||
res = _uniq_normal(seq)
|
||||
else:
|
||||
res = _uniq_idfun(seq,idfun)
|
||||
res = _uniq_idfun(seq, idfun)
|
||||
|
||||
return list(res) if as_list else res
|
||||
|
||||
|
|
@ -53,7 +54,7 @@ def get_z3_version(as_str=False):
|
|||
minor = ctypes.c_uint(0)
|
||||
build = ctypes.c_uint(0)
|
||||
rev = ctypes.c_uint(0)
|
||||
Z3_get_version(major,minor, build, rev)
|
||||
Z3_get_version(major, minor, build, rev)
|
||||
rs = map(int, (major.value, minor.value, build.value, rev.value))
|
||||
if as_str:
|
||||
return "{}.{}.{}.{}".format(*rs)
|
||||
|
|
@ -87,6 +88,7 @@ In Z3, variables are called *uninterpreted* consts and
|
|||
variables are *interpreted* consts.
|
||||
"""
|
||||
|
||||
|
||||
def is_expr_var(v):
|
||||
"""
|
||||
EXAMPLES:
|
||||
|
|
@ -111,7 +113,8 @@ def is_expr_var(v):
|
|||
True
|
||||
"""
|
||||
|
||||
return is_const(v) and v.decl().kind()==Z3_OP_UNINTERPRETED
|
||||
return is_const(v) and v.decl().kind() == Z3_OP_UNINTERPRETED
|
||||
|
||||
|
||||
def is_expr_val(v):
|
||||
"""
|
||||
|
|
@ -136,12 +139,10 @@ def is_expr_val(v):
|
|||
>>> is_expr_val(SafetyInjection)
|
||||
False
|
||||
"""
|
||||
return is_const(v) and v.decl().kind()!=Z3_OP_UNINTERPRETED
|
||||
return is_const(v) and v.decl().kind() != Z3_OP_UNINTERPRETED
|
||||
|
||||
|
||||
|
||||
|
||||
def get_vars(f, rs = None):
|
||||
def get_vars(f, rs=None):
|
||||
"""
|
||||
>>> x,y = Ints('x y')
|
||||
>>> a,b = Bools('a b')
|
||||
|
|
@ -158,8 +159,8 @@ def get_vars(f, rs = None):
|
|||
if is_const(f):
|
||||
if is_expr_val(f):
|
||||
return rs
|
||||
else: #variable
|
||||
return vset(rs + [f],str)
|
||||
else: # variable
|
||||
return vset(rs + [f], str)
|
||||
|
||||
else:
|
||||
for f_ in f.children():
|
||||
|
|
@ -168,7 +169,6 @@ def get_vars(f, rs = None):
|
|||
return vset(rs, str)
|
||||
|
||||
|
||||
|
||||
def mk_var(name, vsort):
|
||||
if vsort.kind() == Z3_INT_SORT:
|
||||
v = Int(name)
|
||||
|
|
@ -179,13 +179,12 @@ def mk_var(name, vsort):
|
|||
elif vsort.kind() == Z3_DATATYPE_SORT:
|
||||
v = Const(name, vsort)
|
||||
else:
|
||||
raise TypeError('Cannot handle this sort (s: %sid: %d)' %(vsort,vsort.kind()))
|
||||
raise TypeError("Cannot handle this sort (s: %sid: %d)" % (vsort, vsort.kind()))
|
||||
|
||||
return v
|
||||
|
||||
|
||||
|
||||
def prove(claim,assume=None,verbose=0):
|
||||
def prove(claim, assume=None, verbose=0):
|
||||
"""
|
||||
>>> r,m = prove(BoolVal(True),verbose=0); r,model_str(m,as_str=False)
|
||||
(True, None)
|
||||
|
|
@ -236,51 +235,51 @@ def prove(claim,assume=None,verbose=0):
|
|||
to_prove = claim
|
||||
if assume:
|
||||
if z3_debug():
|
||||
is_proved,_ = prove(Not(assume))
|
||||
is_proved, _ = prove(Not(assume))
|
||||
|
||||
def _f():
|
||||
emsg = "Assumption is always False!"
|
||||
if verbose >= 2:
|
||||
emsg = "{}\n{}".format(assume,emsg)
|
||||
emsg = "{}\n{}".format(assume, emsg)
|
||||
return emsg
|
||||
|
||||
assert is_proved==False, _f()
|
||||
assert is_proved == False, _f()
|
||||
|
||||
to_prove = Implies(assume,to_prove)
|
||||
to_prove = Implies(assume, to_prove)
|
||||
|
||||
if verbose >= 2:
|
||||
print('assume: ')
|
||||
print("assume: ")
|
||||
print(assume)
|
||||
print('claim: ')
|
||||
print("claim: ")
|
||||
print(claim)
|
||||
print('to_prove: ')
|
||||
print("to_prove: ")
|
||||
print(to_prove)
|
||||
|
||||
f = Not(to_prove)
|
||||
|
||||
models = get_models(f,k=1)
|
||||
if models is None: #unknown
|
||||
print('E: cannot solve !')
|
||||
models = get_models(f, k=1)
|
||||
if models is None: # unknown
|
||||
print("E: cannot solve !")
|
||||
return None, None
|
||||
elif models == False: #unsat
|
||||
return True,None
|
||||
else: #sat
|
||||
elif models == False: # unsat
|
||||
return True, None
|
||||
else: # sat
|
||||
if z3_debug():
|
||||
assert isinstance(models,list)
|
||||
assert isinstance(models, list)
|
||||
|
||||
if models:
|
||||
return False, models[0] #the first counterexample
|
||||
return False, models[0] # the first counterexample
|
||||
else:
|
||||
return False, [] #infinite counterexample,models
|
||||
return False, [] # infinite counterexample,models
|
||||
|
||||
|
||||
def get_models(f,k):
|
||||
def get_models(f, k):
|
||||
"""
|
||||
Returns the first k models satisfiying f.
|
||||
If f is not satisfiable, returns False.
|
||||
If f cannot be solved, returns None
|
||||
If f is satisfiable, returns the first k models
|
||||
Note that if f is a tautology, e.g.\ True, then the result is []
|
||||
Note that if f is a tautology, e.g.\\ True, then the result is []
|
||||
|
||||
Based on http://stackoverflow.com/questions/11867611/z3py-checking-all-solutions-for-equation
|
||||
|
||||
|
|
@ -323,16 +322,14 @@ def get_models(f,k):
|
|||
while s.check() == sat and i < k:
|
||||
i = i + 1
|
||||
m = s.model()
|
||||
if not m: #if m == []
|
||||
if not m: # if m == []
|
||||
break
|
||||
models.append(m)
|
||||
|
||||
|
||||
#create new constraint to block the current model
|
||||
# create new constraint to block the current model
|
||||
block = Not(And([v() == m[v] for v in m]))
|
||||
s.add(block)
|
||||
|
||||
|
||||
if s.check() == unknown:
|
||||
return None
|
||||
elif s.check() == unsat and i == 0:
|
||||
|
|
@ -340,7 +337,8 @@ def get_models(f,k):
|
|||
else:
|
||||
return models
|
||||
|
||||
def is_tautology(claim,verbose=0):
|
||||
|
||||
def is_tautology(claim, verbose=0):
|
||||
"""
|
||||
>>> is_tautology(Implies(Bool('x'),Bool('x')))
|
||||
True
|
||||
|
|
@ -355,10 +353,10 @@ def is_tautology(claim,verbose=0):
|
|||
False
|
||||
|
||||
"""
|
||||
return prove(claim=claim,assume=None,verbose=verbose)[0]
|
||||
return prove(claim=claim, assume=None, verbose=verbose)[0]
|
||||
|
||||
|
||||
def is_contradiction(claim,verbose=0):
|
||||
def is_contradiction(claim, verbose=0):
|
||||
"""
|
||||
>>> x,y=Bools('x y')
|
||||
>>> is_contradiction(BoolVal(False))
|
||||
|
|
@ -380,7 +378,7 @@ def is_contradiction(claim,verbose=0):
|
|||
True
|
||||
"""
|
||||
|
||||
return prove(claim=Not(claim),assume=None,verbose=verbose)[0]
|
||||
return prove(claim=Not(claim), assume=None, verbose=verbose)[0]
|
||||
|
||||
|
||||
def exact_one_model(f):
|
||||
|
|
@ -403,15 +401,14 @@ def exact_one_model(f):
|
|||
False
|
||||
"""
|
||||
|
||||
models = get_models(f,k=2)
|
||||
if isinstance(models,list):
|
||||
return len(models)==1
|
||||
models = get_models(f, k=2)
|
||||
if isinstance(models, list):
|
||||
return len(models) == 1
|
||||
else:
|
||||
return False
|
||||
|
||||
|
||||
|
||||
def myBinOp(op,*L):
|
||||
def myBinOp(op, *L):
|
||||
"""
|
||||
>>> myAnd(*[Bool('x'),Bool('y')])
|
||||
And(x, y)
|
||||
|
|
@ -445,38 +442,42 @@ def myBinOp(op,*L):
|
|||
if z3_debug():
|
||||
assert op == Z3_OP_OR or op == Z3_OP_AND or op == Z3_OP_IMPLIES
|
||||
|
||||
if len(L)==1 and (isinstance(L[0],list) or isinstance(L[0],tuple)):
|
||||
if len(L) == 1 and (isinstance(L[0], list) or isinstance(L[0], tuple)):
|
||||
L = L[0]
|
||||
|
||||
if z3_debug():
|
||||
assert all(not isinstance(l,bool) for l in L)
|
||||
assert all(not isinstance(l, bool) for l in L)
|
||||
|
||||
L = [l for l in L if is_expr(l)]
|
||||
if L:
|
||||
if len(L)==1:
|
||||
if len(L) == 1:
|
||||
return L[0]
|
||||
if op == Z3_OP_OR:
|
||||
return Or(L)
|
||||
if op == Z3_OP_AND:
|
||||
return And(L)
|
||||
return Implies(L[0],L[1])
|
||||
return Implies(L[0], L[1])
|
||||
else:
|
||||
return None
|
||||
|
||||
|
||||
def myAnd(*L):
|
||||
return myBinOp(Z3_OP_AND,*L)
|
||||
return myBinOp(Z3_OP_AND, *L)
|
||||
|
||||
|
||||
def myOr(*L):
|
||||
return myBinOp(Z3_OP_OR,*L)
|
||||
|
||||
def myImplies(a,b):
|
||||
return myBinOp(Z3_OP_IMPLIES,[a,b])
|
||||
return myBinOp(Z3_OP_OR, *L)
|
||||
|
||||
|
||||
Iff = lambda f: And(Implies(f[0],f[1]),Implies(f[1],f[0]))
|
||||
def myImplies(a, b):
|
||||
return myBinOp(Z3_OP_IMPLIES, [a, b])
|
||||
|
||||
def model_str(m,as_str=True):
|
||||
|
||||
def Iff(f):
|
||||
return And(Implies(f[0], f[1]), Implies(f[1], f[0]))
|
||||
|
||||
|
||||
def model_str(m, as_str=True):
|
||||
"""
|
||||
Returned a 'sorted' model (so that it's easier to see)
|
||||
The model is sorted by its key,
|
||||
|
|
@ -488,15 +489,14 @@ def model_str(m,as_str=True):
|
|||
|
||||
"""
|
||||
if z3_debug():
|
||||
assert m is None or m == [] or isinstance(m,ModelRef)
|
||||
assert m is None or m == [] or isinstance(m, ModelRef)
|
||||
|
||||
if m :
|
||||
vs = [(v,m[v]) for v in m]
|
||||
vs = sorted(vs,key=lambda a,_: str(a))
|
||||
if m:
|
||||
vs = [(v, m[v]) for v in m]
|
||||
vs = sorted(vs, key=lambda a, _: str(a))
|
||||
if as_str:
|
||||
return '\n'.join(['{} = {}'.format(k,v) for (k,v) in vs])
|
||||
return "\n".join(["{} = {}".format(k, v) for (k, v) in vs])
|
||||
else:
|
||||
return vs
|
||||
else:
|
||||
return str(m) if as_str else m
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue