%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET764^4 : 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 : n007.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:36 AM UTC 2026 % Result : Theorem 0.39s 0.58s % Output : Proof 0.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.13 % Problem : SET764^4 : TPTP v9.2.1. Released v3.6.0. % 0.10/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n007.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 16:10:26 EDT 2026 % 0.16/0.35 % CPUTime : % 0.30/0.51 %----Proving TH0 % 0.39/0.58 --- 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.39/0.58 % SZS status Theorem % 0.39/0.58 % SZS output start Proof % 0.39/0.58 ( % 0.39/0.58 (declare-sort $$unsorted 0) % 0.39/0.58 (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.39/0.58 (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.39/0.58 (define tptp.emptyset () (lambda (@list (@var "X" $$unsorted)) false)) % 0.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (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.39/0.58 (define tptp.fun_image () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "Y" $$unsorted))) (let ((_let_4 (@var "A" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_4 _let_3) (exists (@list _let_1) (and (_ _let_4 _let_1) (= _let_3 (_ _let_2 _let_1)))))))))) % 0.39/0.58 (define tptp.fun_composition () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "G" (-> $$unsorted $$unsorted)))) (lambda (@list _let_2 _let_3 _let_1) (_ _let_3 (_ _let_2 _let_1))))))) % 0.39/0.58 (define tptp.fun_inv_image () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "Y" $$unsorted))) (let ((_let_4 (@var "B" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_4 _let_1) (exists (@list _let_3) (and (_ _let_4 _let_3) (= _let_3 (_ _let_2 _let_1)))))))))) % 0.39/0.58 (define tptp.fun_injective () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "F" (-> $$unsorted $$unsorted)))) (lambda (@list _let_3) (forall (@list _let_2 _let_1) (=> (= (_ _let_3 _let_2) (_ _let_3 _let_1)) (= _let_2 _let_1)))))))) % 0.39/0.58 (define tptp.fun_surjective () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "Y" $$unsorted))) (lambda (@list _let_2) (forall (@list _let_3) (exists (@list _let_1) (= _let_3 (_ _let_2 _let_1))))))))) % 0.39/0.58 (define tptp.fun_bijective () (let ((_let_1 (@var "F" (-> $$unsorted $$unsorted)))) (lambda (@list _let_1) (and (_ tptp.fun_injective _let_1) (_ tptp.fun_surjective _let_1))))) % 0.39/0.58 (define tptp.fun_decreasing () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "Y" $$unsorted))) (let ((_let_4 (@var "SMALLER" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2 _let_4) (forall (@list _let_1 _let_3) (=> (_ (_ _let_4 _let_1) _let_3) (_ (_ _let_4 (_ _let_2 _let_3)) (_ _let_2 _let_1)))))))))) % 0.39/0.58 (define tptp.fun_increasing () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "F" (-> $$unsorted $$unsorted)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "SMALLER" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2 _let_4) (forall (@list _let_3 _let_1) (=> (_ (_ _let_4 _let_3) _let_1) (_ (_ _let_4 (_ _let_2 _let_3)) (_ _let_2 _let_1)))))))))) % 0.39/0.58 (define @t1 () (@var "F" (-> $$unsorted $$unsorted))) % 0.39/0.58 (define @t2 () (= (_ (_ tptp.fun_inv_image @t1) tptp.emptyset) tptp.emptyset)) % 0.39/0.58 (define @t3 () (@list @t1)) % 0.39/0.58 (define @t4 () (forall @t3 @t2)) % 0.39/0.58 (define @t5 () (not @t4)) % 0.39/0.58 (define @t6 () (@var "X" $$unsorted)) % 0.39/0.58 (define @t7 () (@var "M" (-> $$unsorted Bool))) % 0.39/0.58 (define @t8 () (lambda (@list @t6 @t7) (_ @t7 @t6))) % 0.39/0.58 (define @t9 () (@list @t6)) % 0.39/0.58 (define @t10 () (lambda @t9 false)) % 0.39/0.58 (define @t11 () (@var "Y" $$unsorted)) % 0.39/0.58 (define @t12 () (@var "U" $$unsorted)) % 0.39/0.58 (define @t13 () (= @t12 @t6)) % 0.39/0.58 (define @t14 () (lambda (@list @t6 @t11 @t12) (or @t13 (= @t12 @t11)))) % 0.39/0.58 (define @t15 () (lambda (@list @t6 @t12) @t13)) % 0.39/0.58 (define @t16 () (@var "Y" (-> $$unsorted Bool))) % 0.39/0.58 (define @t17 () (_ @t16 @t12)) % 0.39/0.58 (define @t18 () (@var "X" (-> $$unsorted Bool))) % 0.39/0.58 (define @t19 () (_ @t18 @t12)) % 0.39/0.58 (define @t20 () (@list @t18 @t16 @t12)) % 0.39/0.58 (define @t21 () (lambda @t20 (or @t19 @t17))) % 0.39/0.58 (define @t22 () (not @t19)) % 0.39/0.58 (define @t23 () (and @t19 (not @t17))) % 0.39/0.58 (define @t24 () (lambda @t20 (or @t23 (and @t22 @t17)))) % 0.39/0.58 (define @t25 () (and @t19 @t17)) % 0.39/0.58 (define @t26 () (lambda @t20 @t25)) % 0.39/0.58 (define @t27 () (lambda @t20 @t23)) % 0.39/0.58 (define @t28 () (lambda (@list @t18 @t12) @t22)) % 0.39/0.58 (define @t29 () (@list @t18 @t16)) % 0.39/0.58 (define @t30 () (lambda @t29 (= (_ (_ tptp.intersection @t18) @t16) tptp.emptyset))) % 0.39/0.58 (define @t31 () (@list @t12)) % 0.39/0.58 (define @t32 () (lambda @t29 (forall @t31 (=> @t19 @t17)))) % 0.39/0.58 (define @t33 () (exists @t31 @t25)) % 0.39/0.58 (define @t34 () (lambda @t29 @t33)) % 0.39/0.58 (define @t35 () (lambda @t29 (not @t33))) % 0.39/0.58 (define @t36 () (_ @t1 @t6)) % 0.39/0.58 (define @t37 () (= @t11 @t36)) % 0.39/0.58 (define @t38 () (@var "A" (-> $$unsorted Bool))) % 0.39/0.58 (define @t39 () (lambda (@list @t1 @t38 @t11) (exists @t9 (and (_ @t38 @t6) @t37)))) % 0.39/0.58 (define @t40 () (@var "G" (-> $$unsorted $$unsorted))) % 0.39/0.58 (define @t41 () (lambda (@list @t1 @t40 @t6) (_ @t40 @t36))) % 0.39/0.58 (define @t42 () (@var "B" (-> $$unsorted Bool))) % 0.39/0.58 (define @t43 () (_ @t42 @t11)) % 0.39/0.58 (define @t44 () (and @t43 @t37)) % 0.39/0.58 (define @t45 () (@list @t11)) % 0.39/0.58 (define @t46 () (exists @t45 @t44)) % 0.39/0.58 (define @t47 () (@list @t1 @t42 @t6)) % 0.39/0.58 (define @t48 () (lambda @t47 @t46)) % 0.39/0.58 (define @t49 () (_ @t1 @t11)) % 0.39/0.58 (define @t50 () (@list @t6 @t11)) % 0.39/0.58 (define @t51 () (lambda @t3 (forall @t50 (=> (= @t36 @t49) (= @t6 @t11))))) % 0.39/0.58 (define @t52 () (lambda @t3 (forall @t45 (exists @t9 @t37)))) % 0.39/0.58 (define @t53 () (lambda @t3 (and (_ tptp.fun_injective @t1) (_ tptp.fun_surjective @t1)))) % 0.39/0.58 (define @t54 () (@var "SMALLER" (-> $$unsorted $$unsorted Bool))) % 0.39/0.58 (define @t55 () (_ (_ @t54 @t6) @t11)) % 0.39/0.58 (define @t56 () (@list @t1 @t54)) % 0.39/0.58 (define @t57 () (lambda @t56 (forall @t50 (=> @t55 (_ (_ @t54 @t49) @t36))))) % 0.39/0.58 (define @t58 () (lambda @t56 (forall @t50 (=> @t55 (_ (_ @t54 @t36) @t49))))) % 0.39/0.58 (define @t59 () (@var "BOUND_VARIABLE_7845" $$unsorted)) % 0.39/0.58 (define @t60 () (lambda (@list @t59) false)) % 0.39/0.58 (define @t61 () (_ @t1 @t6)) % 0.39/0.58 (define @t62 () (_ @t60 @t61)) % 0.39/0.58 (define @t63 () (lambda @t9 @t62)) % 0.39/0.58 (define @t64 () (_ @t42 @t61)) % 0.39/0.58 (define @t65 () (lambda (@list @t42 @t6) @t64)) % 0.39/0.58 (define @t66 () (_ (lambda @t47 @t64) @t1)) % 0.39/0.58 (define @t67 () (= (_ @t66 @t10) @t10)) % 0.39/0.58 (define @t68 () (forall @t3 @t67)) % 0.39/0.58 (define @t69 () (not @t64)) % 0.39/0.58 (define @t70 () (not (= @t61 @t61))) % 0.39/0.58 (define @t71 () (or @t69 @t70)) % 0.39/0.58 (define @t72 () (not (= @t11 @t61))) % 0.39/0.58 (define @t73 () (_ @t42 @t11)) % 0.39/0.58 (define @t74 () (not @t73)) % 0.39/0.58 (define @t75 () (or @t72 @t74 @t72)) % 0.39/0.58 (define @t76 () (or @t74 @t72)) % 0.39/0.58 (define @t77 () (not @t37)) % 0.39/0.58 (define @t78 () (not @t43)) % 0.39/0.58 (define @t79 () (or @t78 @t77)) % 0.39/0.58 (define @t80 () (forall @t45 (not @t44))) % 0.39/0.58 (define @t81 () (not @t80)) % 0.39/0.58 (assume @p1 @t5) % 0.39/0.58 (assume @p2 true) % 0.39/0.58 (step @p3 (= tptp.in @t8) :rule refl :args (@t8)) % 0.39/0.58 (step @p4 (= tptp.is_a @t8) :rule refl :args (@t8)) % 0.39/0.58 (step @p5 (= tptp.emptyset @t10) :rule refl :args (@t10)) % 0.39/0.58 (step @p6 (= tptp.unord_pair @t14) :rule refl :args (@t14)) % 0.39/0.58 (step @p7 (= tptp.singleton @t15) :rule refl :args (@t15)) % 0.39/0.58 (step @p8 (= tptp.union @t21) :rule refl :args (@t21)) % 0.39/0.58 (step @p9 (= tptp.excl_union @t24) :rule refl :args (@t24)) % 0.39/0.58 (step @p10 (= tptp.intersection @t26) :rule refl :args (@t26)) % 0.39/0.58 (step @p11 (= tptp.setminus @t27) :rule refl :args (@t27)) % 0.39/0.58 (step @p12 (= tptp.complement @t28) :rule refl :args (@t28)) % 0.39/0.58 (step @p13 (= tptp.disjoint @t30) :rule refl :args (@t30)) % 0.39/0.58 (step @p14 (= tptp.subset @t32) :rule refl :args (@t32)) % 0.39/0.58 (step @p15 (= tptp.meets @t34) :rule refl :args (@t34)) % 0.39/0.58 (step @p16 (= tptp.misses @t35) :rule refl :args (@t35)) % 0.39/0.58 (step @p17 (= tptp.fun_image @t39) :rule refl :args (@t39)) % 0.39/0.58 (step @p18 (= tptp.fun_composition @t41) :rule refl :args (@t41)) % 0.39/0.58 (step @p19 (= tptp.fun_inv_image @t48) :rule refl :args (@t48)) % 0.39/0.58 (step @p20 (= tptp.fun_injective @t51) :rule refl :args (@t51)) % 0.39/0.58 (step @p21 (= tptp.fun_surjective @t52) :rule refl :args (@t52)) % 0.39/0.58 (step @p22 (= tptp.fun_bijective @t53) :rule refl :args (@t53)) % 0.39/0.58 (step @p23 (= tptp.fun_decreasing @t57) :rule refl :args (@t57)) % 0.39/0.58 (step @p24 (= tptp.fun_increasing @t58) :rule refl :args (@t58)) % 0.39/0.58 (step @p25 :rule evaluate :args ((not true))) % 0.39/0.58 (step @p26 :rule quant-unused-vars :args ((= (forall @t3 true) true))) % 0.39/0.58 (step @p27 :rule eq-refl :args (@t60)) % 0.39/0.58 (step @p28 :rule refl :args (@t60)) % 0.39/0.58 (step @p29 :rule symm :premises (@p28)) % 0.39/0.58 (step @p30 :rule alpha_equiv :args (@t10 (@list @t6) (@list @t59))) % 0.39/0.58 (step @p31 :rule trans :premises (@p30 @p29)) % 0.39/0.58 (step @p32 :rule beta-reduce :args ((= @t62 false))) % 0.39/0.58 (step @p33 :rule cong :premises (@p32) :args (@t63)) % 0.39/0.58 (step @p34 :rule trans :premises (@p33 @p31)) % 0.39/0.58 (step @p35 :rule beta-reduce :args ((= (_ @t65 @t60) @t63))) % 0.39/0.58 (step @p36 :rule trans :premises (@p35 @p34)) % 0.39/0.58 (step @p37 :rule beta-reduce :args ((= @t66 @t65))) % 0.39/0.58 (step @p38 :rule ho_cong :premises (@p37 @p31)) % 0.39/0.58 (step @p39 :rule trans :premises (@p38 @p36)) % 0.39/0.58 (step @p40 :rule cong :premises (@p39 @p31) :args (@t67)) % 0.39/0.58 (step @p41 :rule trans :premises (@p40 @p27)) % 0.39/0.58 (step @p42 :rule cong :premises (@p41) :args (@t68)) % 0.39/0.58 (step @p43 :rule trans :premises (@p42 @p26)) % 0.39/0.58 (step @p44 :rule cong :premises (@p43) :args ((not @t68))) % 0.39/0.58 (step @p45 :rule trans :premises (@p44 @p25)) % 0.39/0.58 (step @p46 :rule refl :args (@t1)) % 0.39/0.58 (step @p47 :rule bool-double-not-elim :args (@t64)) % 0.39/0.58 (step @p48 :rule aci_norm :args ((= (or @t69 false) @t69))) % 0.39/0.58 (step @p49 :rule eq-refl :args (@t61)) % 0.39/0.58 (step @p50 :rule cong :premises (@p49) :args (@t70)) % 0.39/0.58 (step @p51 :rule trans :premises (@p50 @p25)) % 0.39/0.58 (step @p52 :rule refl :args (@t69)) % 0.39/0.58 (step @p53 :rule nary_cong :premises (@p52 @p51) :args (@t71)) % 0.39/0.58 (step @p54 :rule trans :premises (@p53 @p48)) % 0.39/0.58 (step @p55 :rule quant-var-elim-eq :args ((= (forall @t45 @t75) @t71))) % 0.39/0.58 (step @p56 :rule aci_norm :args ((= @t76 @t75))) % 0.39/0.58 (step @p57 :rule cong :premises (@p56) :args ((forall @t45 @t76))) % 0.39/0.58 (step @p58 :rule trans :premises (@p57 @p55)) % 0.39/0.58 (step @p59 :rule trans :premises (@p58 @p54)) % 0.39/0.58 (step @p60 :rule refl :args (@t61)) % 0.39/0.58 (step @p61 :rule refl :args (@t36)) % 0.39/0.58 (step @p62 :rule cong :premises (@p61 @p60) :args ((= @t36 @t61))) % 0.39/0.58 (step @p63 :rule symm :premises (@p62)) % 0.39/0.58 (step @p64 :rule eq_resolve :premises (@p61 @p63)) % 0.39/0.58 (step @p65 :rule refl :args (@t11)) % 0.39/0.58 (step @p66 :rule cong :premises (@p65 @p64) :args (@t37)) % 0.39/0.58 (step @p67 :rule cong :premises (@p66) :args (@t77)) % 0.39/0.58 (step @p68 :rule refl :args (@t73)) % 0.39/0.58 (step @p69 :rule refl :args (@t43)) % 0.39/0.58 (step @p70 :rule cong :premises (@p69 @p68) :args ((= @t43 @t73))) % 0.39/0.58 (step @p71 :rule symm :premises (@p70)) % 0.39/0.58 (step @p72 :rule eq_resolve :premises (@p69 @p71)) % 0.39/0.58 (step @p73 :rule cong :premises (@p72) :args (@t78)) % 0.39/0.58 (step @p74 :rule nary_cong :premises (@p73 @p67) :args (@t79)) % 0.39/0.58 (step @p75 :rule cong :premises (@p74) :args ((forall @t45 @t79))) % 0.39/0.58 (step @p76 :rule trans :premises (@p75 @p59)) % 0.39/0.58 (step @p77 :rule bool-and-de-morgan :args (@t43 @t37 true)) % 0.39/0.58 (step @p78 :rule cong :premises (@p77) :args (@t80)) % 0.39/0.58 (step @p79 :rule trans :premises (@p78 @p76)) % 0.39/0.58 (step @p80 :rule cong :premises (@p79) :args (@t81)) % 0.39/0.58 (step @p81 :rule trans :premises (@p80 @p47)) % 0.39/0.58 (step @p82 :rule exists-elim :args ((= @t46 @t81))) % 0.39/0.58 (step @p83 :rule trans :premises (@p82 @p81)) % 0.39/0.58 (step @p84 :rule cong :premises (@p83) :args (@t48)) % 0.39/0.58 (step @p85 :rule trans :premises (@p19 @p84)) % 0.39/0.58 (step @p86 :rule ho_cong :premises (@p85 @p46)) % 0.39/0.58 (step @p87 :rule ho_cong :premises (@p86 @p5)) % 0.39/0.58 (step @p88 :rule cong :premises (@p87 @p5) :args (@t2)) % 0.39/0.58 (step @p89 :rule cong :premises (@p88) :args (@t4)) % 0.39/0.58 (step @p90 :rule cong :premises (@p89) :args (@t5)) % 0.39/0.58 (step @p91 :rule trans :premises (@p90 @p45)) % 0.39/0.58 (step @p92 false :rule eq_resolve :premises (@p1 @p91)) % 0.39/0.58 ) % 0.39/0.58 % SZS output end Proof % 0.39/0.58 % cvc5 exiting %------------------------------------------------------------------------------