maedmax: Maximal Ordered Completion
blabla

MaedMax Experiment : TPTP UEQ SAT

maedmax test SAT after changes in narrowing e24316c --json
E E sat 600
Vampire Vampire UEQ SAT examples
0.00
ALG299-1
equations: 3
iterations: 1
memory: 3 MB
restarts: 0
problem shape: none
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0

Convergent TRS

(VAR oduct(B,A)) -> )
(RULES
)
0.00
0.00
109.38
ALG300-1
equations: 2
iterations: 1
memory: 1051 MB
restarts: 0
problem shape: carbonio
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 109.38

Convergent TRS

(VAR product(product(product(product(product(product(product(B,B),B),C),product(product(product(B,B),B),C)),product(product(product(B,B),B),C)),A),C)
(RULES
A = product(product(product(product(B,B),B),A),product(B,C)) →
product(product(product(product(product(product(product(B,B),B),C),product(product(product(B,B),B),C)),product(product(product(B,B),B),C)),A),C) = A →

)
0.01
0.00
0.00
ALG302-1
equations: 2
iterations: 1
memory: 3 MB
restarts: 0
problem shape: carbonio
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0
0.01
0.00
0.01
BOO027-1
equations: 14
iterations: 2
memory: 3 MB
restarts: 0
problem shape: none
time (sec): 
reducibility constraints: 0.001
ground joinability: 0
find TRSs: 0.004
compute CPs: 0.001
main control loop: 0.002
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0

Convergent TRS

(VAR X,inverse(X)) -> on)
(RULES
add(multiply(X,inverse(Y)),multiply(X,add(X,inverse(Y)))) → X
add(multiply(X,inverse(Y)),multiply(Y,add(X,inverse(Y)))) → X
)
0.01
0.00
0.00
GRP393-2
equations: 1
iterations: 1
memory: 3 MB
restarts: 0
problem shape: zolfo
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0
0.00
0.00
2.15
GRP394-3
equations: 46
iterations: 5
memory: 26 MB
restarts: 1
problem shape: none
time (sec): 
reducibility constraints: 0.154
ground joinability: 0
find TRSs: 0.239
compute CPs: 0.514
main control loop: 1.861
rewriting: 1.255
SMT solver: 0.005
selection: 0.015
success checks: 0.048

Convergent TRS

(VAR iply(inverse(X),X) -> identit)
(RULES
multiply(identity,X) → X
multiply(inverse(Y),multiply(Y,X)) → X
multiply(multiply(X,Y),Z) → multiply(X,multiply(Y,Z))
inverse(inverse(X)) → X
inverse(identity) → identity
multiply(X,identity) → X
multiply(X,inverse(X)) → identity
)
0.00
0.01
HWC004-1
equations: 27
iterations: 2
memory: 3 MB
restarts: 0
problem shape: elio
time (sec): 
reducibility constraints: 0.002
ground joinability: 0
find TRSs: 0.009
compute CPs: 0
main control loop: 0.001
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0

Convergent TRS

(VAR > not(n0)
(RULES
and(>not(n0>),n0) → n0
or(>not(n0>),n0) → >not(n0>)
or(>not(n0>),>not(n0>)) → >not(n0>)
not(>not(n0>)) → n0
or(n0,n0) → n0
and(n0,n0) → n0
and(>not(n0>),>not(n0>)) → >not(n0>)
)
0.01
0.00
0.01
HWC004-2
equations: 15
iterations: 2
memory: 3 MB
restarts: 0
problem shape: none
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0.004
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0

Convergent TRS

(VAR X,n0) -> n)
(RULES
n1 → not(n0)
or(X,not(n0)) → not(n0)
not(not(n0)) → n0
)
0.01
0.00
2.00
LCL407-2
equations: 146
iterations: 14
memory: 15 MB
restarts: 2
problem shape: none
time (sec): 
reducibility constraints: 1.059
ground joinability: 0
find TRSs: 1.447
compute CPs: 0.1
main control loop: 0.289
rewriting: 0.15
SMT solver: 0.063
selection: 0.007
success checks: 0.029

Convergent TRS

(VAR star(X,not(falsehood)) -> )
(RULES
xor(xor(falsehood,X),X) → falsehood
and_star(not(falsehood),xor(falsehood,X)) → and_star(not(falsehood),X)
and_star(not(and_star(xor(falsehood,X),xor(falsehood,Y))),xor(falsehood,Y)) → and_star(not(and_star(xor(falsehood,X),Y)),Y)
and_star(not(and_star(xor(not(falsehood),X),xor(falsehood,Y))),xor(falsehood,Y)) → and_star(not(and_star(xor(not(falsehood),X),Y)),Y)
and_star(xor(not(falsehood),X),xor(falsehood,X)) → falsehood
and_star(not(and_star(not(falsehood),X)),xor(falsehood,X)) → falsehood
xor(X,X) → falsehood
not(not(X)) → X
and_star(X,falsehood) → falsehood
and_star(xor(falsehood,X),xor(not(falsehood),X)) → falsehood
and_star(not(and_star(not(falsehood),X)),X) → falsehood
xor(X,xor(falsehood,Y)) → xor(X,Y)
and_star(xor(not(falsehood),X),X) → falsehood
and_star(not(and_star(falsehood,X)),X) → not(xor(not(falsehood),X))
xor(X,not(falsehood)) → not(X)
xor(not(xor(not(falsehood),X)),X) → falsehood
xor(X,xor(not(falsehood),Y)) → xor(not(X),Y)
xor(X,falsehood) → X and_star(not(and_star(xor(falsehood,X),xor(not(falsehood),Y))),xor(not(falsehood),Y)) = and_star(not(and_star(xor(falsehood,Y),xor(not(falsehood),X))),xor(not(falsehood),X))

and_star(not(and_star(xor(falsehood,Y),X)),X) = and_star(not(and_star(xor(not(falsehood),X),xor(not(falsehood),Y))),xor(not(falsehood),Y)) →

and_star(not(and_star(xor(not(falsehood),X),Y)),Y) = and_star(not(and_star(xor(not(falsehood),Y),X)),X) →

)
0.01
0.01
1.50
LCL905-1
equations: 125
iterations: 13
memory: 9 MB
restarts: 2
problem shape: none
time (sec): 
reducibility constraints: 0.745
ground joinability: 0
find TRSs: 1.058
compute CPs: 0.073
main control loop: 0.22
rewriting: 0.098
SMT solver: 0.049
selection: 0.011
success checks: 0.022

Convergent TRS

(VAR ehood -> not(truth)
(RULES
and_star(not(and_star(truth,X)),xor(truth,xor(truth,X))) → not(truth)
and_star(not(and_star(truth,X)),X) → not(truth)
xor(X,not(truth)) → X
xor(X,xor(truth,xor(truth,Y))) → xor(X,Y)
and_star(truth,xor(truth,xor(truth,X))) → and_star(truth,X)
and_star(not(and_star(not(truth),X)),X) → not(xor(truth,X))
and_star(xor(truth,X),X) → not(truth)
xor(X,X) → not(truth)
and_star(X,not(truth)) → not(truth)
xor(xor(truth,xor(truth,X)),X) → not(truth)
and_star(X,truth) → X
xor(not(X),Y) → xor(X,xor(truth,Y))
not(not(X)) → X
and_star(xor(truth,X),xor(truth,xor(truth,X))) → not(truth)
xor(X,truth) → not(X) and_star(not(and_star(xor(truth,X),xor(truth,xor(truth,Y)))),xor(truth,xor(truth,Y))) = and_star(not(and_star(xor(truth,Y),xor(truth,xor(truth,X)))),xor(truth,xor(truth,X)))

and_star(not(and_star(xor(truth,X),Y)),Y) = and_star(not(and_star(xor(truth,Y),X)),X) →

and_star(not(and_star(xor(truth,Y),xor(truth,xor(truth,X)))),xor(truth,xor(truth,X))) = and_star(not(and_star(xor(truth,X),Y)),Y) →

and_star(not(and_star(xor(truth,X),xor(truth,xor(truth,Y)))),xor(truth,xor(truth,Y))) = and_star(not(and_star(xor(truth,X),Y)),Y) →

and_star(not(and_star(xor(truth,X),Y)),Y) = and_star(not(and_star(xor(truth,X),xor(truth,xor(truth,Y)))),xor(truth,xor(truth,Y))) →

)
0.01
0.01
5.55
RNG042-2
equations: 35
iterations: 2
memory: 142 MB
restarts: 1
problem shape: xeno
time (sec): 
reducibility constraints: 0.575
ground joinability: 0
find TRSs: 0.69
compute CPs: 0.482
main control loop: 4.707
rewriting: 1.03
SMT solver: 0.009
selection: 0.105
success checks: 2.193

Convergent TRS

(VAR Y,add(X,additive_inverse(Y))) -> )
(RULES
multiply(additive_inverse(X),Y) → additive_inverse(multiply(X,Y))
add(additive_inverse(X),X) → additive_identity
add(Y,add(additive_inverse(Y),X)) → X
multiply(add(X,Z),Y) → add(multiply(X,Y),multiply(Z,Y))
multiply(additive_identity,X) → additive_identity
add(additive_identity,X) → X
multiply(X,additive_inverse(Y)) → additive_inverse(multiply(X,Y))
add(additive_inverse(Y),add(X,Y)) → X
add(add(X,Y),Z) → add(X,add(Y,Z))
multiply(X,additive_identity) → additive_identity
additive_inverse(additive_identity) → additive_identity
add(X,additive_identity) → X
additive_inverse(additive_inverse(X)) → X
multiply(X,add(Y,Z)) → add(multiply(X,Y),multiply(X,Z))
add(X,additive_inverse(X)) → additive_identity
additive_inverse(add(X,Y)) → add(additive_inverse(X),additive_inverse(Y)) add(Y,add(Z,X)) = add(X,add(Y,Z))
add(X,add(Y,Z)) = add(Y,add(X,Z)) →

add(X,add(Y,Z)) = add(Y,add(Z,X)) →
)
3.09
RNG042-3
equations: 88
iterations: 5
memory: 70 MB
restarts: 1
problem shape: xeno
time (sec): 
reducibility constraints: 0.441
ground joinability: 0
find TRSs: 0.555
compute CPs: 0.509
main control loop: 2.376
rewriting: 0.656
SMT solver: 0.008
selection: 0.078
success checks: 0.608

Convergent TRS

(VAR Y,add(X,additive_inverse(Y))) -> )
(RULES
add(Y,add(additive_inverse(Y),X)) → X
add(additive_inverse(Y),add(X,Y)) → X
add(Z,add(X,add(additive_inverse(Z),Y))) → add(X,Y)
add(Z,add(X,add(Y,additive_inverse(Z)))) → add(X,Y)
multiply(additive_inverse(X),Y) → additive_inverse(multiply(X,Y))
additive_inverse(additive_identity) → additive_identity
add(X,additive_identity) → X
add(X,additive_inverse(X)) → additive_identity
multiply(multiply(X,Y),Z) → multiply(X,multiply(Y,Z))
multiply(add(X,Z),Y) → add(multiply(X,Y),multiply(Z,Y))
multiply(additive_identity,X) → additive_identity
add(additive_identity,X) → X
multiply(X,additive_inverse(Y)) → additive_inverse(multiply(X,Y))
add(add(X,Y),Z) → add(X,add(Y,Z))
multiply(X,additive_identity) → additive_identity
additive_inverse(additive_inverse(X)) → X
multiply(X,add(Y,Z)) → add(multiply(X,Y),multiply(X,Z))
additive_inverse(add(Y,X)) → add(additive_inverse(X),additive_inverse(Y))
add(additive_inverse(Z),add(X,add(Z,Y))) → add(X,Y)
add(additive_inverse(Z),add(X,add(Y,Z))) → add(X,Y) add(Y,add(Z,X)) = add(X,add(Y,Z))
add(X,add(Y,Z)) = add(Y,add(X,Z)) →

add(X,add(Y,Z)) = add(Y,add(Z,X)) →
)
0.00
SYN305-1
equations: 2
iterations: 1
memory: 3 MB
restarts: 0
problem shape: elio
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0

Convergent TRS

(VAR (X)) -> )
(RULES
)
0.01
0.00
0.00
SYN552-1
equations: 2
iterations: 1
memory: 3 MB
restarts: 0
problem shape: none
time (sec): 
reducibility constraints: 0
ground joinability: 0
find TRSs: 0
compute CPs: 0
main control loop: 0
rewriting: 0
SMT solver: 0
selection: 0
success checks: 0
0.00
0.00
max_iterations 14
max_restarts 2
equalities 146
total equalities 508
goals
restarts 7
hard restarts
successes 141211
timeouts 115132133
median time 0.0140.008
time/overlaps 2s (1%)
time/rewrite 3s (3%)
time/select 0s (0%)
time/subsumption checks
time/success checks 112s (91%)
time/sat 0s (0%)
total time 123.7090.080.025
average time 8.840.01
errors 15
average memory 215 MB
OVERALL STATS
solved14
diff solved3