%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL864^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 : n019.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:04 AM UTC 2026 % Result : Theorem 1.13s 1.48s % Output : Proof 1.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL864^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.09/0.35 % Computer : n019.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sun Sep 6 01:29:38 UTC 2026 % 0.09/0.36 % CPUTime : % 0.13/0.43 %----Proving TH0 % 1.13/1.48 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 1.13/1.48 % SZS status Theorem % 1.13/1.48 % SZS output start Proof % 1.13/1.48 ( % 1.13/1.48 (declare-sort $$unsorted 0) % 1.13/1.48 (declare-sort tptp.mu 0) % 1.13/1.48 (declare-const tptp.mfalse (-> $$unsorted Bool)) % 1.13/1.48 (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))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true)) % 1.13/1.48 (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))))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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)))))))) % 1.13/1.48 (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)))))))) % 1.13/1.48 (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)))))))))) % 1.13/1.48 (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)))))))))) % 1.13/1.48 (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)))))))))) % 1.13/1.48 (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))))))))))))) % 1.13/1.48 (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)))))))))))) % 1.13/1.48 (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))))))))))) % 1.13/1.48 (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))))))))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (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)))))) % 1.13/1.48 (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))))))) % 1.13/1.48 (define @t1 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 1.13/1.48 (define @t2 () (_ tptp.meuclidean @t1)) % 1.13/1.48 (define @t3 () (and (_ tptp.mserial @t1) (_ tptp.mtransitive @t1) (_ tptp.msymmetric @t1) @t2)) % 1.13/1.48 (define @t4 () (and (_ tptp.mreflexive @t1) @t2)) % 1.13/1.48 (define @t5 () (= @t4 @t3)) % 1.13/1.48 (define @t6 () (@list @t1)) % 1.13/1.48 (define @t7 () (forall @t6 @t5)) % 1.13/1.48 (define @t8 () (not @t7)) % 1.13/1.48 (define @t9 () (@var "Y" tptp.mu)) % 1.13/1.48 (define @t10 () (@var "X" tptp.mu)) % 1.13/1.48 (define @t11 () (@var "W" $$unsorted)) % 1.13/1.48 (define @t12 () (lambda (@list @t10 @t9 @t11) (= @t10 @t9))) % 1.13/1.48 (define @t13 () (@var "Y" (-> $$unsorted Bool))) % 1.13/1.48 (define @t14 () (@var "X" (-> $$unsorted Bool))) % 1.13/1.48 (define @t15 () (lambda (@list @t14 @t13 @t11) (= (_ @t14 @t11) (_ @t13 @t11)))) % 1.13/1.48 (define @t16 () (@var "Phi" (-> $$unsorted Bool))) % 1.13/1.48 (define @t17 () (_ @t16 @t11)) % 1.13/1.48 (define @t18 () (not @t17)) % 1.13/1.48 (define @t19 () (lambda (@list @t16 @t11) @t18)) % 1.13/1.48 (define @t20 () (@var "Psi" (-> $$unsorted Bool))) % 1.13/1.48 (define @t21 () (lambda (@list @t16 @t20 @t11) (or @t17 (_ @t20 @t11)))) % 1.13/1.48 (define @t22 () (@var "__flatten_var_0" $$unsorted)) % 1.13/1.48 (define @t23 () (_ tptp.mnot @t20)) % 1.13/1.48 (define @t24 () (_ tptp.mnot @t16)) % 1.13/1.48 (define @t25 () (_ tptp.mor @t24)) % 1.13/1.48 (define @t26 () (@list @t16 @t20 @t22)) % 1.13/1.48 (define @t27 () (lambda @t26 (_ (_ tptp.mnot (_ @t25 @t23)) @t22))) % 1.13/1.48 (define @t28 () (lambda @t26 (_ (_ @t25 @t20) @t22))) % 1.13/1.48 (define @t29 () (lambda @t26 (_ (_ (_ tptp.mor @t23) @t16) @t22))) % 1.13/1.48 (define @t30 () (lambda @t26 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t16) @t20)) (_ (_ tptp.mimplies @t20) @t16)) @t22))) % 1.13/1.48 (define @t31 () (lambda @t26 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t16) @t20)) @t22))) % 1.13/1.48 (define @t32 () (@var "Phi" (-> tptp.mu $$unsorted Bool))) % 1.13/1.48 (define @t33 () (_ @t32 @t10)) % 1.13/1.48 (define @t34 () (lambda (@list @t32 @t11) (forall (@list @t10) (_ @t33 @t11)))) % 1.13/1.48 (define @t35 () (@var "P" (-> $$unsorted Bool))) % 1.13/1.48 (define @t36 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool))) % 1.13/1.48 (define @t37 () (_ @t36 @t35)) % 1.13/1.48 (define @t38 () (lambda (@list @t36 @t11) (forall (@list @t35) (_ @t37 @t11)))) % 1.13/1.48 (define @t39 () (lambda (@list @t32 @t22) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list @t10 @t22) (_ (_ tptp.mnot @t33) @t22)))) @t22))) % 1.13/1.48 (define @t40 () (lambda (@list @t36 @t22) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t35 @t22) (_ (_ tptp.mnot @t37) @t22)))) @t22))) % 1.13/1.48 (define @t41 () (@list @t11)) % 1.13/1.48 (define @t42 () (lambda @t41 true)) % 1.13/1.48 (define @t43 () (@var "V" $$unsorted)) % 1.13/1.48 (define @t44 () (@list @t43)) % 1.13/1.48 (define @t45 () (lambda (@list @t1 @t16 @t11) (forall @t44 (or (not (_ (_ @t1 @t11) @t43)) (_ @t16 @t43))))) % 1.13/1.48 (define @t46 () (lambda (@list @t1 @t16 @t22) (_ (_ tptp.mnot (_ (_ tptp.mbox @t1) @t24)) @t22))) % 1.13/1.48 (define @t47 () (@var "S" $$unsorted)) % 1.13/1.48 (define @t48 () (_ @t1 @t47)) % 1.13/1.48 (define @t49 () (_ @t48 @t47)) % 1.13/1.48 (define @t50 () (@list @t47)) % 1.13/1.48 (define @t51 () (forall @t50 @t49)) % 1.13/1.48 (define @t52 () (lambda @t6 @t51)) % 1.13/1.48 (define @t53 () (@var "T" $$unsorted)) % 1.13/1.48 (define @t54 () (_ @t1 @t53)) % 1.13/1.48 (define @t55 () (_ @t54 @t47)) % 1.13/1.48 (define @t56 () (_ @t48 @t53)) % 1.13/1.48 (define @t57 () (@list @t47 @t53)) % 1.13/1.48 (define @t58 () (forall @t57 (=> @t56 @t55))) % 1.13/1.48 (define @t59 () (lambda @t6 @t58)) % 1.13/1.48 (define @t60 () (@list @t53)) % 1.13/1.48 (define @t61 () (exists @t60 @t56)) % 1.13/1.48 (define @t62 () (forall @t50 @t61)) % 1.13/1.48 (define @t63 () (lambda @t6 @t62)) % 1.13/1.48 (define @t64 () (@var "U" $$unsorted)) % 1.13/1.48 (define @t65 () (_ @t48 @t64)) % 1.13/1.48 (define @t66 () (_ @t54 @t64)) % 1.13/1.48 (define @t67 () (and @t56 @t66)) % 1.13/1.48 (define @t68 () (@list @t47 @t53 @t64)) % 1.13/1.48 (define @t69 () (forall @t68 (=> @t67 @t65))) % 1.13/1.48 (define @t70 () (lambda @t6 @t69)) % 1.13/1.48 (define @t71 () (and @t56 @t65)) % 1.13/1.48 (define @t72 () (forall @t68 (=> @t71 @t66))) % 1.13/1.48 (define @t73 () (lambda @t6 @t72)) % 1.13/1.48 (define @t74 () (= @t53 @t64)) % 1.13/1.48 (define @t75 () (lambda @t6 (forall @t68 (=> @t71 @t74)))) % 1.13/1.48 (define @t76 () (@list @t64)) % 1.13/1.48 (define @t77 () (lambda @t6 (forall @t50 (exists @t60 (and @t56 (forall @t76 (=> @t65 @t74))))))) % 1.13/1.48 (define @t78 () (_ @t1 @t64)) % 1.13/1.48 (define @t79 () (_ @t78 @t53)) % 1.13/1.48 (define @t80 () (lambda @t6 (forall @t68 (=> @t56 (exists @t76 (and @t65 @t79)))))) % 1.13/1.48 (define @t81 () (lambda @t6 (forall @t68 (=> @t71 (or @t66 @t74 @t79))))) % 1.13/1.48 (define @t82 () (lambda @t6 (forall @t68 (=> @t71 (exists @t44 (and (_ @t54 @t43) (_ @t78 @t43))))))) % 1.13/1.48 (define @t83 () (@list @t16)) % 1.13/1.48 (define @t84 () (lambda @t83 (forall @t41 @t17))) % 1.13/1.48 (define @t85 () (lambda @t83 (forall @t41 @t18))) % 1.13/1.48 (define @t86 () (lambda @t83 (exists @t41 @t17))) % 1.13/1.48 (define @t87 () (lambda @t83 (exists @t41 @t18))) % 1.13/1.48 (define @t88 () (_ @t1 @t53 @t64)) % 1.13/1.48 (define @t89 () (_ @t1 @t47 @t64)) % 1.13/1.48 (define @t90 () (_ @t1 @t47 @t53)) % 1.13/1.48 (define @t91 () (not @t90)) % 1.13/1.48 (define @t92 () (forall @t68 (or @t91 (not @t89) @t88))) % 1.13/1.48 (define @t93 () (_ @t1 @t47 @t47)) % 1.13/1.48 (define @t94 () (forall @t50 @t93)) % 1.13/1.48 (define @t95 () (_ @t1 @t53 @t47)) % 1.13/1.48 (define @t96 () (forall @t57 (or @t91 @t95))) % 1.13/1.48 (define @t97 () (forall @t68 (or @t91 (not @t88) @t89))) % 1.13/1.48 (define @t98 () (forall @t50 (not (forall @t60 @t91)))) % 1.13/1.48 (define @t99 () (@quantifiers_skolemize (forall @t6 (= (and @t98 @t97 @t96 @t92) (and @t94 @t92))) 0)) % 1.13/1.48 (define @t100 () (_ @t99 @t53 @t64)) % 1.13/1.48 (define @t101 () (_ @t99 @t47 @t64)) % 1.13/1.48 (define @t102 () (not (_ @t99 @t47 @t53))) % 1.13/1.48 (define @t103 () (forall @t68 (or @t102 (not @t101) @t100))) % 1.13/1.48 (define @t104 () (forall @t57 (or @t102 (_ @t99 @t53 @t47)))) % 1.13/1.48 (define @t105 () (forall @t68 (or @t102 (not @t100) @t101))) % 1.13/1.48 (define @t106 () (forall @t50 (not (forall @t60 @t102)))) % 1.13/1.48 (define @t107 () (and @t106 @t105 @t104 @t103)) % 1.13/1.48 (define @t108 () (not @t107)) % 1.13/1.48 (define @t109 () (@quantifiers_skolemize @t104 0)) % 1.13/1.48 (define @t110 () (@quantifiers_skolemize @t104 1)) % 1.13/1.48 (define @t111 () (_ @t99 @t110 @t109)) % 1.13/1.48 (define @t112 () (_ @t99 @t109 @t110)) % 1.13/1.48 (define @t113 () (not @t112)) % 1.13/1.48 (define @t114 () (or @t113 @t111)) % 1.13/1.48 (define @t115 () (not @t114)) % 1.13/1.48 (define @t116 () (not @t104)) % 1.13/1.48 (define @t117 () (_ (lambda @t6 @t92) @t1)) % 1.13/1.48 (define @t118 () (_ (lambda @t6 @t94) @t1)) % 1.13/1.48 (define @t119 () (and @t118 @t117)) % 1.13/1.48 (define @t120 () (_ (lambda @t6 @t96) @t1)) % 1.13/1.48 (define @t121 () (_ (lambda @t6 @t97) @t1)) % 1.13/1.48 (define @t122 () (_ (lambda @t6 @t98) @t1)) % 1.13/1.48 (define @t123 () (and @t122 @t121 @t120 @t117)) % 1.13/1.48 (define @t124 () (forall @t6 (= @t119 @t123))) % 1.13/1.48 (define @t125 () (not @t65)) % 1.13/1.48 (define @t126 () (not @t56)) % 1.13/1.48 (define @t127 () (or @t126 @t125 @t66)) % 1.13/1.48 (define @t128 () (or @t126 @t55)) % 1.13/1.48 (define @t129 () (not @t66)) % 1.13/1.48 (define @t130 () (or @t126 @t129 @t65)) % 1.13/1.48 (define @t131 () (forall @t60 @t126)) % 1.13/1.48 (define @t132 () (not @t131)) % 1.13/1.48 (define @t133 () (forall @t50 (_ @t99 @t47 @t47))) % 1.13/1.48 (define @t134 () (and @t133 @t103)) % 1.13/1.48 (define @t135 () (= @t107 @t134)) % 1.13/1.48 (define @t136 () (not @t134)) % 1.13/1.48 (define @t137 () (_ @t99 @t109 @t109)) % 1.13/1.48 (define @t138 () (not @t137)) % 1.13/1.48 (define @t139 () (or @t113 @t138 @t111)) % 1.13/1.48 (define @t140 () (@quantifiers_skolemize @t105 1)) % 1.13/1.48 (define @t141 () (@quantifiers_skolemize @t105 0)) % 1.13/1.48 (define @t142 () (_ @t99 @t141 @t140)) % 1.13/1.48 (define @t143 () (@quantifiers_skolemize @t105 2)) % 1.13/1.48 (define @t144 () (_ @t99 @t141 @t143)) % 1.13/1.48 (define @t145 () (_ @t99 @t140 @t143)) % 1.13/1.48 (define @t146 () (not @t145)) % 1.13/1.48 (define @t147 () (not @t142)) % 1.13/1.48 (define @t148 () (or @t147 @t146 @t144)) % 1.13/1.48 (define @t149 () (_ @t99 @t140 @t141)) % 1.13/1.48 (define @t150 () (or @t147 @t149)) % 1.13/1.48 (define @t151 () (@list false)) % 1.13/1.48 (define @t152 () (not @t149)) % 1.13/1.48 (define @t153 () (or @t152 @t146 @t144)) % 1.13/1.48 (define @t154 () (not @t148)) % 1.13/1.48 (define @t155 () (not @t105)) % 1.13/1.48 (define @t156 () (@quantifiers_skolemize @t133 0)) % 1.13/1.48 (define @t157 () (forall @t60 (not (_ @t99 @t156 @t53)))) % 1.13/1.48 (define @t158 () (@quantifiers_skolemize @t157 0)) % 1.13/1.48 (define @t159 () (_ @t99 @t158 @t156)) % 1.13/1.48 (define @t160 () (_ @t99 @t156 @t158)) % 1.13/1.48 (define @t161 () (not @t160)) % 1.13/1.48 (define @t162 () (or @t161 @t159)) % 1.13/1.48 (define @t163 () (not @t157)) % 1.13/1.48 (define @t164 () (not @t161)) % 1.13/1.48 (define @t165 () (_ @t99 @t156 @t156)) % 1.13/1.48 (define @t166 () (not @t159)) % 1.13/1.48 (define @t167 () (or @t161 @t166 @t165)) % 1.13/1.48 (define @t168 () (not @t165)) % 1.13/1.48 (define @t169 () (not @t133)) % 1.13/1.48 (define @t170 () (not @t103)) % 1.13/1.48 (define @t171 () (not @t106)) % 1.13/1.48 (define @t172 () (@quantifiers_skolemize @t106 0)) % 1.13/1.48 (define @t173 () (forall @t60 (not (_ @t99 @t172 @t53)))) % 1.13/1.48 (define @t174 () (not (not @t173))) % 1.13/1.48 (define @t175 () (@list true)) % 1.13/1.48 (define @t176 () (@list @t106)) % 1.13/1.48 (define @t177 () (@list @t172)) % 1.13/1.48 (define @t178 () (_ @t99 @t172 @t172)) % 1.13/1.48 (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue))) % 1.13/1.48 (assume @p2 @t8) % 1.13/1.48 (assume @p3 true) % 1.13/1.48 (step @p4 (= tptp.meq_ind @t12) :rule refl :args (@t12)) % 1.13/1.48 (step @p5 (= tptp.meq_prop @t15) :rule refl :args (@t15)) % 1.13/1.48 (step @p6 (= tptp.mnot @t19) :rule refl :args (@t19)) % 1.13/1.48 (step @p7 (= tptp.mor @t21) :rule refl :args (@t21)) % 1.13/1.48 (step @p8 (= tptp.mand @t27) :rule refl :args (@t27)) % 1.13/1.48 (step @p9 (= tptp.mimplies @t28) :rule refl :args (@t28)) % 1.13/1.48 (step @p10 (= tptp.mimplied @t29) :rule refl :args (@t29)) % 1.13/1.48 (step @p11 (= tptp.mequiv @t30) :rule refl :args (@t30)) % 1.13/1.48 (step @p12 (= tptp.mxor @t31) :rule refl :args (@t31)) % 1.13/1.48 (step @p13 (= tptp.mforall_ind @t34) :rule refl :args (@t34)) % 1.13/1.48 (step @p14 (= tptp.mforall_prop @t38) :rule refl :args (@t38)) % 1.13/1.48 (step @p15 (= tptp.mexists_ind @t39) :rule refl :args (@t39)) % 1.13/1.48 (step @p16 (= tptp.mexists_prop @t40) :rule refl :args (@t40)) % 1.13/1.48 (step @p17 (= tptp.mtrue @t42) :rule refl :args (@t42)) % 1.13/1.48 (step @p18 (= tptp.mbox @t45) :rule refl :args (@t45)) % 1.13/1.48 (step @p19 (= tptp.mdia @t46) :rule refl :args (@t46)) % 1.13/1.48 (step @p20 (= tptp.mreflexive @t52) :rule refl :args (@t52)) % 1.13/1.48 (step @p21 (= tptp.msymmetric @t59) :rule refl :args (@t59)) % 1.13/1.48 (step @p22 (= tptp.mserial @t63) :rule refl :args (@t63)) % 1.13/1.48 (step @p23 (= tptp.mtransitive @t70) :rule refl :args (@t70)) % 1.13/1.48 (step @p24 (= tptp.meuclidean @t73) :rule refl :args (@t73)) % 1.13/1.48 (step @p25 (= tptp.mpartially_functional @t75) :rule refl :args (@t75)) % 1.13/1.48 (step @p26 (= tptp.mfunctional @t77) :rule refl :args (@t77)) % 1.13/1.48 (step @p27 (= tptp.mweakly_dense @t80) :rule refl :args (@t80)) % 1.13/1.48 (step @p28 (= tptp.mweakly_connected @t81) :rule refl :args (@t81)) % 1.13/1.48 (step @p29 (= tptp.mweakly_directed @t82) :rule refl :args (@t82)) % 1.13/1.48 (step @p30 (= tptp.mvalid @t84) :rule refl :args (@t84)) % 1.13/1.48 (step @p31 (= tptp.minvalid @t85) :rule refl :args (@t85)) % 1.13/1.48 (step @p32 (= tptp.msatisfiable @t86) :rule refl :args (@t86)) % 1.13/1.48 (step @p33 (= tptp.mcountersatisfiable @t87) :rule refl :args (@t87)) % 1.13/1.48 (step @p34 :rule cnf_and_pos :args (@t107 2)) % 1.13/1.48 (step @p35 :rule reordering :premises (@p34) :args ((or @t104 @t108))) % 1.13/1.48 (step @p36 :rule refl :args (@t115)) % 1.13/1.48 (step @p37 :rule bool-double-not-elim :args (@t104)) % 1.13/1.48 (step @p38 :rule nary_cong :premises (@p37 @p36) :args ((or (not @t116) @t115))) % 1.13/1.48 (assume-push @p277 @t116) % 1.13/1.48 (step @p40 :rule skolemize :premises (@p277)) % 1.13/1.48 (step-pop @p278 :rule scope :premises (@p40)) % 1.13/1.48 (step @p41 :rule process_scope :premises (@p278) :args (@t115)) % 1.13/1.48 (step @p43 :rule implies_elim :premises (@p41)) % 1.13/1.48 (step @p44 :rule eq_resolve :premises (@p43 @p38)) % 1.13/1.48 (step @p45 :rule beta-reduce :args ((= @t117 @t92))) % 1.13/1.48 (step @p46 :rule beta-reduce :args ((= @t118 @t94))) % 1.13/1.48 (step @p47 :rule nary_cong :premises (@p46 @p45) :args (@t119)) % 1.13/1.48 (step @p48 :rule beta-reduce :args ((= @t120 @t96))) % 1.13/1.48 (step @p49 :rule beta-reduce :args ((= @t121 @t97))) % 1.13/1.48 (step @p50 :rule beta-reduce :args ((= @t122 @t98))) % 1.13/1.48 (step @p51 :rule nary_cong :premises (@p50 @p49 @p48 @p45) :args (@t123)) % 1.13/1.48 (step @p52 :rule cong :premises (@p51 @p47) :args ((= @t123 @t119))) % 1.13/1.48 (step @p53 :rule eq-symm :args (@t119 @t123)) % 1.13/1.48 (step @p54 :rule trans :premises (@p53 @p52)) % 1.13/1.48 (step @p55 :rule cong :premises (@p54) :args (@t124)) % 1.13/1.48 (step @p56 :rule cong :premises (@p55) :args ((not @t124))) % 1.13/1.48 (step @p57 :rule refl :args (@t1)) % 1.13/1.48 (step @p58 :rule refl :args (@t88)) % 1.13/1.48 (step @p59 :rule refl :args (@t66)) % 1.13/1.48 (step @p60 :rule cong :premises (@p59 @p58) :args ((= @t66 @t88))) % 1.13/1.48 (step @p61 :rule symm :premises (@p60)) % 1.13/1.48 (step @p62 :rule eq_resolve :premises (@p59 @p61)) % 1.13/1.48 (step @p63 :rule refl :args (@t89)) % 1.13/1.48 (step @p64 :rule refl :args (@t65)) % 1.13/1.48 (step @p65 :rule cong :premises (@p64 @p63) :args ((= @t65 @t89))) % 1.13/1.48 (step @p66 :rule symm :premises (@p65)) % 1.13/1.48 (step @p67 :rule eq_resolve :premises (@p64 @p66)) % 1.13/1.48 (step @p68 :rule cong :premises (@p67) :args (@t125)) % 1.13/1.48 (step @p69 :rule refl :args (@t90)) % 1.13/1.48 (step @p70 :rule refl :args (@t56)) % 1.13/1.48 (step @p71 :rule cong :premises (@p70 @p69) :args ((= @t56 @t90))) % 1.13/1.48 (step @p72 :rule symm :premises (@p71)) % 1.13/1.48 (step @p73 :rule eq_resolve :premises (@p70 @p72)) % 1.13/1.48 (step @p74 :rule cong :premises (@p73) :args (@t126)) % 1.13/1.48 (step @p75 :rule nary_cong :premises (@p74 @p68 @p62) :args (@t127)) % 1.13/1.48 (step @p76 :rule cong :premises (@p75) :args ((forall @t68 @t127))) % 1.13/1.48 (step @p77 :rule aci_norm :args ((= (or (or @t126 @t125) @t66) @t127))) % 1.13/1.48 (step @p78 :rule bool-and-de-morgan :args (@t56 @t65 true)) % 1.13/1.48 (step @p79 :rule nary_cong :premises (@p78 @p59) :args ((or (not @t71) @t66))) % 1.13/1.48 (step @p80 :rule trans :premises (@p79 @p77)) % 1.13/1.48 (step @p81 :rule bool-impl-elim :args (@t71 @t66)) % 1.13/1.48 (step @p82 :rule trans :premises (@p81 @p80)) % 1.13/1.48 (step @p83 :rule cong :premises (@p82) :args (@t72)) % 1.13/1.48 (step @p84 :rule trans :premises (@p83 @p76)) % 1.13/1.48 (step @p85 :rule cong :premises (@p84) :args (@t73)) % 1.13/1.48 (step @p86 :rule trans :premises (@p24 @p85)) % 1.13/1.48 (step @p87 :rule ho_cong :premises (@p86 @p57)) % 1.13/1.48 (step @p88 :rule refl :args (@t95)) % 1.13/1.48 (step @p89 :rule refl :args (@t55)) % 1.13/1.48 (step @p90 :rule cong :premises (@p89 @p88) :args ((= @t55 @t95))) % 1.13/1.48 (step @p91 :rule symm :premises (@p90)) % 1.13/1.48 (step @p92 :rule eq_resolve :premises (@p89 @p91)) % 1.13/1.48 (step @p93 :rule nary_cong :premises (@p74 @p92) :args (@t128)) % 1.13/1.48 (step @p94 :rule cong :premises (@p93) :args ((forall @t57 @t128))) % 1.13/1.48 (step @p95 :rule bool-impl-elim :args (@t56 @t55)) % 1.13/1.48 (step @p96 :rule cong :premises (@p95) :args (@t58)) % 1.13/1.48 (step @p97 :rule trans :premises (@p96 @p94)) % 1.13/1.48 (step @p98 :rule cong :premises (@p97) :args (@t59)) % 1.13/1.48 (step @p99 :rule trans :premises (@p21 @p98)) % 1.13/1.48 (step @p100 :rule ho_cong :premises (@p99 @p57)) % 1.13/1.48 (step @p101 :rule cong :premises (@p62) :args (@t129)) % 1.13/1.48 (step @p102 :rule nary_cong :premises (@p74 @p101 @p67) :args (@t130)) % 1.13/1.48 (step @p103 :rule cong :premises (@p102) :args ((forall @t68 @t130))) % 1.13/1.48 (step @p104 :rule aci_norm :args ((= (or (or @t126 @t129) @t65) @t130))) % 1.13/1.48 (step @p105 :rule bool-and-de-morgan :args (@t56 @t66 true)) % 1.13/1.48 (step @p106 :rule nary_cong :premises (@p105 @p64) :args ((or (not @t67) @t65))) % 1.13/1.48 (step @p107 :rule trans :premises (@p106 @p104)) % 1.13/1.48 (step @p108 :rule bool-impl-elim :args (@t67 @t65)) % 1.13/1.48 (step @p109 :rule trans :premises (@p108 @p107)) % 1.13/1.48 (step @p110 :rule cong :premises (@p109) :args (@t69)) % 1.13/1.48 (step @p111 :rule trans :premises (@p110 @p103)) % 1.13/1.48 (step @p112 :rule cong :premises (@p111) :args (@t70)) % 1.13/1.48 (step @p113 :rule trans :premises (@p23 @p112)) % 1.13/1.48 (step @p114 :rule ho_cong :premises (@p113 @p57)) % 1.13/1.48 (step @p115 :rule cong :premises (@p74) :args (@t131)) % 1.13/1.48 (step @p116 :rule cong :premises (@p115) :args (@t132)) % 1.13/1.48 (step @p117 :rule exists-elim :args ((= @t61 @t132))) % 1.13/1.48 (step @p118 :rule trans :premises (@p117 @p116)) % 1.13/1.48 (step @p119 :rule cong :premises (@p118) :args (@t62)) % 1.13/1.48 (step @p120 :rule cong :premises (@p119) :args (@t63)) % 1.13/1.48 (step @p121 :rule trans :premises (@p22 @p120)) % 1.13/1.48 (step @p122 :rule ho_cong :premises (@p121 @p57)) % 1.13/1.48 (step @p123 :rule nary_cong :premises (@p122 @p114 @p100 @p87) :args (@t3)) % 1.13/1.48 (step @p124 :rule refl :args (@t93)) % 1.13/1.48 (step @p125 :rule refl :args (@t49)) % 1.13/1.48 (step @p126 :rule cong :premises (@p125 @p124) :args ((= @t49 @t93))) % 1.13/1.48 (step @p127 :rule symm :premises (@p126)) % 1.13/1.48 (step @p128 :rule eq_resolve :premises (@p125 @p127)) % 1.13/1.48 (step @p129 :rule cong :premises (@p128) :args (@t51)) % 1.13/1.48 (step @p130 :rule cong :premises (@p129) :args (@t52)) % 1.13/1.48 (step @p131 :rule trans :premises (@p20 @p130)) % 1.13/1.48 (step @p132 :rule ho_cong :premises (@p131 @p57)) % 1.13/1.48 (step @p133 :rule nary_cong :premises (@p132 @p87) :args (@t4)) % 1.13/1.48 (step @p134 :rule cong :premises (@p133 @p123) :args (@t5)) % 1.13/1.48 (step @p135 :rule cong :premises (@p134) :args (@t7)) % 1.13/1.48 (step @p136 :rule cong :premises (@p135) :args (@t8)) % 1.13/1.48 (step @p137 :rule trans :premises (@p136 @p56)) % 1.13/1.48 (step @p138 :rule eq_resolve :premises (@p2 @p137)) % 1.13/1.48 (step @p139 :rule skolemize :premises (@p138)) % 1.13/1.48 (step @p140 :rule cnf_equiv_neg1 :args (@t135)) % 1.13/1.48 (step @p141 :rule reordering :premises (@p140) :args ((or @t107 @t134 @t135))) % 1.13/1.48 (step @p142 :rule bool-double-not-elim :args (@t112)) % 1.13/1.48 (step @p143 :rule refl :args (@t114)) % 1.13/1.48 (step @p144 :rule nary_cong :premises (@p143 @p142) :args ((or @t114 (not @t113)))) % 1.13/1.48 (step @p145 :rule cnf_or_neg :args (@t114 0)) % 1.13/1.48 (step @p146 :rule eq_resolve :premises (@p145 @p144)) % 1.13/1.48 (step @p147 :rule reordering :premises (@p146) :args ((or @t112 @t114))) % 1.13/1.48 (step @p148 :rule cnf_or_neg :args (@t114 1)) % 1.13/1.48 (step @p149 :rule cnf_and_pos :args (@t134 0)) % 1.13/1.48 (step @p150 :rule reordering :premises (@p149) :args ((or @t133 @t136))) % 1.13/1.48 (step @p151 :rule cnf_and_pos :args (@t107 3)) % 1.13/1.48 (step @p152 :rule reordering :premises (@p151) :args ((or @t103 @t108))) % 1.13/1.48 (step @p153 :rule cnf_and_pos :args (@t134 1)) % 1.13/1.48 (step @p154 :rule reordering :premises (@p153) :args ((or @t103 @t136))) % 1.13/1.48 (step @p155 :rule chain_m_resolution :premises (@p141 @p139 @p154 @p152) :args (@t103 (@list true true true) (@list @t135 @t134 @t107))) % 1.13/1.48 (step @p156 :rule instantiate :premises (@p155) :args ((@list @t109 @t110 @t109))) % 1.13/1.48 (step @p157 :rule cnf_or_pos :args (@t139)) % 1.13/1.48 (step @p158 :rule reordering :premises (@p157) :args ((or @t113 @t111 @t138 (not @t139)))) % 1.13/1.48 (assume-push @p279 @t133) % 1.13/1.48 (step @p160 :rule instantiate :premises (@p279) :args ((@list @t109))) % 1.13/1.48 (step-pop @p280 :rule scope :premises (@p160)) % 1.13/1.48 (step @p161 :rule process_scope :premises (@p280) :args (@t137)) % 1.13/1.48 (step @p163 :rule implies_elim :premises (@p161)) % 1.13/1.48 (step @p164 :rule chain_m_resolution :premises (@p163 @p158 @p156 @p150 @p148 @p147 @p141 @p139 @p44 @p35) :args (@t104 (@list true false false true false false true true true) (@list @t137 @t139 @t133 @t111 @t112 @t134 @t135 @t114 @t107))) % 1.13/1.48 (step @p165 :rule bool-double-not-elim :args (@t142)) % 1.13/1.48 (step @p166 :rule refl :args (@t148)) % 1.13/1.48 (step @p167 :rule nary_cong :premises (@p166 @p165) :args ((or @t148 (not @t147)))) % 1.13/1.48 (step @p168 :rule cnf_or_neg :args (@t148 0)) % 1.13/1.48 (step @p169 :rule eq_resolve :premises (@p168 @p167)) % 1.13/1.48 (step @p170 :rule reordering :premises (@p169) :args ((or @t142 @t148))) % 1.13/1.48 (step @p171 :rule bool-double-not-elim :args (@t145)) % 1.13/1.48 (step @p172 :rule nary_cong :premises (@p166 @p171) :args ((or @t148 (not @t146)))) % 1.13/1.48 (step @p173 :rule cnf_or_neg :args (@t148 1)) % 1.13/1.48 (step @p174 :rule eq_resolve :premises (@p173 @p172)) % 1.13/1.48 (step @p175 :rule reordering :premises (@p174) :args ((or @t145 @t148))) % 1.13/1.48 (step @p176 :rule cnf_or_neg :args (@t148 2)) % 1.13/1.48 (assume-push @p281 @t104) % 1.13/1.48 (step @p178 :rule instantiate :premises (@p281) :args ((@list @t141 @t140))) % 1.13/1.48 (step-pop @p282 :rule scope :premises (@p178)) % 1.13/1.48 (step @p179 :rule process_scope :premises (@p282) :args (@t150)) % 1.13/1.48 (step @p181 :rule implies_elim :premises (@p179)) % 1.13/1.48 (step @p182 :rule chain_m_resolution :premises (@p181 @p164) :args (@t150 @t151 (@list @t104))) % 1.13/1.48 (step @p183 :rule cnf_or_pos :args (@t150)) % 1.13/1.48 (step @p184 :rule reordering :premises (@p183) :args ((or @t147 @t149 (not @t150)))) % 1.13/1.48 (step @p185 :rule instantiate :premises (@p155) :args ((@list @t140 @t141 @t143))) % 1.13/1.48 (step @p186 :rule cnf_or_pos :args (@t153)) % 1.13/1.48 (step @p187 :rule reordering :premises (@p186) :args ((or @t146 @t144 @t152 (not @t153)))) % 1.13/1.48 (step @p188 :rule chain_m_resolution :premises (@p187 @p185 @p184 @p182 @p176 @p175 @p170) :args (@t148 (@list false false false true false false) (@list @t153 @t149 @t150 @t144 @t145 @t142))) % 1.13/1.48 (step @p189 :rule refl :args (@t154)) % 1.13/1.48 (step @p190 :rule bool-double-not-elim :args (@t105)) % 1.13/1.48 (step @p191 :rule nary_cong :premises (@p190 @p189) :args ((or (not @t155) @t154))) % 1.13/1.48 (assume-push @p283 @t155) % 1.13/1.48 (step @p193 :rule skolemize :premises (@p283)) % 1.13/1.48 (step-pop @p284 :rule scope :premises (@p193)) % 1.13/1.48 (step @p194 :rule process_scope :premises (@p284) :args (@t154)) % 1.13/1.48 (step @p196 :rule implies_elim :premises (@p194)) % 1.13/1.48 (step @p197 :rule eq_resolve :premises (@p196 @p191)) % 1.13/1.48 (step @p198 :rule chain_m_resolution :premises (@p197 @p188) :args (@t105 @t151 (@list @t148))) % 1.13/1.48 (assume-push @p285 @t104) % 1.13/1.48 (step @p200 :rule instantiate :premises (@p285) :args ((@list @t156 @t158))) % 1.13/1.48 (step-pop @p286 :rule scope :premises (@p200)) % 1.13/1.48 (step @p201 :rule process_scope :premises (@p286) :args (@t162)) % 1.13/1.48 (step @p203 :rule implies_elim :premises (@p201)) % 1.13/1.48 (assume-push @p287 @t106) % 1.13/1.48 (step @p205 :rule instantiate :premises (@p287) :args ((@list @t156))) % 1.13/1.48 (step-pop @p288 :rule scope :premises (@p205)) % 1.13/1.48 (step @p206 :rule process_scope :premises (@p288) :args (@t163)) % 1.13/1.48 (step @p208 :rule implies_elim :premises (@p206)) % 1.13/1.48 (step @p209 :rule refl :args (@t160)) % 1.13/1.48 (step @p210 :rule bool-double-not-elim :args (@t157)) % 1.13/1.48 (step @p211 :rule nary_cong :premises (@p210 @p209) :args ((or (not @t163) @t160))) % 1.13/1.48 (step @p212 :rule bool-double-not-elim :args (@t160)) % 1.13/1.48 (step @p213 :rule refl :args (@t163)) % 1.13/1.48 (step @p214 :rule cong :premises (@p213 @p212) :args ((=> @t163 @t164))) % 1.13/1.48 (assume-push @p289 @t163) % 1.13/1.48 (step @p216 :rule skolemize :premises (@p289)) % 1.13/1.48 (step-pop @p290 :rule scope :premises (@p216)) % 1.13/1.48 (step @p217 :rule process_scope :premises (@p290) :args (@t164)) % 1.13/1.48 (step @p219 :rule eq_resolve :premises (@p217 @p214)) % 1.13/1.48 (step @p220 :rule implies_elim :premises (@p219)) % 1.13/1.48 (step @p221 :rule eq_resolve :premises (@p220 @p211)) % 1.13/1.48 (step @p222 :rule cnf_or_pos :args (@t162)) % 1.13/1.48 (step @p223 :rule reordering :premises (@p222) :args ((or @t161 @t159 (not @t162)))) % 1.13/1.48 (assume-push @p291 @t105) % 1.13/1.48 (step @p225 :rule instantiate :premises (@p291) :args ((@list @t156 @t158 @t156))) % 1.13/1.48 (step-pop @p292 :rule scope :premises (@p225)) % 1.13/1.48 (step @p226 :rule process_scope :premises (@p292) :args (@t167)) % 1.13/1.48 (step @p228 :rule implies_elim :premises (@p226)) % 1.13/1.48 (step @p229 :rule cnf_or_pos :args (@t167)) % 1.13/1.48 (step @p230 :rule reordering :premises (@p229) :args ((or @t165 @t161 @t166 (not @t167)))) % 1.13/1.48 (step @p231 :rule refl :args (@t168)) % 1.13/1.48 (step @p232 :rule bool-double-not-elim :args (@t133)) % 1.13/1.48 (step @p233 :rule nary_cong :premises (@p232 @p231) :args ((or (not @t169) @t168))) % 1.13/1.48 (assume-push @p293 @t169) % 1.13/1.48 (step @p235 :rule skolemize :premises (@p293)) % 1.13/1.48 (step-pop @p294 :rule scope :premises (@p235)) % 1.13/1.48 (step @p236 :rule process_scope :premises (@p294) :args (@t168)) % 1.13/1.48 (step @p238 :rule implies_elim :premises (@p236)) % 1.13/1.48 (step @p239 :rule eq_resolve :premises (@p238 @p233)) % 1.13/1.48 (step @p240 :rule cnf_and_neg :args (@t107)) % 1.13/1.48 (step @p241 :rule cnf_and_neg :args (@t134)) % 1.13/1.48 (step @p242 :rule reordering :premises (@p241) :args ((or @t134 @t170 @t169))) % 1.13/1.48 (step @p243 :rule cnf_equiv_neg2 :args (@t135)) % 1.13/1.48 (step @p244 :rule chain_m_resolution :premises (@p243 @p139 @p242 @p240 @p239 @p230 @p228 @p223 @p221 @p208 @p203) :args ((or @t171 @t155 @t116 @t170) (@list true false false false false false false false true false) (@list @t135 @t134 @t107 @t133 @t165 @t167 @t159 @t160 @t157 @t162))) % 1.13/1.48 (step @p245 :rule chain_m_resolution :premises (@p244 @p198 @p155 @p164) :args (@t171 (@list false false false) (@list @t105 @t103 @t104))) % 1.13/1.48 (step @p246 :rule refl :args (@t173)) % 1.13/1.48 (step @p247 :rule bool-double-not-elim :args (@t106)) % 1.13/1.48 (step @p248 :rule nary_cong :premises (@p247 @p246) :args ((or (not @t171) @t173))) % 1.13/1.48 (step @p249 :rule bool-double-not-elim :args (@t173)) % 1.13/1.48 (step @p250 :rule refl :args (@t171)) % 1.13/1.48 (step @p251 :rule cong :premises (@p250 @p249) :args ((=> @t171 @t174))) % 1.13/1.48 (assume-push @p295 @t171) % 1.13/1.48 (step @p253 :rule skolemize :premises (@p295)) % 1.13/1.48 (step-pop @p296 :rule scope :premises (@p253)) % 1.13/1.48 (step @p254 :rule process_scope :premises (@p296) :args (@t174)) % 1.13/1.48 (step @p256 :rule eq_resolve :premises (@p254 @p251)) % 1.13/1.48 (step @p257 :rule implies_elim :premises (@p256)) % 1.13/1.48 (step @p258 :rule eq_resolve :premises (@p257 @p248)) % 1.13/1.48 (step @p259 :rule chain_m_resolution :premises (@p258 @p245) :args (@t173 @t175 @t176)) % 1.13/1.48 (step @p260 :rule cnf_and_pos :args (@t107 0)) % 1.13/1.48 (step @p261 :rule reordering :premises (@p260) :args ((or @t106 @t108))) % 1.13/1.48 (step @p262 :rule chain_m_resolution :premises (@p261 @p245) :args (@t108 @t175 @t176)) % 1.13/1.48 (step @p263 :rule chain_m_resolution :premises (@p141 @p262 @p139) :args (@t134 (@list true true) (@list @t107 @t135))) % 1.13/1.48 (step @p264 :rule chain_m_resolution :premises (@p150 @p263) :args (@t133 @t151 (@list @t134))) % 1.13/1.48 (assume-push @p297 @t133) % 1.13/1.48 (step @p266 :rule instantiate :premises (@p297) :args (@t177)) % 1.13/1.48 (step-pop @p298 :rule scope :premises (@p266)) % 1.13/1.48 (step @p267 :rule process_scope :premises (@p298) :args (@t178)) % 1.13/1.48 (step @p269 :rule implies_elim :premises (@p267)) % 1.13/1.48 (step @p270 :rule chain_m_resolution :premises (@p269 @p264) :args (@t178 @t151 (@list @t133))) % 1.13/1.48 (assume-push @p299 @t173) % 1.13/1.48 (step @p272 :rule instantiate :premises (@p299) :args (@t177)) % 1.13/1.48 (step-pop @p300 :rule scope :premises (@p272)) % 1.13/1.49 (step @p273 :rule process_scope :premises (@p300) :args ((not @t178))) % 1.13/1.49 (step @p275 :rule implies_elim :premises (@p273)) % 1.13/1.49 (step @p276 false :rule chain_m_resolution :premises (@p275 @p270 @p259) :args (false (@list false false) (@list @t178 @t173))) % 1.13/1.49 ) % 1.13/1.49 % SZS output end Proof % 1.13/1.49 % cvc5 exiting %------------------------------------------------------------------------------