%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : DAT103_1 : TPTP v9.2.1. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n018.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:14:31 AM UTC 2026 % Result : Theorem 0.40s 0.63s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT103_1 : TPTP v9.2.1. Released v6.1.0. % 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n018.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Mon Jun 1 22:28:35 EDT 2026 % 0.16/0.34 % CPUTime : % 0.26/0.49 %----Proving TF0_ARI % 0.40/0.63 --- Run --finite-model-find --decision=internal at 45... % 0.40/0.63 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60... % 0.40/0.63 % SZS status Theorem % 0.40/0.63 % SZS output start Proof % 0.40/0.63 ( % 0.40/0.63 (declare-sort tptp.list 0) % 0.40/0.63 (declare-const tptp.inRange (-> Int tptp.list Bool)) % 0.40/0.63 (declare-const tptp.nil tptp.list) % 0.40/0.63 (declare-const tptp.tail (-> tptp.list tptp.list)) % 0.40/0.63 (declare-const tptp.head (-> tptp.list Int)) % 0.40/0.63 (declare-const tptp.cons (-> Int tptp.list tptp.list)) % 0.40/0.63 (define @t1 () (@var "K" Int)) % 0.40/0.63 (define @t2 () (@var "L" tptp.list)) % 0.40/0.63 (define @t3 () (tptp.cons @t1 @t2)) % 0.40/0.63 (define @t4 () (tptp.head @t3)) % 0.40/0.63 (define @t5 () (= @t4 @t1)) % 0.40/0.63 (define @t6 () (@list @t1 @t2)) % 0.40/0.63 (define @t7 () (forall @t6 @t5)) % 0.40/0.63 (define @t8 () (tptp.head @t2)) % 0.40/0.63 (define @t9 () (= @t2 tptp.nil)) % 0.40/0.63 (define @t10 () (@var "T" tptp.list)) % 0.40/0.63 (define @t11 () (@var "N" Int)) % 0.40/0.63 (define @t12 () (tptp.inRange @t11 @t10)) % 0.40/0.63 (define @t13 () (tptp.cons @t1 @t10)) % 0.40/0.63 (define @t14 () (= @t2 @t13)) % 0.40/0.63 (define @t15 () (and @t14 (<= 0 @t1) (< @t1 @t11) @t12)) % 0.40/0.63 (define @t16 () (@list @t1 @t10)) % 0.40/0.63 (define @t17 () (exists @t16 @t15)) % 0.40/0.63 (define @t18 () (or @t9 @t17)) % 0.40/0.63 (define @t19 () (tptp.inRange @t11 @t2)) % 0.40/0.63 (define @t20 () (= @t19 @t18)) % 0.40/0.63 (define @t21 () (@list @t11 @t2)) % 0.40/0.63 (define @t22 () (forall @t21 @t20)) % 0.40/0.63 (define @t23 () (- @t11 @t8)) % 0.40/0.63 (define @t24 () (not @t9)) % 0.40/0.63 (define @t25 () (and @t24 @t19 (< @t23 1))) % 0.40/0.63 (define @t26 () (@list @t2 @t11)) % 0.40/0.63 (define @t27 () (exists @t26 @t25)) % 0.40/0.63 (define @t28 () (+ @t11 (* -1 @t8))) % 0.40/0.63 (define @t29 () (>= @t28 1)) % 0.40/0.63 (define @t30 () (not @t19)) % 0.40/0.63 (define @t31 () (= tptp.nil @t2)) % 0.40/0.63 (define @t32 () (not @t29)) % 0.40/0.63 (define @t33 () (not @t32)) % 0.40/0.63 (define @t34 () (not @t31)) % 0.40/0.63 (define @t35 () (not @t34)) % 0.40/0.63 (define @t36 () (or @t35 @t30 @t33)) % 0.40/0.63 (define @t37 () (and @t34 @t19 @t32)) % 0.40/0.63 (define @t38 () (forall @t26 (not @t37))) % 0.40/0.63 (define @t39 () (not @t38)) % 0.40/0.63 (define @t40 () (>= @t23 1)) % 0.40/0.63 (define @t41 () (forall @t26 (or @t31 @t30 @t29))) % 0.40/0.63 (define @t42 () (@quantifiers_skolemize @t41 0)) % 0.40/0.63 (define @t43 () (tptp.head @t42)) % 0.40/0.63 (define @t44 () (* -1 @t43)) % 0.40/0.63 (define @t45 () (@quantifiers_skolemize @t41 1)) % 0.40/0.63 (define @t46 () (+ @t45 @t44)) % 0.40/0.63 (define @t47 () (>= @t46 1)) % 0.40/0.63 (define @t48 () (tptp.inRange @t45 @t42)) % 0.40/0.63 (define @t49 () (not @t48)) % 0.40/0.63 (define @t50 () (= tptp.nil @t42)) % 0.40/0.63 (define @t51 () (or @t50 @t49 @t47)) % 0.40/0.63 (define @t52 () (not @t47)) % 0.40/0.63 (define @t53 () (@list true)) % 0.40/0.63 (define @t54 () (@list @t51)) % 0.40/0.63 (define @t55 () (not @t12)) % 0.40/0.63 (define @t56 () (+ @t1 (* -1 @t11))) % 0.40/0.63 (define @t57 () (>= @t56 0)) % 0.40/0.63 (define @t58 () (>= @t1 0)) % 0.40/0.63 (define @t59 () (not @t58)) % 0.40/0.63 (define @t60 () (not @t14)) % 0.40/0.63 (define @t61 () (not @t57)) % 0.40/0.63 (define @t62 () (not @t61)) % 0.40/0.63 (define @t63 () (or @t60 @t59 @t62 @t55)) % 0.40/0.63 (define @t64 () (and @t14 @t58 @t61 @t12)) % 0.40/0.63 (define @t65 () (forall @t16 (not @t64))) % 0.40/0.63 (define @t66 () (not @t65)) % 0.40/0.63 (define @t67 () (>= @t1 @t11)) % 0.40/0.63 (define @t68 () (not (tptp.inRange @t45 @t10))) % 0.40/0.63 (define @t69 () (* -1 @t45)) % 0.40/0.63 (define @t70 () (>= (+ @t1 @t69) 0)) % 0.40/0.63 (define @t71 () (not (= @t42 @t13))) % 0.40/0.63 (define @t72 () (or @t71 @t59 @t70 @t68)) % 0.40/0.63 (define @t73 () (forall @t16 @t72)) % 0.40/0.63 (define @t74 () (not @t73)) % 0.40/0.63 (define @t75 () (or @t50 @t74)) % 0.40/0.63 (define @t76 () (= @t48 @t75)) % 0.40/0.63 (define @t77 () (forall @t21 (= @t19 (or @t31 (not (forall @t16 (or @t60 @t59 @t57 @t55))))))) % 0.40/0.63 (define @t78 () (forall @t16 (or (not (= @t13 @t42)) @t59 @t70 @t68))) % 0.40/0.63 (define @t79 () (not @t78)) % 0.40/0.63 (define @t80 () (or @t50 @t79)) % 0.40/0.63 (define @t81 () (= @t48 @t80)) % 0.40/0.63 (define @t82 () (@quantifiers_skolemize @t78 1)) % 0.40/0.63 (define @t83 () (not (tptp.inRange @t45 @t82))) % 0.40/0.63 (define @t84 () (@quantifiers_skolemize @t78 0)) % 0.40/0.63 (define @t85 () (* -1 @t84)) % 0.40/0.63 (define @t86 () (+ @t45 @t85)) % 0.40/0.63 (define @t87 () (>= @t86 1)) % 0.40/0.63 (define @t88 () (not @t87)) % 0.40/0.63 (define @t89 () (not (>= @t84 0))) % 0.40/0.63 (define @t90 () (tptp.cons @t84 @t82)) % 0.40/0.63 (define @t91 () (= @t42 @t90)) % 0.40/0.63 (define @t92 () (not @t91)) % 0.40/0.63 (define @t93 () (or @t92 @t89 @t88 @t83)) % 0.40/0.63 (define @t94 () (not @t93)) % 0.40/0.63 (define @t95 () (+ @t69 @t84)) % 0.40/0.63 (define @t96 () (+ @t86 1)) % 0.40/0.63 (define @t97 () (+ @t84 @t69)) % 0.40/0.63 (define @t98 () (>= @t97 0)) % 0.40/0.63 (define @t99 () (not (= @t90 @t42))) % 0.40/0.63 (define @t100 () (or @t99 @t89 @t98 @t83)) % 0.40/0.63 (define @t101 () (not @t100)) % 0.40/0.63 (define @t102 () (@list @t93)) % 0.40/0.63 (define @t103 () (tptp.head @t90)) % 0.40/0.63 (define @t104 () (= @t84 @t103)) % 0.40/0.63 (define @t105 () (not @t104)) % 0.40/0.63 (define @t106 () (= @t43 @t84)) % 0.40/0.63 (define @t107 () (+ @t84 @t44)) % 0.40/0.63 (define @t108 () (= @t107 0)) % 0.40/0.63 (define @t109 () (* -1 1)) % 0.40/0.63 (define @t110 () (* -1 0)) % 0.40/0.63 (define @t111 () (+ @t110 @t109 1)) % 0.40/0.63 (define @t112 () (* 0 @t45)) % 0.40/0.63 (define @t113 () (* 0 @t43)) % 0.40/0.63 (define @t114 () (+ @t84 @t85 @t113 @t112)) % 0.40/0.63 (define @t115 () (+ (* -1 @t107) (* -1 @t86) @t46)) % 0.40/0.63 (define @t116 () (>= @t115 @t111)) % 0.40/0.63 (define @t117 () (- @t84 @t43)) % 0.40/0.63 (define @t118 () (= @t84 @t43)) % 0.40/0.63 (define @t119 () (and @t52 @t87 @t106)) % 0.40/0.63 (assume @p1 @t7) % 0.40/0.63 (assume @p2 (forall @t6 (= (tptp.tail @t3) @t2))) % 0.40/0.63 (assume @p3 (forall (@list @t2) (or @t9 (= @t2 (tptp.cons @t8 (tptp.tail @t2)))))) % 0.40/0.63 (assume @p4 (forall @t6 (not (= @t3 tptp.nil)))) % 0.40/0.63 (assume @p5 @t22) % 0.40/0.63 (assume @p6 (not (not @t27))) % 0.40/0.63 (assume @p7 true) % 0.40/0.63 (step @p8 :rule bool-double-not-elim :args (@t29)) % 0.40/0.63 (step @p9 :rule refl :args (@t30)) % 0.40/0.63 (step @p10 :rule bool-double-not-elim :args (@t31)) % 0.40/0.63 (step @p11 :rule nary_cong :premises (@p10 @p9 @p8) :args (@t36)) % 0.40/0.63 (step @p12 :rule aci_norm :args ((= (or @t35 (or @t30 @t33)) @t36))) % 0.40/0.63 (step @p13 :rule trans :premises (@p12 @p11)) % 0.40/0.63 (step @p14 :rule bool-and-de-morgan :args (@t19 @t32 true)) % 0.40/0.63 (step @p15 :rule refl :args (@t35)) % 0.40/0.63 (step @p16 :rule nary_cong :premises (@p15 @p14) :args ((or @t35 (not (and @t19 @t32))))) % 0.40/0.63 (step @p17 :rule bool-and-de-morgan :args (@t34 @t19 (and @t32))) % 0.40/0.63 (step @p18 :rule trans :premises (@p17 @p16)) % 0.40/0.63 (step @p19 :rule trans :premises (@p18 @p13)) % 0.40/0.63 (step @p20 :rule cong :premises (@p19) :args (@t38)) % 0.40/0.63 (step @p21 :rule cong :premises (@p20) :args (@t39)) % 0.40/0.63 (step @p22 :rule exists-elim :args ((= (exists @t26 @t37) @t39))) % 0.40/0.63 (step @p23 :rule trans :premises (@p22 @p21)) % 0.40/0.63 (step @p24 :rule refl :args (1)) % 0.40/0.63 (step @p25 :rule arith_poly_norm :args ((= @t23 @t28))) % 0.40/0.63 (step @p26 :rule cong :premises (@p25 @p24) :args (@t40)) % 0.40/0.63 (step @p27 :rule cong :premises (@p26) :args ((not @t40))) % 0.40/0.63 (step @p28 :rule arith-elim-lt :args (@t23 1)) % 0.40/0.63 (step @p29 :rule trans :premises (@p28 @p27)) % 0.40/0.63 (step @p30 :rule refl :args (@t19)) % 0.40/0.63 (step @p31 :rule eq-symm :args (@t2 tptp.nil)) % 0.40/0.63 (step @p32 :rule cong :premises (@p31) :args (@t24)) % 0.40/0.63 (step @p33 :rule nary_cong :premises (@p32 @p30 @p29) :args (@t25)) % 0.40/0.63 (step @p34 :rule cong :premises (@p33) :args (@t27)) % 0.40/0.63 (step @p35 :rule trans :premises (@p34 @p23)) % 0.40/0.63 (step @p36 :rule bool-double-not-elim :args (@t27)) % 0.40/0.63 (step @p37 :rule trans :premises (@p36 @p35)) % 0.40/0.63 (step @p38 :rule eq_resolve :premises (@p6 @p37)) % 0.40/0.63 (step @p39 :rule skolemize :premises (@p38)) % 0.40/0.63 (step @p40 :rule cnf_or_neg :args (@t51 2)) % 0.40/0.63 (step @p41 :rule chain_m_resolution :premises (@p40 @p39) :args (@t52 @t53 @t54)) % 0.40/0.63 (step @p42 :rule refl :args (@t55)) % 0.40/0.63 (step @p43 :rule bool-double-not-elim :args (@t57)) % 0.40/0.63 (step @p44 :rule refl :args (@t59)) % 0.40/0.63 (step @p45 :rule refl :args (@t60)) % 0.40/0.63 (step @p46 :rule nary_cong :premises (@p45 @p44 @p43 @p42) :args (@t63)) % 0.40/0.63 (step @p47 :rule aci_norm :args ((= (or @t60 (or @t59 (or @t62 @t55))) @t63))) % 0.40/0.63 (step @p48 :rule trans :premises (@p47 @p46)) % 0.40/0.63 (step @p49 :rule bool-and-de-morgan :args (@t61 @t12 true)) % 0.40/0.63 (step @p50 :rule nary_cong :premises (@p44 @p49) :args ((or @t59 (not (and @t61 @t12))))) % 0.40/0.63 (step @p51 :rule bool-and-de-morgan :args (@t58 @t61 (and @t12))) % 0.40/0.63 (step @p52 :rule trans :premises (@p51 @p50)) % 0.40/0.63 (step @p53 :rule nary_cong :premises (@p45 @p52) :args ((or @t60 (not (and @t58 @t61 @t12))))) % 0.40/0.63 (step @p54 :rule bool-and-de-morgan :args (@t14 @t58 (and @t61 @t12))) % 0.40/0.63 (step @p55 :rule trans :premises (@p54 @p53)) % 0.40/0.63 (step @p56 :rule trans :premises (@p55 @p48)) % 0.40/0.63 (step @p57 :rule cong :premises (@p56) :args (@t65)) % 0.40/0.63 (step @p58 :rule cong :premises (@p57) :args (@t66)) % 0.40/0.63 (step @p59 :rule exists-elim :args ((= (exists @t16 @t64) @t66))) % 0.40/0.63 (step @p60 :rule trans :premises (@p59 @p58)) % 0.40/0.63 (step @p61 :rule refl :args (@t12)) % 0.40/0.63 (step @p62 :rule arith_poly_norm :args ((= (* 1 (- @t1 @t11)) (* 1 (- @t56 0))))) % 0.40/0.63 (step @p63 :rule arith_poly_norm_rel :premises (@p62) :args ((= @t67 @t57))) % 0.40/0.63 (step @p64 :rule cong :premises (@p63) :args ((not @t67))) % 0.40/0.63 (step @p65 :rule arith-elim-lt :args (@t1 @t11)) % 0.40/0.63 (step @p66 :rule trans :premises (@p65 @p64)) % 0.40/0.63 (step @p67 :rule arith-elim-leq :args (0 @t1)) % 0.40/0.63 (step @p68 :rule refl :args (@t14)) % 0.40/0.63 (step @p69 :rule nary_cong :premises (@p68 @p67 @p66 @p61) :args (@t15)) % 0.40/0.63 (step @p70 :rule cong :premises (@p69) :args (@t17)) % 0.40/0.63 (step @p71 :rule trans :premises (@p70 @p60)) % 0.40/0.63 (step @p72 :rule nary_cong :premises (@p31 @p71) :args (@t18)) % 0.40/0.63 (step @p73 :rule cong :premises (@p30 @p72) :args (@t20)) % 0.40/0.63 (step @p74 :rule cong :premises (@p73) :args (@t22)) % 0.40/0.63 (step @p75 :rule eq_resolve :premises (@p5 @p74)) % 0.40/0.63 (step @p76 :rule refl :args (@t68)) % 0.40/0.63 (step @p77 :rule refl :args (@t70)) % 0.40/0.63 (step @p78 :rule refl :args (@t59)) % 0.40/0.63 (step @p79 :rule eq-symm :args (@t42 @t13)) % 0.40/0.63 (step @p80 :rule cong :premises (@p79) :args (@t71)) % 0.40/0.63 (step @p81 :rule nary_cong :premises (@p80 @p78 @p77 @p76) :args (@t72)) % 0.40/0.63 (step @p82 :rule cong :premises (@p81) :args (@t73)) % 0.40/0.63 (step @p83 :rule cong :premises (@p82) :args (@t74)) % 0.40/0.63 (step @p84 :rule refl :args (@t50)) % 0.40/0.63 (step @p85 :rule nary_cong :premises (@p84 @p83) :args (@t75)) % 0.40/0.63 (step @p86 :rule refl :args (@t48)) % 0.40/0.63 (step @p87 :rule cong :premises (@p86 @p85) :args (@t76)) % 0.40/0.63 (step @p88 :rule refl :args (@t77)) % 0.40/0.63 (step @p89 :rule cong :premises (@p88 @p87) :args ((=> @t77 @t76))) % 0.40/0.63 (assume-push @p243 @t77) % 0.40/0.63 (step @p91 :rule instantiate :premises (@p75) :args ((@list @t45 @t42))) % 0.40/0.63 (step-pop @p244 :rule scope :premises (@p91)) % 0.40/0.63 (step @p92 :rule process_scope :premises (@p244) :args (@t76)) % 0.40/0.63 (step @p94 :rule eq_resolve :premises (@p92 @p89)) % 0.40/0.63 (step @p95 :rule implies_elim :premises (@p94)) % 0.40/0.63 (step @p96 :rule chain_m_resolution :premises (@p95 @p75) :args (@t81 (@list false) (@list @t77))) % 0.40/0.63 (step @p97 :rule bool-double-not-elim :args (@t48)) % 0.40/0.63 (step @p98 :rule refl :args (@t51)) % 0.40/0.63 (step @p99 :rule nary_cong :premises (@p98 @p97) :args ((or @t51 (not @t49)))) % 0.40/0.63 (step @p100 :rule cnf_or_neg :args (@t51 1)) % 0.40/0.63 (step @p101 :rule eq_resolve :premises (@p100 @p99)) % 0.40/0.63 (step @p102 :rule reordering :premises (@p101) :args ((or @t48 @t51))) % 0.40/0.63 (step @p103 :rule chain_m_resolution :premises (@p102 @p39) :args (@t48 @t53 @t54)) % 0.40/0.63 (step @p104 :rule cnf_equiv_pos1 :args (@t81)) % 0.40/0.63 (step @p105 :rule reordering :premises (@p104) :args ((or @t49 @t80 (not @t81)))) % 0.40/0.63 (step @p106 :rule chain_m_resolution :premises (@p105 @p103 @p96) :args (@t80 (@list false false) (@list @t48 @t81))) % 0.40/0.63 (step @p107 :rule cnf_or_neg :args (@t51 0)) % 0.40/0.63 (step @p108 :rule chain_m_resolution :premises (@p107 @p39) :args ((not @t50) @t53 @t54)) % 0.40/0.63 (step @p109 :rule cnf_or_pos :args (@t80)) % 0.40/0.63 (step @p110 :rule reordering :premises (@p109) :args ((or @t50 @t79 (not @t80)))) % 0.40/0.63 (step @p111 :rule chain_m_resolution :premises (@p110 @p108 @p106) :args (@t79 (@list true false) (@list @t50 @t80))) % 0.40/0.63 (step @p112 :rule refl :args (@t94)) % 0.40/0.63 (step @p113 :rule bool-double-not-elim :args (@t78)) % 0.40/0.63 (step @p114 :rule nary_cong :premises (@p113 @p112) :args ((or (not @t79) @t94))) % 0.40/0.63 (step @p115 :rule refl :args (@t83)) % 0.40/0.63 (step @p116 :rule arith_poly_norm :args ((= (* -1 (- 1 @t96)) (* -1 (- @t95 0))))) % 0.40/0.63 (step @p117 :rule arith_poly_norm_rel :premises (@p116) :args ((= (>= 1 @t96) (>= @t95 0)))) % 0.40/0.63 (step @p118 :rule arith-geq-tighten :args (@t86 1)) % 0.40/0.63 (step @p119 :rule trans :premises (@p118 @p117)) % 0.40/0.63 (step @p120 :rule symm :premises (@p119)) % 0.40/0.63 (step @p121 :rule refl :args (0)) % 0.40/0.63 (step @p122 :rule arith_poly_norm :args ((= @t97 @t95))) % 0.40/0.63 (step @p123 :rule cong :premises (@p122 @p121) :args (@t98)) % 0.40/0.63 (step @p124 :rule trans :premises (@p123 @p120)) % 0.40/0.63 (step @p125 :rule refl :args (@t89)) % 0.40/0.63 (step @p126 :rule eq-symm :args (@t90 @t42)) % 0.40/0.63 (step @p127 :rule cong :premises (@p126) :args (@t99)) % 0.40/0.63 (step @p128 :rule nary_cong :premises (@p127 @p125 @p124 @p115) :args (@t100)) % 0.40/0.63 (step @p129 :rule cong :premises (@p128) :args (@t101)) % 0.40/0.63 (step @p130 :rule refl :args (@t79)) % 0.40/0.63 (step @p131 :rule cong :premises (@p130 @p129) :args ((=> @t79 @t101))) % 0.40/0.63 (assume-push @p245 @t79) % 0.40/0.63 (step @p133 :rule skolemize :premises (@p111)) % 0.40/0.63 (step-pop @p246 :rule scope :premises (@p133)) % 0.40/0.63 (step @p134 :rule process_scope :premises (@p246) :args (@t101)) % 0.40/0.63 (step @p136 :rule eq_resolve :premises (@p134 @p131)) % 0.40/0.63 (step @p137 :rule implies_elim :premises (@p136)) % 0.40/0.63 (step @p138 :rule eq_resolve :premises (@p137 @p114)) % 0.40/0.63 (step @p139 :rule chain_m_resolution :premises (@p138 @p111) :args (@t94 @t53 (@list @t78))) % 0.40/0.63 (step @p140 :rule bool-double-not-elim :args (@t91)) % 0.40/0.63 (step @p141 :rule refl :args (@t93)) % 0.40/0.63 (step @p142 :rule nary_cong :premises (@p141 @p140) :args ((or @t93 (not @t92)))) % 0.40/0.63 (step @p143 :rule cnf_or_neg :args (@t93 0)) % 0.40/0.63 (step @p144 :rule eq_resolve :premises (@p143 @p142)) % 0.40/0.63 (step @p145 :rule reordering :premises (@p144) :args ((or @t91 @t93))) % 0.40/0.63 (step @p146 :rule chain_m_resolution :premises (@p145 @p139) :args (@t91 @t53 @t102)) % 0.40/0.63 (step @p147 :rule bool-double-not-elim :args (@t87)) % 0.40/0.63 (step @p148 :rule nary_cong :premises (@p141 @p147) :args ((or @t93 (not @t88)))) % 0.40/0.63 (step @p149 :rule cnf_or_neg :args (@t93 2)) % 0.40/0.63 (step @p150 :rule eq_resolve :premises (@p149 @p148)) % 0.40/0.63 (step @p151 :rule reordering :premises (@p150) :args ((or @t87 @t93))) % 0.40/0.63 (step @p152 :rule chain_m_resolution :premises (@p151 @p139) :args (@t87 @t53 @t102)) % 0.40/0.63 (step @p153 :rule arith_poly_norm :args ((= (* 1 (- @t4 @t1)) (* -1 (- @t1 @t4))))) % 0.40/0.63 (step @p154 :rule arith_poly_norm_rel :premises (@p153) :args ((= @t5 (= @t1 @t4)))) % 0.40/0.63 (step @p155 :rule cong :premises (@p154) :args (@t7)) % 0.40/0.63 (step @p156 :rule eq_resolve :premises (@p1 @p155)) % 0.40/0.63 (step @p157 :rule instantiate :premises (@p156) :args ((@list @t84 @t82))) % 0.40/0.63 (step @p158 :rule refl :args (@t105)) % 0.40/0.63 (step @p159 :rule refl :args (@t88)) % 0.40/0.63 (step @p160 :rule refl :args (@t92)) % 0.40/0.63 (step @p161 :rule bool-double-not-elim :args (@t47)) % 0.40/0.63 (step @p162 :rule nary_cong :premises (@p161 @p160 @p159 @p158) :args ((or (not @t52) @t92 @t88 @t105))) % 0.40/0.63 (assume-push @p247 @t52) % 0.40/0.63 (assume-push @p248 @t87) % 0.40/0.63 (assume-push @p249 @t106) % 0.40/0.63 (assume-push @p250 @t108) % 0.40/0.63 (step @p167 :rule evaluate :args ((not true))) % 0.40/0.63 (step @p168 :rule evaluate :args ((>= 0 0))) % 0.40/0.63 (step @p169 :rule evaluate :args ((+ 0 -1 1))) % 0.40/0.63 (step @p170 :rule evaluate :args (@t109)) % 0.40/0.63 (step @p171 :rule evaluate :args (@t110)) % 0.40/0.63 (step @p172 :rule nary_cong :premises (@p171 @p170 @p24) :args (@t111)) % 0.40/0.63 (step @p173 :rule trans :premises (@p172 @p169)) % 0.40/0.63 (step @p174 :rule arith_poly_norm :args ((= (+ @t84 @t85 0 0) 0))) % 0.40/0.63 (step @p175 :rule arith_poly_norm :args ((= @t112 0))) % 0.40/0.63 (step @p176 :rule arith_poly_norm :args ((= @t113 0))) % 0.40/0.63 (step @p177 :rule refl :args (@t85)) % 0.40/0.63 (step @p178 :rule refl :args (@t84)) % 0.40/0.63 (step @p179 :rule nary_cong :premises (@p178 @p177 @p176 @p175) :args (@t114)) % 0.40/0.63 (step @p180 :rule trans :premises (@p179 @p174)) % 0.40/0.63 (step @p181 :rule arith_poly_norm :args ((= @t115 @t114))) % 0.40/0.63 (step @p182 :rule trans :premises (@p181 @p180)) % 0.40/0.63 (step @p183 :rule cong :premises (@p182 @p173) :args (@t116)) % 0.40/0.63 (step @p184 :rule trans :premises (@p183 @p168)) % 0.40/0.63 (step @p185 :rule cong :premises (@p184) :args ((not @t116))) % 0.40/0.63 (step @p186 :rule trans :premises (@p185 @p167)) % 0.40/0.63 (step @p187 :rule arith-elim-lt :args (@t115 @t111)) % 0.40/0.63 (step @p188 :rule trans :premises (@p187 @p186)) % 0.40/0.63 (step @p189 :rule arith-elim-lt :args (@t46 1)) % 0.40/0.63 (step @p190 :rule symm :premises (@p189)) % 0.40/0.63 (step @p191 :rule eq_resolve :premises (@p41 @p190)) % 0.40/0.63 (step @p192 :rule arith_mult_neg :args (-1 @t87)) % 0.40/0.63 (step @p193 :rule evaluate :args ((< -1 0))) % 0.40/0.63 (step @p194 :rule true_elim :premises (@p193)) % 0.40/0.63 (step @p195 :rule and_intro :premises (@p194 @p152)) % 0.40/0.63 (step @p196 :rule modus_ponens :premises (@p195 @p192)) % 0.40/0.63 (step @p197 :rule arith_mult_neg :args (-1 @t108)) % 0.40/0.63 (step @p198 :rule and_intro :premises (@p194 @p250)) % 0.40/0.63 (step @p199 :rule modus_ponens :premises (@p198 @p197)) % 0.40/0.63 (step @p200 :rule arith_sum_ub :premises (@p199 @p196 @p191)) % 0.40/0.63 (step @p201 false :rule eq_resolve :premises (@p200 @p188)) % 0.40/0.63 (step-pop @p251 :rule scope :premises (@p201)) % 0.40/0.63 (step @p202 :rule process_scope :premises (@p251) :args (false)) % 0.40/0.63 (step @p204 :rule arith_poly_norm :args ((= (* -1 (- @t107 0)) (* -1 @t117)))) % 0.40/0.63 (step @p205 :rule arith_poly_norm_rel :premises (@p204) :args ((= @t108 @t118))) % 0.40/0.63 (step @p206 :rule symm :premises (@p205)) % 0.40/0.63 (step @p207 :rule arith_poly_norm :args ((= (* -1 (- @t43 @t84)) (* 1 @t117)))) % 0.40/0.63 (step @p208 :rule arith_poly_norm_rel :premises (@p207) :args ((= @t106 @t118))) % 0.40/0.63 (step @p209 :rule trans :premises (@p208 @p206)) % 0.40/0.63 (step @p210 :rule eq_resolve :premises (@p249 @p209)) % 0.40/0.63 (step @p211 false :rule contra :premises (@p210 @p202)) % 0.40/0.63 (step-pop @p252 :rule scope :premises (@p211)) % 0.40/0.63 (step-pop @p253 :rule scope :premises (@p252)) % 0.40/0.63 (step-pop @p254 :rule scope :premises (@p253)) % 0.40/0.63 (step @p212 :rule process_scope :premises (@p254) :args (false)) % 0.40/0.63 (assume-push @p255 @t52) % 0.40/0.63 (assume-push @p256 @t91) % 0.40/0.63 (assume-push @p257 @t87) % 0.40/0.63 (assume-push @p258 @t104) % 0.40/0.63 (assume-push @p259 @t104) % 0.40/0.63 (assume-push @p260 (= @t43 @t103)) % 0.40/0.63 (step @p222 :rule symm :premises (@p157)) % 0.40/0.63 (step @p223 :rule chain_m_resolution :premises (@p145 @p139) :args (@t91 @t53 @t102)) % 0.40/0.63 (step @p224 :rule cong :premises (@p223) :args (@t43)) % 0.40/0.63 (step @p225 :rule trans :premises (@p224 @p222)) % 0.40/0.63 (step-pop @p261 :rule scope :premises (@p225)) % 0.40/0.63 (step-pop @p262 :rule scope :premises (@p261)) % 0.40/0.63 (step @p226 :rule process_scope :premises (@p262) :args (@t106)) % 0.40/0.63 (step @p229 :rule cong :premises (@p146) :args (@t43)) % 0.40/0.63 (step @p230 :rule and_intro :premises (@p157 @p229)) % 0.40/0.63 (step @p231 :rule modus_ponens :premises (@p230 @p226)) % 0.40/0.63 (step @p232 :rule and_intro :premises (@p41 @p152 @p231)) % 0.40/0.63 (step-pop @p263 :rule scope :premises (@p232)) % 0.40/0.63 (step-pop @p264 :rule scope :premises (@p263)) % 0.40/0.63 (step-pop @p265 :rule scope :premises (@p264)) % 0.40/0.63 (step-pop @p266 :rule scope :premises (@p265)) % 0.40/0.63 (step @p233 :rule process_scope :premises (@p266) :args (@t119)) % 0.40/0.63 (step @p238 :rule implies_elim :premises (@p233)) % 0.40/0.63 (step @p239 :rule resolution :premises (@p238 @p212) :args (true @t119)) % 0.40/0.63 (step @p240 :rule not_and :premises (@p239)) % 0.40/0.63 (step @p241 :rule eq_resolve :premises (@p240 @p162)) % 0.40/0.63 (step @p242 false :rule chain_m_resolution :premises (@p241 @p157 @p152 @p146 @p41) :args (false (@list false false false true) (@list @t104 @t87 @t91 @t47))) % 0.40/0.63 ) % 0.40/0.63 % SZS output end Proof % 0.40/0.63 % cvc5 exiting %------------------------------------------------------------------------------