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