%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET651^3 : TPTP v9.2.1. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n022.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:48:22 AM UTC 2026 % Result : Theorem 0.36s 0.59s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET651^3 : TPTP v9.2.1. Released v3.6.0. % 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.15/0.34 % Computer : n022.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue Jun 2 16:05:53 EDT 2026 % 0.15/0.34 % CPUTime : % 0.29/0.50 %----Proving TH0 % 0.36/0.59 --- 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.36/0.59 % SZS status Theorem % 0.36/0.59 % SZS output start Proof % 0.36/0.59 ( % 0.36/0.59 (declare-sort $$unsorted 0) % 0.36/0.59 (declare-const tptp.a (-> $$unsorted Bool)) % 0.36/0.59 (define tptp.in () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "M" (-> $$unsorted Bool)))) (lambda (@list _let_1 _let_2) (_ _let_2 _let_1))))) % 0.36/0.59 (define tptp.is_a () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "M" (-> $$unsorted Bool)))) (lambda (@list _let_1 _let_2) (_ _let_2 _let_1))))) % 0.36/0.59 (define tptp.emptyset () (lambda (@list (@var "X" $$unsorted)) false)) % 0.36/0.59 (define tptp.unord_pair () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "X" $$unsorted))) (lambda (@list _let_3 _let_1 _let_2) (or (= _let_2 _let_3) (= _let_2 _let_1))))))) % 0.36/0.59 (define tptp.singleton () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (lambda (@list _let_1 _let_2) (= _let_2 _let_1))))) % 0.36/0.59 (define tptp.union () (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.36/0.59 (define tptp.excl_union () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (_ _let_2 _let_1))) (let ((_let_4 (@var "X" (-> $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_1))) (lambda (@list _let_4 _let_2 _let_1) (or (and _let_5 (not _let_3)) (and (not _let_5) _let_3))))))))) % 0.36/0.59 (define tptp.intersection () (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.36/0.59 (define tptp.setminus () (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) (not (_ _let_2 _let_1)))))))) % 0.36/0.59 (define tptp.complement () (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.36/0.59 (define tptp.disjoint () (let ((_let_1 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (= (_ (_ tptp.intersection _let_2) _let_1) tptp.emptyset))))) % 0.36/0.59 (define tptp.subset () (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) (forall (@list _let_1) (=> (_ _let_3 _let_1) (_ _let_2 _let_1)))))))) % 0.36/0.59 (define tptp.meets () (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) (exists (@list _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1)))))))) % 0.36/0.59 (define tptp.misses () (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) (not (exists (@list _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1))))))))) % 0.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (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.36/0.59 (define @t1 () (@var "X" $$unsorted)) % 0.36/0.59 (define @t2 () (@list @t1)) % 0.36/0.59 (define @t3 () (lambda @t2 true)) % 0.36/0.59 (define @t4 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.36/0.59 (define @t5 () (_ tptp.rel_domain @t4)) % 0.36/0.59 (define @t6 () (=> (_ (_ tptp.subset @t5) tptp.a) (_ (_ tptp.sub_rel @t4) (_ (_ tptp.cartesian_product tptp.a) @t3)))) % 0.36/0.59 (define @t7 () (@list @t4)) % 0.36/0.59 (define @t8 () (forall @t7 @t6)) % 0.36/0.59 (define @t9 () (not @t8)) % 0.36/0.59 (define @t10 () (@var "M" (-> $$unsorted Bool))) % 0.36/0.59 (define @t11 () (lambda (@list @t1 @t10) (_ @t10 @t1))) % 0.36/0.59 (define @t12 () (lambda @t2 false)) % 0.36/0.59 (define @t13 () (@var "Y" $$unsorted)) % 0.36/0.59 (define @t14 () (@var "U" $$unsorted)) % 0.36/0.59 (define @t15 () (= @t14 @t1)) % 0.36/0.59 (define @t16 () (lambda (@list @t1 @t13 @t14) (or @t15 (= @t14 @t13)))) % 0.36/0.59 (define @t17 () (lambda (@list @t1 @t14) @t15)) % 0.36/0.59 (define @t18 () (@var "Y" (-> $$unsorted Bool))) % 0.36/0.59 (define @t19 () (_ @t18 @t14)) % 0.36/0.59 (define @t20 () (@var "X" (-> $$unsorted Bool))) % 0.36/0.59 (define @t21 () (_ @t20 @t14)) % 0.36/0.59 (define @t22 () (@list @t20 @t18 @t14)) % 0.36/0.59 (define @t23 () (lambda @t22 (or @t21 @t19))) % 0.36/0.59 (define @t24 () (not @t21)) % 0.36/0.59 (define @t25 () (and @t21 (not @t19))) % 0.36/0.59 (define @t26 () (lambda @t22 (or @t25 (and @t24 @t19)))) % 0.36/0.59 (define @t27 () (and @t21 @t19)) % 0.36/0.59 (define @t28 () (lambda @t22 @t27)) % 0.36/0.59 (define @t29 () (lambda @t22 @t25)) % 0.36/0.59 (define @t30 () (lambda (@list @t20 @t14) @t24)) % 0.36/0.59 (define @t31 () (@list @t20 @t18)) % 0.36/0.59 (define @t32 () (lambda @t31 (= (_ (_ tptp.intersection @t20) @t18) tptp.emptyset))) % 0.36/0.59 (define @t33 () (@list @t14)) % 0.36/0.59 (define @t34 () (forall @t33 (=> @t21 @t19))) % 0.36/0.59 (define @t35 () (lambda @t31 @t34)) % 0.36/0.59 (define @t36 () (exists @t33 @t27)) % 0.36/0.59 (define @t37 () (lambda @t31 @t36)) % 0.36/0.59 (define @t38 () (lambda @t31 (not @t36))) % 0.36/0.59 (define @t39 () (@var "V" $$unsorted)) % 0.36/0.59 (define @t40 () (_ @t18 @t39)) % 0.36/0.59 (define @t41 () (lambda (@list @t20 @t18 @t14 @t39) (and @t21 @t40))) % 0.36/0.59 (define @t42 () (lambda (@list @t1 @t13 @t14 @t39) (or @t15 (= @t39 @t13)))) % 0.36/0.59 (define @t43 () (= @t1 @t13)) % 0.36/0.59 (define @t44 () (@var "S" (-> $$unsorted Bool))) % 0.36/0.59 (define @t45 () (_ @t44 @t1)) % 0.36/0.59 (define @t46 () (lambda (@list @t44 @t1 @t13) (and @t45 @t43))) % 0.36/0.59 (define @t47 () (@var "R2" (-> $$unsorted $$unsorted Bool))) % 0.36/0.59 (define @t48 () (_ (_ @t47 @t1) @t13)) % 0.36/0.59 (define @t49 () (@var "R1" (-> $$unsorted $$unsorted Bool))) % 0.36/0.59 (define @t50 () (_ (_ @t49 @t1) @t13)) % 0.36/0.59 (define @t51 () (@list @t1 @t13)) % 0.36/0.59 (define @t52 () (forall @t51 (=> @t50 @t48))) % 0.36/0.59 (define @t53 () (@list @t49 @t47)) % 0.36/0.59 (define @t54 () (lambda @t53 @t52)) % 0.36/0.59 (define @t55 () (@var "B" (-> $$unsorted Bool))) % 0.36/0.59 (define @t56 () (@var "A" (-> $$unsorted Bool))) % 0.36/0.59 (define @t57 () (_ @t4 @t1)) % 0.36/0.59 (define @t58 () (_ @t57 @t13)) % 0.36/0.59 (define @t59 () (lambda (@list @t4 @t56 @t55) (forall @t51 (=> @t58 (and (_ @t56 @t1) (_ @t55 @t13)))))) % 0.36/0.59 (define @t60 () (@list @t4 @t44 @t1 @t13)) % 0.36/0.59 (define @t61 () (lambda @t60 (and @t45 @t58))) % 0.36/0.59 (define @t62 () (lambda @t51 @t43)) % 0.36/0.59 (define @t63 () (@var "Z" $$unsorted)) % 0.36/0.59 (define @t64 () (@list @t13)) % 0.36/0.59 (define @t65 () (lambda (@list @t49 @t47 @t1 @t63) (exists @t64 (and @t50 (_ (_ @t47 @t13) @t63))))) % 0.36/0.59 (define @t66 () (_ @t57 @t1)) % 0.36/0.59 (define @t67 () (lambda @t7 (forall @t2 @t66))) % 0.36/0.59 (define @t68 () (lambda @t7 (forall @t2 (not @t66)))) % 0.36/0.59 (define @t69 () (_ @t4 @t13)) % 0.36/0.59 (define @t70 () (_ @t69 @t1)) % 0.36/0.59 (define @t71 () (lambda @t7 (forall @t51 (=> @t58 @t70)))) % 0.36/0.59 (define @t72 () (lambda @t7 (forall (@list @t1 @t13 @t63) (=> (and @t58 (_ @t69 @t63)) (_ @t57 @t63))))) % 0.36/0.59 (define @t73 () (lambda @t7 (and (_ tptp.reflexive @t4) (_ tptp.symmetric @t4) (_ tptp.transitive @t4)))) % 0.36/0.59 (define @t74 () (lambda (@list @t4 @t13) (exists @t2 @t58))) % 0.36/0.59 (define @t75 () (exists @t64 @t58)) % 0.36/0.59 (define @t76 () (@list @t4 @t1)) % 0.36/0.59 (define @t77 () (lambda @t76 @t75)) % 0.36/0.59 (define @t78 () (lambda (@list @t4 @t1 @t13) @t70)) % 0.36/0.59 (define @t79 () (@var "S1" (-> $$unsorted Bool))) % 0.36/0.59 (define @t80 () (lambda (@list @t4 @t79) (exists @t2 (and (_ @t79 @t1) (forall @t64 (= (_ @t79 @t13) @t58)))))) % 0.36/0.59 (define @t81 () (lambda @t60 (and (_ @t44 @t13) @t58))) % 0.36/0.59 (define @t82 () (lambda @t76 (or (_ @t5 @t1) (_ (_ tptp.rel_codomain @t4) @t1)))) % 0.36/0.59 (define @t83 () (@var "W" $$unsorted)) % 0.36/0.59 (define @t84 () (not (_ @t20 @t83))) % 0.36/0.59 (define @t85 () (@list @t83)) % 0.36/0.59 (define @t86 () (_ @t20 @t13)) % 0.36/0.59 (define @t87 () (_ @t20 @t63)) % 0.36/0.59 (define @t88 () (@list @t20 @t63)) % 0.36/0.59 (define @t89 () (lambda @t7 (forall @t88 (=> @t87 (exists @t64 (and @t86 (forall @t85 (=> (_ @t69 @t83) @t84)))))))) % 0.36/0.59 (define @t90 () (lambda @t7 (forall @t88 (=> @t87 (exists @t64 (and @t86 (forall @t85 (=> (_ @t69 @t13) @t84)))))))) % 0.36/0.59 (define @t91 () (@var "BOUND_VARIABLE_8226" $$unsorted)) % 0.36/0.59 (define @t92 () (tptp.a @t91)) % 0.36/0.59 (define @t93 () (@var "BOUND_VARIABLE_8228" $$unsorted)) % 0.36/0.59 (define @t94 () (not (_ @t4 @t91 @t93))) % 0.36/0.59 (define @t95 () (tptp.a @t14)) % 0.36/0.59 (define @t96 () (@var "BOUND_VARIABLE_8178" $$unsorted)) % 0.36/0.59 (define @t97 () (not (_ @t4 @t14 @t96))) % 0.36/0.59 (define @t98 () (@list @t14 @t96)) % 0.36/0.59 (define @t99 () (forall @t98 (or @t97 @t95))) % 0.36/0.59 (define @t100 () (not @t99)) % 0.36/0.59 (define @t101 () (or @t100 @t94 @t92)) % 0.36/0.59 (define @t102 () (or @t94 @t92)) % 0.36/0.59 (define @t103 () (or @t100 @t102)) % 0.36/0.59 (define @t104 () (@list @t4 @t91 @t93)) % 0.36/0.59 (define @t105 () (forall @t104 @t103)) % 0.36/0.59 (define @t106 () (@list @t91 @t93)) % 0.36/0.59 (define @t107 () (forall @t106 @t103)) % 0.36/0.59 (define @t108 () (forall @t106 @t102)) % 0.36/0.59 (define @t109 () (or @t100 @t108)) % 0.36/0.59 (define @t110 () (tptp.a @t1)) % 0.36/0.59 (define @t111 () (_ @t4 @t1 @t13)) % 0.36/0.59 (define @t112 () (not @t111)) % 0.36/0.59 (define @t113 () (forall @t51 (or @t112 @t110))) % 0.36/0.59 (define @t114 () (_ tptp.a @t1)) % 0.36/0.59 (define @t115 () (or @t112 @t114)) % 0.36/0.59 (define @t116 () (_ tptp.a @t14)) % 0.36/0.59 (define @t117 () (@list @t14 @t39)) % 0.36/0.59 (define @t118 () (lambda @t117 @t116)) % 0.36/0.59 (define @t119 () (_ @t118 @t1 @t13)) % 0.36/0.59 (define @t120 () (or @t112 @t119)) % 0.36/0.59 (define @t121 () (forall @t51 @t120)) % 0.36/0.59 (define @t122 () (_ @t47 @t1 @t13)) % 0.36/0.59 (define @t123 () (lambda (@list @t47) (forall @t51 (or @t112 @t122)))) % 0.36/0.59 (define @t124 () (@var "BOUND_VARIABLE_8204" $$unsorted)) % 0.36/0.59 (define @t125 () (lambda (@list @t124) true)) % 0.36/0.59 (define @t126 () (_ @t125 @t39)) % 0.36/0.59 (define @t127 () (and @t116 @t126)) % 0.36/0.59 (define @t128 () (lambda @t117 @t127)) % 0.36/0.59 (define @t129 () (lambda (@list @t18 @t14 @t39) (and @t116 @t40))) % 0.36/0.59 (define @t130 () (_ @t41 tptp.a)) % 0.36/0.59 (define @t131 () (_ @t49 @t1 @t13)) % 0.36/0.59 (define @t132 () (_ (lambda @t53 (forall @t51 (or (not @t131) @t122))) @t4)) % 0.36/0.59 (define @t133 () (_ @t18 @t14)) % 0.36/0.59 (define @t134 () (or @t97 @t133)) % 0.36/0.59 (define @t135 () (forall @t98 @t134)) % 0.36/0.59 (define @t136 () (@list @t18)) % 0.36/0.59 (define @t137 () (@list @t96)) % 0.36/0.59 (define @t138 () (forall @t137 @t134)) % 0.36/0.59 (define @t139 () (forall @t137 @t97)) % 0.36/0.59 (define @t140 () (or @t139 @t133)) % 0.36/0.59 (define @t141 () (forall @t64 (not (_ @t4 @t14 @t13)))) % 0.36/0.59 (define @t142 () (not (forall @t64 @t112))) % 0.36/0.59 (define @t143 () (lambda @t2 @t142)) % 0.36/0.59 (define @t144 () (_ @t143 @t14)) % 0.36/0.59 (define @t145 () (not @t144)) % 0.36/0.59 (define @t146 () (or @t145 @t133)) % 0.36/0.59 (define @t147 () (forall @t33 @t146)) % 0.36/0.59 (define @t148 () (lambda @t136 @t147)) % 0.36/0.59 (define @t149 () (_ @t20 @t14)) % 0.36/0.59 (define @t150 () (lambda @t31 (forall @t33 (or (not @t149) @t133)))) % 0.36/0.59 (define @t151 () (_ (lambda @t76 @t142) @t4)) % 0.36/0.59 (define @t152 () (=> (_ (_ @t150 @t151) tptp.a) (_ @t132 (_ @t130 @t3)))) % 0.36/0.59 (define @t153 () (forall @t7 @t152)) % 0.36/0.59 (define @t154 () (not @t50)) % 0.36/0.59 (define @t155 () (or @t154 @t48)) % 0.36/0.59 (define @t156 () (not @t58)) % 0.36/0.59 (define @t157 () (forall @t64 @t156)) % 0.36/0.59 (define @t158 () (not @t157)) % 0.36/0.59 (define @t159 () (or @t24 @t19)) % 0.36/0.59 (define @t160 () (forall @t104 @t101)) % 0.36/0.59 (define @t161 () (@quantifiers_skolemize @t160 0)) % 0.36/0.59 (define @t162 () (forall @t98 (or (not (_ @t161 @t14 @t96)) @t95))) % 0.36/0.59 (define @t163 () (@quantifiers_skolemize @t160 1)) % 0.36/0.59 (define @t164 () (tptp.a @t163)) % 0.36/0.59 (define @t165 () (@quantifiers_skolemize @t160 2)) % 0.36/0.59 (define @t166 () (_ @t161 @t163 @t165)) % 0.36/0.59 (define @t167 () (not @t166)) % 0.36/0.59 (define @t168 () (not @t162)) % 0.36/0.59 (define @t169 () (or @t168 @t167 @t164)) % 0.36/0.59 (define @t170 () (@list true)) % 0.36/0.59 (define @t171 () (@list @t169)) % 0.36/0.59 (define @t172 () (or @t167 @t164)) % 0.36/0.59 (define @t173 () (not @t172)) % 0.36/0.59 (assume @p1 @t9) % 0.36/0.59 (assume @p2 true) % 0.36/0.59 (step @p3 (= tptp.in @t11) :rule refl :args (@t11)) % 0.36/0.59 (step @p4 (= tptp.is_a @t11) :rule refl :args (@t11)) % 0.36/0.59 (step @p5 (= tptp.emptyset @t12) :rule refl :args (@t12)) % 0.36/0.59 (step @p6 (= tptp.unord_pair @t16) :rule refl :args (@t16)) % 0.36/0.59 (step @p7 (= tptp.singleton @t17) :rule refl :args (@t17)) % 0.36/0.59 (step @p8 (= tptp.union @t23) :rule refl :args (@t23)) % 0.36/0.59 (step @p9 (= tptp.excl_union @t26) :rule refl :args (@t26)) % 0.36/0.59 (step @p10 (= tptp.intersection @t28) :rule refl :args (@t28)) % 0.36/0.59 (step @p11 (= tptp.setminus @t29) :rule refl :args (@t29)) % 0.36/0.59 (step @p12 (= tptp.complement @t30) :rule refl :args (@t30)) % 0.36/0.59 (step @p13 (= tptp.disjoint @t32) :rule refl :args (@t32)) % 0.36/0.59 (step @p14 (= tptp.subset @t35) :rule refl :args (@t35)) % 0.36/0.59 (step @p15 (= tptp.meets @t37) :rule refl :args (@t37)) % 0.36/0.59 (step @p16 (= tptp.misses @t38) :rule refl :args (@t38)) % 0.36/0.59 (step @p17 (= tptp.cartesian_product @t41) :rule refl :args (@t41)) % 0.36/0.59 (step @p18 (= tptp.pair_rel @t42) :rule refl :args (@t42)) % 0.36/0.59 (step @p19 (= tptp.id_rel @t46) :rule refl :args (@t46)) % 0.36/0.59 (step @p20 (= tptp.sub_rel @t54) :rule refl :args (@t54)) % 0.36/0.59 (step @p21 (= tptp.is_rel_on @t59) :rule refl :args (@t59)) % 0.36/0.59 (step @p22 (= tptp.restrict_rel_domain @t61) :rule refl :args (@t61)) % 0.36/0.59 (step @p23 (= tptp.rel_diagonal @t62) :rule refl :args (@t62)) % 0.36/0.59 (step @p24 (= tptp.rel_composition @t65) :rule refl :args (@t65)) % 0.36/0.59 (step @p25 (= tptp.reflexive @t67) :rule refl :args (@t67)) % 0.36/0.59 (step @p26 (= tptp.irreflexive @t68) :rule refl :args (@t68)) % 0.36/0.59 (step @p27 (= tptp.symmetric @t71) :rule refl :args (@t71)) % 0.36/0.59 (step @p28 (= tptp.transitive @t72) :rule refl :args (@t72)) % 0.36/0.59 (step @p29 (= tptp.equiv_rel @t73) :rule refl :args (@t73)) % 0.36/0.59 (step @p30 (= tptp.rel_codomain @t74) :rule refl :args (@t74)) % 0.36/0.59 (step @p31 (= tptp.rel_domain @t77) :rule refl :args (@t77)) % 0.36/0.59 (step @p32 (= tptp.rel_inverse @t78) :rule refl :args (@t78)) % 0.36/0.59 (step @p33 (= tptp.equiv_classes @t80) :rule refl :args (@t80)) % 0.36/0.59 (step @p34 (= tptp.restrict_rel_codomain @t81) :rule refl :args (@t81)) % 0.36/0.59 (step @p35 (= tptp.rel_field @t82) :rule refl :args (@t82)) % 0.36/0.59 (step @p36 (= tptp.well_founded @t89) :rule refl :args (@t89)) % 0.36/0.59 (step @p37 (= tptp.upwards_well_founded @t90) :rule refl :args (@t90)) % 0.36/0.59 (step @p38 :rule aci_norm :args ((= @t103 @t101))) % 0.36/0.59 (step @p39 :rule cong :premises (@p38) :args (@t105)) % 0.36/0.59 (step @p40 :rule quant-merge-prenex :args ((= (forall @t7 @t107) @t105))) % 0.36/0.59 (step @p41 :rule alpha_equiv :args (@t108 (@list @t91 @t93) (@list @t1 @t13))) % 0.36/0.59 (step @p42 :rule refl :args (@t100)) % 0.36/0.59 (step @p43 :rule nary_cong :premises (@p42 @p41) :args (@t109)) % 0.36/0.59 (step @p44 :rule quant-miniscope-or :args ((= @t107 @t109))) % 0.36/0.59 (step @p45 :rule trans :premises (@p44 @p43)) % 0.36/0.59 (step @p46 :rule symm :premises (@p45)) % 0.36/0.59 (step @p47 :rule cong :premises (@p46) :args ((forall @t7 (or @t100 @t113)))) % 0.36/0.59 (step @p48 :rule trans :premises (@p47 @p40)) % 0.36/0.59 (step @p49 :rule trans :premises (@p48 @p39)) % 0.36/0.59 (step @p50 :rule bool-impl-elim :args (@t99 @t113)) % 0.36/0.59 (step @p51 :rule cong :premises (@p50) :args ((forall @t7 (=> @t99 @t113)))) % 0.36/0.59 (step @p52 :rule trans :premises (@p51 @p49)) % 0.36/0.59 (step @p53 :rule refl :args (@t110)) % 0.36/0.59 (step @p54 :rule refl :args (@t114)) % 0.36/0.59 (step @p55 :rule cong :premises (@p54 @p53) :args ((= @t114 @t110))) % 0.36/0.59 (step @p56 :rule symm :premises (@p55)) % 0.36/0.59 (step @p57 :rule eq_resolve :premises (@p54 @p56)) % 0.36/0.59 (step @p58 :rule refl :args (@t112)) % 0.36/0.59 (step @p59 :rule nary_cong :premises (@p58 @p57) :args (@t115)) % 0.36/0.59 (step @p60 :rule cong :premises (@p59) :args ((forall @t51 @t115))) % 0.36/0.59 (step @p61 :rule beta-reduce :args ((= @t119 @t114))) % 0.36/0.59 (step @p62 :rule refl :args (@t112)) % 0.36/0.59 (step @p63 :rule nary_cong :premises (@p62 @p61) :args (@t120)) % 0.36/0.59 (step @p64 :rule cong :premises (@p63) :args (@t121)) % 0.36/0.59 (step @p65 :rule trans :premises (@p64 @p60)) % 0.36/0.59 (step @p66 :rule beta-reduce :args ((= (_ @t123 @t118) @t121))) % 0.36/0.59 (step @p67 :rule trans :premises (@p66 @p65)) % 0.36/0.59 (step @p68 :rule aci_norm :args ((= (and @t116 true) @t116))) % 0.36/0.59 (step @p69 :rule beta-reduce :args ((= @t126 true))) % 0.36/0.59 (step @p70 :rule refl :args (@t116)) % 0.36/0.59 (step @p71 :rule nary_cong :premises (@p70 @p69) :args (@t127)) % 0.36/0.59 (step @p72 :rule trans :premises (@p71 @p68)) % 0.36/0.59 (step @p73 :rule cong :premises (@p72) :args (@t128)) % 0.36/0.59 (step @p74 :rule beta-reduce :args ((= (_ @t129 @t125) @t128))) % 0.36/0.59 (step @p75 :rule trans :premises (@p74 @p73)) % 0.36/0.59 (step @p76 :rule refl :args (@t125)) % 0.36/0.59 (step @p77 :rule symm :premises (@p76)) % 0.36/0.59 (step @p78 :rule alpha_equiv :args (@t3 (@list @t1) (@list @t124))) % 0.36/0.59 (step @p79 :rule trans :premises (@p78 @p77)) % 0.36/0.59 (step @p80 :rule beta-reduce :args ((= @t130 @t129))) % 0.36/0.59 (step @p81 :rule ho_cong :premises (@p80 @p79)) % 0.36/0.59 (step @p82 :rule trans :premises (@p81 @p75)) % 0.36/0.59 (step @p83 :rule beta-reduce :args ((= @t132 @t123))) % 0.36/0.59 (step @p84 :rule ho_cong :premises (@p83 @p82)) % 0.36/0.59 (step @p85 :rule trans :premises (@p84 @p67)) % 0.36/0.59 (step @p86 :rule beta-reduce :args ((= (_ (lambda @t136 @t135) tptp.a) @t99))) % 0.36/0.59 (step @p87 :rule refl :args (tptp.a)) % 0.36/0.59 (step @p88 :rule quant-merge-prenex :args ((= (forall @t33 @t138) @t135))) % 0.36/0.59 (step @p89 :rule refl :args (@t133)) % 0.36/0.59 (step @p90 :rule alpha_equiv :args (@t139 (@list @t96) (@list @t13))) % 0.36/0.59 (step @p91 :rule nary_cong :premises (@p90 @p89) :args (@t140)) % 0.36/0.59 (step @p92 :rule quant-miniscope-or :args ((= @t138 @t140))) % 0.36/0.59 (step @p93 :rule trans :premises (@p92 @p91)) % 0.36/0.59 (step @p94 :rule symm :premises (@p93)) % 0.36/0.59 (step @p95 :rule cong :premises (@p94) :args ((forall @t33 (or @t141 @t133)))) % 0.36/0.59 (step @p96 :rule trans :premises (@p95 @p88)) % 0.36/0.59 (step @p97 :rule refl :args (@t133)) % 0.36/0.59 (step @p98 :rule bool-double-not-elim :args (@t141)) % 0.36/0.59 (step @p99 :rule beta-reduce :args ((= @t144 (not @t141)))) % 0.36/0.59 (step @p100 :rule cong :premises (@p99) :args (@t145)) % 0.36/0.59 (step @p101 :rule trans :premises (@p100 @p98)) % 0.36/0.59 (step @p102 :rule nary_cong :premises (@p101 @p97) :args (@t146)) % 0.36/0.59 (step @p103 :rule cong :premises (@p102) :args (@t147)) % 0.36/0.59 (step @p104 :rule trans :premises (@p103 @p96)) % 0.36/0.59 (step @p105 :rule cong :premises (@p104) :args (@t148)) % 0.36/0.59 (step @p106 :rule beta-reduce :args ((= (_ @t150 @t143) @t148))) % 0.36/0.59 (step @p107 :rule trans :premises (@p106 @p105)) % 0.36/0.59 (step @p108 :rule beta-reduce :args ((= @t151 @t143))) % 0.36/0.59 (step @p109 :rule refl :args (@t150)) % 0.36/0.59 (step @p110 :rule ho_cong :premises (@p109 @p108)) % 0.36/0.59 (step @p111 :rule trans :premises (@p110 @p107)) % 0.36/0.59 (step @p112 :rule ho_cong :premises (@p111 @p87)) % 0.36/0.59 (step @p113 :rule trans :premises (@p112 @p86)) % 0.36/0.59 (step @p114 :rule cong :premises (@p113 @p85) :args (@t152)) % 0.36/0.59 (step @p115 :rule cong :premises (@p114) :args (@t153)) % 0.36/0.59 (step @p116 :rule trans :premises (@p115 @p52)) % 0.36/0.59 (step @p117 :rule cong :premises (@p116) :args ((not @t153))) % 0.36/0.59 (step @p118 :rule refl :args (@t3)) % 0.36/0.59 (step @p119 :rule ho_cong :premises (@p17 @p87)) % 0.36/0.59 (step @p120 :rule ho_cong :premises (@p119 @p118)) % 0.36/0.59 (step @p121 :rule refl :args (@t4)) % 0.36/0.59 (step @p122 :rule refl :args (@t122)) % 0.36/0.59 (step @p123 :rule refl :args (@t48)) % 0.36/0.59 (step @p124 :rule cong :premises (@p123 @p122) :args ((= @t48 @t122))) % 0.36/0.59 (step @p125 :rule symm :premises (@p124)) % 0.36/0.59 (step @p126 :rule eq_resolve :premises (@p123 @p125)) % 0.36/0.59 (step @p127 :rule refl :args (@t131)) % 0.36/0.59 (step @p128 :rule refl :args (@t50)) % 0.36/0.59 (step @p129 :rule cong :premises (@p128 @p127) :args ((= @t50 @t131))) % 0.36/0.59 (step @p130 :rule symm :premises (@p129)) % 0.36/0.59 (step @p131 :rule eq_resolve :premises (@p128 @p130)) % 0.36/0.59 (step @p132 :rule cong :premises (@p131) :args (@t154)) % 0.36/0.59 (step @p133 :rule nary_cong :premises (@p132 @p126) :args (@t155)) % 0.36/0.59 (step @p134 :rule cong :premises (@p133) :args ((forall @t51 @t155))) % 0.36/0.59 (step @p135 :rule bool-impl-elim :args (@t50 @t48)) % 0.36/0.59 (step @p136 :rule cong :premises (@p135) :args (@t52)) % 0.36/0.59 (step @p137 :rule trans :premises (@p136 @p134)) % 0.36/0.59 (step @p138 :rule cong :premises (@p137) :args (@t54)) % 0.36/0.59 (step @p139 :rule trans :premises (@p20 @p138)) % 0.36/0.59 (step @p140 :rule ho_cong :premises (@p139 @p121)) % 0.36/0.59 (step @p141 :rule ho_cong :premises (@p140 @p120)) % 0.36/0.59 (step @p142 :rule refl :args (@t111)) % 0.36/0.59 (step @p143 :rule refl :args (@t58)) % 0.36/0.59 (step @p144 :rule cong :premises (@p143 @p142) :args ((= @t58 @t111))) % 0.36/0.59 (step @p145 :rule symm :premises (@p144)) % 0.36/0.59 (step @p146 :rule eq_resolve :premises (@p143 @p145)) % 0.36/0.59 (step @p147 :rule cong :premises (@p146) :args (@t156)) % 0.36/0.59 (step @p148 :rule cong :premises (@p147) :args (@t157)) % 0.36/0.59 (step @p149 :rule cong :premises (@p148) :args (@t158)) % 0.36/0.59 (step @p150 :rule exists-elim :args ((= @t75 @t158))) % 0.36/0.59 (step @p151 :rule trans :premises (@p150 @p149)) % 0.36/0.59 (step @p152 :rule cong :premises (@p151) :args (@t77)) % 0.36/0.59 (step @p153 :rule trans :premises (@p31 @p152)) % 0.36/0.59 (step @p154 :rule ho_cong :premises (@p153 @p121)) % 0.36/0.59 (step @p155 :rule refl :args (@t133)) % 0.36/0.59 (step @p156 :rule refl :args (@t19)) % 0.36/0.59 (step @p157 :rule cong :premises (@p156 @p155) :args ((= @t19 @t133))) % 0.36/0.59 (step @p158 :rule symm :premises (@p157)) % 0.36/0.59 (step @p159 :rule eq_resolve :premises (@p156 @p158)) % 0.36/0.59 (step @p160 :rule refl :args (@t149)) % 0.36/0.59 (step @p161 :rule refl :args (@t21)) % 0.36/0.59 (step @p162 :rule cong :premises (@p161 @p160) :args ((= @t21 @t149))) % 0.36/0.59 (step @p163 :rule symm :premises (@p162)) % 0.36/0.59 (step @p164 :rule eq_resolve :premises (@p161 @p163)) % 0.36/0.59 (step @p165 :rule cong :premises (@p164) :args (@t24)) % 0.36/0.59 (step @p166 :rule nary_cong :premises (@p165 @p159) :args (@t159)) % 0.36/0.59 (step @p167 :rule cong :premises (@p166) :args ((forall @t33 @t159))) % 0.36/0.59 (step @p168 :rule bool-impl-elim :args (@t21 @t19)) % 0.36/0.59 (step @p169 :rule cong :premises (@p168) :args (@t34)) % 0.36/0.59 (step @p170 :rule trans :premises (@p169 @p167)) % 0.36/0.59 (step @p171 :rule cong :premises (@p170) :args (@t35)) % 0.36/0.59 (step @p172 :rule trans :premises (@p14 @p171)) % 0.36/0.59 (step @p173 :rule ho_cong :premises (@p172 @p154)) % 0.36/0.59 (step @p174 :rule ho_cong :premises (@p173 @p87)) % 0.36/0.59 (step @p175 :rule cong :premises (@p174 @p141) :args (@t6)) % 0.36/0.59 (step @p176 :rule cong :premises (@p175) :args (@t8)) % 0.36/0.59 (step @p177 :rule cong :premises (@p176) :args (@t9)) % 0.36/0.59 (step @p178 :rule trans :premises (@p177 @p117)) % 0.36/0.59 (step @p179 :rule eq_resolve :premises (@p1 @p178)) % 0.36/0.59 (step @p180 :rule skolemize :premises (@p179)) % 0.36/0.59 (step @p181 :rule bool-double-not-elim :args (@t162)) % 0.36/0.59 (step @p182 :rule refl :args (@t169)) % 0.36/0.59 (step @p183 :rule nary_cong :premises (@p182 @p181) :args ((or @t169 (not @t168)))) % 0.36/0.59 (step @p184 :rule cnf_or_neg :args (@t169 0)) % 0.36/0.59 (step @p185 :rule eq_resolve :premises (@p184 @p183)) % 0.36/0.59 (step @p186 :rule reordering :premises (@p185) :args ((or @t162 @t169))) % 0.36/0.59 (step @p187 :rule chain_m_resolution :premises (@p186 @p180) :args (@t162 @t170 @t171)) % 0.36/0.59 (step @p188 :rule cnf_or_neg :args (@t169 2)) % 0.36/0.59 (step @p189 :rule chain_m_resolution :premises (@p188 @p180) :args ((not @t164) @t170 @t171)) % 0.36/0.59 (step @p190 :rule bool-double-not-elim :args (@t166)) % 0.36/0.59 (step @p191 :rule nary_cong :premises (@p182 @p190) :args ((or @t169 (not @t167)))) % 0.36/0.59 (step @p192 :rule cnf_or_neg :args (@t169 1)) % 0.36/0.59 (step @p193 :rule eq_resolve :premises (@p192 @p191)) % 0.36/0.59 (step @p194 :rule reordering :premises (@p193) :args ((or @t166 @t169))) % 0.36/0.59 (step @p195 :rule chain_m_resolution :premises (@p194 @p180) :args (@t166 @t170 @t171)) % 0.36/0.59 (step @p196 :rule cnf_or_pos :args (@t172)) % 0.36/0.59 (step @p197 :rule reordering :premises (@p196) :args ((or @t167 @t164 @t173))) % 0.36/0.59 (step @p198 :rule chain_m_resolution :premises (@p197 @p195 @p189) :args (@t173 (@list false true) (@list @t166 @t164))) % 0.36/0.59 (assume-push @p205 @t162) % 0.36/0.59 (step @p200 :rule instantiate :premises (@p187) :args ((@list @t163 @t165))) % 0.36/0.59 (step-pop @p206 :rule scope :premises (@p200)) % 0.36/0.59 (step @p201 :rule process_scope :premises (@p206) :args (@t172)) % 0.36/0.59 (step @p203 :rule implies_elim :premises (@p201)) % 0.36/0.59 (step @p204 false :rule chain_m_resolution :premises (@p203 @p198 @p187) :args (false (@list true false) (@list @t172 @t162))) % 0.36/0.59 ) % 0.36/0.59 % SZS output end Proof % 0.36/0.59 % cvc5 exiting %------------------------------------------------------------------------------