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