%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL862^1 : TPTP v9.3.1. Bugfixed v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n009.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:24:03 AM UTC 2026 % Result : Theorem 0.30s 0.57s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL862^1 : TPTP v9.3.1. Bugfixed v5.0.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.10/0.36 % Computer : n009.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sat Sep 5 10:48:21 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.44 %----Proving TH0 % 0.30/0.57 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.30/0.57 % SZS status Theorem % 0.30/0.57 % SZS output start Proof % 0.30/0.57 ( % 0.30/0.57 (declare-sort $$unsorted 0) % 0.30/0.57 (declare-sort tptp.mu 0) % 0.30/0.57 (declare-const tptp.mfalse (-> $$unsorted Bool)) % 0.30/0.57 (define tptp.meq_ind () (let ((_let_1 (@var "Y" tptp.mu))) (let ((_let_2 (@var "X" tptp.mu))) (lambda (@list _let_2 _let_1 (@var "W" $$unsorted)) (= _let_2 _let_1))))) % 0.30/0.57 (define tptp.meq_prop () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (= (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.30/0.57 (define tptp.mnot () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1)))))) % 0.30/0.57 (define tptp.mor () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.30/0.57 (define tptp.mand () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mor (_ tptp.mnot _let_3)) (_ tptp.mnot _let_2))) _let_1)))))) % 0.30/0.57 (define tptp.mimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.30/0.57 (define tptp.mimplied () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Psi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.30/0.57 (define tptp.mequiv () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Psi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mand (_ (_ tptp.mimplies _let_2) _let_3)) (_ (_ tptp.mimplies _let_3) _let_2)) _let_1)))))) % 0.30/0.57 (define tptp.mxor () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mequiv _let_3) _let_2)) _let_1)))))) % 0.30/0.57 (define tptp.mforall_ind () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.mu))) (let ((_let_3 (@var "Phi" (-> tptp.mu $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.30/0.57 (define tptp.mforall_prop () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.30/0.57 (define tptp.mexists_ind () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "X" tptp.mu))) (let ((_let_3 (@var "Phi" (-> tptp.mu $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ _let_3 _let_2)) _let_1)))) _let_1)))))) % 0.30/0.57 (define tptp.mexists_prop () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ _let_3 _let_2)) _let_1)))) _let_1)))))) % 0.30/0.57 (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.30/0.57 (define tptp.mbox () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "W" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (forall (@list _let_1) (or (not (_ (_ _let_4 _let_3) _let_1)) (_ _let_2 _let_1))))))))) % 0.30/0.57 (define tptp.mdia () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mbox _let_3) (_ tptp.mnot _let_2))) _let_1)))))) % 0.30/0.57 (define tptp.mreflexive () (let ((_let_1 (@var "S" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ (_ _let_2 _let_1) _let_1)))))) % 0.30/0.57 (define tptp.msymmetric () (let ((_let_1 (@var "S" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_1 _let_2) (=> (_ (_ _let_3 _let_1) _let_2) (_ (_ _let_3 _let_2) _let_1)))))))) % 0.30/0.57 (define tptp.mserial () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "S" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_2) (exists (@list _let_1) (_ (_ _let_3 _let_2) _let_1)))))))) % 0.30/0.57 (define tptp.mtransitive () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "S" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (_ _let_3 _let_2))) (let ((_let_5 (@var "T" $$unsorted))) (lambda (@list _let_3) (forall (@list _let_2 _let_5 _let_1) (=> (and (_ _let_4 _let_5) (_ (_ _let_3 _let_5) _let_1)) (_ _let_4 _let_1)))))))))) % 0.30/0.57 (define tptp.meuclidean () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_2 _let_1) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (_ (_ _let_3 _let_2) _let_1)))))))))) % 0.30/0.57 (define tptp.mpartially_functional () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "S" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_3))) (lambda (@list _let_4) (forall (@list _let_3 _let_2 _let_1) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (= _let_2 _let_1)))))))))) % 0.30/0.57 (define tptp.mfunctional () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "S" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_3))) (lambda (@list _let_4) (forall (@list _let_3) (exists (@list _let_2) (and (_ _let_5 _let_2) (forall (@list _let_1) (=> (_ _let_5 _let_1) (= _let_2 _let_1))))))))))))) % 0.30/0.57 (define tptp.mweakly_dense () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (_ _let_5 _let_1) (exists (@list _let_2) (and (_ _let_5 _let_2) (_ (_ _let_3 _let_2) _let_1)))))))))))) % 0.30/0.57 (define tptp.mweakly_connected () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (and (_ _let_5 _let_1) (_ _let_5 _let_2)) (or (_ (_ _let_3 _let_1) _let_2) (= _let_1 _let_2) (_ (_ _let_3 _let_2) _let_1))))))))))) % 0.30/0.57 (define tptp.mweakly_directed () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "T" $$unsorted))) (let ((_let_5 (@var "S" $$unsorted))) (let ((_let_6 (_ _let_3 _let_5))) (lambda (@list _let_3) (forall (@list _let_5 _let_4 _let_2) (=> (and (_ _let_6 _let_4) (_ _let_6 _let_2)) (exists (@list _let_1) (and (_ (_ _let_3 _let_4) _let_1) (_ (_ _let_3 _let_2) _let_1))))))))))))) % 0.30/0.57 (define tptp.mvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ _let_2 _let_1)))))) % 0.30/0.57 (define tptp.minvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.30/0.57 (define tptp.msatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (_ _let_2 _let_1)))))) % 0.30/0.57 (define tptp.mcountersatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.30/0.57 (define @t1 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.30/0.57 (define @t2 () (_ tptp.mreflexive @t1)) % 0.30/0.57 (define @t3 () (and @t2 (_ tptp.mtransitive @t1) (_ tptp.msymmetric @t1))) % 0.30/0.57 (define @t4 () (and @t2 (_ tptp.meuclidean @t1))) % 0.30/0.57 (define @t5 () (= @t4 @t3)) % 0.30/0.57 (define @t6 () (@list @t1)) % 0.30/0.57 (define @t7 () (forall @t6 @t5)) % 0.30/0.57 (define @t8 () (not @t7)) % 0.30/0.57 (define @t9 () (@var "Y" tptp.mu)) % 0.30/0.57 (define @t10 () (@var "X" tptp.mu)) % 0.30/0.57 (define @t11 () (@var "W" $$unsorted)) % 0.30/0.57 (define @t12 () (lambda (@list @t10 @t9 @t11) (= @t10 @t9))) % 0.30/0.57 (define @t13 () (@var "Y" (-> $$unsorted Bool))) % 0.30/0.57 (define @t14 () (@var "X" (-> $$unsorted Bool))) % 0.30/0.57 (define @t15 () (lambda (@list @t14 @t13 @t11) (= (_ @t14 @t11) (_ @t13 @t11)))) % 0.30/0.57 (define @t16 () (@var "Phi" (-> $$unsorted Bool))) % 0.30/0.57 (define @t17 () (_ @t16 @t11)) % 0.30/0.57 (define @t18 () (not @t17)) % 0.30/0.57 (define @t19 () (lambda (@list @t16 @t11) @t18)) % 0.30/0.57 (define @t20 () (@var "Psi" (-> $$unsorted Bool))) % 0.30/0.57 (define @t21 () (lambda (@list @t16 @t20 @t11) (or @t17 (_ @t20 @t11)))) % 0.30/0.57 (define @t22 () (@var "__flatten_var_0" $$unsorted)) % 0.30/0.57 (define @t23 () (_ tptp.mnot @t20)) % 0.30/0.57 (define @t24 () (_ tptp.mnot @t16)) % 0.30/0.57 (define @t25 () (_ tptp.mor @t24)) % 0.30/0.57 (define @t26 () (@list @t16 @t20 @t22)) % 0.30/0.57 (define @t27 () (lambda @t26 (_ (_ tptp.mnot (_ @t25 @t23)) @t22))) % 0.30/0.57 (define @t28 () (lambda @t26 (_ (_ @t25 @t20) @t22))) % 0.30/0.57 (define @t29 () (lambda @t26 (_ (_ (_ tptp.mor @t23) @t16) @t22))) % 0.30/0.57 (define @t30 () (lambda @t26 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t16) @t20)) (_ (_ tptp.mimplies @t20) @t16)) @t22))) % 0.30/0.57 (define @t31 () (lambda @t26 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t16) @t20)) @t22))) % 0.30/0.57 (define @t32 () (@var "Phi" (-> tptp.mu $$unsorted Bool))) % 0.30/0.57 (define @t33 () (_ @t32 @t10)) % 0.30/0.57 (define @t34 () (lambda (@list @t32 @t11) (forall (@list @t10) (_ @t33 @t11)))) % 0.30/0.57 (define @t35 () (@var "P" (-> $$unsorted Bool))) % 0.30/0.57 (define @t36 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool))) % 0.30/0.57 (define @t37 () (_ @t36 @t35)) % 0.30/0.57 (define @t38 () (lambda (@list @t36 @t11) (forall (@list @t35) (_ @t37 @t11)))) % 0.30/0.57 (define @t39 () (lambda (@list @t32 @t22) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list @t10 @t22) (_ (_ tptp.mnot @t33) @t22)))) @t22))) % 0.30/0.57 (define @t40 () (lambda (@list @t36 @t22) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t35 @t22) (_ (_ tptp.mnot @t37) @t22)))) @t22))) % 0.30/0.57 (define @t41 () (@list @t11)) % 0.30/0.57 (define @t42 () (lambda @t41 true)) % 0.30/0.57 (define @t43 () (@var "V" $$unsorted)) % 0.30/0.57 (define @t44 () (@list @t43)) % 0.30/0.57 (define @t45 () (lambda (@list @t1 @t16 @t11) (forall @t44 (or (not (_ (_ @t1 @t11) @t43)) (_ @t16 @t43))))) % 0.30/0.57 (define @t46 () (lambda (@list @t1 @t16 @t22) (_ (_ tptp.mnot (_ (_ tptp.mbox @t1) @t24)) @t22))) % 0.30/0.57 (define @t47 () (@var "S" $$unsorted)) % 0.30/0.57 (define @t48 () (_ @t1 @t47)) % 0.30/0.57 (define @t49 () (_ @t48 @t47)) % 0.30/0.57 (define @t50 () (@list @t47)) % 0.30/0.57 (define @t51 () (forall @t50 @t49)) % 0.30/0.57 (define @t52 () (lambda @t6 @t51)) % 0.30/0.57 (define @t53 () (@var "T" $$unsorted)) % 0.30/0.57 (define @t54 () (_ @t1 @t53)) % 0.30/0.57 (define @t55 () (_ @t54 @t47)) % 0.30/0.57 (define @t56 () (_ @t48 @t53)) % 0.30/0.57 (define @t57 () (@list @t47 @t53)) % 0.30/0.57 (define @t58 () (forall @t57 (=> @t56 @t55))) % 0.30/0.57 (define @t59 () (lambda @t6 @t58)) % 0.30/0.57 (define @t60 () (@list @t53)) % 0.30/0.57 (define @t61 () (lambda @t6 (forall @t50 (exists @t60 @t56)))) % 0.30/0.57 (define @t62 () (@var "U" $$unsorted)) % 0.30/0.57 (define @t63 () (_ @t48 @t62)) % 0.30/0.57 (define @t64 () (_ @t54 @t62)) % 0.30/0.57 (define @t65 () (and @t56 @t64)) % 0.30/0.57 (define @t66 () (@list @t47 @t53 @t62)) % 0.30/0.57 (define @t67 () (forall @t66 (=> @t65 @t63))) % 0.30/0.57 (define @t68 () (lambda @t6 @t67)) % 0.30/0.57 (define @t69 () (and @t56 @t63)) % 0.30/0.57 (define @t70 () (forall @t66 (=> @t69 @t64))) % 0.30/0.57 (define @t71 () (lambda @t6 @t70)) % 0.30/0.57 (define @t72 () (= @t53 @t62)) % 0.30/0.57 (define @t73 () (lambda @t6 (forall @t66 (=> @t69 @t72)))) % 0.30/0.57 (define @t74 () (@list @t62)) % 0.30/0.57 (define @t75 () (lambda @t6 (forall @t50 (exists @t60 (and @t56 (forall @t74 (=> @t63 @t72))))))) % 0.30/0.57 (define @t76 () (_ @t1 @t62)) % 0.30/0.57 (define @t77 () (_ @t76 @t53)) % 0.30/0.57 (define @t78 () (lambda @t6 (forall @t66 (=> @t56 (exists @t74 (and @t63 @t77)))))) % 0.30/0.57 (define @t79 () (lambda @t6 (forall @t66 (=> @t69 (or @t64 @t72 @t77))))) % 0.30/0.57 (define @t80 () (lambda @t6 (forall @t66 (=> @t69 (exists @t44 (and (_ @t54 @t43) (_ @t76 @t43))))))) % 0.30/0.57 (define @t81 () (@list @t16)) % 0.30/0.57 (define @t82 () (lambda @t81 (forall @t41 @t17))) % 0.30/0.57 (define @t83 () (lambda @t81 (forall @t41 @t18))) % 0.30/0.57 (define @t84 () (lambda @t81 (exists @t41 @t17))) % 0.30/0.57 (define @t85 () (lambda @t81 (exists @t41 @t18))) % 0.30/0.57 (define @t86 () (_ @t1 @t53 @t62)) % 0.30/0.57 (define @t87 () (_ @t1 @t47 @t62)) % 0.30/0.57 (define @t88 () (_ @t1 @t47 @t53)) % 0.30/0.57 (define @t89 () (not @t88)) % 0.30/0.57 (define @t90 () (forall @t66 (or @t89 (not @t87) @t86))) % 0.30/0.57 (define @t91 () (_ (lambda @t6 @t90) @t1)) % 0.30/0.57 (define @t92 () (_ @t1 @t47 @t47)) % 0.30/0.57 (define @t93 () (forall @t50 @t92)) % 0.30/0.57 (define @t94 () (_ (lambda @t6 @t93) @t1)) % 0.30/0.57 (define @t95 () (and @t94 @t91)) % 0.30/0.57 (define @t96 () (_ @t1 @t53 @t47)) % 0.30/0.57 (define @t97 () (forall @t57 (or @t89 @t96))) % 0.30/0.57 (define @t98 () (_ (lambda @t6 @t97) @t1)) % 0.30/0.57 (define @t99 () (forall @t66 (or @t89 (not @t86) @t87))) % 0.30/0.57 (define @t100 () (_ (lambda @t6 @t99) @t1)) % 0.30/0.57 (define @t101 () (and @t94 @t100 @t98)) % 0.30/0.57 (define @t102 () (forall @t6 (= @t95 @t101))) % 0.30/0.57 (define @t103 () (not @t56)) % 0.30/0.57 (define @t104 () (or @t103 @t55)) % 0.30/0.57 (define @t105 () (not @t64)) % 0.30/0.57 (define @t106 () (or @t103 @t105 @t63)) % 0.30/0.57 (define @t107 () (not @t63)) % 0.30/0.57 (define @t108 () (or @t103 @t107 @t64)) % 0.30/0.57 (define @t109 () (@quantifiers_skolemize (forall @t6 (= (and @t93 @t99 @t97) (and @t93 @t90))) 0)) % 0.30/0.57 (define @t110 () (forall @t50 (_ @t109 @t47 @t47))) % 0.30/0.57 (define @t111 () (not (_ @t109 @t47 @t53))) % 0.30/0.57 (define @t112 () (forall @t57 (or @t111 (_ @t109 @t53 @t47)))) % 0.30/0.57 (define @t113 () (@quantifiers_skolemize @t112 0)) % 0.30/0.57 (define @t114 () (_ @t109 @t113 @t113)) % 0.30/0.57 (define @t115 () (_ @t109 @t47 @t62)) % 0.30/0.57 (define @t116 () (_ @t109 @t53 @t62)) % 0.30/0.57 (define @t117 () (forall @t66 (or @t111 (not @t116) @t115))) % 0.30/0.57 (define @t118 () (and @t110 @t117 @t112)) % 0.30/0.57 (define @t119 () (not @t118)) % 0.30/0.57 (define @t120 () (@quantifiers_skolemize @t112 1)) % 0.30/0.57 (define @t121 () (_ @t109 @t120 @t113)) % 0.30/0.57 (define @t122 () (_ @t109 @t113 @t120)) % 0.30/0.57 (define @t123 () (not @t122)) % 0.30/0.57 (define @t124 () (or @t123 @t121)) % 0.30/0.57 (define @t125 () (not @t124)) % 0.30/0.57 (define @t126 () (not @t112)) % 0.30/0.57 (define @t127 () (forall @t66 (or @t111 (not @t115) @t116))) % 0.30/0.57 (define @t128 () (and @t110 @t127)) % 0.30/0.57 (define @t129 () (= @t118 @t128)) % 0.30/0.57 (define @t130 () (not @t128)) % 0.30/0.57 (define @t131 () (not @t114)) % 0.30/0.57 (define @t132 () (or @t123 @t131 @t121)) % 0.30/0.57 (define @t133 () (@quantifiers_skolemize @t127 2)) % 0.30/0.57 (define @t134 () (@quantifiers_skolemize @t127 0)) % 0.30/0.57 (define @t135 () (@quantifiers_skolemize @t127 1)) % 0.30/0.57 (define @t136 () (_ @t109 @t135 @t133)) % 0.30/0.57 (define @t137 () (_ @t109 @t134 @t133)) % 0.30/0.57 (define @t138 () (not @t137)) % 0.30/0.57 (define @t139 () (_ @t109 @t135 @t134)) % 0.30/0.57 (define @t140 () (not @t139)) % 0.30/0.57 (define @t141 () (or @t140 @t138 @t136)) % 0.30/0.57 (define @t142 () (_ @t109 @t134 @t135)) % 0.30/0.57 (define @t143 () (not @t142)) % 0.30/0.57 (define @t144 () (or @t143 @t139)) % 0.30/0.57 (define @t145 () (or @t143 @t138 @t136)) % 0.30/0.57 (define @t146 () (not @t145)) % 0.30/0.57 (define @t147 () (not @t127)) % 0.30/0.57 (define @t148 () (not @t117)) % 0.30/0.57 (define @t149 () (not @t110)) % 0.30/0.57 (define @t150 () (@quantifiers_skolemize @t117 1)) % 0.30/0.57 (define @t151 () (@quantifiers_skolemize @t117 0)) % 0.30/0.57 (define @t152 () (_ @t109 @t150 @t151)) % 0.30/0.57 (define @t153 () (_ @t109 @t151 @t150)) % 0.30/0.57 (define @t154 () (not @t153)) % 0.30/0.57 (define @t155 () (or @t154 @t152)) % 0.30/0.57 (define @t156 () (@quantifiers_skolemize @t117 2)) % 0.30/0.57 (define @t157 () (_ @t109 @t151 @t156)) % 0.30/0.57 (define @t158 () (_ @t109 @t150 @t156)) % 0.30/0.57 (define @t159 () (not @t158)) % 0.30/0.57 (define @t160 () (or @t154 @t159 @t157)) % 0.30/0.57 (define @t161 () (not @t160)) % 0.30/0.57 (define @t162 () (not @t152)) % 0.30/0.57 (define @t163 () (or @t162 @t159 @t157)) % 0.30/0.57 (define @t164 () (@list true)) % 0.30/0.57 (define @t165 () (@list @t110)) % 0.30/0.57 (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue))) % 0.30/0.57 (assume @p2 @t8) % 0.30/0.57 (assume @p3 true) % 0.30/0.57 (step @p4 (= tptp.meq_ind @t12) :rule refl :args (@t12)) % 0.30/0.57 (step @p5 (= tptp.meq_prop @t15) :rule refl :args (@t15)) % 0.30/0.57 (step @p6 (= tptp.mnot @t19) :rule refl :args (@t19)) % 0.30/0.57 (step @p7 (= tptp.mor @t21) :rule refl :args (@t21)) % 0.30/0.57 (step @p8 (= tptp.mand @t27) :rule refl :args (@t27)) % 0.30/0.57 (step @p9 (= tptp.mimplies @t28) :rule refl :args (@t28)) % 0.30/0.57 (step @p10 (= tptp.mimplied @t29) :rule refl :args (@t29)) % 0.30/0.57 (step @p11 (= tptp.mequiv @t30) :rule refl :args (@t30)) % 0.30/0.57 (step @p12 (= tptp.mxor @t31) :rule refl :args (@t31)) % 0.30/0.57 (step @p13 (= tptp.mforall_ind @t34) :rule refl :args (@t34)) % 0.30/0.57 (step @p14 (= tptp.mforall_prop @t38) :rule refl :args (@t38)) % 0.30/0.57 (step @p15 (= tptp.mexists_ind @t39) :rule refl :args (@t39)) % 0.30/0.57 (step @p16 (= tptp.mexists_prop @t40) :rule refl :args (@t40)) % 0.30/0.57 (step @p17 (= tptp.mtrue @t42) :rule refl :args (@t42)) % 0.30/0.57 (step @p18 (= tptp.mbox @t45) :rule refl :args (@t45)) % 0.30/0.57 (step @p19 (= tptp.mdia @t46) :rule refl :args (@t46)) % 0.30/0.57 (step @p20 (= tptp.mreflexive @t52) :rule refl :args (@t52)) % 0.30/0.57 (step @p21 (= tptp.msymmetric @t59) :rule refl :args (@t59)) % 0.30/0.57 (step @p22 (= tptp.mserial @t61) :rule refl :args (@t61)) % 0.30/0.57 (step @p23 (= tptp.mtransitive @t68) :rule refl :args (@t68)) % 0.30/0.57 (step @p24 (= tptp.meuclidean @t71) :rule refl :args (@t71)) % 0.30/0.57 (step @p25 (= tptp.mpartially_functional @t73) :rule refl :args (@t73)) % 0.30/0.57 (step @p26 (= tptp.mfunctional @t75) :rule refl :args (@t75)) % 0.30/0.57 (step @p27 (= tptp.mweakly_dense @t78) :rule refl :args (@t78)) % 0.30/0.57 (step @p28 (= tptp.mweakly_connected @t79) :rule refl :args (@t79)) % 0.30/0.57 (step @p29 (= tptp.mweakly_directed @t80) :rule refl :args (@t80)) % 0.30/0.57 (step @p30 (= tptp.mvalid @t82) :rule refl :args (@t82)) % 0.30/0.57 (step @p31 (= tptp.minvalid @t83) :rule refl :args (@t83)) % 0.30/0.57 (step @p32 (= tptp.msatisfiable @t84) :rule refl :args (@t84)) % 0.30/0.57 (step @p33 (= tptp.mcountersatisfiable @t85) :rule refl :args (@t85)) % 0.30/0.57 (step @p34 :rule beta-reduce :args ((= @t91 @t90))) % 0.30/0.57 (step @p35 :rule beta-reduce :args ((= @t94 @t93))) % 0.30/0.57 (step @p36 :rule nary_cong :premises (@p35 @p34) :args (@t95)) % 0.30/0.57 (step @p37 :rule beta-reduce :args ((= @t98 @t97))) % 0.30/0.57 (step @p38 :rule beta-reduce :args ((= @t100 @t99))) % 0.30/0.57 (step @p39 :rule nary_cong :premises (@p35 @p38 @p37) :args (@t101)) % 0.30/0.57 (step @p40 :rule cong :premises (@p39 @p36) :args ((= @t101 @t95))) % 0.30/0.57 (step @p41 :rule eq-symm :args (@t95 @t101)) % 0.30/0.57 (step @p42 :rule trans :premises (@p41 @p40)) % 0.30/0.57 (step @p43 :rule cong :premises (@p42) :args (@t102)) % 0.30/0.57 (step @p44 :rule cong :premises (@p43) :args ((not @t102))) % 0.30/0.57 (step @p45 :rule refl :args (@t1)) % 0.30/0.57 (step @p46 :rule refl :args (@t96)) % 0.30/0.57 (step @p47 :rule refl :args (@t55)) % 0.30/0.57 (step @p48 :rule cong :premises (@p47 @p46) :args ((= @t55 @t96))) % 0.30/0.57 (step @p49 :rule symm :premises (@p48)) % 0.30/0.57 (step @p50 :rule eq_resolve :premises (@p47 @p49)) % 0.30/0.57 (step @p51 :rule refl :args (@t88)) % 0.30/0.57 (step @p52 :rule refl :args (@t56)) % 0.30/0.57 (step @p53 :rule cong :premises (@p52 @p51) :args ((= @t56 @t88))) % 0.30/0.57 (step @p54 :rule symm :premises (@p53)) % 0.30/0.57 (step @p55 :rule eq_resolve :premises (@p52 @p54)) % 0.30/0.57 (step @p56 :rule cong :premises (@p55) :args (@t103)) % 0.30/0.57 (step @p57 :rule nary_cong :premises (@p56 @p50) :args (@t104)) % 0.30/0.57 (step @p58 :rule cong :premises (@p57) :args ((forall @t57 @t104))) % 0.30/0.57 (step @p59 :rule bool-impl-elim :args (@t56 @t55)) % 0.30/0.57 (step @p60 :rule cong :premises (@p59) :args (@t58)) % 0.30/0.57 (step @p61 :rule trans :premises (@p60 @p58)) % 0.30/0.57 (step @p62 :rule cong :premises (@p61) :args (@t59)) % 0.30/0.57 (step @p63 :rule trans :premises (@p21 @p62)) % 0.30/0.57 (step @p64 :rule ho_cong :premises (@p63 @p45)) % 0.30/0.57 (step @p65 :rule refl :args (@t87)) % 0.30/0.57 (step @p66 :rule refl :args (@t63)) % 0.30/0.57 (step @p67 :rule cong :premises (@p66 @p65) :args ((= @t63 @t87))) % 0.30/0.57 (step @p68 :rule symm :premises (@p67)) % 0.30/0.57 (step @p69 :rule eq_resolve :premises (@p66 @p68)) % 0.30/0.57 (step @p70 :rule refl :args (@t86)) % 0.30/0.57 (step @p71 :rule refl :args (@t64)) % 0.30/0.57 (step @p72 :rule cong :premises (@p71 @p70) :args ((= @t64 @t86))) % 0.30/0.57 (step @p73 :rule symm :premises (@p72)) % 0.30/0.57 (step @p74 :rule eq_resolve :premises (@p71 @p73)) % 0.30/0.57 (step @p75 :rule cong :premises (@p74) :args (@t105)) % 0.30/0.57 (step @p76 :rule nary_cong :premises (@p56 @p75 @p69) :args (@t106)) % 0.30/0.57 (step @p77 :rule cong :premises (@p76) :args ((forall @t66 @t106))) % 0.30/0.57 (step @p78 :rule aci_norm :args ((= (or (or @t103 @t105) @t63) @t106))) % 0.30/0.57 (step @p79 :rule bool-and-de-morgan :args (@t56 @t64 true)) % 0.30/0.57 (step @p80 :rule nary_cong :premises (@p79 @p66) :args ((or (not @t65) @t63))) % 0.30/0.57 (step @p81 :rule trans :premises (@p80 @p78)) % 0.30/0.57 (step @p82 :rule bool-impl-elim :args (@t65 @t63)) % 0.30/0.57 (step @p83 :rule trans :premises (@p82 @p81)) % 0.30/0.57 (step @p84 :rule cong :premises (@p83) :args (@t67)) % 0.30/0.57 (step @p85 :rule trans :premises (@p84 @p77)) % 0.30/0.57 (step @p86 :rule cong :premises (@p85) :args (@t68)) % 0.30/0.57 (step @p87 :rule trans :premises (@p23 @p86)) % 0.30/0.57 (step @p88 :rule ho_cong :premises (@p87 @p45)) % 0.30/0.57 (step @p89 :rule refl :args (@t92)) % 0.30/0.57 (step @p90 :rule refl :args (@t49)) % 0.30/0.57 (step @p91 :rule cong :premises (@p90 @p89) :args ((= @t49 @t92))) % 0.30/0.57 (step @p92 :rule symm :premises (@p91)) % 0.30/0.57 (step @p93 :rule eq_resolve :premises (@p90 @p92)) % 0.30/0.57 (step @p94 :rule cong :premises (@p93) :args (@t51)) % 0.30/0.57 (step @p95 :rule cong :premises (@p94) :args (@t52)) % 0.30/0.57 (step @p96 :rule trans :premises (@p20 @p95)) % 0.30/0.57 (step @p97 :rule ho_cong :premises (@p96 @p45)) % 0.30/0.57 (step @p98 :rule nary_cong :premises (@p97 @p88 @p64) :args (@t3)) % 0.30/0.57 (step @p99 :rule cong :premises (@p69) :args (@t107)) % 0.30/0.57 (step @p100 :rule nary_cong :premises (@p56 @p99 @p74) :args (@t108)) % 0.30/0.57 (step @p101 :rule cong :premises (@p100) :args ((forall @t66 @t108))) % 0.30/0.57 (step @p102 :rule aci_norm :args ((= (or (or @t103 @t107) @t64) @t108))) % 0.30/0.57 (step @p103 :rule bool-and-de-morgan :args (@t56 @t63 true)) % 0.30/0.57 (step @p104 :rule nary_cong :premises (@p103 @p71) :args ((or (not @t69) @t64))) % 0.30/0.57 (step @p105 :rule trans :premises (@p104 @p102)) % 0.30/0.57 (step @p106 :rule bool-impl-elim :args (@t69 @t64)) % 0.30/0.57 (step @p107 :rule trans :premises (@p106 @p105)) % 0.30/0.57 (step @p108 :rule cong :premises (@p107) :args (@t70)) % 0.30/0.57 (step @p109 :rule trans :premises (@p108 @p101)) % 0.30/0.57 (step @p110 :rule cong :premises (@p109) :args (@t71)) % 0.30/0.57 (step @p111 :rule trans :premises (@p24 @p110)) % 0.30/0.57 (step @p112 :rule ho_cong :premises (@p111 @p45)) % 0.30/0.57 (step @p113 :rule nary_cong :premises (@p97 @p112) :args (@t4)) % 0.30/0.57 (step @p114 :rule cong :premises (@p113 @p98) :args (@t5)) % 0.30/0.57 (step @p115 :rule cong :premises (@p114) :args (@t7)) % 0.30/0.57 (step @p116 :rule cong :premises (@p115) :args (@t8)) % 0.30/0.57 (step @p117 :rule trans :premises (@p116 @p44)) % 0.30/0.57 (step @p118 :rule eq_resolve :premises (@p2 @p117)) % 0.30/0.57 (step @p119 :rule skolemize :premises (@p118)) % 0.30/0.57 (assume-push @p239 @t110) % 0.30/0.57 (step @p121 :rule instantiate :premises (@p239) :args ((@list @t113))) % 0.30/0.57 (step-pop @p240 :rule scope :premises (@p121)) % 0.30/0.57 (step @p122 :rule process_scope :premises (@p240) :args (@t114)) % 0.30/0.57 (step @p124 :rule implies_elim :premises (@p122)) % 0.30/0.57 (step @p125 :rule cnf_and_pos :args (@t118 2)) % 0.30/0.57 (step @p126 :rule reordering :premises (@p125) :args ((or @t112 @t119))) % 0.30/0.57 (step @p127 :rule refl :args (@t125)) % 0.30/0.57 (step @p128 :rule bool-double-not-elim :args (@t112)) % 0.30/0.57 (step @p129 :rule nary_cong :premises (@p128 @p127) :args ((or (not @t126) @t125))) % 0.30/0.57 (assume-push @p241 @t126) % 0.30/0.57 (step @p131 :rule skolemize :premises (@p241)) % 0.30/0.57 (step-pop @p242 :rule scope :premises (@p131)) % 0.30/0.57 (step @p132 :rule process_scope :premises (@p242) :args (@t125)) % 0.30/0.57 (step @p134 :rule implies_elim :premises (@p132)) % 0.30/0.57 (step @p135 :rule eq_resolve :premises (@p134 @p129)) % 0.30/0.57 (step @p136 :rule cnf_equiv_neg1 :args (@t129)) % 0.30/0.57 (step @p137 :rule reordering :premises (@p136) :args ((or @t118 @t128 @t129))) % 0.30/0.57 (step @p138 :rule bool-double-not-elim :args (@t122)) % 0.30/0.57 (step @p139 :rule refl :args (@t124)) % 0.30/0.57 (step @p140 :rule nary_cong :premises (@p139 @p138) :args ((or @t124 (not @t123)))) % 0.30/0.57 (step @p141 :rule cnf_or_neg :args (@t124 0)) % 0.30/0.57 (step @p142 :rule eq_resolve :premises (@p141 @p140)) % 0.30/0.57 (step @p143 :rule reordering :premises (@p142) :args ((or @t122 @t124))) % 0.30/0.57 (step @p144 :rule cnf_or_neg :args (@t124 1)) % 0.30/0.57 (step @p145 :rule cnf_and_pos :args (@t128 1)) % 0.30/0.57 (step @p146 :rule reordering :premises (@p145) :args ((or @t127 @t130))) % 0.30/0.57 (step @p147 :rule cnf_or_pos :args (@t132)) % 0.30/0.57 (step @p148 :rule reordering :premises (@p147) :args ((or @t123 @t121 @t131 (not @t132)))) % 0.30/0.57 (assume-push @p243 @t127) % 0.30/0.57 (step @p150 :rule instantiate :premises (@p243) :args ((@list @t113 @t120 @t113))) % 0.30/0.57 (step-pop @p244 :rule scope :premises (@p150)) % 0.30/0.57 (step @p151 :rule process_scope :premises (@p244) :args (@t132)) % 0.30/0.57 (step @p153 :rule implies_elim :premises (@p151)) % 0.30/0.57 (step @p154 :rule chain_m_resolution :premises (@p153 @p148 @p146 @p144 @p143 @p137 @p119 @p135 @p126) :args ((or @t112 @t131) (@list true false true false false true true true) (@list @t132 @t127 @t121 @t122 @t128 @t129 @t124 @t118))) % 0.30/0.57 (assume-push @p245 @t117) % 0.30/0.57 (step @p156 :rule instantiate :premises (@p245) :args ((@list @t135 @t134 @t133))) % 0.30/0.57 (step-pop @p246 :rule scope :premises (@p156)) % 0.30/0.57 (step @p157 :rule process_scope :premises (@p246) :args (@t141)) % 0.30/0.57 (step @p159 :rule implies_elim :premises (@p157)) % 0.30/0.57 (step @p160 :rule cnf_and_neg :args (@t118)) % 0.30/0.57 (assume-push @p247 @t112) % 0.30/0.57 (step @p162 :rule instantiate :premises (@p247) :args ((@list @t134 @t135))) % 0.30/0.57 (step-pop @p248 :rule scope :premises (@p162)) % 0.30/0.57 (step @p163 :rule process_scope :premises (@p248) :args (@t144)) % 0.30/0.57 (step @p165 :rule implies_elim :premises (@p163)) % 0.30/0.57 (step @p166 :rule cnf_equiv_neg2 :args (@t129)) % 0.30/0.57 (step @p167 :rule cnf_and_neg :args (@t128)) % 0.30/0.57 (step @p168 :rule refl :args (@t146)) % 0.30/0.57 (step @p169 :rule bool-double-not-elim :args (@t127)) % 0.30/0.57 (step @p170 :rule nary_cong :premises (@p169 @p168) :args ((or (not @t147) @t146))) % 0.30/0.57 (assume-push @p249 @t147) % 0.30/0.57 (step @p172 :rule skolemize :premises (@p249)) % 0.30/0.57 (step-pop @p250 :rule scope :premises (@p172)) % 0.30/0.57 (step @p173 :rule process_scope :premises (@p250) :args (@t146)) % 0.30/0.57 (step @p175 :rule implies_elim :premises (@p173)) % 0.30/0.57 (step @p176 :rule eq_resolve :premises (@p175 @p170)) % 0.30/0.57 (step @p177 :rule bool-double-not-elim :args (@t142)) % 0.30/0.57 (step @p178 :rule refl :args (@t145)) % 0.30/0.57 (step @p179 :rule nary_cong :premises (@p178 @p177) :args ((or @t145 (not @t143)))) % 0.30/0.57 (step @p180 :rule cnf_or_neg :args (@t145 0)) % 0.30/0.57 (step @p181 :rule eq_resolve :premises (@p180 @p179)) % 0.30/0.57 (step @p182 :rule reordering :premises (@p181) :args ((or @t142 @t145))) % 0.30/0.57 (step @p183 :rule bool-double-not-elim :args (@t137)) % 0.30/0.57 (step @p184 :rule nary_cong :premises (@p178 @p183) :args ((or @t145 (not @t138)))) % 0.30/0.57 (step @p185 :rule cnf_or_neg :args (@t145 1)) % 0.30/0.57 (step @p186 :rule eq_resolve :premises (@p185 @p184)) % 0.30/0.57 (step @p187 :rule reordering :premises (@p186) :args ((or @t137 @t145))) % 0.30/0.57 (step @p188 :rule cnf_or_neg :args (@t145 2)) % 0.30/0.57 (step @p189 :rule cnf_or_pos :args (@t144)) % 0.30/0.57 (step @p190 :rule reordering :premises (@p189) :args ((or @t143 @t139 (not @t144)))) % 0.30/0.57 (step @p191 :rule cnf_or_pos :args (@t141)) % 0.30/0.57 (step @p192 :rule reordering :premises (@p191) :args ((or @t138 @t136 @t140 (not @t141)))) % 0.30/0.57 (step @p193 :rule chain_m_resolution :premises (@p192 @p190 @p188 @p187 @p182 @p176 @p167 @p166 @p119 @p165 @p160 @p159) :args ((or @t149 @t148 @t126) (@list false true false false true true true true false false false) (@list @t139 @t136 @t137 @t142 @t145 @t127 @t128 @t129 @t144 @t118 @t141))) % 0.30/0.57 (assume-push @p251 @t112) % 0.30/0.57 (step @p195 :rule instantiate :premises (@p251) :args ((@list @t151 @t150))) % 0.30/0.57 (step-pop @p252 :rule scope :premises (@p195)) % 0.30/0.57 (step @p196 :rule process_scope :premises (@p252) :args (@t155)) % 0.30/0.57 (step @p198 :rule implies_elim :premises (@p196)) % 0.30/0.57 (step @p199 :rule cnf_and_pos :args (@t118 1)) % 0.30/0.57 (step @p200 :rule reordering :premises (@p199) :args ((or @t117 @t119))) % 0.30/0.57 (step @p201 :rule refl :args (@t161)) % 0.30/0.57 (step @p202 :rule bool-double-not-elim :args (@t117)) % 0.30/0.57 (step @p203 :rule nary_cong :premises (@p202 @p201) :args ((or (not @t148) @t161))) % 0.30/0.57 (assume-push @p253 @t148) % 0.30/0.57 (step @p205 :rule skolemize :premises (@p253)) % 0.30/0.57 (step-pop @p254 :rule scope :premises (@p205)) % 0.30/0.57 (step @p206 :rule process_scope :premises (@p254) :args (@t161)) % 0.30/0.57 (step @p208 :rule implies_elim :premises (@p206)) % 0.30/0.57 (step @p209 :rule eq_resolve :premises (@p208 @p203)) % 0.30/0.57 (step @p210 :rule bool-double-not-elim :args (@t153)) % 0.30/0.57 (step @p211 :rule refl :args (@t160)) % 0.30/0.57 (step @p212 :rule nary_cong :premises (@p211 @p210) :args ((or @t160 (not @t154)))) % 0.30/0.57 (step @p213 :rule cnf_or_neg :args (@t160 0)) % 0.30/0.57 (step @p214 :rule eq_resolve :premises (@p213 @p212)) % 0.30/0.57 (step @p215 :rule reordering :premises (@p214) :args ((or @t153 @t160))) % 0.30/0.57 (step @p216 :rule bool-double-not-elim :args (@t158)) % 0.30/0.57 (step @p217 :rule nary_cong :premises (@p211 @p216) :args ((or @t160 (not @t159)))) % 0.30/0.57 (step @p218 :rule cnf_or_neg :args (@t160 1)) % 0.30/0.57 (step @p219 :rule eq_resolve :premises (@p218 @p217)) % 0.30/0.58 (step @p220 :rule reordering :premises (@p219) :args ((or @t158 @t160))) % 0.30/0.58 (step @p221 :rule cnf_or_neg :args (@t160 2)) % 0.30/0.58 (step @p222 :rule cnf_or_pos :args (@t155)) % 0.30/0.58 (step @p223 :rule reordering :premises (@p222) :args ((or @t154 @t152 (not @t155)))) % 0.30/0.58 (step @p224 :rule cnf_or_pos :args (@t163)) % 0.30/0.58 (step @p225 :rule reordering :premises (@p224) :args ((or @t159 @t157 @t162 (not @t163)))) % 0.30/0.58 (assume-push @p255 @t127) % 0.30/0.58 (step @p227 :rule instantiate :premises (@p255) :args ((@list @t150 @t151 @t156))) % 0.30/0.58 (step-pop @p256 :rule scope :premises (@p227)) % 0.30/0.58 (step @p228 :rule process_scope :premises (@p256) :args (@t163)) % 0.30/0.58 (step @p230 :rule implies_elim :premises (@p228)) % 0.30/0.58 (step @p231 :rule chain_m_resolution :premises (@p230 @p225 @p223 @p146 @p221 @p220 @p215 @p137 @p119 @p209 @p200 @p198 @p193 @p154 @p124) :args (@t149 (@list true false false true false false false true true true false true false false) (@list @t163 @t152 @t127 @t157 @t158 @t153 @t128 @t129 @t160 @t118 @t155 @t117 @t112 @t114))) % 0.30/0.58 (step @p232 :rule cnf_and_pos :args (@t118 0)) % 0.30/0.58 (step @p233 :rule reordering :premises (@p232) :args ((or @t110 @t119))) % 0.30/0.58 (step @p234 :rule chain_m_resolution :premises (@p233 @p231) :args (@t119 @t164 @t165)) % 0.30/0.58 (step @p235 :rule cnf_and_pos :args (@t128 0)) % 0.30/0.58 (step @p236 :rule reordering :premises (@p235) :args ((or @t110 @t130))) % 0.30/0.58 (step @p237 :rule chain_m_resolution :premises (@p236 @p231) :args (@t130 @t164 @t165)) % 0.30/0.58 (step @p238 false :rule chain_m_resolution :premises (@p137 @p237 @p234 @p119) :args (false (@list true true true) (@list @t128 @t118 @t129))) % 0.30/0.58 ) % 0.30/0.58 % SZS output end Proof % 0.30/0.58 % cvc5 exiting %------------------------------------------------------------------------------