%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL699^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 : n029.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:23:39 AM UTC 2026 % Result : Theorem 0.20s 0.50s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL699^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 : n029.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.03/0.36 % CPULimit : 300 % 0.03/0.36 % WCLimit : 300 % 0.03/0.36 % DateTime : Sat Sep 5 23:01:25 UTC 2026 % 0.03/0.36 % CPUTime : % 0.03/0.44 %----Proving TH0 % 0.20/0.50 --- 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.20/0.50 % SZS status Theorem % 0.20/0.50 % SZS output start Proof % 0.20/0.50 ( % 0.20/0.50 (declare-sort $$unsorted 0) % 0.20/0.50 (declare-sort tptp.mu 0) % 0.20/0.50 (declare-const tptp.mfalse (-> $$unsorted Bool)) % 0.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (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.20/0.50 (define @t1 () (@var "__flatten_var_0" $$unsorted)) % 0.20/0.50 (define @t2 () (@var "A" (-> $$unsorted Bool))) % 0.20/0.50 (define @t3 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.20/0.50 (define @t4 () (_ tptp.mbox @t3)) % 0.20/0.50 (define @t5 () (@list @t2 @t1)) % 0.20/0.50 (define @t6 () (lambda @t5 (_ (_ (_ tptp.mimplies (_ @t4 @t2)) @t2) @t1))) % 0.20/0.50 (define @t7 () (=> (_ tptp.mreflexive @t3) (_ tptp.mvalid (_ tptp.mforall_prop @t6)))) % 0.20/0.50 (define @t8 () (@list @t3)) % 0.20/0.50 (define @t9 () (forall @t8 @t7)) % 0.20/0.50 (define @t10 () (not @t9)) % 0.20/0.50 (define @t11 () (@var "Y" tptp.mu)) % 0.20/0.50 (define @t12 () (@var "X" tptp.mu)) % 0.20/0.50 (define @t13 () (@var "W" $$unsorted)) % 0.20/0.50 (define @t14 () (lambda (@list @t12 @t11 @t13) (= @t12 @t11))) % 0.20/0.50 (define @t15 () (@var "Y" (-> $$unsorted Bool))) % 0.20/0.50 (define @t16 () (@var "X" (-> $$unsorted Bool))) % 0.20/0.50 (define @t17 () (lambda (@list @t16 @t15 @t13) (= (_ @t16 @t13) (_ @t15 @t13)))) % 0.20/0.50 (define @t18 () (@var "Phi" (-> $$unsorted Bool))) % 0.20/0.50 (define @t19 () (_ @t18 @t13)) % 0.20/0.50 (define @t20 () (not @t19)) % 0.20/0.50 (define @t21 () (@list @t18 @t13)) % 0.20/0.50 (define @t22 () (lambda @t21 @t20)) % 0.20/0.50 (define @t23 () (@var "Psi" (-> $$unsorted Bool))) % 0.20/0.50 (define @t24 () (_ @t23 @t13)) % 0.20/0.50 (define @t25 () (lambda (@list @t18 @t23 @t13) (or @t19 @t24))) % 0.20/0.50 (define @t26 () (_ tptp.mnot @t23)) % 0.20/0.50 (define @t27 () (_ tptp.mnot @t18)) % 0.20/0.50 (define @t28 () (_ tptp.mor @t27)) % 0.20/0.50 (define @t29 () (@list @t18 @t23 @t1)) % 0.20/0.50 (define @t30 () (lambda @t29 (_ (_ tptp.mnot (_ @t28 @t26)) @t1))) % 0.20/0.50 (define @t31 () (lambda @t29 (_ (_ @t28 @t23) @t1))) % 0.20/0.50 (define @t32 () (lambda @t29 (_ (_ (_ tptp.mor @t26) @t18) @t1))) % 0.20/0.50 (define @t33 () (lambda @t29 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t18) @t23)) (_ (_ tptp.mimplies @t23) @t18)) @t1))) % 0.20/0.50 (define @t34 () (lambda @t29 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t18) @t23)) @t1))) % 0.20/0.50 (define @t35 () (@var "Phi" (-> tptp.mu $$unsorted Bool))) % 0.20/0.50 (define @t36 () (_ @t35 @t12)) % 0.20/0.50 (define @t37 () (lambda (@list @t35 @t13) (forall (@list @t12) (_ @t36 @t13)))) % 0.20/0.50 (define @t38 () (@var "P" (-> $$unsorted Bool))) % 0.20/0.50 (define @t39 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool))) % 0.20/0.50 (define @t40 () (_ @t39 @t38)) % 0.20/0.50 (define @t41 () (_ @t40 @t13)) % 0.20/0.50 (define @t42 () (@list @t38)) % 0.20/0.50 (define @t43 () (forall @t42 @t41)) % 0.20/0.50 (define @t44 () (@list @t39 @t13)) % 0.20/0.50 (define @t45 () (lambda @t44 @t43)) % 0.20/0.50 (define @t46 () (lambda (@list @t35 @t1) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list @t12 @t1) (_ (_ tptp.mnot @t36) @t1)))) @t1))) % 0.20/0.50 (define @t47 () (lambda (@list @t39 @t1) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t38 @t1) (_ (_ tptp.mnot @t40) @t1)))) @t1))) % 0.20/0.50 (define @t48 () (@list @t13)) % 0.20/0.50 (define @t49 () (lambda @t48 true)) % 0.20/0.50 (define @t50 () (@var "V" $$unsorted)) % 0.20/0.50 (define @t51 () (_ @t18 @t50)) % 0.20/0.50 (define @t52 () (_ (_ @t3 @t13) @t50)) % 0.20/0.50 (define @t53 () (not @t52)) % 0.20/0.50 (define @t54 () (or @t53 @t51)) % 0.20/0.50 (define @t55 () (@list @t50)) % 0.20/0.50 (define @t56 () (forall @t55 @t54)) % 0.20/0.50 (define @t57 () (@list @t3 @t18 @t13)) % 0.20/0.50 (define @t58 () (lambda @t57 @t56)) % 0.20/0.50 (define @t59 () (lambda (@list @t3 @t18 @t1) (_ (_ tptp.mnot (_ @t4 @t27)) @t1))) % 0.20/0.50 (define @t60 () (@var "S" $$unsorted)) % 0.20/0.50 (define @t61 () (_ @t3 @t60)) % 0.20/0.50 (define @t62 () (_ @t61 @t60)) % 0.20/0.50 (define @t63 () (@list @t60)) % 0.20/0.50 (define @t64 () (forall @t63 @t62)) % 0.20/0.50 (define @t65 () (lambda @t8 @t64)) % 0.20/0.50 (define @t66 () (@var "T" $$unsorted)) % 0.20/0.50 (define @t67 () (_ @t3 @t66)) % 0.20/0.50 (define @t68 () (_ @t61 @t66)) % 0.20/0.50 (define @t69 () (lambda @t8 (forall (@list @t60 @t66) (=> @t68 (_ @t67 @t60))))) % 0.20/0.50 (define @t70 () (@list @t66)) % 0.20/0.50 (define @t71 () (lambda @t8 (forall @t63 (exists @t70 @t68)))) % 0.20/0.50 (define @t72 () (@var "U" $$unsorted)) % 0.20/0.50 (define @t73 () (_ @t61 @t72)) % 0.20/0.50 (define @t74 () (_ @t67 @t72)) % 0.20/0.50 (define @t75 () (@list @t60 @t66 @t72)) % 0.20/0.50 (define @t76 () (lambda @t8 (forall @t75 (=> (and @t68 @t74) @t73)))) % 0.20/0.50 (define @t77 () (and @t68 @t73)) % 0.20/0.50 (define @t78 () (lambda @t8 (forall @t75 (=> @t77 @t74)))) % 0.20/0.50 (define @t79 () (= @t66 @t72)) % 0.20/0.50 (define @t80 () (lambda @t8 (forall @t75 (=> @t77 @t79)))) % 0.20/0.50 (define @t81 () (@list @t72)) % 0.20/0.50 (define @t82 () (lambda @t8 (forall @t63 (exists @t70 (and @t68 (forall @t81 (=> @t73 @t79))))))) % 0.20/0.50 (define @t83 () (_ @t3 @t72)) % 0.20/0.50 (define @t84 () (_ @t83 @t66)) % 0.20/0.50 (define @t85 () (lambda @t8 (forall @t75 (=> @t68 (exists @t81 (and @t73 @t84)))))) % 0.20/0.50 (define @t86 () (lambda @t8 (forall @t75 (=> @t77 (or @t74 @t79 @t84))))) % 0.20/0.50 (define @t87 () (lambda @t8 (forall @t75 (=> @t77 (exists @t55 (and (_ @t67 @t50) (_ @t83 @t50))))))) % 0.20/0.50 (define @t88 () (forall @t48 @t19)) % 0.20/0.50 (define @t89 () (@list @t18)) % 0.20/0.50 (define @t90 () (lambda @t89 @t88)) % 0.20/0.50 (define @t91 () (lambda @t89 (forall @t48 @t20))) % 0.20/0.50 (define @t92 () (lambda @t89 (exists @t48 @t19))) % 0.20/0.50 (define @t93 () (lambda @t89 (exists @t48 @t20))) % 0.20/0.50 (define @t94 () (@var "BOUND_VARIABLE_8388" $$unsorted)) % 0.20/0.50 (define @t95 () (@var "BOUND_VARIABLE_8390" (-> $$unsorted Bool))) % 0.20/0.50 (define @t96 () (_ @t95 @t94)) % 0.20/0.50 (define @t97 () (not (forall @t55 (or (not (_ @t3 @t94 @t50)) (_ @t95 @t50))))) % 0.20/0.50 (define @t98 () (_ @t3 @t60 @t60)) % 0.20/0.50 (define @t99 () (forall @t63 @t98)) % 0.20/0.50 (define @t100 () (not @t99)) % 0.20/0.50 (define @t101 () (or @t100 @t97 @t96)) % 0.20/0.50 (define @t102 () (or @t97 @t96)) % 0.20/0.50 (define @t103 () (or @t100 @t102)) % 0.20/0.50 (define @t104 () (@list @t3 @t94 @t95)) % 0.20/0.50 (define @t105 () (forall @t104 @t103)) % 0.20/0.50 (define @t106 () (@list @t94 @t95)) % 0.20/0.50 (define @t107 () (forall @t106 @t103)) % 0.20/0.50 (define @t108 () (forall @t106 @t102)) % 0.20/0.50 (define @t109 () (or @t100 @t108)) % 0.20/0.50 (define @t110 () (_ @t38 @t13)) % 0.20/0.50 (define @t111 () (_ @t3 @t13 @t50)) % 0.20/0.50 (define @t112 () (not @t111)) % 0.20/0.50 (define @t113 () (not (forall @t55 (or @t112 (_ @t38 @t50))))) % 0.20/0.50 (define @t114 () (or @t113 @t110)) % 0.20/0.50 (define @t115 () (forall (@list @t13 @t38) @t114)) % 0.20/0.50 (define @t116 () (forall @t42 @t114)) % 0.20/0.50 (define @t117 () (lambda @t48 @t116)) % 0.20/0.50 (define @t118 () (_ @t117 @t13)) % 0.20/0.50 (define @t119 () (forall @t48 @t118)) % 0.20/0.50 (define @t120 () (_ @t18 @t13)) % 0.20/0.50 (define @t121 () (lambda @t89 (forall @t48 @t120))) % 0.20/0.50 (define @t122 () (_ @t38 @t13)) % 0.20/0.50 (define @t123 () (or @t113 @t122)) % 0.20/0.50 (define @t124 () (_ @t2 @t50)) % 0.20/0.50 (define @t125 () (forall @t55 (or (not (_ @t3 @t1 @t50)) @t124))) % 0.20/0.50 (define @t126 () (not @t125)) % 0.20/0.50 (define @t127 () (or @t126 (_ @t2 @t1))) % 0.20/0.50 (define @t128 () (lambda @t5 @t127)) % 0.20/0.50 (define @t129 () (_ @t128 @t38 @t13)) % 0.20/0.50 (define @t130 () (forall @t42 @t129)) % 0.20/0.50 (define @t131 () (lambda @t48 @t130)) % 0.20/0.50 (define @t132 () (_ @t39 @t38 @t13)) % 0.20/0.50 (define @t133 () (lambda @t44 (forall @t42 @t132))) % 0.20/0.50 (define @t134 () (lambda (@list @t1) @t127)) % 0.20/0.50 (define @t135 () (_ @t23 @t1)) % 0.20/0.50 (define @t136 () (@list @t23 @t1)) % 0.20/0.50 (define @t137 () (lambda @t48 (forall @t55 (or @t112 @t124)))) % 0.20/0.50 (define @t138 () (_ @t137 @t1)) % 0.20/0.50 (define @t139 () (not @t138)) % 0.20/0.50 (define @t140 () (or @t139 @t135)) % 0.20/0.50 (define @t141 () (lambda @t136 @t140)) % 0.20/0.50 (define @t142 () (or (not (_ @t18 @t1)) @t135)) % 0.20/0.50 (define @t143 () (lambda @t29 @t142)) % 0.20/0.50 (define @t144 () (_ @t18 @t50)) % 0.20/0.50 (define @t145 () (forall @t55 (or @t112 @t144))) % 0.20/0.50 (define @t146 () (lambda @t21 @t145)) % 0.20/0.50 (define @t147 () (_ (lambda @t57 @t145) @t3)) % 0.20/0.50 (define @t148 () (lambda @t5 (_ (_ (_ @t143 (_ @t147 @t2)) @t2) @t1))) % 0.20/0.50 (define @t149 () (_ (lambda @t8 @t99) @t3)) % 0.20/0.50 (define @t150 () (=> @t149 (_ @t121 (_ @t133 @t148)))) % 0.20/0.50 (define @t151 () (forall @t8 @t150)) % 0.20/0.50 (define @t152 () (or @t20 @t24)) % 0.20/0.50 (define @t153 () (lambda @t48 @t152)) % 0.20/0.50 (define @t154 () (@list @t23 @t13)) % 0.20/0.50 (define @t155 () (lambda @t48 @t20)) % 0.20/0.50 (define @t156 () (_ @t155 @t13)) % 0.20/0.50 (define @t157 () (or @t156 @t24)) % 0.20/0.50 (define @t158 () (lambda @t154 @t157)) % 0.20/0.50 (define @t159 () (forall @t104 @t101)) % 0.20/0.50 (define @t160 () (@quantifiers_skolemize @t159 0)) % 0.20/0.50 (define @t161 () (forall @t63 (_ @t160 @t60 @t60))) % 0.20/0.50 (define @t162 () (@quantifiers_skolemize @t159 1)) % 0.20/0.50 (define @t163 () (@quantifiers_skolemize @t159 2)) % 0.20/0.50 (define @t164 () (_ @t163 @t162)) % 0.20/0.50 (define @t165 () (forall @t55 (or (not (_ @t160 @t162 @t50)) (_ @t163 @t50)))) % 0.20/0.50 (define @t166 () (not @t165)) % 0.20/0.50 (define @t167 () (not @t161)) % 0.20/0.50 (define @t168 () (or @t167 @t166 @t164)) % 0.20/0.50 (define @t169 () (@list true)) % 0.20/0.50 (define @t170 () (@list @t168)) % 0.20/0.50 (define @t171 () (@list @t162)) % 0.20/0.50 (define @t172 () (_ @t160 @t162 @t162)) % 0.20/0.50 (define @t173 () (not @t172)) % 0.20/0.50 (define @t174 () (or @t173 @t164)) % 0.20/0.50 (define @t175 () (@list true false)) % 0.20/0.50 (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue))) % 0.20/0.50 (assume @p2 @t10) % 0.20/0.50 (assume @p3 true) % 0.20/0.50 (step @p4 (= tptp.meq_ind @t14) :rule refl :args (@t14)) % 0.20/0.50 (step @p5 (= tptp.meq_prop @t17) :rule refl :args (@t17)) % 0.20/0.50 (step @p6 (= tptp.mnot @t22) :rule refl :args (@t22)) % 0.20/0.50 (step @p7 (= tptp.mor @t25) :rule refl :args (@t25)) % 0.20/0.50 (step @p8 (= tptp.mand @t30) :rule refl :args (@t30)) % 0.20/0.50 (step @p9 (= tptp.mimplies @t31) :rule refl :args (@t31)) % 0.20/0.50 (step @p10 (= tptp.mimplied @t32) :rule refl :args (@t32)) % 0.20/0.50 (step @p11 (= tptp.mequiv @t33) :rule refl :args (@t33)) % 0.20/0.50 (step @p12 (= tptp.mxor @t34) :rule refl :args (@t34)) % 0.20/0.50 (step @p13 (= tptp.mforall_ind @t37) :rule refl :args (@t37)) % 0.20/0.50 (step @p14 (= tptp.mforall_prop @t45) :rule refl :args (@t45)) % 0.20/0.50 (step @p15 (= tptp.mexists_ind @t46) :rule refl :args (@t46)) % 0.20/0.50 (step @p16 (= tptp.mexists_prop @t47) :rule refl :args (@t47)) % 0.20/0.50 (step @p17 (= tptp.mtrue @t49) :rule refl :args (@t49)) % 0.20/0.50 (step @p18 (= tptp.mbox @t58) :rule refl :args (@t58)) % 0.20/0.50 (step @p19 (= tptp.mdia @t59) :rule refl :args (@t59)) % 0.20/0.50 (step @p20 (= tptp.mreflexive @t65) :rule refl :args (@t65)) % 0.20/0.50 (step @p21 (= tptp.msymmetric @t69) :rule refl :args (@t69)) % 0.20/0.50 (step @p22 (= tptp.mserial @t71) :rule refl :args (@t71)) % 0.20/0.50 (step @p23 (= tptp.mtransitive @t76) :rule refl :args (@t76)) % 0.20/0.50 (step @p24 (= tptp.meuclidean @t78) :rule refl :args (@t78)) % 0.20/0.50 (step @p25 (= tptp.mpartially_functional @t80) :rule refl :args (@t80)) % 0.20/0.50 (step @p26 (= tptp.mfunctional @t82) :rule refl :args (@t82)) % 0.20/0.50 (step @p27 (= tptp.mweakly_dense @t85) :rule refl :args (@t85)) % 0.20/0.50 (step @p28 (= tptp.mweakly_connected @t86) :rule refl :args (@t86)) % 0.20/0.50 (step @p29 (= tptp.mweakly_directed @t87) :rule refl :args (@t87)) % 0.20/0.50 (step @p30 (= tptp.mvalid @t90) :rule refl :args (@t90)) % 0.20/0.50 (step @p31 (= tptp.minvalid @t91) :rule refl :args (@t91)) % 0.20/0.50 (step @p32 (= tptp.msatisfiable @t92) :rule refl :args (@t92)) % 0.20/0.50 (step @p33 (= tptp.mcountersatisfiable @t93) :rule refl :args (@t93)) % 0.20/0.50 (step @p34 :rule aci_norm :args ((= @t103 @t101))) % 0.20/0.50 (step @p35 :rule cong :premises (@p34) :args (@t105)) % 0.20/0.50 (step @p36 :rule quant-merge-prenex :args ((= (forall @t8 @t107) @t105))) % 0.20/0.50 (step @p37 :rule alpha_equiv :args (@t108 (@list @t94 @t95) (@list @t13 @t38))) % 0.20/0.50 (step @p38 :rule refl :args (@t100)) % 0.20/0.50 (step @p39 :rule nary_cong :premises (@p38 @p37) :args (@t109)) % 0.20/0.50 (step @p40 :rule quant-miniscope-or :args ((= @t107 @t109))) % 0.20/0.50 (step @p41 :rule trans :premises (@p40 @p39)) % 0.20/0.50 (step @p42 :rule symm :premises (@p41)) % 0.20/0.50 (step @p43 :rule cong :premises (@p42) :args ((forall @t8 (or @t100 @t115)))) % 0.20/0.50 (step @p44 :rule trans :premises (@p43 @p36)) % 0.20/0.50 (step @p45 :rule trans :premises (@p44 @p35)) % 0.20/0.50 (step @p46 :rule bool-impl-elim :args (@t99 @t115)) % 0.20/0.50 (step @p47 :rule cong :premises (@p46) :args ((forall @t8 (=> @t99 @t115)))) % 0.20/0.50 (step @p48 :rule trans :premises (@p47 @p45)) % 0.20/0.50 (step @p49 :rule quant-merge-prenex :args ((= (forall @t48 @t116) @t115))) % 0.20/0.50 (step @p50 :rule beta-reduce :args ((= @t118 @t116))) % 0.20/0.50 (step @p51 :rule cong :premises (@p50) :args (@t119)) % 0.20/0.50 (step @p52 :rule trans :premises (@p51 @p49)) % 0.20/0.50 (step @p53 :rule beta-reduce :args ((= (_ @t121 @t117) @t119))) % 0.20/0.50 (step @p54 :rule trans :premises (@p53 @p52)) % 0.20/0.50 (step @p55 :rule refl :args (@t110)) % 0.20/0.50 (step @p56 :rule refl :args (@t122)) % 0.20/0.50 (step @p57 :rule cong :premises (@p56 @p55) :args ((= @t122 @t110))) % 0.20/0.50 (step @p58 :rule symm :premises (@p57)) % 0.20/0.50 (step @p59 :rule eq_resolve :premises (@p56 @p58)) % 0.20/0.50 (step @p60 :rule refl :args (@t113)) % 0.20/0.50 (step @p61 :rule nary_cong :premises (@p60 @p59) :args (@t123)) % 0.20/0.50 (step @p62 :rule cong :premises (@p61) :args ((forall @t42 @t123))) % 0.20/0.50 (step @p63 :rule beta-reduce :args ((= @t129 @t123))) % 0.20/0.50 (step @p64 :rule cong :premises (@p63) :args (@t130)) % 0.20/0.50 (step @p65 :rule trans :premises (@p64 @p62)) % 0.20/0.50 (step @p66 :rule cong :premises (@p65) :args (@t131)) % 0.20/0.50 (step @p67 :rule beta-reduce :args ((= (_ @t133 @t128) @t131))) % 0.20/0.50 (step @p68 :rule trans :premises (@p67 @p66)) % 0.20/0.50 (step @p69 :rule beta-reduce :args ((= (_ @t134 @t1) @t127))) % 0.20/0.50 (step @p70 :rule refl :args (@t1)) % 0.20/0.50 (step @p71 :rule beta-reduce :args ((= (_ (lambda @t136 (or @t126 @t135)) @t2) @t134))) % 0.20/0.50 (step @p72 :rule refl :args (@t2)) % 0.20/0.50 (step @p73 :rule refl :args (@t135)) % 0.20/0.50 (step @p74 :rule beta-reduce :args ((= @t138 @t125))) % 0.20/0.50 (step @p75 :rule cong :premises (@p74) :args (@t139)) % 0.20/0.50 (step @p76 :rule nary_cong :premises (@p75 @p73) :args (@t140)) % 0.20/0.50 (step @p77 :rule cong :premises (@p76) :args (@t141)) % 0.20/0.50 (step @p78 :rule beta-reduce :args ((= (_ @t143 @t137) @t141))) % 0.20/0.50 (step @p79 :rule trans :premises (@p78 @p77)) % 0.20/0.50 (step @p80 :rule beta-reduce :args ((= (_ @t146 @t2) @t137))) % 0.20/0.50 (step @p81 :rule beta-reduce :args ((= @t147 @t146))) % 0.20/0.50 (step @p82 :rule ho_cong :premises (@p81 @p72)) % 0.20/0.50 (step @p83 :rule trans :premises (@p82 @p80)) % 0.20/0.50 (step @p84 :rule refl :args (@t143)) % 0.20/0.50 (step @p85 :rule ho_cong :premises (@p84 @p83)) % 0.20/0.50 (step @p86 :rule trans :premises (@p85 @p79)) % 0.20/0.50 (step @p87 :rule ho_cong :premises (@p86 @p72)) % 0.20/0.50 (step @p88 :rule trans :premises (@p87 @p71)) % 0.20/0.50 (step @p89 :rule ho_cong :premises (@p88 @p70)) % 0.20/0.50 (step @p90 :rule trans :premises (@p89 @p69)) % 0.20/0.50 (step @p91 :rule cong :premises (@p90) :args (@t148)) % 0.20/0.50 (step @p92 :rule refl :args (@t133)) % 0.20/0.50 (step @p93 :rule ho_cong :premises (@p92 @p91)) % 0.20/0.50 (step @p94 :rule trans :premises (@p93 @p68)) % 0.20/0.50 (step @p95 :rule refl :args (@t121)) % 0.20/0.50 (step @p96 :rule ho_cong :premises (@p95 @p94)) % 0.20/0.50 (step @p97 :rule trans :premises (@p96 @p54)) % 0.20/0.50 (step @p98 :rule beta-reduce :args ((= @t149 @t99))) % 0.20/0.50 (step @p99 :rule cong :premises (@p98 @p97) :args (@t150)) % 0.20/0.50 (step @p100 :rule cong :premises (@p99) :args (@t151)) % 0.20/0.50 (step @p101 :rule trans :premises (@p100 @p48)) % 0.20/0.50 (step @p102 :rule cong :premises (@p101) :args ((not @t151))) % 0.20/0.50 (step @p103 :rule refl :args (@t3)) % 0.20/0.50 (step @p104 :rule refl :args (@t144)) % 0.20/0.50 (step @p105 :rule refl :args (@t51)) % 0.20/0.50 (step @p106 :rule cong :premises (@p105 @p104) :args ((= @t51 @t144))) % 0.20/0.50 (step @p107 :rule symm :premises (@p106)) % 0.20/0.50 (step @p108 :rule eq_resolve :premises (@p105 @p107)) % 0.20/0.50 (step @p109 :rule refl :args (@t111)) % 0.20/0.50 (step @p110 :rule refl :args (@t52)) % 0.20/0.50 (step @p111 :rule cong :premises (@p110 @p109) :args ((= @t52 @t111))) % 0.20/0.50 (step @p112 :rule symm :premises (@p111)) % 0.20/0.50 (step @p113 :rule eq_resolve :premises (@p110 @p112)) % 0.20/0.50 (step @p114 :rule cong :premises (@p113) :args (@t53)) % 0.20/0.50 (step @p115 :rule nary_cong :premises (@p114 @p108) :args (@t54)) % 0.20/0.50 (step @p116 :rule cong :premises (@p115) :args (@t56)) % 0.20/0.50 (step @p117 :rule cong :premises (@p116) :args (@t58)) % 0.20/0.50 (step @p118 :rule trans :premises (@p18 @p117)) % 0.20/0.50 (step @p119 :rule ho_cong :premises (@p118 @p103)) % 0.20/0.50 (step @p120 :rule ho_cong :premises (@p119 @p72)) % 0.20/0.50 (step @p121 :rule beta-reduce :args ((= (_ @t153 @t1) @t142))) % 0.20/0.50 (step @p122 :rule beta-reduce :args ((= (_ (lambda @t154 @t152) @t23) @t153))) % 0.20/0.50 (step @p123 :rule refl :args (@t23)) % 0.20/0.50 (step @p124 :rule refl :args (@t24)) % 0.20/0.50 (step @p125 :rule beta-reduce :args ((= @t156 @t20))) % 0.20/0.50 (step @p126 :rule nary_cong :premises (@p125 @p124) :args (@t157)) % 0.20/0.50 (step @p127 :rule cong :premises (@p126) :args (@t158)) % 0.20/0.50 (step @p128 :rule beta-reduce :args ((= (_ @t25 @t155) @t158))) % 0.20/0.50 (step @p129 :rule trans :premises (@p128 @p127)) % 0.20/0.50 (step @p130 :rule beta-reduce :args ((= (_ @t22 @t18) @t155))) % 0.20/0.50 (step @p131 :rule refl :args (@t25)) % 0.20/0.50 (step @p132 :rule ho_cong :premises (@p131 @p130)) % 0.20/0.50 (step @p133 :rule trans :premises (@p132 @p129)) % 0.20/0.50 (step @p134 :rule ho_cong :premises (@p133 @p123)) % 0.20/0.50 (step @p135 :rule trans :premises (@p134 @p122)) % 0.20/0.50 (step @p136 :rule ho_cong :premises (@p135 @p70)) % 0.20/0.50 (step @p137 :rule trans :premises (@p136 @p121)) % 0.20/0.50 (step @p138 :rule refl :args (@t18)) % 0.20/0.50 (step @p139 :rule ho_cong :premises (@p6 @p138)) % 0.20/0.50 (step @p140 :rule ho_cong :premises (@p7 @p139)) % 0.20/0.50 (step @p141 :rule ho_cong :premises (@p140 @p123)) % 0.20/0.50 (step @p142 :rule ho_cong :premises (@p141 @p70)) % 0.20/0.50 (step @p143 :rule trans :premises (@p142 @p137)) % 0.20/0.50 (step @p144 :rule cong :premises (@p143) :args (@t31)) % 0.20/0.50 (step @p145 :rule trans :premises (@p9 @p144)) % 0.20/0.50 (step @p146 :rule ho_cong :premises (@p145 @p120)) % 0.20/0.50 (step @p147 :rule ho_cong :premises (@p146 @p72)) % 0.20/0.50 (step @p148 :rule ho_cong :premises (@p147 @p70)) % 0.20/0.50 (step @p149 :rule cong :premises (@p148) :args (@t6)) % 0.20/0.50 (step @p150 :rule refl :args (@t132)) % 0.20/0.50 (step @p151 :rule refl :args (@t41)) % 0.20/0.50 (step @p152 :rule cong :premises (@p151 @p150) :args ((= @t41 @t132))) % 0.20/0.50 (step @p153 :rule symm :premises (@p152)) % 0.20/0.50 (step @p154 :rule eq_resolve :premises (@p151 @p153)) % 0.20/0.50 (step @p155 :rule cong :premises (@p154) :args (@t43)) % 0.20/0.50 (step @p156 :rule cong :premises (@p155) :args (@t45)) % 0.20/0.50 (step @p157 :rule trans :premises (@p14 @p156)) % 0.20/0.50 (step @p158 :rule ho_cong :premises (@p157 @p149)) % 0.20/0.50 (step @p159 :rule refl :args (@t120)) % 0.20/0.50 (step @p160 :rule refl :args (@t19)) % 0.20/0.50 (step @p161 :rule cong :premises (@p160 @p159) :args ((= @t19 @t120))) % 0.20/0.50 (step @p162 :rule symm :premises (@p161)) % 0.20/0.50 (step @p163 :rule eq_resolve :premises (@p160 @p162)) % 0.20/0.50 (step @p164 :rule cong :premises (@p163) :args (@t88)) % 0.20/0.50 (step @p165 :rule cong :premises (@p164) :args (@t90)) % 0.20/0.50 (step @p166 :rule trans :premises (@p30 @p165)) % 0.20/0.50 (step @p167 :rule ho_cong :premises (@p166 @p158)) % 0.20/0.50 (step @p168 :rule refl :args (@t98)) % 0.20/0.50 (step @p169 :rule refl :args (@t62)) % 0.20/0.50 (step @p170 :rule cong :premises (@p169 @p168) :args ((= @t62 @t98))) % 0.20/0.50 (step @p171 :rule symm :premises (@p170)) % 0.20/0.50 (step @p172 :rule eq_resolve :premises (@p169 @p171)) % 0.20/0.50 (step @p173 :rule cong :premises (@p172) :args (@t64)) % 0.20/0.50 (step @p174 :rule cong :premises (@p173) :args (@t65)) % 0.20/0.50 (step @p175 :rule trans :premises (@p20 @p174)) % 0.20/0.50 (step @p176 :rule ho_cong :premises (@p175 @p103)) % 0.20/0.50 (step @p177 :rule cong :premises (@p176 @p167) :args (@t7)) % 0.20/0.50 (step @p178 :rule cong :premises (@p177) :args (@t9)) % 0.20/0.50 (step @p179 :rule cong :premises (@p178) :args (@t10)) % 0.20/0.50 (step @p180 :rule trans :premises (@p179 @p102)) % 0.20/0.50 (step @p181 :rule eq_resolve :premises (@p2 @p180)) % 0.20/0.50 (step @p182 :rule skolemize :premises (@p181)) % 0.20/0.50 (step @p183 :rule bool-double-not-elim :args (@t161)) % 0.20/0.50 (step @p184 :rule refl :args (@t168)) % 0.20/0.50 (step @p185 :rule nary_cong :premises (@p184 @p183) :args ((or @t168 (not @t167)))) % 0.20/0.50 (step @p186 :rule cnf_or_neg :args (@t168 0)) % 0.20/0.50 (step @p187 :rule eq_resolve :premises (@p186 @p185)) % 0.20/0.50 (step @p188 :rule reordering :premises (@p187) :args ((or @t161 @t168))) % 0.20/0.50 (step @p189 :rule chain_m_resolution :premises (@p188 @p182) :args (@t161 @t169 @t170)) % 0.20/0.50 (step @p190 :rule bool-double-not-elim :args (@t165)) % 0.20/0.50 (step @p191 :rule nary_cong :premises (@p184 @p190) :args ((or @t168 (not @t166)))) % 0.20/0.50 (step @p192 :rule cnf_or_neg :args (@t168 1)) % 0.20/0.50 (step @p193 :rule eq_resolve :premises (@p192 @p191)) % 0.20/0.50 (step @p194 :rule reordering :premises (@p193) :args ((or @t165 @t168))) % 0.20/0.50 (step @p195 :rule chain_m_resolution :premises (@p194 @p182) :args (@t165 @t169 @t170)) % 0.20/0.50 (step @p196 :rule instantiate :premises (@p195) :args (@t171)) % 0.20/0.50 (step @p197 :rule cnf_or_neg :args (@t168 2)) % 0.20/0.50 (step @p198 :rule chain_m_resolution :premises (@p197 @p182) :args ((not @t164) @t169 @t170)) % 0.20/0.50 (step @p199 :rule cnf_or_pos :args (@t174)) % 0.20/0.50 (step @p200 :rule reordering :premises (@p199) :args ((or @t164 @t173 (not @t174)))) % 0.20/0.50 (step @p201 :rule chain_m_resolution :premises (@p200 @p198 @p196) :args (@t173 @t175 (@list @t164 @t174))) % 0.20/0.50 (assume-push @p208 @t161) % 0.20/0.50 (step @p203 :rule instantiate :premises (@p189) :args (@t171)) % 0.20/0.50 (step-pop @p209 :rule scope :premises (@p203)) % 0.20/0.50 (step @p204 :rule process_scope :premises (@p209) :args (@t172)) % 0.20/0.50 (step @p206 :rule implies_elim :premises (@p204)) % 0.20/0.50 (step @p207 false :rule chain_m_resolution :premises (@p206 @p201 @p189) :args (false @t175 (@list @t172 @t161))) % 0.20/0.50 ) % 0.20/0.50 % SZS output end Proof % 0.20/0.50 % cvc5 exiting %------------------------------------------------------------------------------