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