%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SET017^1 : 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 : 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:46:58 AM UTC 2026 % Result : Theorem 0.37s 0.58s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET017^1 : TPTP v9.2.1. Released v3.6.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.15/0.34 % Computer : n007.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 14:39:56 EDT 2026 % 0.15/0.34 % CPUTime : % 0.29/0.49 %----Proving TH0 % 0.37/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.37/0.58 % SZS status Theorem % 0.37/0.58 % SZS output start Proof % 0.37/0.58 ( % 0.37/0.58 (declare-sort $$unsorted 0) % 0.37/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.37/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.37/0.58 (define tptp.emptyset () (lambda (@list (@var "X" $$unsorted)) false)) % 0.37/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.37/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.37/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.37/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.37/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.37/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.37/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.37/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.37/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.37/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.37/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.37/0.58 (define @t1 () (@var "Z" $$unsorted)) % 0.37/0.58 (define @t2 () (@var "Y" $$unsorted)) % 0.37/0.58 (define @t3 () (= @t2 @t1)) % 0.37/0.58 (define @t4 () (@var "X" $$unsorted)) % 0.37/0.58 (define @t5 () (_ tptp.unord_pair @t4)) % 0.37/0.58 (define @t6 () (= (_ @t5 @t2) (_ @t5 @t1))) % 0.37/0.58 (define @t7 () (=> @t6 @t3)) % 0.37/0.58 (define @t8 () (@list @t4 @t2 @t1)) % 0.37/0.58 (define @t9 () (forall @t8 @t7)) % 0.37/0.58 (define @t10 () (not @t9)) % 0.37/0.58 (define @t11 () (@var "M" (-> $$unsorted Bool))) % 0.37/0.58 (define @t12 () (lambda (@list @t4 @t11) (_ @t11 @t4))) % 0.37/0.58 (define @t13 () (lambda (@list @t4) false)) % 0.37/0.58 (define @t14 () (@var "U" $$unsorted)) % 0.37/0.58 (define @t15 () (= @t14 @t4)) % 0.37/0.58 (define @t16 () (or @t15 (= @t14 @t2))) % 0.37/0.58 (define @t17 () (@list @t4 @t2 @t14)) % 0.37/0.58 (define @t18 () (lambda @t17 @t16)) % 0.37/0.58 (define @t19 () (lambda (@list @t4 @t14) @t15)) % 0.37/0.58 (define @t20 () (@var "Y" (-> $$unsorted Bool))) % 0.37/0.58 (define @t21 () (_ @t20 @t14)) % 0.37/0.58 (define @t22 () (@var "X" (-> $$unsorted Bool))) % 0.37/0.58 (define @t23 () (_ @t22 @t14)) % 0.37/0.58 (define @t24 () (@list @t22 @t20 @t14)) % 0.37/0.58 (define @t25 () (lambda @t24 (or @t23 @t21))) % 0.37/0.58 (define @t26 () (not @t23)) % 0.37/0.58 (define @t27 () (and @t23 (not @t21))) % 0.37/0.58 (define @t28 () (lambda @t24 (or @t27 (and @t26 @t21)))) % 0.37/0.58 (define @t29 () (and @t23 @t21)) % 0.37/0.58 (define @t30 () (lambda @t24 @t29)) % 0.37/0.58 (define @t31 () (lambda @t24 @t27)) % 0.37/0.58 (define @t32 () (lambda (@list @t22 @t14) @t26)) % 0.37/0.58 (define @t33 () (@list @t22 @t20)) % 0.37/0.58 (define @t34 () (lambda @t33 (= (_ (_ tptp.intersection @t22) @t20) tptp.emptyset))) % 0.37/0.58 (define @t35 () (@list @t14)) % 0.37/0.58 (define @t36 () (lambda @t33 (forall @t35 (=> @t23 @t21)))) % 0.37/0.58 (define @t37 () (exists @t35 @t29)) % 0.37/0.58 (define @t38 () (lambda @t33 @t37)) % 0.37/0.58 (define @t39 () (lambda @t33 (not @t37))) % 0.37/0.58 (define @t40 () (= @t4 @t14)) % 0.37/0.58 (define @t41 () (or @t40 (= @t2 @t14))) % 0.37/0.58 (define @t42 () (lambda @t35 @t41)) % 0.37/0.58 (define @t43 () (= @t42 (lambda @t35 (or @t40 (= @t14 @t1))))) % 0.37/0.58 (define @t44 () (or @t40 (= @t1 @t14))) % 0.37/0.58 (define @t45 () (lambda @t35 @t44)) % 0.37/0.58 (define @t46 () (lambda (@list @t2 @t14) @t41)) % 0.37/0.58 (define @t47 () (_ (lambda @t17 @t41) @t4)) % 0.37/0.58 (define @t48 () (= (_ @t47 @t2) (_ @t47 @t1))) % 0.37/0.58 (define @t49 () (=> @t48 @t3)) % 0.37/0.58 (define @t50 () (forall @t8 @t49)) % 0.37/0.58 (define @t51 () (forall @t8 (or (not @t43) @t3))) % 0.37/0.58 (define @t52 () (@quantifiers_skolemize @t51 2)) % 0.37/0.58 (define @t53 () (@quantifiers_skolemize @t51 1)) % 0.37/0.58 (define @t54 () (= @t53 @t52)) % 0.37/0.58 (define @t55 () (@quantifiers_skolemize @t51 0)) % 0.37/0.58 (define @t56 () (= @t14 @t55)) % 0.37/0.58 (define @t57 () (or @t56 (= @t14 @t53))) % 0.37/0.58 (define @t58 () (lambda @t35 @t57)) % 0.37/0.58 (define @t59 () (@purify @t58)) % 0.37/0.58 (define @t60 () (= @t14 @t52)) % 0.37/0.58 (define @t61 () (or @t56 @t60)) % 0.37/0.58 (define @t62 () (lambda @t35 @t61)) % 0.37/0.58 (define @t63 () (@purify @t62)) % 0.37/0.58 (define @t64 () (= @t63 @t59)) % 0.37/0.58 (define @t65 () (not @t64)) % 0.37/0.58 (define @t66 () (or @t65 @t54)) % 0.37/0.58 (define @t67 () (not @t66)) % 0.37/0.58 (define @t68 () (not @t51)) % 0.37/0.58 (define @t69 () (= @t58 @t62)) % 0.37/0.58 (define @t70 () (not @t69)) % 0.37/0.58 (define @t71 () (or @t70 @t54)) % 0.37/0.58 (define @t72 () (not @t71)) % 0.37/0.58 (define @t73 () (= @t55 @t14)) % 0.37/0.58 (define @t74 () (or @t73 @t60)) % 0.37/0.58 (define @t75 () (lambda @t35 @t74)) % 0.37/0.58 (define @t76 () (or @t73 (= @t53 @t14))) % 0.37/0.58 (define @t77 () (lambda @t35 @t76)) % 0.37/0.58 (define @t78 () (= @t77 @t75)) % 0.37/0.58 (define @t79 () (not @t78)) % 0.37/0.58 (define @t80 () (or @t79 @t54)) % 0.37/0.58 (define @t81 () (not @t80)) % 0.37/0.58 (define @t82 () (@list true)) % 0.37/0.58 (define @t83 () (@list @t66)) % 0.37/0.58 (define @t84 () (forall @t35 (= @t61 @t57))) % 0.37/0.58 (define @t85 () (=> @t64 @t84)) % 0.37/0.58 (define @t86 () (forall @t35 (= @t57 @t61))) % 0.37/0.58 (define @t87 () (@list false)) % 0.37/0.58 (define @t88 () (= @t55 @t53)) % 0.37/0.58 (define @t89 () (= @t53 @t55)) % 0.37/0.58 (define @t90 () (= @t55 @t52)) % 0.37/0.58 (define @t91 () (or @t90 @t54)) % 0.37/0.58 (define @t92 () (= @t52 @t55)) % 0.37/0.58 (define @t93 () (or @t92 (= @t52 @t52))) % 0.37/0.58 (define @t94 () (or @t92 (= @t52 @t53))) % 0.37/0.58 (define @t95 () (= @t94 @t93)) % 0.37/0.58 (define @t96 () (@list true false)) % 0.37/0.58 (define @t97 () (or @t88 @t54)) % 0.37/0.58 (define @t98 () (not @t97)) % 0.37/0.58 (define @t99 () (or @t89 @t54)) % 0.37/0.58 (define @t100 () (or @t89 (= @t53 @t53))) % 0.37/0.58 (define @t101 () (= @t100 @t99)) % 0.37/0.58 (assume @p1 @t10) % 0.37/0.58 (assume @p2 true) % 0.37/0.58 (step @p3 (= tptp.in @t12) :rule refl :args (@t12)) % 0.37/0.58 (step @p4 (= tptp.is_a @t12) :rule refl :args (@t12)) % 0.37/0.58 (step @p5 (= tptp.emptyset @t13) :rule refl :args (@t13)) % 0.37/0.58 (step @p6 (= tptp.unord_pair @t18) :rule refl :args (@t18)) % 0.37/0.58 (step @p7 (= tptp.singleton @t19) :rule refl :args (@t19)) % 0.37/0.58 (step @p8 (= tptp.union @t25) :rule refl :args (@t25)) % 0.37/0.58 (step @p9 (= tptp.excl_union @t28) :rule refl :args (@t28)) % 0.37/0.58 (step @p10 (= tptp.intersection @t30) :rule refl :args (@t30)) % 0.37/0.58 (step @p11 (= tptp.setminus @t31) :rule refl :args (@t31)) % 0.37/0.58 (step @p12 (= tptp.complement @t32) :rule refl :args (@t32)) % 0.37/0.58 (step @p13 (= tptp.disjoint @t34) :rule refl :args (@t34)) % 0.37/0.58 (step @p14 (= tptp.subset @t36) :rule refl :args (@t36)) % 0.37/0.58 (step @p15 (= tptp.meets @t38) :rule refl :args (@t38)) % 0.37/0.58 (step @p16 (= tptp.misses @t39) :rule refl :args (@t39)) % 0.37/0.58 (step @p17 :rule bool-impl-elim :args (@t43 @t3)) % 0.37/0.58 (step @p18 :rule cong :premises (@p17) :args ((forall @t8 (=> @t43 @t3)))) % 0.37/0.58 (step @p19 :rule refl :args (@t3)) % 0.37/0.58 (step @p20 :rule eq-symm :args (@t1 @t14)) % 0.37/0.58 (step @p21 :rule refl :args (@t40)) % 0.37/0.58 (step @p22 :rule nary_cong :premises (@p21 @p20) :args (@t44)) % 0.37/0.58 (step @p23 :rule cong :premises (@p22) :args (@t45)) % 0.37/0.58 (step @p24 :rule beta-reduce :args ((= (_ @t46 @t1) @t45))) % 0.37/0.58 (step @p25 :rule trans :premises (@p24 @p23)) % 0.37/0.58 (step @p26 :rule refl :args (@t1)) % 0.37/0.58 (step @p27 :rule beta-reduce :args ((= @t47 @t46))) % 0.37/0.58 (step @p28 :rule ho_cong :premises (@p27 @p26)) % 0.37/0.58 (step @p29 :rule trans :premises (@p28 @p25)) % 0.37/0.58 (step @p30 :rule beta-reduce :args ((= (_ @t46 @t2) @t42))) % 0.37/0.58 (step @p31 :rule refl :args (@t2)) % 0.37/0.58 (step @p32 :rule ho_cong :premises (@p27 @p31)) % 0.37/0.58 (step @p33 :rule trans :premises (@p32 @p30)) % 0.37/0.58 (step @p34 :rule cong :premises (@p33 @p29) :args (@t48)) % 0.37/0.58 (step @p35 :rule cong :premises (@p34 @p19) :args (@t49)) % 0.37/0.58 (step @p36 :rule cong :premises (@p35) :args (@t50)) % 0.37/0.58 (step @p37 :rule trans :premises (@p36 @p18)) % 0.37/0.58 (step @p38 :rule cong :premises (@p37) :args ((not @t50))) % 0.37/0.58 (step @p39 :rule refl :args (@t4)) % 0.37/0.58 (step @p40 :rule eq-symm :args (@t14 @t2)) % 0.37/0.58 (step @p41 :rule eq-symm :args (@t14 @t4)) % 0.37/0.58 (step @p42 :rule nary_cong :premises (@p41 @p40) :args (@t16)) % 0.37/0.58 (step @p43 :rule cong :premises (@p42) :args (@t18)) % 0.37/0.58 (step @p44 :rule trans :premises (@p6 @p43)) % 0.37/0.58 (step @p45 :rule ho_cong :premises (@p44 @p39)) % 0.37/0.58 (step @p46 :rule ho_cong :premises (@p45 @p26)) % 0.37/0.58 (step @p47 :rule ho_cong :premises (@p45 @p31)) % 0.37/0.58 (step @p48 :rule cong :premises (@p47 @p46) :args (@t6)) % 0.37/0.58 (step @p49 :rule cong :premises (@p48 @p19) :args (@t7)) % 0.37/0.58 (step @p50 :rule cong :premises (@p49) :args (@t9)) % 0.37/0.58 (step @p51 :rule cong :premises (@p50) :args (@t10)) % 0.37/0.58 (step @p52 :rule trans :premises (@p51 @p38)) % 0.37/0.58 (step @p53 :rule eq_resolve :premises (@p1 @p52)) % 0.37/0.58 (step @p54 :rule refl :args (@t67)) % 0.37/0.58 (step @p55 :rule bool-double-not-elim :args (@t51)) % 0.37/0.58 (step @p56 :rule nary_cong :premises (@p55 @p54) :args ((or (not @t68) @t67))) % 0.37/0.58 (step @p57 :rule refl :args (@t54)) % 0.37/0.58 (step @p58 :rule eq-symm :args (@t59 @t63)) % 0.37/0.58 (step @p59 :rule eq-refl :args (@t62)) % 0.37/0.58 (step @p60 :rule skolem_intro :args (@t63)) % 0.37/0.58 (step @p61 :rule refl :args (@t62)) % 0.37/0.58 (step @p62 :rule cong :premises (@p61 @p60) :args ((= @t62 @t63))) % 0.37/0.58 (step @p63 :rule trans :premises (@p62 @p59)) % 0.37/0.58 (step @p64 :rule true_elim :premises (@p63)) % 0.37/0.58 (step @p65 :rule eq-refl :args (@t58)) % 0.37/0.58 (step @p66 :rule skolem_intro :args (@t59)) % 0.37/0.58 (step @p67 :rule refl :args (@t58)) % 0.37/0.58 (step @p68 :rule cong :premises (@p67 @p66) :args ((= @t58 @t59))) % 0.37/0.58 (step @p69 :rule trans :premises (@p68 @p65)) % 0.37/0.58 (step @p70 :rule true_elim :premises (@p69)) % 0.37/0.58 (step @p71 :rule cong :premises (@p70 @p64) :args (@t69)) % 0.37/0.58 (step @p72 :rule trans :premises (@p71 @p58)) % 0.37/0.58 (step @p73 :rule cong :premises (@p72) :args (@t70)) % 0.37/0.58 (step @p74 :rule nary_cong :premises (@p73 @p57) :args (@t71)) % 0.37/0.58 (step @p75 :rule cong :premises (@p74) :args (@t72)) % 0.37/0.58 (step @p76 :rule refl :args (@t68)) % 0.37/0.58 (step @p77 :rule cong :premises (@p76 @p75) :args ((=> @t68 @t72))) % 0.37/0.58 (step @p78 :rule refl :args (@t60)) % 0.37/0.58 (step @p79 :rule eq-symm :args (@t55 @t14)) % 0.37/0.58 (step @p80 :rule nary_cong :premises (@p79 @p78) :args (@t74)) % 0.37/0.58 (step @p81 :rule cong :premises (@p80) :args (@t75)) % 0.37/0.58 (step @p82 :rule eq-symm :args (@t53 @t14)) % 0.37/0.58 (step @p83 :rule nary_cong :premises (@p79 @p82) :args (@t76)) % 0.37/0.58 (step @p84 :rule cong :premises (@p83) :args (@t77)) % 0.37/0.58 (step @p85 :rule cong :premises (@p84 @p81) :args (@t78)) % 0.37/0.59 (step @p86 :rule cong :premises (@p85) :args (@t79)) % 0.37/0.59 (step @p87 :rule nary_cong :premises (@p86 @p57) :args (@t80)) % 0.37/0.59 (step @p88 :rule cong :premises (@p87) :args (@t81)) % 0.37/0.59 (step @p89 :rule cong :premises (@p76 @p88) :args ((=> @t68 @t81))) % 0.37/0.59 (step @p90 :rule trans :premises (@p89 @p77)) % 0.37/0.59 (assume-push @p172 @t68) % 0.37/0.59 (step @p92 :rule skolemize :premises (@p53)) % 0.37/0.59 (step-pop @p173 :rule scope :premises (@p92)) % 0.37/0.59 (step @p93 :rule process_scope :premises (@p173) :args (@t81)) % 0.37/0.59 (step @p95 :rule eq_resolve :premises (@p93 @p90)) % 0.37/0.59 (step @p96 :rule implies_elim :premises (@p95)) % 0.37/0.59 (step @p97 :rule eq_resolve :premises (@p96 @p56)) % 0.37/0.59 (step @p98 :rule chain_m_resolution :premises (@p97 @p53) :args (@t67 @t82 (@list @t51))) % 0.37/0.59 (step @p99 :rule bool-double-not-elim :args (@t64)) % 0.37/0.59 (step @p100 :rule refl :args (@t66)) % 0.37/0.59 (step @p101 :rule nary_cong :premises (@p100 @p99) :args ((or @t66 (not @t65)))) % 0.37/0.59 (step @p102 :rule cnf_or_neg :args (@t66 0)) % 0.37/0.59 (step @p103 :rule eq_resolve :premises (@p102 @p101)) % 0.37/0.59 (step @p104 :rule reordering :premises (@p103) :args ((or @t64 @t66))) % 0.37/0.59 (step @p105 :rule chain_m_resolution :premises (@p104 @p98) :args (@t64 @t82 @t83)) % 0.37/0.59 (step @p106 :rule eq-symm :args (@t61 @t57)) % 0.37/0.59 (step @p107 :rule cong :premises (@p106) :args (@t84)) % 0.37/0.59 (step @p108 :rule refl :args (@t64)) % 0.37/0.59 (step @p109 :rule cong :premises (@p108 @p107) :args (@t85)) % 0.37/0.59 ; WARNING: add trust step for TRUST % 0.37/0.59 ; trust TRUST THEORY_LEMMA % 0.37/0.59 (step @p110 :rule trust :premises () :args (@t85)) % 0.37/0.59 (step @p111 :rule eq_resolve :premises (@p110 @p109)) % 0.37/0.59 (step @p112 :rule implies_elim :premises (@p111)) % 0.37/0.59 (step @p113 :rule chain_m_resolution :premises (@p112 @p105) :args (@t86 @t87 (@list @t64))) % 0.37/0.59 (step @p114 :rule bool-eq-false :args (@t88)) % 0.37/0.59 (step @p115 :rule symm :premises (@p114)) % 0.37/0.59 (step @p116 :rule eq-symm :args (@t53 @t55)) % 0.37/0.59 (step @p117 :rule cong :premises (@p116) :args ((not @t89))) % 0.37/0.59 (step @p118 :rule bool-eq-false :args (@t89)) % 0.37/0.59 (step @p119 :rule trans :premises (@p118 @p117)) % 0.37/0.59 (step @p120 :rule trans :premises (@p119 @p115)) % 0.37/0.59 (step @p121 :rule cnf_or_neg :args (@t66 1)) % 0.37/0.59 (step @p122 :rule chain_m_resolution :premises (@p121 @p98) :args ((not @t54) @t82 @t83)) % 0.37/0.59 (step @p123 :rule false_intro :premises (@p122)) % 0.37/0.59 (step @p124 :rule bool-eq-true :args (@t91)) % 0.37/0.59 (step @p125 :rule absorb :args ((= (or @t90 true) true))) % 0.37/0.59 (step @p126 :rule eq-refl :args (@t52)) % 0.37/0.59 (step @p127 :rule eq-symm :args (@t52 @t55)) % 0.37/0.59 (step @p128 :rule nary_cong :premises (@p127 @p126) :args (@t93)) % 0.37/0.59 (step @p129 :rule trans :premises (@p128 @p125)) % 0.37/0.59 (step @p130 :rule eq-symm :args (@t52 @t53)) % 0.37/0.59 (step @p131 :rule nary_cong :premises (@p127 @p130) :args (@t94)) % 0.37/0.59 (step @p132 :rule cong :premises (@p131 @p129) :args (@t95)) % 0.37/0.59 (step @p133 :rule trans :premises (@p132 @p124)) % 0.37/0.59 (step @p134 :rule refl :args (@t86)) % 0.37/0.59 (step @p135 :rule cong :premises (@p134 @p133) :args ((=> @t86 @t95))) % 0.37/0.59 (assume-push @p174 @t86) % 0.37/0.59 (step @p137 :rule instantiate :premises (@p113) :args ((@list @t52))) % 0.37/0.59 (step-pop @p175 :rule scope :premises (@p137)) % 0.37/0.59 (step @p138 :rule process_scope :premises (@p175) :args (@t95)) % 0.37/0.59 (step @p140 :rule eq_resolve :premises (@p138 @p135)) % 0.37/0.59 (step @p141 :rule implies_elim :premises (@p140)) % 0.37/0.59 (step @p142 :rule chain_m_resolution :premises (@p141 @p113) :args (@t91 @t87 (@list @t86))) % 0.37/0.59 (step @p143 :rule cnf_or_pos :args (@t91)) % 0.37/0.59 (step @p144 :rule reordering :premises (@p143) :args ((or @t54 @t90 (not @t91)))) % 0.37/0.59 (step @p145 :rule chain_m_resolution :premises (@p144 @p122 @p142) :args (@t90 @t96 (@list @t54 @t91))) % 0.37/0.59 (step @p146 :rule refl :args (@t53)) % 0.37/0.59 (step @p147 :rule cong :premises (@p146 @p145) :args (@t89)) % 0.37/0.59 (step @p148 :rule trans :premises (@p147 @p123)) % 0.37/0.59 (step @p149 :rule eq_resolve :premises (@p148 @p120)) % 0.37/0.59 (step @p150 :rule false_elim :premises (@p149)) % 0.37/0.59 (step @p151 :rule cnf_or_pos :args (@t97)) % 0.37/0.59 (step @p152 :rule reordering :premises (@p151) :args ((or @t54 @t88 @t98))) % 0.37/0.59 (step @p153 :rule chain_m_resolution :premises (@p152 @p122 @p150) :args (@t98 (@list true true) (@list @t54 @t88))) % 0.37/0.59 (step @p154 :rule bool-eq-true :args (@t97)) % 0.37/0.59 (step @p155 :rule eq-symm :args (true @t97)) % 0.37/0.59 (step @p156 :rule trans :premises (@p155 @p154)) % 0.37/0.59 (step @p157 :rule nary_cong :premises (@p116 @p57) :args (@t99)) % 0.37/0.59 (step @p158 :rule absorb :args ((= (or @t88 true) true))) % 0.37/0.59 (step @p159 :rule eq-refl :args (@t53)) % 0.37/0.59 (step @p160 :rule nary_cong :premises (@p116 @p159) :args (@t100)) % 0.37/0.59 (step @p161 :rule trans :premises (@p160 @p158)) % 0.37/0.59 (step @p162 :rule cong :premises (@p161 @p157) :args (@t101)) % 0.37/0.59 (step @p163 :rule trans :premises (@p162 @p156)) % 0.37/0.59 (step @p164 :rule cong :premises (@p134 @p163) :args ((=> @t86 @t101))) % 0.37/0.59 (assume-push @p176 @t86) % 0.37/0.59 (step @p166 :rule instantiate :premises (@p113) :args ((@list @t53))) % 0.37/0.59 (step-pop @p177 :rule scope :premises (@p166)) % 0.37/0.59 (step @p167 :rule process_scope :premises (@p177) :args (@t101)) % 0.37/0.59 (step @p169 :rule eq_resolve :premises (@p167 @p164)) % 0.37/0.59 (step @p170 :rule implies_elim :premises (@p169)) % 0.37/0.59 (step @p171 false :rule chain_m_resolution :premises (@p170 @p153 @p113) :args (false @t96 (@list @t97 @t86))) % 0.37/0.59 ) % 0.37/0.59 % SZS output end Proof % 0.37/0.59 % cvc5 exiting %------------------------------------------------------------------------------