%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET630^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 : n003.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:18 AM UTC 2026 % Result : Theorem 0.42s 0.58s % Output : Proof 0.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SET630^3 : TPTP v9.2.1. Released v3.6.0. % 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n003.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Jun 2 16:05:14 EDT 2026 % 0.18/0.35 % CPUTime : % 0.34/0.51 %----Proving TH0 % 0.42/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.42/0.58 % SZS status Theorem % 0.42/0.58 % SZS output start Proof % 0.42/0.58 ( % 0.42/0.58 (declare-sort $$unsorted 0) % 0.42/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.42/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.42/0.58 (define tptp.emptyset () (lambda (@list (@var "X" $$unsorted)) false)) % 0.42/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.42/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.42/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.42/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.42/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.42/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.42/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.42/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.42/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.42/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.42/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.42/0.58 (define @t1 () (@var "Y" (-> $$unsorted Bool))) % 0.42/0.58 (define @t2 () (@var "X" (-> $$unsorted Bool))) % 0.42/0.58 (define @t3 () (_ (_ tptp.intersection @t2) @t1)) % 0.42/0.58 (define @t4 () (@list @t2 @t1)) % 0.42/0.58 (define @t5 () (forall @t4 (_ (_ tptp.misses @t3) (_ (_ tptp.excl_union @t2) @t1)))) % 0.42/0.58 (define @t6 () (not @t5)) % 0.42/0.58 (define @t7 () (@var "X" $$unsorted)) % 0.42/0.58 (define @t8 () (@var "M" (-> $$unsorted Bool))) % 0.42/0.58 (define @t9 () (lambda (@list @t7 @t8) (_ @t8 @t7))) % 0.42/0.58 (define @t10 () (lambda (@list @t7) false)) % 0.42/0.58 (define @t11 () (@var "Y" $$unsorted)) % 0.42/0.58 (define @t12 () (@var "U" $$unsorted)) % 0.42/0.58 (define @t13 () (= @t12 @t7)) % 0.42/0.58 (define @t14 () (lambda (@list @t7 @t11 @t12) (or @t13 (= @t12 @t11)))) % 0.42/0.58 (define @t15 () (lambda (@list @t7 @t12) @t13)) % 0.42/0.58 (define @t16 () (_ @t1 @t12)) % 0.42/0.58 (define @t17 () (_ @t2 @t12)) % 0.42/0.58 (define @t18 () (@list @t2 @t1 @t12)) % 0.42/0.58 (define @t19 () (lambda @t18 (or @t17 @t16))) % 0.42/0.58 (define @t20 () (not @t17)) % 0.42/0.58 (define @t21 () (and @t20 @t16)) % 0.42/0.58 (define @t22 () (not @t16)) % 0.42/0.58 (define @t23 () (and @t17 @t22)) % 0.42/0.58 (define @t24 () (or @t23 @t21)) % 0.42/0.58 (define @t25 () (lambda @t18 @t24)) % 0.42/0.58 (define @t26 () (and @t17 @t16)) % 0.42/0.58 (define @t27 () (lambda @t18 @t26)) % 0.42/0.58 (define @t28 () (lambda @t18 @t23)) % 0.42/0.58 (define @t29 () (lambda (@list @t2 @t12) @t20)) % 0.42/0.58 (define @t30 () (lambda @t4 (= @t3 tptp.emptyset))) % 0.42/0.58 (define @t31 () (@list @t12)) % 0.42/0.58 (define @t32 () (lambda @t4 (forall @t31 (=> @t17 @t16)))) % 0.42/0.58 (define @t33 () (exists @t31 @t26)) % 0.42/0.58 (define @t34 () (lambda @t4 @t33)) % 0.42/0.58 (define @t35 () (not @t33)) % 0.42/0.58 (define @t36 () (lambda @t4 @t35)) % 0.42/0.58 (define @t37 () (_ @t1 @t12)) % 0.42/0.58 (define @t38 () (not @t37)) % 0.42/0.58 (define @t39 () (_ @t2 @t12)) % 0.42/0.58 (define @t40 () (not @t39)) % 0.42/0.58 (define @t41 () (or @t40 @t38 (and (or @t40 @t37) (or @t39 @t38)))) % 0.42/0.58 (define @t42 () (forall @t18 @t41)) % 0.42/0.58 (define @t43 () (or @t17 @t22)) % 0.42/0.58 (define @t44 () (or @t20 @t16)) % 0.42/0.58 (define @t45 () (and @t44 @t43)) % 0.42/0.58 (define @t46 () (or @t40 @t38 @t45)) % 0.42/0.58 (define @t47 () (or @t40 @t38 (not @t24))) % 0.42/0.58 (define @t48 () (lambda @t31 @t24)) % 0.42/0.58 (define @t49 () (_ @t48 @t12)) % 0.42/0.58 (define @t50 () (not @t49)) % 0.42/0.58 (define @t51 () (or @t40 @t38 @t50)) % 0.42/0.58 (define @t52 () (forall @t31 @t51)) % 0.42/0.58 (define @t53 () (@var "BOUND_VARIABLE_7628" (-> $$unsorted Bool))) % 0.42/0.58 (define @t54 () (not (_ @t53 @t12))) % 0.42/0.58 (define @t55 () (@list @t53)) % 0.42/0.58 (define @t56 () (@list @t1 @t12)) % 0.42/0.58 (define @t57 () (lambda @t56 @t24)) % 0.42/0.58 (define @t58 () (_ @t25 @t2)) % 0.42/0.58 (define @t59 () (or @t20 @t22 @t54)) % 0.42/0.58 (define @t60 () (or @t20 @t22)) % 0.42/0.58 (define @t61 () (not @t26)) % 0.42/0.58 (define @t62 () (or @t61 @t54)) % 0.42/0.58 (define @t63 () (lambda @t31 @t26)) % 0.42/0.58 (define @t64 () (_ @t63 @t12)) % 0.42/0.58 (define @t65 () (not @t64)) % 0.42/0.58 (define @t66 () (or @t65 @t54)) % 0.42/0.58 (define @t67 () (forall @t31 @t66)) % 0.42/0.58 (define @t68 () (lambda @t55 @t67)) % 0.42/0.58 (define @t69 () (forall @t31 (or @t40 @t38))) % 0.42/0.58 (define @t70 () (lambda @t4 @t69)) % 0.42/0.58 (define @t71 () (lambda @t56 @t26)) % 0.42/0.58 (define @t72 () (_ @t27 @t2)) % 0.42/0.58 (define @t73 () (forall @t4 (_ (_ @t70 (_ @t72 @t1)) (_ @t58 @t1)))) % 0.42/0.58 (define @t74 () (forall @t31 @t61)) % 0.42/0.58 (define @t75 () (not @t74)) % 0.42/0.58 (define @t76 () (@quantifiers_skolemize @t42 2)) % 0.42/0.58 (define @t77 () (_ (@quantifiers_skolemize @t42 1) @t76)) % 0.42/0.58 (define @t78 () (not @t77)) % 0.42/0.58 (define @t79 () (_ (@quantifiers_skolemize @t42 0) @t76)) % 0.42/0.58 (define @t80 () (or @t79 @t78)) % 0.42/0.58 (define @t81 () (not @t79)) % 0.42/0.58 (define @t82 () (or @t81 @t77)) % 0.42/0.58 (define @t83 () (and @t82 @t80)) % 0.42/0.58 (define @t84 () (or @t81 @t78 @t83)) % 0.42/0.58 (define @t85 () (@list true)) % 0.42/0.58 (define @t86 () (@list @t84)) % 0.42/0.58 (define @t87 () (@list false)) % 0.42/0.58 (assume @p1 @t6) % 0.42/0.58 (assume @p2 true) % 0.42/0.58 (step @p3 (= tptp.in @t9) :rule refl :args (@t9)) % 0.42/0.58 (step @p4 (= tptp.is_a @t9) :rule refl :args (@t9)) % 0.42/0.58 (step @p5 (= tptp.emptyset @t10) :rule refl :args (@t10)) % 0.42/0.58 (step @p6 (= tptp.unord_pair @t14) :rule refl :args (@t14)) % 0.42/0.58 (step @p7 (= tptp.singleton @t15) :rule refl :args (@t15)) % 0.42/0.58 (step @p8 (= tptp.union @t19) :rule refl :args (@t19)) % 0.42/0.58 (step @p9 (= tptp.excl_union @t25) :rule refl :args (@t25)) % 0.42/0.58 (step @p10 (= tptp.intersection @t27) :rule refl :args (@t27)) % 0.42/0.58 (step @p11 (= tptp.setminus @t28) :rule refl :args (@t28)) % 0.42/0.58 (step @p12 (= tptp.complement @t29) :rule refl :args (@t29)) % 0.42/0.58 (step @p13 (= tptp.disjoint @t30) :rule refl :args (@t30)) % 0.42/0.58 (step @p14 (= tptp.subset @t32) :rule refl :args (@t32)) % 0.42/0.58 (step @p15 (= tptp.meets @t34) :rule refl :args (@t34)) % 0.42/0.58 (step @p16 (= tptp.misses @t36) :rule refl :args (@t36)) % 0.42/0.58 (step @p17 :rule quant-merge-prenex :args ((= (forall @t4 (forall @t31 @t41)) @t42))) % 0.42/0.58 (step @p18 :rule refl :args (@t37)) % 0.42/0.58 (step @p19 :rule refl :args (@t16)) % 0.42/0.58 (step @p20 :rule cong :premises (@p19 @p18) :args ((= @t16 @t37))) % 0.42/0.58 (step @p21 :rule symm :premises (@p20)) % 0.42/0.58 (step @p22 :rule eq_resolve :premises (@p19 @p21)) % 0.42/0.58 (step @p23 :rule cong :premises (@p22) :args (@t22)) % 0.42/0.58 (step @p24 :rule refl :args (@t39)) % 0.42/0.58 (step @p25 :rule refl :args (@t17)) % 0.42/0.58 (step @p26 :rule cong :premises (@p25 @p24) :args ((= @t17 @t39))) % 0.42/0.58 (step @p27 :rule symm :premises (@p26)) % 0.42/0.58 (step @p28 :rule eq_resolve :premises (@p25 @p27)) % 0.42/0.58 (step @p29 :rule nary_cong :premises (@p28 @p23) :args (@t43)) % 0.42/0.58 (step @p30 :rule cong :premises (@p28) :args (@t20)) % 0.42/0.58 (step @p31 :rule nary_cong :premises (@p30 @p22) :args (@t44)) % 0.42/0.58 (step @p32 :rule nary_cong :premises (@p31 @p29) :args (@t45)) % 0.42/0.58 (step @p33 :rule refl :args (@t38)) % 0.42/0.58 (step @p34 :rule refl :args (@t40)) % 0.42/0.58 (step @p35 :rule nary_cong :premises (@p34 @p33 @p32) :args (@t46)) % 0.42/0.58 (step @p36 :rule cong :premises (@p35) :args ((forall @t31 @t46))) % 0.42/0.58 (step @p37 :rule refl :args (@t22)) % 0.42/0.58 (step @p38 :rule bool-double-not-elim :args (@t17)) % 0.42/0.58 (step @p39 :rule nary_cong :premises (@p38 @p37) :args ((or (not @t20) @t22))) % 0.42/0.58 (step @p40 :rule bool-and-de-morgan :args (@t20 @t16 true)) % 0.42/0.58 (step @p41 :rule trans :premises (@p40 @p39)) % 0.42/0.58 (step @p42 :rule bool-double-not-elim :args (@t16)) % 0.42/0.58 (step @p43 :rule refl :args (@t20)) % 0.42/0.58 (step @p44 :rule nary_cong :premises (@p43 @p42) :args ((or @t20 (not @t22)))) % 0.42/0.58 (step @p45 :rule bool-and-de-morgan :args (@t17 @t22 true)) % 0.42/0.58 (step @p46 :rule trans :premises (@p45 @p44)) % 0.42/0.58 (step @p47 :rule nary_cong :premises (@p46 @p41) :args ((and (not @t23) (not @t21)))) % 0.42/0.58 (step @p48 :rule bool-or-de-morgan :args (@t23 @t21 false)) % 0.42/0.58 (step @p49 :rule trans :premises (@p48 @p47)) % 0.42/0.58 (step @p50 :rule nary_cong :premises (@p34 @p33 @p49) :args (@t47)) % 0.42/0.58 (step @p51 :rule cong :premises (@p50) :args ((forall @t31 @t47))) % 0.42/0.58 (step @p52 :rule trans :premises (@p51 @p36)) % 0.42/0.58 (step @p53 :rule beta-reduce :args ((= @t49 @t24))) % 0.42/0.58 (step @p54 :rule cong :premises (@p53) :args (@t50)) % 0.42/0.58 (step @p55 :rule refl :args (@t38)) % 0.42/0.58 (step @p56 :rule refl :args (@t40)) % 0.42/0.58 (step @p57 :rule nary_cong :premises (@p56 @p55 @p54) :args (@t51)) % 0.42/0.58 (step @p58 :rule cong :premises (@p57) :args (@t52)) % 0.42/0.58 (step @p59 :rule trans :premises (@p58 @p52)) % 0.42/0.58 (step @p60 :rule beta-reduce :args ((= (_ (lambda @t55 (forall @t31 (or @t40 @t38 @t54))) @t48) @t52))) % 0.42/0.58 (step @p61 :rule trans :premises (@p60 @p59)) % 0.42/0.58 (step @p62 :rule beta-reduce :args ((= (_ @t57 @t1) @t48))) % 0.42/0.58 (step @p63 :rule refl :args (@t1)) % 0.42/0.58 (step @p64 :rule beta-reduce :args ((= @t58 @t57))) % 0.42/0.58 (step @p65 :rule ho_cong :premises (@p64 @p63)) % 0.42/0.58 (step @p66 :rule trans :premises (@p65 @p62)) % 0.42/0.58 (step @p67 :rule refl :args (@t54)) % 0.42/0.58 (step @p68 :rule nary_cong :premises (@p30 @p23 @p67) :args (@t59)) % 0.42/0.58 (step @p69 :rule cong :premises (@p68) :args ((forall @t31 @t59))) % 0.42/0.58 (step @p70 :rule aci_norm :args ((= (or @t60 @t54) @t59))) % 0.42/0.58 (step @p71 :rule bool-and-de-morgan :args (@t17 @t16 true)) % 0.42/0.58 (step @p72 :rule nary_cong :premises (@p71 @p67) :args (@t62)) % 0.42/0.58 (step @p73 :rule trans :premises (@p72 @p70)) % 0.42/0.58 (step @p74 :rule cong :premises (@p73) :args ((forall @t31 @t62))) % 0.42/0.58 (step @p75 :rule trans :premises (@p74 @p69)) % 0.42/0.58 (step @p76 :rule refl :args (@t54)) % 0.42/0.58 (step @p77 :rule beta-reduce :args ((= @t64 @t26))) % 0.42/0.58 (step @p78 :rule cong :premises (@p77) :args (@t65)) % 0.42/0.58 (step @p79 :rule nary_cong :premises (@p78 @p76) :args (@t66)) % 0.42/0.58 (step @p80 :rule cong :premises (@p79) :args (@t67)) % 0.42/0.58 (step @p81 :rule trans :premises (@p80 @p75)) % 0.42/0.58 (step @p82 :rule cong :premises (@p81) :args (@t68)) % 0.42/0.58 (step @p83 :rule beta-reduce :args ((= (_ (lambda (@list @t2 @t53) (forall @t31 (or @t40 @t54))) @t63) @t68))) % 0.42/0.58 (step @p84 :rule trans :premises (@p83 @p82)) % 0.42/0.58 (step @p85 :rule refl :args (@t63)) % 0.42/0.58 (step @p86 :rule alpha_equiv :args (@t70 (@list @t1) (@list @t53))) % 0.42/0.58 (step @p87 :rule ho_cong :premises (@p86 @p85)) % 0.42/0.58 (step @p88 :rule trans :premises (@p87 @p84)) % 0.42/0.58 (step @p89 :rule beta-reduce :args ((= (_ @t71 @t1) @t63))) % 0.42/0.58 (step @p90 :rule beta-reduce :args ((= @t72 @t71))) % 0.42/0.58 (step @p91 :rule ho_cong :premises (@p90 @p63)) % 0.42/0.58 (step @p92 :rule trans :premises (@p91 @p89)) % 0.42/0.58 (step @p93 :rule refl :args (@t70)) % 0.42/0.58 (step @p94 :rule ho_cong :premises (@p93 @p92)) % 0.42/0.58 (step @p95 :rule trans :premises (@p94 @p88)) % 0.42/0.58 (step @p96 :rule ho_cong :premises (@p95 @p66)) % 0.42/0.58 (step @p97 :rule trans :premises (@p96 @p61)) % 0.42/0.58 (step @p98 :rule cong :premises (@p97) :args (@t73)) % 0.42/0.58 (step @p99 :rule trans :premises (@p98 @p17)) % 0.42/0.58 (step @p100 :rule cong :premises (@p99) :args ((not @t73))) % 0.42/0.58 (step @p101 :rule refl :args (@t2)) % 0.42/0.58 (step @p102 :rule ho_cong :premises (@p9 @p101)) % 0.42/0.58 (step @p103 :rule ho_cong :premises (@p102 @p63)) % 0.42/0.58 (step @p104 :rule ho_cong :premises (@p10 @p101)) % 0.42/0.58 (step @p105 :rule ho_cong :premises (@p104 @p63)) % 0.42/0.58 (step @p106 :rule bool-double-not-elim :args (@t69)) % 0.42/0.58 (step @p107 :rule nary_cong :premises (@p30 @p23) :args (@t60)) % 0.42/0.58 (step @p108 :rule cong :premises (@p107) :args ((forall @t31 @t60))) % 0.42/0.58 (step @p109 :rule cong :premises (@p71) :args (@t74)) % 0.42/0.58 (step @p110 :rule trans :premises (@p109 @p108)) % 0.42/0.58 (step @p111 :rule cong :premises (@p110) :args (@t75)) % 0.42/0.58 (step @p112 :rule exists-elim :args ((= @t33 @t75))) % 0.42/0.58 (step @p113 :rule trans :premises (@p112 @p111)) % 0.42/0.58 (step @p114 :rule cong :premises (@p113) :args (@t35)) % 0.42/0.58 (step @p115 :rule trans :premises (@p114 @p106)) % 0.42/0.58 (step @p116 :rule cong :premises (@p115) :args (@t36)) % 0.42/0.58 (step @p117 :rule trans :premises (@p16 @p116)) % 0.42/0.58 (step @p118 :rule ho_cong :premises (@p117 @p105)) % 0.42/0.58 (step @p119 :rule ho_cong :premises (@p118 @p103)) % 0.42/0.58 (step @p120 :rule cong :premises (@p119) :args (@t5)) % 0.42/0.58 (step @p121 :rule cong :premises (@p120) :args (@t6)) % 0.42/0.58 (step @p122 :rule trans :premises (@p121 @p100)) % 0.42/0.58 (step @p123 :rule eq_resolve :premises (@p1 @p122)) % 0.42/0.58 (step @p124 :rule skolemize :premises (@p123)) % 0.42/0.58 (step @p125 :rule cnf_or_neg :args (@t84 2)) % 0.42/0.58 (step @p126 :rule chain_m_resolution :premises (@p125 @p124) :args ((not @t83) @t85 @t86)) % 0.42/0.58 (step @p127 :rule bool-double-not-elim :args (@t79)) % 0.42/0.58 (step @p128 :rule refl :args (@t84)) % 0.42/0.58 (step @p129 :rule nary_cong :premises (@p128 @p127) :args ((or @t84 (not @t81)))) % 0.42/0.58 (step @p130 :rule cnf_or_neg :args (@t84 0)) % 0.42/0.58 (step @p131 :rule eq_resolve :premises (@p130 @p129)) % 0.42/0.58 (step @p132 :rule reordering :premises (@p131) :args ((or @t79 @t84))) % 0.42/0.58 (step @p133 :rule chain_m_resolution :premises (@p132 @p124) :args (@t79 @t85 @t86)) % 0.42/0.58 (step @p134 :rule cnf_or_neg :args (@t80 0)) % 0.42/0.58 (step @p135 :rule reordering :premises (@p134) :args ((or @t81 @t80))) % 0.42/0.58 (step @p136 :rule chain_m_resolution :premises (@p135 @p133) :args (@t80 @t87 (@list @t79))) % 0.42/0.58 (step @p137 :rule bool-double-not-elim :args (@t77)) % 0.42/0.58 (step @p138 :rule nary_cong :premises (@p128 @p137) :args ((or @t84 (not @t78)))) % 0.42/0.58 (step @p139 :rule cnf_or_neg :args (@t84 1)) % 0.42/0.58 (step @p140 :rule eq_resolve :premises (@p139 @p138)) % 0.42/0.58 (step @p141 :rule reordering :premises (@p140) :args ((or @t77 @t84))) % 0.42/0.58 (step @p142 :rule chain_m_resolution :premises (@p141 @p124) :args (@t77 @t85 @t86)) % 0.42/0.58 (step @p143 :rule cnf_or_neg :args (@t82 1)) % 0.42/0.58 (step @p144 :rule reordering :premises (@p143) :args ((or @t78 @t82))) % 0.42/0.58 (step @p145 :rule chain_m_resolution :premises (@p144 @p142) :args (@t82 @t87 (@list @t77))) % 0.42/0.58 (step @p146 :rule cnf_and_neg :args (@t83)) % 0.42/0.58 (step @p147 false :rule chain_m_resolution :premises (@p146 @p145 @p136 @p126) :args (false (@list false false true) (@list @t82 @t80 @t83))) % 0.42/0.58 ) % 0.42/0.58 % SZS output end Proof % 0.42/0.58 % cvc5 exiting %------------------------------------------------------------------------------