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