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