%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : GEG018^1 : TPTP v9.2.1. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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 : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jun 3 08:16:00 AM UTC 2026 % Result : Theorem 0.44s 0.66s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GEG018^1 : TPTP v9.2.1. Released v4.1.0. % 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n019.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Mon Jun 1 23:03:49 EDT 2026 % 0.17/0.34 % CPUTime : % 0.29/0.50 %----Proving TH0 % 0.44/0.66 --- 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.44/0.66 % SZS status Theorem % 0.44/0.66 % SZS output start Proof % 0.44/0.66 ( % 0.44/0.66 (declare-sort tptp.reg 0) % 0.44/0.66 (declare-sort $$unsorted 0) % 0.44/0.66 (declare-sort tptp.mu 0) % 0.44/0.66 (declare-const tptp.c (-> tptp.reg tptp.reg Bool)) % 0.44/0.66 (declare-const tptp.france tptp.reg) % 0.44/0.66 (declare-const tptp.catalunya tptp.reg) % 0.44/0.66 (declare-const tptp.a (-> $$unsorted $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.spain tptp.reg) % 0.44/0.66 (declare-const tptp.fool (-> $$unsorted $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.mfalse (-> $$unsorted Bool)) % 0.44/0.66 (declare-const tptp.paris tptp.reg) % 0.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (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.44/0.66 (define tptp.dc () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "X" tptp.reg))) (lambda (@list _let_2 _let_1) (not (_ (_ tptp.c _let_2) _let_1)))))) % 0.44/0.66 (define tptp.p () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "Z" tptp.reg))) (let ((_let_3 (_ tptp.c _let_2))) (let ((_let_4 (@var "X" tptp.reg))) (lambda (@list _let_4 _let_1) (forall (@list _let_2) (=> (_ _let_3 _let_4) (_ _let_3 _let_1))))))))) % 0.44/0.66 (define tptp.eq () (let ((_let_1 (@var "X" tptp.reg))) (let ((_let_2 (@var "Y" tptp.reg))) (lambda (@list _let_1 _let_2) (and (_ (_ tptp.p _let_1) _let_2) (_ (_ tptp.p _let_2) _let_1)))))) % 0.44/0.66 (define tptp.o () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "Z" tptp.reg))) (let ((_let_3 (_ tptp.p _let_2))) (let ((_let_4 (@var "X" tptp.reg))) (lambda (@list _let_4 _let_1) (exists (@list _let_2) (and (_ _let_3 _let_4) (_ _let_3 _let_1))))))))) % 0.44/0.66 (define tptp.po () (let ((_let_1 (@var "X" tptp.reg))) (let ((_let_2 (@var "Y" tptp.reg))) (lambda (@list _let_1 _let_2) (and (_ (_ tptp.o _let_1) _let_2) (not (_ (_ tptp.p _let_1) _let_2)) (not (_ (_ tptp.p _let_2) _let_1))))))) % 0.44/0.66 (define tptp.ec () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "X" tptp.reg))) (lambda (@list _let_2 _let_1) (and (_ (_ tptp.c _let_2) _let_1) (not (_ (_ tptp.o _let_2) _let_1))))))) % 0.44/0.66 (define tptp.pp () (let ((_let_1 (@var "X" tptp.reg))) (let ((_let_2 (@var "Y" tptp.reg))) (lambda (@list _let_1 _let_2) (and (_ (_ tptp.p _let_1) _let_2) (not (_ (_ tptp.p _let_2) _let_1))))))) % 0.44/0.66 (define tptp.tpp () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "Z" tptp.reg))) (let ((_let_3 (_ tptp.ec _let_2))) (let ((_let_4 (@var "X" tptp.reg))) (lambda (@list _let_4 _let_1) (and (_ (_ tptp.pp _let_4) _let_1) (exists (@list _let_2) (and (_ _let_3 _let_4) (_ _let_3 _let_1)))))))))) % 0.44/0.66 (define tptp.ntpp () (let ((_let_1 (@var "Y" tptp.reg))) (let ((_let_2 (@var "Z" tptp.reg))) (let ((_let_3 (_ tptp.ec _let_2))) (let ((_let_4 (@var "X" tptp.reg))) (lambda (@list _let_4 _let_1) (and (_ (_ tptp.pp _let_4) _let_1) (not (exists (@list _let_2) (and (_ _let_3 _let_4) (_ _let_3 _let_1))))))))))) % 0.44/0.66 (define @t1 () (@var "X" tptp.reg)) % 0.44/0.66 (define @t2 () (_ tptp.c @t1)) % 0.44/0.66 (define @t3 () (_ @t2 @t1)) % 0.44/0.66 (define @t4 () (forall (@list @t1) @t3)) % 0.44/0.66 (define @t5 () (@var "Y" tptp.reg)) % 0.44/0.66 (define @t6 () (_ @t2 @t5)) % 0.44/0.66 (define @t7 () (@list @t1 @t5)) % 0.44/0.66 (define @t8 () (@var "__flatten_var_0" $$unsorted)) % 0.44/0.66 (define @t9 () (@var "A" (-> $$unsorted Bool))) % 0.44/0.66 (define @t10 () (_ tptp.mbox tptp.fool)) % 0.44/0.66 (define @t11 () (_ @t10 @t9)) % 0.44/0.66 (define @t12 () (_ tptp.mimplies @t11)) % 0.44/0.66 (define @t13 () (@list @t9 @t8)) % 0.44/0.66 (define @t14 () (@var "Phi" (-> $$unsorted Bool))) % 0.44/0.66 (define @t15 () (_ tptp.mbox tptp.a)) % 0.44/0.66 (define @t16 () (@list (@var "X" $$unsorted))) % 0.44/0.66 (define @t17 () (@var "Z" tptp.reg)) % 0.44/0.66 (define @t18 () (@list @t5)) % 0.44/0.66 (define @t19 () (forall @t18 (_ (_ tptp.ntpp @t17) @t5))) % 0.44/0.66 (define @t20 () (@list @t17)) % 0.44/0.66 (define @t21 () (exists @t20 @t19)) % 0.44/0.66 (define @t22 () (not @t21)) % 0.44/0.66 (define @t23 () (lambda @t16 @t22)) % 0.44/0.66 (define @t24 () (not (_ tptp.mvalid (_ @t10 @t23)))) % 0.44/0.66 (define @t25 () (@var "Y" tptp.mu)) % 0.44/0.66 (define @t26 () (@var "X" tptp.mu)) % 0.44/0.66 (define @t27 () (@var "W" $$unsorted)) % 0.44/0.66 (define @t28 () (lambda (@list @t26 @t25 @t27) (= @t26 @t25))) % 0.44/0.66 (define @t29 () (@var "Y" (-> $$unsorted Bool))) % 0.44/0.66 (define @t30 () (@var "X" (-> $$unsorted Bool))) % 0.44/0.66 (define @t31 () (lambda (@list @t30 @t29 @t27) (= (_ @t30 @t27) (_ @t29 @t27)))) % 0.44/0.66 (define @t32 () (_ @t14 @t27)) % 0.44/0.66 (define @t33 () (not @t32)) % 0.44/0.66 (define @t34 () (@list @t14 @t27)) % 0.44/0.66 (define @t35 () (lambda @t34 @t33)) % 0.44/0.66 (define @t36 () (@var "Psi" (-> $$unsorted Bool))) % 0.44/0.66 (define @t37 () (lambda (@list @t14 @t36 @t27) (or @t32 (_ @t36 @t27)))) % 0.44/0.66 (define @t38 () (_ tptp.mnot @t36)) % 0.44/0.66 (define @t39 () (_ tptp.mnot @t14)) % 0.44/0.66 (define @t40 () (_ tptp.mor @t39)) % 0.44/0.66 (define @t41 () (@list @t14 @t36 @t8)) % 0.44/0.66 (define @t42 () (lambda @t41 (_ (_ tptp.mnot (_ @t40 @t38)) @t8))) % 0.44/0.66 (define @t43 () (lambda @t41 (_ (_ @t40 @t36) @t8))) % 0.44/0.66 (define @t44 () (lambda @t41 (_ (_ (_ tptp.mor @t38) @t14) @t8))) % 0.44/0.66 (define @t45 () (lambda @t41 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t14) @t36)) (_ (_ tptp.mimplies @t36) @t14)) @t8))) % 0.44/0.66 (define @t46 () (lambda @t41 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t14) @t36)) @t8))) % 0.44/0.66 (define @t47 () (@var "Phi" (-> tptp.mu $$unsorted Bool))) % 0.44/0.66 (define @t48 () (_ @t47 @t26)) % 0.44/0.66 (define @t49 () (lambda (@list @t47 @t27) (forall (@list @t26) (_ @t48 @t27)))) % 0.44/0.66 (define @t50 () (@var "P" (-> $$unsorted Bool))) % 0.44/0.66 (define @t51 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool))) % 0.44/0.66 (define @t52 () (_ @t51 @t50)) % 0.44/0.66 (define @t53 () (lambda (@list @t51 @t27) (forall (@list @t50) (_ @t52 @t27)))) % 0.44/0.66 (define @t54 () (lambda (@list @t47 @t8) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list @t26 @t8) (_ (_ tptp.mnot @t48) @t8)))) @t8))) % 0.44/0.66 (define @t55 () (lambda (@list @t51 @t8) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t50 @t8) (_ (_ tptp.mnot @t52) @t8)))) @t8))) % 0.44/0.66 (define @t56 () (@list @t27)) % 0.44/0.66 (define @t57 () (lambda @t56 true)) % 0.44/0.66 (define @t58 () (@var "V" $$unsorted)) % 0.44/0.66 (define @t59 () (_ @t14 @t58)) % 0.44/0.66 (define @t60 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.44/0.66 (define @t61 () (_ (_ @t60 @t27) @t58)) % 0.44/0.66 (define @t62 () (not @t61)) % 0.44/0.66 (define @t63 () (or @t62 @t59)) % 0.44/0.66 (define @t64 () (@list @t58)) % 0.44/0.66 (define @t65 () (forall @t64 @t63)) % 0.44/0.66 (define @t66 () (@list @t60 @t14 @t27)) % 0.44/0.66 (define @t67 () (lambda @t66 @t65)) % 0.44/0.66 (define @t68 () (lambda (@list @t60 @t14 @t8) (_ (_ tptp.mnot (_ (_ tptp.mbox @t60) @t39)) @t8))) % 0.44/0.66 (define @t69 () (@var "S" $$unsorted)) % 0.44/0.66 (define @t70 () (_ @t60 @t69)) % 0.44/0.66 (define @t71 () (@list @t69)) % 0.44/0.66 (define @t72 () (@list @t60)) % 0.44/0.66 (define @t73 () (lambda @t72 (forall @t71 (_ @t70 @t69)))) % 0.44/0.66 (define @t74 () (@var "T" $$unsorted)) % 0.44/0.66 (define @t75 () (_ @t60 @t74)) % 0.44/0.66 (define @t76 () (_ @t70 @t74)) % 0.44/0.66 (define @t77 () (lambda @t72 (forall (@list @t69 @t74) (=> @t76 (_ @t75 @t69))))) % 0.44/0.66 (define @t78 () (@list @t74)) % 0.44/0.66 (define @t79 () (lambda @t72 (forall @t71 (exists @t78 @t76)))) % 0.44/0.66 (define @t80 () (@var "U" $$unsorted)) % 0.44/0.66 (define @t81 () (_ @t70 @t80)) % 0.44/0.66 (define @t82 () (_ @t75 @t80)) % 0.44/0.66 (define @t83 () (@list @t69 @t74 @t80)) % 0.44/0.66 (define @t84 () (lambda @t72 (forall @t83 (=> (and @t76 @t82) @t81)))) % 0.44/0.66 (define @t85 () (and @t76 @t81)) % 0.44/0.66 (define @t86 () (lambda @t72 (forall @t83 (=> @t85 @t82)))) % 0.44/0.66 (define @t87 () (= @t74 @t80)) % 0.44/0.66 (define @t88 () (lambda @t72 (forall @t83 (=> @t85 @t87)))) % 0.44/0.66 (define @t89 () (@list @t80)) % 0.44/0.66 (define @t90 () (lambda @t72 (forall @t71 (exists @t78 (and @t76 (forall @t89 (=> @t81 @t87))))))) % 0.44/0.66 (define @t91 () (_ @t60 @t80)) % 0.44/0.66 (define @t92 () (_ @t91 @t74)) % 0.44/0.66 (define @t93 () (lambda @t72 (forall @t83 (=> @t76 (exists @t89 (and @t81 @t92)))))) % 0.44/0.66 (define @t94 () (lambda @t72 (forall @t83 (=> @t85 (or @t82 @t87 @t92))))) % 0.44/0.66 (define @t95 () (lambda @t72 (forall @t83 (=> @t85 (exists @t64 (and (_ @t75 @t58) (_ @t91 @t58))))))) % 0.44/0.66 (define @t96 () (forall @t56 @t32)) % 0.44/0.66 (define @t97 () (@list @t14)) % 0.44/0.66 (define @t98 () (lambda @t97 @t96)) % 0.44/0.66 (define @t99 () (lambda @t97 (forall @t56 @t33))) % 0.44/0.66 (define @t100 () (lambda @t97 (exists @t56 @t32))) % 0.44/0.66 (define @t101 () (lambda @t97 (exists @t56 @t33))) % 0.44/0.66 (define @t102 () (lambda @t7 (not @t6))) % 0.44/0.66 (define @t103 () (_ tptp.c @t17)) % 0.44/0.66 (define @t104 () (_ @t103 @t5)) % 0.44/0.66 (define @t105 () (_ @t103 @t1)) % 0.44/0.66 (define @t106 () (forall @t20 (=> @t105 @t104))) % 0.44/0.66 (define @t107 () (lambda @t7 @t106)) % 0.44/0.66 (define @t108 () (_ (_ tptp.p @t5) @t1)) % 0.44/0.66 (define @t109 () (_ (_ tptp.p @t1) @t5)) % 0.44/0.66 (define @t110 () (lambda @t7 (and @t109 @t108))) % 0.44/0.66 (define @t111 () (_ tptp.p @t17)) % 0.44/0.66 (define @t112 () (and (_ @t111 @t1) (_ @t111 @t5))) % 0.44/0.66 (define @t113 () (exists @t20 @t112)) % 0.44/0.66 (define @t114 () (lambda @t7 @t113)) % 0.44/0.66 (define @t115 () (not @t108)) % 0.44/0.66 (define @t116 () (_ (_ tptp.o @t1) @t5)) % 0.44/0.66 (define @t117 () (lambda @t7 (and @t116 (not @t109) @t115))) % 0.44/0.66 (define @t118 () (not @t116)) % 0.44/0.66 (define @t119 () (and @t6 @t118)) % 0.44/0.66 (define @t120 () (lambda @t7 @t119)) % 0.44/0.66 (define @t121 () (and @t109 @t115)) % 0.44/0.66 (define @t122 () (lambda @t7 @t121)) % 0.44/0.66 (define @t123 () (_ tptp.ec @t17)) % 0.44/0.66 (define @t124 () (and (_ @t123 @t1) (_ @t123 @t5))) % 0.44/0.66 (define @t125 () (exists @t20 @t124)) % 0.44/0.66 (define @t126 () (_ (_ tptp.pp @t1) @t5)) % 0.44/0.66 (define @t127 () (lambda @t7 (and @t126 @t125))) % 0.44/0.66 (define @t128 () (not @t125)) % 0.44/0.66 (define @t129 () (and @t126 @t128)) % 0.44/0.66 (define @t130 () (lambda @t7 @t129)) % 0.44/0.66 (define @t131 () (tptp.c @t1 @t1)) % 0.44/0.66 (define @t132 () (@var "BOUND_VARIABLE_9094" tptp.reg)) % 0.44/0.66 (define @t133 () (tptp.c @t132 @t17)) % 0.44/0.66 (define @t134 () (@var "BOUND_VARIABLE_9177" tptp.reg)) % 0.44/0.66 (define @t135 () (not (tptp.c @t132 @t134))) % 0.44/0.66 (define @t136 () (@list @t132)) % 0.44/0.66 (define @t137 () (@list @t134)) % 0.44/0.66 (define @t138 () (forall @t137 (not (forall @t136 (or @t135 @t133))))) % 0.44/0.66 (define @t139 () (not @t138)) % 0.44/0.66 (define @t140 () (@var "BOUND_VARIABLE_9170" tptp.reg)) % 0.44/0.66 (define @t141 () (@var "BOUND_VARIABLE_9103" tptp.reg)) % 0.44/0.66 (define @t142 () (tptp.c @t141 @t140)) % 0.44/0.66 (define @t143 () (not (tptp.c @t141 @t17))) % 0.44/0.66 (define @t144 () (or @t143 @t142)) % 0.44/0.66 (define @t145 () (@list @t140 @t141)) % 0.44/0.66 (define @t146 () (forall @t145 @t144)) % 0.44/0.66 (define @t147 () (not @t146)) % 0.44/0.66 (define @t148 () (@var "BOUND_VARIABLE_9155" tptp.reg)) % 0.44/0.66 (define @t149 () (@var "BOUND_VARIABLE_8327" tptp.reg)) % 0.44/0.66 (define @t150 () (@var "BOUND_VARIABLE_8440" tptp.reg)) % 0.44/0.66 (define @t151 () (not (tptp.c @t149 @t150))) % 0.44/0.66 (define @t152 () (@list @t149)) % 0.44/0.66 (define @t153 () (@var "BOUND_VARIABLE_9111" tptp.reg)) % 0.44/0.66 (define @t154 () (not (forall @t152 (or @t151 (tptp.c @t149 @t153))))) % 0.44/0.66 (define @t155 () (@list @t150)) % 0.44/0.66 (define @t156 () (not (forall @t155 (or @t154 (not (forall @t152 (or @t151 (tptp.c @t149 @t148)))))))) % 0.44/0.66 (define @t157 () (not (tptp.c @t153 @t148))) % 0.44/0.66 (define @t158 () (tptp.c @t149 @t17)) % 0.44/0.66 (define @t159 () (not (forall @t152 (or @t151 @t158)))) % 0.44/0.66 (define @t160 () (not (forall @t155 (or @t154 @t159)))) % 0.44/0.66 (define @t161 () (not (tptp.c @t153 @t17))) % 0.44/0.66 (define @t162 () (or @t161 @t160 @t157 @t156)) % 0.44/0.66 (define @t163 () (@list @t148 @t153)) % 0.44/0.66 (define @t164 () (forall @t163 @t162)) % 0.44/0.66 (define @t165 () (not @t164)) % 0.44/0.66 (define @t166 () (or @t165 @t147 @t139)) % 0.44/0.66 (define @t167 () (forall @t20 @t166)) % 0.44/0.66 (define @t168 () (@quantifiers_skolemize @t167 0)) % 0.44/0.66 (define @t169 () (not (tptp.fool @t27 @t58))) % 0.44/0.66 (define @t170 () (forall @t64 @t169)) % 0.44/0.66 (define @t171 () (forall @t56 @t170)) % 0.44/0.66 (define @t172 () (or @t167 @t171)) % 0.44/0.66 (define @t173 () (or @t167 @t170)) % 0.44/0.66 (define @t174 () (lambda @t56 @t173)) % 0.44/0.66 (define @t175 () (_ @t174 @t27)) % 0.44/0.66 (define @t176 () (forall @t56 @t175)) % 0.44/0.66 (define @t177 () (_ @t14 @t27)) % 0.44/0.66 (define @t178 () (lambda @t97 (forall @t56 @t177))) % 0.44/0.66 (define @t179 () (or @t167 @t169)) % 0.44/0.66 (define @t180 () (or @t169 @t167)) % 0.44/0.66 (define @t181 () (lambda @t16 @t167)) % 0.44/0.66 (define @t182 () (_ @t181 @t58)) % 0.44/0.66 (define @t183 () (or @t169 @t182)) % 0.44/0.66 (define @t184 () (forall @t64 @t183)) % 0.44/0.66 (define @t185 () (lambda @t56 @t184)) % 0.44/0.66 (define @t186 () (_ @t14 @t58)) % 0.44/0.66 (define @t187 () (lambda @t34 (forall @t64 (or @t169 @t186)))) % 0.44/0.66 (define @t188 () (and @t164 @t146 @t138)) % 0.44/0.66 (define @t189 () (forall @t20 (not @t188))) % 0.44/0.66 (define @t190 () (not @t189)) % 0.44/0.66 (define @t191 () (@list @t141)) % 0.44/0.66 (define @t192 () (forall (@list @t140) (forall @t191 @t144))) % 0.44/0.66 (define @t193 () (@list @t153)) % 0.44/0.66 (define @t194 () (forall (@list @t148) (forall @t193 @t162))) % 0.44/0.66 (define @t195 () (not (tptp.c @t132 @t5))) % 0.44/0.66 (define @t196 () (not (forall @t136 (or @t195 @t133)))) % 0.44/0.66 (define @t197 () (forall @t18 @t196)) % 0.44/0.66 (define @t198 () (@list @t5)) % 0.44/0.66 (define @t199 () (tptp.c @t141 @t5)) % 0.44/0.66 (define @t200 () (forall @t191 (or @t143 @t199))) % 0.44/0.66 (define @t201 () (forall @t18 @t200)) % 0.44/0.66 (define @t202 () (tptp.c @t149 @t5)) % 0.44/0.66 (define @t203 () (not (forall @t152 (or @t151 @t202)))) % 0.44/0.66 (define @t204 () (not (forall @t155 (or @t154 @t203)))) % 0.44/0.66 (define @t205 () (not (tptp.c @t153 @t5))) % 0.44/0.66 (define @t206 () (forall @t193 (or @t161 @t160 @t205 @t204))) % 0.44/0.66 (define @t207 () (forall @t18 @t206)) % 0.44/0.66 (define @t208 () (and @t207 @t201 @t197)) % 0.44/0.66 (define @t209 () (and @t206 @t200 @t196)) % 0.44/0.66 (define @t210 () (lambda @t18 @t209)) % 0.44/0.66 (define @t211 () (tptp.c @t149 @t1)) % 0.44/0.66 (define @t212 () (not (forall @t152 (or @t151 @t211)))) % 0.44/0.66 (define @t213 () (tptp.c @t17 @t1)) % 0.44/0.66 (define @t214 () (tptp.c @t17 @t5)) % 0.44/0.66 (define @t215 () (not @t214)) % 0.44/0.66 (define @t216 () (forall @t20 (or @t215 @t213))) % 0.44/0.66 (define @t217 () (@list @t17)) % 0.44/0.66 (define @t218 () (not @t216)) % 0.44/0.66 (define @t219 () (not @t213)) % 0.44/0.66 (define @t220 () (forall @t20 (or @t219 @t214))) % 0.44/0.66 (define @t221 () (forall @t155 (or @t159 @t203))) % 0.44/0.66 (define @t222 () (not @t221)) % 0.44/0.66 (define @t223 () (forall @t155 (or @t159 @t212))) % 0.44/0.66 (define @t224 () (not @t223)) % 0.44/0.66 (define @t225 () (forall @t20 (or @t219 @t224 @t215 @t222))) % 0.44/0.66 (define @t226 () (and @t225 @t220 @t218)) % 0.44/0.66 (define @t227 () (lambda @t7 @t226)) % 0.44/0.66 (define @t228 () (forall @t18 (_ (_ @t227 @t17) @t5))) % 0.44/0.66 (define @t229 () (exists @t20 @t228)) % 0.44/0.66 (define @t230 () (not @t229)) % 0.44/0.66 (define @t231 () (lambda @t16 @t230)) % 0.44/0.66 (define @t232 () (_ @t60 @t27 @t58)) % 0.44/0.66 (define @t233 () (_ (lambda @t66 (forall @t64 (or (not @t232) @t186))) tptp.fool)) % 0.44/0.66 (define @t234 () (and @t220 @t218)) % 0.44/0.66 (define @t235 () (not @t104)) % 0.44/0.66 (define @t236 () (not @t105)) % 0.44/0.66 (define @t237 () (or @t236 @t224 @t235 @t222)) % 0.44/0.66 (define @t238 () (and @t104 @t221)) % 0.44/0.66 (define @t239 () (and @t105 @t223 @t104 @t221)) % 0.44/0.66 (define @t240 () (forall @t20 (not @t239))) % 0.44/0.66 (define @t241 () (not @t240)) % 0.44/0.66 (define @t242 () (and @t105 @t223)) % 0.44/0.66 (define @t243 () (lambda @t18 @t238)) % 0.44/0.66 (define @t244 () (not @t158)) % 0.44/0.66 (define @t245 () (forall @t152 (or @t244 @t202))) % 0.44/0.66 (define @t246 () (forall @t152 (or @t244 @t211))) % 0.44/0.66 (define @t247 () (forall @t20 (or (not @t246) (not @t245)))) % 0.44/0.66 (define @t248 () (and @t6 @t247)) % 0.44/0.66 (define @t249 () (lambda @t7 @t248)) % 0.44/0.66 (define @t250 () (_ @t249 @t17)) % 0.44/0.66 (define @t251 () (and (_ @t250 @t1) (_ @t250 @t5))) % 0.44/0.66 (define @t252 () (exists @t20 @t251)) % 0.44/0.66 (define @t253 () (not @t252)) % 0.44/0.66 (define @t254 () (lambda @t18 @t234)) % 0.44/0.66 (define @t255 () (_ (lambda @t7 @t234) @t1)) % 0.44/0.66 (define @t256 () (not @t247)) % 0.44/0.66 (define @t257 () (lambda @t18 @t256)) % 0.44/0.66 (define @t258 () (_ (lambda @t7 @t256) @t1)) % 0.44/0.66 (define @t259 () (not (_ @t258 @t5))) % 0.44/0.66 (define @t260 () (and @t246 @t245)) % 0.44/0.66 (define @t261 () (forall @t20 (not @t260))) % 0.44/0.66 (define @t262 () (not @t261)) % 0.44/0.66 (define @t263 () (lambda @t18 @t245)) % 0.44/0.66 (define @t264 () (lambda @t7 @t220)) % 0.44/0.66 (define @t265 () (_ @t264 @t17)) % 0.44/0.66 (define @t266 () (and (_ @t265 @t1) (_ @t265 @t5))) % 0.44/0.66 (define @t267 () (or @t236 @t104)) % 0.44/0.66 (define @t268 () (@var "BOUND_VARIABLE_8289" tptp.reg)) % 0.44/0.66 (define @t269 () (tptp.c @t17 @t268)) % 0.44/0.66 (define @t270 () (lambda (@list @t268) (forall @t20 (or @t215 @t269)))) % 0.44/0.66 (define @t271 () (not (_ (_ @t264 @t5) @t1))) % 0.44/0.66 (define @t272 () (lambda @t18 @t220)) % 0.44/0.66 (define @t273 () (_ @t264 @t1)) % 0.44/0.66 (define @t274 () (forall @t137 (not (forall @t136 (or @t135 (tptp.c @t132 @t168)))))) % 0.44/0.66 (define @t275 () (not @t274)) % 0.44/0.66 (define @t276 () (not (forall @t152 (or @t151 (tptp.c @t149 @t168))))) % 0.44/0.66 (define @t277 () (forall @t163 (or (not (tptp.c @t153 @t168)) (not (forall @t155 (or @t154 @t276))) @t157 @t156))) % 0.44/0.66 (define @t278 () (not @t277)) % 0.44/0.66 (define @t279 () (or @t278 (not (forall @t145 (or (not (tptp.c @t141 @t168)) @t142))) @t275)) % 0.44/0.66 (define @t280 () (@list true)) % 0.44/0.66 (define @t281 () (@list @t279)) % 0.44/0.66 (define @t282 () (forall @t155 @t276)) % 0.44/0.66 (define @t283 () (@list false)) % 0.44/0.66 (define @t284 () (or @t276 @t276)) % 0.44/0.66 (define @t285 () (forall @t155 @t284)) % 0.44/0.66 (define @t286 () (not @t285)) % 0.44/0.66 (define @t287 () (tptp.c @t168 @t168)) % 0.44/0.66 (define @t288 () (not @t287)) % 0.44/0.66 (define @t289 () (or @t288 @t286 @t288 @t286)) % 0.44/0.66 (define @t290 () (not @t282)) % 0.44/0.66 (define @t291 () (or @t288 @t290 @t288 @t290)) % 0.44/0.66 (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue))) % 0.44/0.66 (assume @p2 @t4) % 0.44/0.66 (assume @p3 (forall @t7 (=> @t6 (_ (_ tptp.c @t5) @t1)))) % 0.44/0.66 (assume @p4 (_ tptp.mvalid (_ tptp.mforall_prop (lambda @t13 (_ (_ @t12 @t9) @t8))))) % 0.44/0.66 (assume @p5 (_ tptp.mvalid (_ tptp.mforall_prop (lambda @t13 (_ (_ @t12 (_ @t10 @t11)) @t8))))) % 0.44/0.66 (assume @p6 (_ tptp.mvalid (_ tptp.mforall_prop (lambda (@list @t14 @t8) (_ (_ (_ tptp.mimplies (_ @t10 @t14)) (_ @t15 @t14)) @t8))))) % 0.44/0.66 (assume @p7 (_ tptp.mvalid (_ @t15 (lambda @t16 (_ (_ tptp.tpp tptp.catalunya) tptp.spain))))) % 0.44/0.66 (assume @p8 (_ tptp.mvalid (_ @t10 (lambda @t16 (_ (_ tptp.ec tptp.spain) tptp.france))))) % 0.44/0.66 (assume @p9 (_ tptp.mvalid (_ @t15 (lambda @t16 (_ (_ tptp.ntpp tptp.paris) tptp.france))))) % 0.44/0.66 (assume @p10 @t24) % 0.44/0.66 (assume @p11 true) % 0.44/0.66 (step @p12 (= tptp.meq_ind @t28) :rule refl :args (@t28)) % 0.44/0.66 (step @p13 (= tptp.meq_prop @t31) :rule refl :args (@t31)) % 0.44/0.66 (step @p14 (= tptp.mnot @t35) :rule refl :args (@t35)) % 0.44/0.66 (step @p15 (= tptp.mor @t37) :rule refl :args (@t37)) % 0.44/0.66 (step @p16 (= tptp.mand @t42) :rule refl :args (@t42)) % 0.44/0.66 (step @p17 (= tptp.mimplies @t43) :rule refl :args (@t43)) % 0.44/0.66 (step @p18 (= tptp.mimplied @t44) :rule refl :args (@t44)) % 0.44/0.66 (step @p19 (= tptp.mequiv @t45) :rule refl :args (@t45)) % 0.44/0.66 (step @p20 (= tptp.mxor @t46) :rule refl :args (@t46)) % 0.44/0.66 (step @p21 (= tptp.mforall_ind @t49) :rule refl :args (@t49)) % 0.44/0.66 (step @p22 (= tptp.mforall_prop @t53) :rule refl :args (@t53)) % 0.44/0.66 (step @p23 (= tptp.mexists_ind @t54) :rule refl :args (@t54)) % 0.44/0.66 (step @p24 (= tptp.mexists_prop @t55) :rule refl :args (@t55)) % 0.44/0.66 (step @p25 (= tptp.mtrue @t57) :rule refl :args (@t57)) % 0.44/0.66 (step @p26 (= tptp.mbox @t67) :rule refl :args (@t67)) % 0.44/0.66 (step @p27 (= tptp.mdia @t68) :rule refl :args (@t68)) % 0.44/0.66 (step @p28 (= tptp.mreflexive @t73) :rule refl :args (@t73)) % 0.44/0.66 (step @p29 (= tptp.msymmetric @t77) :rule refl :args (@t77)) % 0.44/0.66 (step @p30 (= tptp.mserial @t79) :rule refl :args (@t79)) % 0.44/0.66 (step @p31 (= tptp.mtransitive @t84) :rule refl :args (@t84)) % 0.44/0.66 (step @p32 (= tptp.meuclidean @t86) :rule refl :args (@t86)) % 0.44/0.66 (step @p33 (= tptp.mpartially_functional @t88) :rule refl :args (@t88)) % 0.44/0.66 (step @p34 (= tptp.mfunctional @t90) :rule refl :args (@t90)) % 0.44/0.66 (step @p35 (= tptp.mweakly_dense @t93) :rule refl :args (@t93)) % 0.44/0.66 (step @p36 (= tptp.mweakly_connected @t94) :rule refl :args (@t94)) % 0.44/0.66 (step @p37 (= tptp.mweakly_directed @t95) :rule refl :args (@t95)) % 0.44/0.66 (step @p38 (= tptp.mvalid @t98) :rule refl :args (@t98)) % 0.44/0.66 (step @p39 (= tptp.minvalid @t99) :rule refl :args (@t99)) % 0.44/0.66 (step @p40 (= tptp.msatisfiable @t100) :rule refl :args (@t100)) % 0.44/0.66 (step @p41 (= tptp.mcountersatisfiable @t101) :rule refl :args (@t101)) % 0.44/0.66 (step @p42 (= tptp.dc @t102) :rule refl :args (@t102)) % 0.44/0.66 (step @p43 (= tptp.p @t107) :rule refl :args (@t107)) % 0.44/0.66 (step @p44 (= tptp.eq @t110) :rule refl :args (@t110)) % 0.44/0.66 (step @p45 (= tptp.o @t114) :rule refl :args (@t114)) % 0.44/0.66 (step @p46 (= tptp.po @t117) :rule refl :args (@t117)) % 0.44/0.66 (step @p47 (= tptp.ec @t120) :rule refl :args (@t120)) % 0.44/0.66 (step @p48 (= tptp.pp @t122) :rule refl :args (@t122)) % 0.44/0.66 (step @p49 (= tptp.tpp @t127) :rule refl :args (@t127)) % 0.44/0.66 (step @p50 (= tptp.ntpp @t130) :rule refl :args (@t130)) % 0.44/0.66 (step @p51 :rule refl :args (@t131)) % 0.44/0.66 (step @p52 :rule refl :args (@t3)) % 0.44/0.66 (step @p53 :rule cong :premises (@p52 @p51) :args ((= @t3 @t131))) % 0.44/0.66 (step @p54 :rule symm :premises (@p53)) % 0.44/0.66 (step @p55 :rule eq_resolve :premises (@p52 @p54)) % 0.44/0.66 (step @p56 :rule cong :premises (@p55) :args (@t4)) % 0.44/0.66 (step @p57 :rule eq_resolve :premises (@p2 @p56)) % 0.44/0.66 (step @p58 :rule instantiate :premises (@p57) :args ((@list @t168))) % 0.44/0.66 (step @p59 :rule quant-merge-prenex :args ((= @t171 (forall (@list @t27 @t58) @t169)))) % 0.44/0.66 (step @p60 :rule refl :args (@t167)) % 0.44/0.66 (step @p61 :rule nary_cong :premises (@p60 @p59) :args (@t172)) % 0.44/0.66 (step @p62 :rule quant-miniscope-or :args ((= (forall @t56 @t173) @t172))) % 0.44/0.66 (step @p63 :rule trans :premises (@p62 @p61)) % 0.44/0.66 (step @p64 :rule beta-reduce :args ((= @t175 @t173))) % 0.44/0.66 (step @p65 :rule cong :premises (@p64) :args (@t176)) % 0.44/0.66 (step @p66 :rule trans :premises (@p65 @p63)) % 0.44/0.66 (step @p67 :rule beta-reduce :args ((= (_ @t178 @t174) @t176))) % 0.44/0.66 (step @p68 :rule trans :premises (@p67 @p66)) % 0.44/0.66 (step @p69 :rule quant-miniscope-or :args ((= (forall @t64 @t179) @t173))) % 0.44/0.66 (step @p70 :rule aci_norm :args ((= @t180 @t179))) % 0.44/0.66 (step @p71 :rule cong :premises (@p70) :args ((forall @t64 @t180))) % 0.44/0.66 (step @p72 :rule trans :premises (@p71 @p69)) % 0.44/0.66 (step @p73 :rule beta-reduce :args ((= @t182 @t167))) % 0.44/0.66 (step @p74 :rule refl :args (@t169)) % 0.44/0.66 (step @p75 :rule nary_cong :premises (@p74 @p73) :args (@t183)) % 0.44/0.66 (step @p76 :rule cong :premises (@p75) :args (@t184)) % 0.44/0.66 (step @p77 :rule trans :premises (@p76 @p72)) % 0.44/0.66 (step @p78 :rule cong :premises (@p77) :args (@t185)) % 0.44/0.66 (step @p79 :rule beta-reduce :args ((= (_ @t187 @t181) @t185))) % 0.44/0.66 (step @p80 :rule trans :premises (@p79 @p78)) % 0.44/0.66 (step @p81 :rule bool-double-not-elim :args (@t167)) % 0.44/0.66 (step @p82 :rule aci_norm :args ((= (or @t165 (or @t147 @t139)) @t166))) % 0.44/0.66 (step @p83 :rule bool-and-de-morgan :args (@t146 @t138 true)) % 0.44/0.66 (step @p84 :rule refl :args (@t165)) % 0.44/0.66 (step @p85 :rule nary_cong :premises (@p84 @p83) :args ((or @t165 (not (and @t146 @t138))))) % 0.44/0.66 (step @p86 :rule bool-and-de-morgan :args (@t164 @t146 (and @t138))) % 0.44/0.66 (step @p87 :rule trans :premises (@p86 @p85)) % 0.44/0.66 (step @p88 :rule trans :premises (@p87 @p82)) % 0.44/0.66 (step @p89 :rule cong :premises (@p88) :args (@t189)) % 0.44/0.66 (step @p90 :rule cong :premises (@p89) :args (@t190)) % 0.44/0.66 (step @p91 :rule exists-elim :args ((= (exists @t20 @t188) @t190))) % 0.44/0.66 (step @p92 :rule trans :premises (@p91 @p90)) % 0.44/0.66 (step @p93 :rule refl :args (@t138)) % 0.44/0.66 (step @p94 :rule quant-merge-prenex :args ((= @t192 @t146))) % 0.44/0.66 (step @p95 :rule quant-merge-prenex :args ((= @t194 @t164))) % 0.44/0.66 (step @p96 :rule nary_cong :premises (@p95 @p94 @p93) :args ((and @t194 @t192 @t138))) % 0.44/0.66 (step @p97 :rule alpha_equiv :args (@t197 @t198 (@list @t134))) % 0.44/0.66 (step @p98 :rule alpha_equiv :args (@t201 @t198 (@list @t140))) % 0.44/0.66 (step @p99 :rule alpha_equiv :args (@t207 @t198 (@list @t148))) % 0.44/0.66 (step @p100 :rule nary_cong :premises (@p99 @p98 @p97) :args (@t208)) % 0.44/0.66 (step @p101 :rule quant-miniscope-and :args ((= (forall @t18 @t209) @t208))) % 0.44/0.66 (step @p102 :rule trans :premises (@p101 @p100)) % 0.44/0.66 (step @p103 :rule trans :premises (@p102 @p96)) % 0.44/0.66 (step @p104 :rule beta-reduce :args ((= (_ @t210 @t5) @t209))) % 0.44/0.66 (step @p105 :rule refl :args (@t5)) % 0.44/0.66 (step @p106 :rule beta-reduce :args ((= (_ (lambda @t7 (and (forall @t193 (or (not (tptp.c @t153 @t1)) (not (forall @t155 (or @t154 @t212))) @t205 @t204)) (forall @t191 (or (not (tptp.c @t141 @t1)) @t199)) (not (forall @t136 (or @t195 (tptp.c @t132 @t1)))))) @t17) @t210))) % 0.44/0.66 (step @p107 :rule refl :args (@t17)) % 0.44/0.66 (step @p108 :rule alpha_equiv :args (@t216 @t217 (@list @t132))) % 0.44/0.66 (step @p109 :rule cong :premises (@p108) :args (@t218)) % 0.44/0.66 (step @p110 :rule alpha_equiv :args (@t220 @t217 (@list @t141))) % 0.44/0.66 (step @p111 :rule alpha_equiv :args (@t225 @t217 (@list @t153))) % 0.44/0.66 (step @p112 :rule nary_cong :premises (@p111 @p110 @p109) :args (@t226)) % 0.44/0.66 (step @p113 :rule cong :premises (@p112) :args (@t227)) % 0.44/0.66 (step @p114 :rule ho_cong :premises (@p113 @p107)) % 0.44/0.66 (step @p115 :rule trans :premises (@p114 @p106)) % 0.44/0.66 (step @p116 :rule ho_cong :premises (@p115 @p105)) % 0.44/0.66 (step @p117 :rule trans :premises (@p116 @p104)) % 0.44/0.66 (step @p118 :rule cong :premises (@p117) :args (@t228)) % 0.44/0.66 (step @p119 :rule trans :premises (@p118 @p103)) % 0.44/0.66 (step @p120 :rule cong :premises (@p119) :args (@t229)) % 0.44/0.66 (step @p121 :rule trans :premises (@p120 @p92)) % 0.44/0.66 (step @p122 :rule cong :premises (@p121) :args (@t230)) % 0.44/0.66 (step @p123 :rule trans :premises (@p122 @p81)) % 0.44/0.66 (step @p124 :rule cong :premises (@p123) :args (@t231)) % 0.44/0.66 (step @p125 :rule beta-reduce :args ((= @t233 @t187))) % 0.44/0.66 (step @p126 :rule ho_cong :premises (@p125 @p124)) % 0.44/0.66 (step @p127 :rule trans :premises (@p126 @p80)) % 0.44/0.66 (step @p128 :rule refl :args (@t178)) % 0.44/0.66 (step @p129 :rule ho_cong :premises (@p128 @p127)) % 0.44/0.66 (step @p130 :rule trans :premises (@p129 @p68)) % 0.44/0.66 (step @p131 :rule cong :premises (@p130) :args ((not (_ @t178 (_ @t233 @t231))))) % 0.44/0.66 (step @p132 :rule refl :args (@t17)) % 0.44/0.66 (step @p133 :rule aci_norm :args ((= (and @t234 @t225) @t226))) % 0.44/0.66 (step @p134 :rule bool-double-not-elim :args (@t225)) % 0.44/0.66 (step @p135 :rule refl :args (@t222)) % 0.44/0.66 (step @p136 :rule refl :args (@t214)) % 0.44/0.66 (step @p137 :rule refl :args (@t104)) % 0.44/0.66 (step @p138 :rule cong :premises (@p137 @p136) :args ((= @t104 @t214))) % 0.44/0.66 (step @p139 :rule symm :premises (@p138)) % 0.44/0.66 (step @p140 :rule eq_resolve :premises (@p137 @p139)) % 0.44/0.66 (step @p141 :rule cong :premises (@p140) :args (@t235)) % 0.44/0.66 (step @p142 :rule refl :args (@t224)) % 0.44/0.66 (step @p143 :rule refl :args (@t213)) % 0.44/0.66 (step @p144 :rule refl :args (@t105)) % 0.44/0.66 (step @p145 :rule cong :premises (@p144 @p143) :args ((= @t105 @t213))) % 0.44/0.66 (step @p146 :rule symm :premises (@p145)) % 0.44/0.66 (step @p147 :rule eq_resolve :premises (@p144 @p146)) % 0.44/0.66 (step @p148 :rule cong :premises (@p147) :args (@t236)) % 0.44/0.66 (step @p149 :rule nary_cong :premises (@p148 @p142 @p141 @p135) :args (@t237)) % 0.44/0.66 (step @p150 :rule cong :premises (@p149) :args ((forall @t20 @t237))) % 0.44/0.66 (step @p151 :rule aci_norm :args ((= (or @t236 (or @t224 (or @t235 @t222))) @t237))) % 0.44/0.66 (step @p152 :rule bool-and-de-morgan :args (@t104 @t221 true)) % 0.44/0.66 (step @p153 :rule nary_cong :premises (@p142 @p152) :args ((or @t224 (not @t238)))) % 0.44/0.66 (step @p154 :rule bool-and-de-morgan :args (@t223 @t104 (and @t221))) % 0.44/0.66 (step @p155 :rule trans :premises (@p154 @p153)) % 0.44/0.66 (step @p156 :rule refl :args (@t236)) % 0.44/0.66 (step @p157 :rule nary_cong :premises (@p156 @p155) :args ((or @t236 (not (and @t223 @t104 @t221))))) % 0.44/0.66 (step @p158 :rule bool-and-de-morgan :args (@t105 @t223 (and @t104 @t221))) % 0.44/0.66 (step @p159 :rule trans :premises (@p158 @p157)) % 0.44/0.66 (step @p160 :rule trans :premises (@p159 @p151)) % 0.44/0.66 (step @p161 :rule cong :premises (@p160) :args (@t240)) % 0.44/0.66 (step @p162 :rule trans :premises (@p161 @p150)) % 0.44/0.66 (step @p163 :rule cong :premises (@p162) :args (@t241)) % 0.44/0.66 (step @p164 :rule exists-elim :args ((= (exists @t20 @t239) @t241))) % 0.44/0.66 (step @p165 :rule trans :premises (@p164 @p163)) % 0.44/0.66 (step @p166 :rule aci_norm :args ((= (and @t242 @t238) @t239))) % 0.44/0.66 (step @p167 :rule beta-reduce :args ((= (_ @t243 @t5) @t238))) % 0.44/0.66 (step @p168 :rule beta-reduce :args ((= (_ (lambda @t7 (and @t6 (forall @t155 (or @t212 @t203)))) @t17) @t243))) % 0.44/0.66 (step @p169 :rule alpha_equiv :args (@t247 @t217 (@list @t150))) % 0.44/0.66 (step @p170 :rule refl :args (@t6)) % 0.44/0.66 (step @p171 :rule nary_cong :premises (@p170 @p169) :args (@t248)) % 0.44/0.66 (step @p172 :rule cong :premises (@p171) :args (@t249)) % 0.44/0.66 (step @p173 :rule ho_cong :premises (@p172 @p107)) % 0.44/0.66 (step @p174 :rule trans :premises (@p173 @p168)) % 0.44/0.66 (step @p175 :rule ho_cong :premises (@p174 @p105)) % 0.44/0.66 (step @p176 :rule trans :premises (@p175 @p167)) % 0.44/0.66 (step @p177 :rule beta-reduce :args ((= (_ @t243 @t1) @t242))) % 0.44/0.66 (step @p178 :rule refl :args (@t1)) % 0.44/0.66 (step @p179 :rule ho_cong :premises (@p174 @p178)) % 0.44/0.66 (step @p180 :rule trans :premises (@p179 @p177)) % 0.44/0.66 (step @p181 :rule nary_cong :premises (@p180 @p176) :args (@t251)) % 0.44/0.66 (step @p182 :rule trans :premises (@p181 @p166)) % 0.44/0.66 (step @p183 :rule cong :premises (@p182) :args (@t252)) % 0.44/0.66 (step @p184 :rule trans :premises (@p183 @p165)) % 0.44/0.66 (step @p185 :rule cong :premises (@p184) :args (@t253)) % 0.44/0.66 (step @p186 :rule trans :premises (@p185 @p134)) % 0.44/0.66 (step @p187 :rule beta-reduce :args ((= (_ @t254 @t5) @t234))) % 0.44/0.66 (step @p188 :rule beta-reduce :args ((= @t255 @t254))) % 0.44/0.66 (step @p189 :rule ho_cong :premises (@p188 @p105)) % 0.44/0.66 (step @p190 :rule trans :premises (@p189 @p187)) % 0.44/0.66 (step @p191 :rule nary_cong :premises (@p190 @p186) :args ((and (_ @t255 @t5) @t253))) % 0.44/0.66 (step @p192 :rule trans :premises (@p191 @p133)) % 0.44/0.66 (step @p193 :rule bool-double-not-elim :args (@t247)) % 0.44/0.66 (step @p194 :rule beta-reduce :args ((= (_ @t257 @t5) @t256))) % 0.44/0.66 (step @p195 :rule beta-reduce :args ((= @t258 @t257))) % 0.44/0.66 (step @p196 :rule ho_cong :premises (@p195 @p105)) % 0.44/0.66 (step @p197 :rule trans :premises (@p196 @p194)) % 0.44/0.66 (step @p198 :rule cong :premises (@p197) :args (@t259)) % 0.44/0.66 (step @p199 :rule trans :premises (@p198 @p193)) % 0.44/0.66 (step @p200 :rule refl :args (@t6)) % 0.44/0.66 (step @p201 :rule nary_cong :premises (@p200 @p199) :args ((and @t6 @t259))) % 0.44/0.66 (step @p202 :rule bool-and-de-morgan :args (@t246 @t245 true)) % 0.44/0.66 (step @p203 :rule cong :premises (@p202) :args (@t261)) % 0.44/0.66 (step @p204 :rule cong :premises (@p203) :args (@t262)) % 0.44/0.66 (step @p205 :rule exists-elim :args ((= (exists @t20 @t260) @t262))) % 0.44/0.66 (step @p206 :rule trans :premises (@p205 @p204)) % 0.44/0.66 (step @p207 :rule beta-reduce :args ((= (_ @t263 @t5) @t245))) % 0.44/0.66 (step @p208 :rule beta-reduce :args ((= (_ (lambda @t7 (forall @t152 (or (not @t211) @t202))) @t17) @t263))) % 0.44/0.66 (step @p209 :rule alpha_equiv :args (@t220 @t217 (@list @t149))) % 0.44/0.66 (step @p210 :rule cong :premises (@p209) :args (@t264)) % 0.44/0.66 (step @p211 :rule ho_cong :premises (@p210 @p107)) % 0.44/0.66 (step @p212 :rule trans :premises (@p211 @p208)) % 0.44/0.66 (step @p213 :rule ho_cong :premises (@p212 @p105)) % 0.44/0.66 (step @p214 :rule trans :premises (@p213 @p207)) % 0.44/0.66 (step @p215 :rule beta-reduce :args ((= (_ @t263 @t1) @t246))) % 0.44/0.66 (step @p216 :rule ho_cong :premises (@p212 @p178)) % 0.44/0.66 (step @p217 :rule trans :premises (@p216 @p215)) % 0.44/0.66 (step @p218 :rule nary_cong :premises (@p217 @p214) :args (@t266)) % 0.44/0.66 (step @p219 :rule cong :premises (@p218) :args ((exists @t20 @t266))) % 0.44/0.66 (step @p220 :rule trans :premises (@p219 @p206)) % 0.44/0.66 (step @p221 :rule nary_cong :premises (@p148 @p140) :args (@t267)) % 0.44/0.66 (step @p222 :rule cong :premises (@p221) :args ((forall @t20 @t267))) % 0.44/0.66 (step @p223 :rule bool-impl-elim :args (@t105 @t104)) % 0.44/0.66 (step @p224 :rule cong :premises (@p223) :args (@t106)) % 0.44/0.66 (step @p225 :rule trans :premises (@p224 @p222)) % 0.44/0.66 (step @p226 :rule cong :premises (@p225) :args (@t107)) % 0.44/0.66 (step @p227 :rule trans :premises (@p43 @p226)) % 0.44/0.66 (step @p228 :rule ho_cong :premises (@p227 @p132)) % 0.44/0.66 (step @p229 :rule ho_cong :premises (@p228 @p105)) % 0.44/0.66 (step @p230 :rule ho_cong :premises (@p228 @p178)) % 0.44/0.66 (step @p231 :rule nary_cong :premises (@p230 @p229) :args (@t112)) % 0.44/0.66 (step @p232 :rule cong :premises (@p231) :args (@t113)) % 0.44/0.66 (step @p233 :rule trans :premises (@p232 @p220)) % 0.44/0.66 (step @p234 :rule cong :premises (@p233) :args (@t114)) % 0.44/0.66 (step @p235 :rule trans :premises (@p45 @p234)) % 0.44/0.66 (step @p236 :rule ho_cong :premises (@p235 @p178)) % 0.44/0.66 (step @p237 :rule ho_cong :premises (@p236 @p105)) % 0.44/0.66 (step @p238 :rule cong :premises (@p237) :args (@t118)) % 0.44/0.66 (step @p239 :rule nary_cong :premises (@p200 @p238) :args (@t119)) % 0.44/0.66 (step @p240 :rule trans :premises (@p239 @p201)) % 0.44/0.66 (step @p241 :rule cong :premises (@p240) :args (@t120)) % 0.44/0.66 (step @p242 :rule trans :premises (@p47 @p241)) % 0.44/0.66 (step @p243 :rule ho_cong :premises (@p242 @p132)) % 0.44/0.66 (step @p244 :rule ho_cong :premises (@p243 @p105)) % 0.44/0.66 (step @p245 :rule ho_cong :premises (@p243 @p178)) % 0.44/0.66 (step @p246 :rule nary_cong :premises (@p245 @p244) :args (@t124)) % 0.44/0.66 (step @p247 :rule cong :premises (@p246) :args (@t125)) % 0.44/0.66 (step @p248 :rule cong :premises (@p247) :args (@t128)) % 0.44/0.66 (step @p249 :rule beta-reduce :args ((= (_ @t270 @t1) @t216))) % 0.44/0.66 (step @p250 :rule beta-reduce :args ((= (_ (lambda (@list @t1 @t268) (forall @t20 (or @t219 @t269))) @t5) @t270))) % 0.44/0.66 (step @p251 :rule refl :args (@t5)) % 0.44/0.66 (step @p252 :rule alpha_equiv :args (@t264 @t198 (@list @t268))) % 0.44/0.66 (step @p253 :rule ho_cong :premises (@p252 @p251)) % 0.44/0.66 (step @p254 :rule trans :premises (@p253 @p250)) % 0.44/0.66 (step @p255 :rule ho_cong :premises (@p254 @p178)) % 0.44/0.66 (step @p256 :rule trans :premises (@p255 @p249)) % 0.44/0.66 (step @p257 :rule cong :premises (@p256) :args (@t271)) % 0.44/0.66 (step @p258 :rule beta-reduce :args ((= (_ @t272 @t5) @t220))) % 0.44/0.66 (step @p259 :rule beta-reduce :args ((= @t273 @t272))) % 0.44/0.66 (step @p260 :rule ho_cong :premises (@p259 @p105)) % 0.44/0.66 (step @p261 :rule trans :premises (@p260 @p258)) % 0.44/0.66 (step @p262 :rule nary_cong :premises (@p261 @p257) :args ((and (_ @t273 @t5) @t271))) % 0.44/0.66 (step @p263 :rule ho_cong :premises (@p227 @p105)) % 0.44/0.66 (step @p264 :rule ho_cong :premises (@p263 @p178)) % 0.44/0.66 (step @p265 :rule cong :premises (@p264) :args (@t115)) % 0.44/0.66 (step @p266 :rule ho_cong :premises (@p227 @p178)) % 0.44/0.66 (step @p267 :rule ho_cong :premises (@p266 @p105)) % 0.44/0.66 (step @p268 :rule nary_cong :premises (@p267 @p265) :args (@t121)) % 0.44/0.66 (step @p269 :rule trans :premises (@p268 @p262)) % 0.44/0.66 (step @p270 :rule cong :premises (@p269) :args (@t122)) % 0.44/0.66 (step @p271 :rule trans :premises (@p48 @p270)) % 0.44/0.66 (step @p272 :rule ho_cong :premises (@p271 @p178)) % 0.44/0.66 (step @p273 :rule ho_cong :premises (@p272 @p105)) % 0.44/0.66 (step @p274 :rule nary_cong :premises (@p273 @p248) :args (@t129)) % 0.44/0.66 (step @p275 :rule trans :premises (@p274 @p192)) % 0.44/0.66 (step @p276 :rule cong :premises (@p275) :args (@t130)) % 0.44/0.66 (step @p277 :rule trans :premises (@p50 @p276)) % 0.44/0.66 (step @p278 :rule ho_cong :premises (@p277 @p132)) % 0.44/0.66 (step @p279 :rule ho_cong :premises (@p278 @p105)) % 0.44/0.66 (step @p280 :rule cong :premises (@p279) :args (@t19)) % 0.44/0.66 (step @p281 :rule cong :premises (@p280) :args (@t21)) % 0.44/0.66 (step @p282 :rule cong :premises (@p281) :args (@t22)) % 0.44/0.66 (step @p283 :rule cong :premises (@p282) :args (@t23)) % 0.44/0.66 (step @p284 :rule refl :args (tptp.fool)) % 0.44/0.66 (step @p285 :rule refl :args (@t186)) % 0.44/0.66 (step @p286 :rule refl :args (@t59)) % 0.44/0.66 (step @p287 :rule cong :premises (@p286 @p285) :args ((= @t59 @t186))) % 0.44/0.66 (step @p288 :rule symm :premises (@p287)) % 0.44/0.66 (step @p289 :rule eq_resolve :premises (@p286 @p288)) % 0.44/0.66 (step @p290 :rule refl :args (@t232)) % 0.44/0.66 (step @p291 :rule refl :args (@t61)) % 0.44/0.66 (step @p292 :rule cong :premises (@p291 @p290) :args ((= @t61 @t232))) % 0.44/0.66 (step @p293 :rule symm :premises (@p292)) % 0.44/0.66 (step @p294 :rule eq_resolve :premises (@p291 @p293)) % 0.44/0.66 (step @p295 :rule cong :premises (@p294) :args (@t62)) % 0.44/0.66 (step @p296 :rule nary_cong :premises (@p295 @p289) :args (@t63)) % 0.44/0.66 (step @p297 :rule cong :premises (@p296) :args (@t65)) % 0.44/0.66 (step @p298 :rule cong :premises (@p297) :args (@t67)) % 0.44/0.66 (step @p299 :rule trans :premises (@p26 @p298)) % 0.44/0.66 (step @p300 :rule ho_cong :premises (@p299 @p284)) % 0.44/0.66 (step @p301 :rule ho_cong :premises (@p300 @p283)) % 0.44/0.66 (step @p302 :rule refl :args (@t177)) % 0.44/0.66 (step @p303 :rule refl :args (@t32)) % 0.44/0.66 (step @p304 :rule cong :premises (@p303 @p302) :args ((= @t32 @t177))) % 0.44/0.66 (step @p305 :rule symm :premises (@p304)) % 0.44/0.66 (step @p306 :rule eq_resolve :premises (@p303 @p305)) % 0.44/0.66 (step @p307 :rule cong :premises (@p306) :args (@t96)) % 0.44/0.66 (step @p308 :rule cong :premises (@p307) :args (@t98)) % 0.44/0.66 (step @p309 :rule trans :premises (@p38 @p308)) % 0.44/0.66 (step @p310 :rule ho_cong :premises (@p309 @p301)) % 0.44/0.66 (step @p311 :rule cong :premises (@p310) :args (@t24)) % 0.44/0.66 (step @p312 :rule trans :premises (@p311 @p131)) % 0.44/0.66 (step @p313 :rule eq_resolve :premises (@p10 @p312)) % 0.44/0.66 (step @p314 :rule not_or_elim :premises (@p313) :args (0)) % 0.44/0.66 (step @p315 :rule skolemize :premises (@p314)) % 0.44/0.66 (step @p316 :rule bool-double-not-elim :args (@t274)) % 0.44/0.66 (step @p317 :rule refl :args (@t279)) % 0.44/0.66 (step @p318 :rule nary_cong :premises (@p317 @p316) :args ((or @t279 (not @t275)))) % 0.44/0.66 (step @p319 :rule cnf_or_neg :args (@t279 2)) % 0.44/0.66 (step @p320 :rule eq_resolve :premises (@p319 @p318)) % 0.44/0.66 (step @p321 :rule reordering :premises (@p320) :args ((or @t274 @t279))) % 0.44/0.66 (step @p322 :rule chain_m_resolution :premises (@p321 @p315) :args (@t274 @t280 @t281)) % 0.44/0.66 (step @p323 :rule alpha_equiv :args (@t274 (@list @t132 @t134) (@list @t149 @t150))) % 0.44/0.66 (step @p324 :rule equiv_elim1 :premises (@p323)) % 0.44/0.66 (step @p325 :rule chain_m_resolution :premises (@p324 @p322) :args (@t282 @t283 (@list @t274))) % 0.44/0.66 (step @p326 :rule bool-double-not-elim :args (@t277)) % 0.44/0.66 (step @p327 :rule nary_cong :premises (@p317 @p326) :args ((or @t279 (not @t278)))) % 0.44/0.66 (step @p328 :rule cnf_or_neg :args (@t279 0)) % 0.44/0.66 (step @p329 :rule eq_resolve :premises (@p328 @p327)) % 0.44/0.66 (step @p330 :rule reordering :premises (@p329) :args ((or @t277 @t279))) % 0.44/0.66 (step @p331 :rule chain_m_resolution :premises (@p330 @p315) :args (@t277 @t280 @t281)) % 0.44/0.66 (step @p332 :rule aci_norm :args ((= @t284 @t276))) % 0.44/0.66 (step @p333 :rule cong :premises (@p332) :args (@t285)) % 0.44/0.66 (step @p334 :rule cong :premises (@p333) :args (@t286)) % 0.44/0.66 (step @p335 :rule refl :args (@t288)) % 0.44/0.66 (step @p336 :rule nary_cong :premises (@p335 @p334 @p335 @p334) :args (@t289)) % 0.44/0.66 (step @p337 :rule refl :args (@t277)) % 0.44/0.66 (step @p338 :rule cong :premises (@p337 @p336) :args ((=> @t277 @t289))) % 0.44/0.66 (assume-push @p350 @t277) % 0.44/0.66 (step @p340 :rule instantiate :premises (@p331) :args ((@list @t168 @t168))) % 0.44/0.66 (step-pop @p351 :rule scope :premises (@p340)) % 0.44/0.66 (step @p341 :rule process_scope :premises (@p351) :args (@t289)) % 0.44/0.66 (step @p343 :rule eq_resolve :premises (@p341 @p338)) % 0.44/0.66 (step @p344 :rule implies_elim :premises (@p343)) % 0.44/0.66 (step @p345 :rule chain_m_resolution :premises (@p344 @p331) :args (@t291 @t283 (@list @t277))) % 0.44/0.66 (step @p346 :rule cnf_or_pos :args (@t291)) % 0.44/0.66 (step @p347 :rule factoring :premises (@p346)) % 0.44/0.66 (step @p348 :rule reordering :premises (@p347) :args ((or @t288 @t290 (not @t291)))) % 0.44/0.66 (step @p349 false :rule chain_m_resolution :premises (@p348 @p345 @p325 @p58) :args (false (@list false false false) (@list @t291 @t282 @t287))) % 0.44/0.66 ) % 0.44/0.66 % SZS output end Proof % 0.44/0.66 % cvc5 exiting %------------------------------------------------------------------------------