%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : DAT002_1 : TPTP v9.2.1. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n010.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:19 AM UTC 2026 % Result : Theorem 0.40s 0.61s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT002_1 : TPTP v9.2.1. Released v5.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.18/0.34 % Computer : n010.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Mon Jun 1 22:24:55 EDT 2026 % 0.18/0.34 % CPUTime : % 0.31/0.48 %----Proving TF0_ARI % 0.40/0.61 --- Run --finite-model-find --decision=internal at 45... % 0.40/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60... % 0.40/0.61 % SZS status Theorem % 0.40/0.61 % SZS output start Proof % 0.40/0.61 ( % 0.40/0.61 (declare-sort tptp.list 0) % 0.40/0.61 (declare-const tptp.mycons (-> Int tptp.list tptp.list)) % 0.40/0.61 (declare-const tptp.fib_sorted (-> tptp.list Bool)) % 0.40/0.61 (declare-const tptp.nil tptp.list) % 0.40/0.61 (define @t1 () (@var "X" Int)) % 0.40/0.61 (define @t2 () (@var "Y" Int)) % 0.40/0.61 (define @t3 () (tptp.fib_sorted (tptp.mycons @t1 (tptp.mycons @t2 tptp.nil)))) % 0.40/0.61 (define @t4 () (< @t1 @t2)) % 0.40/0.61 (define @t5 () (=> @t4 @t3)) % 0.40/0.61 (define @t6 () (@list @t1 @t2)) % 0.40/0.61 (define @t7 () (forall @t6 @t5)) % 0.40/0.61 (define @t8 () (@var "R" tptp.list)) % 0.40/0.61 (define @t9 () (@var "Z" Int)) % 0.40/0.61 (define @t10 () (tptp.mycons @t2 (tptp.mycons @t9 @t8))) % 0.40/0.61 (define @t11 () (tptp.fib_sorted (tptp.mycons @t1 @t10))) % 0.40/0.61 (define @t12 () (tptp.fib_sorted @t10)) % 0.40/0.61 (define @t13 () (+ @t1 @t2)) % 0.40/0.61 (define @t14 () (>= @t9 @t13)) % 0.40/0.61 (define @t15 () (and @t4 @t14 @t12)) % 0.40/0.61 (define @t16 () (=> @t15 @t11)) % 0.40/0.61 (define @t17 () (@list @t1 @t2 @t9 @t8)) % 0.40/0.61 (define @t18 () (forall @t17 @t16)) % 0.40/0.61 (define @t19 () (tptp.mycons 100 tptp.nil)) % 0.40/0.61 (define @t20 () (tptp.mycons 7 @t19)) % 0.40/0.61 (define @t21 () (tptp.mycons 4 @t20)) % 0.40/0.61 (define @t22 () (tptp.mycons 2 @t21)) % 0.40/0.61 (define @t23 () (tptp.fib_sorted (tptp.mycons 1 @t22))) % 0.40/0.61 (define @t24 () (not @t12)) % 0.40/0.61 (define @t25 () (+ @t1 @t2 (* -1 @t9))) % 0.40/0.61 (define @t26 () (>= @t25 1)) % 0.40/0.61 (define @t27 () (+ @t1 (* -1 @t2))) % 0.40/0.61 (define @t28 () (>= @t27 0)) % 0.40/0.61 (define @t29 () (or @t28 @t26 @t24 @t11)) % 0.40/0.61 (define @t30 () (not @t26)) % 0.40/0.61 (define @t31 () (not @t30)) % 0.40/0.61 (define @t32 () (not @t28)) % 0.40/0.61 (define @t33 () (not @t32)) % 0.40/0.61 (define @t34 () (or @t33 @t31 @t24)) % 0.40/0.61 (define @t35 () (and @t32 @t30 @t12)) % 0.40/0.61 (define @t36 () (+ @t25 1)) % 0.40/0.61 (define @t37 () (>= @t1 @t2)) % 0.40/0.61 (define @t38 () (tptp.fib_sorted @t22)) % 0.40/0.61 (define @t39 () (tptp.fib_sorted @t21)) % 0.40/0.61 (define @t40 () (not @t39)) % 0.40/0.61 (define @t41 () (or @t40 @t38)) % 0.40/0.61 (define @t42 () (* -1 7)) % 0.40/0.61 (define @t43 () (+ 2 4 @t42)) % 0.40/0.61 (define @t44 () (>= @t43 1)) % 0.40/0.61 (define @t45 () (* -1 4)) % 0.40/0.61 (define @t46 () (+ 2 @t45)) % 0.40/0.61 (define @t47 () (>= @t46 0)) % 0.40/0.61 (define @t48 () (or @t47 @t44 @t40 @t38)) % 0.40/0.61 (define @t49 () (forall @t17 @t29)) % 0.40/0.61 (define @t50 () (@list false)) % 0.40/0.61 (define @t51 () (@list @t49)) % 0.40/0.61 (define @t52 () (tptp.fib_sorted @t20)) % 0.40/0.61 (define @t53 () (not @t52)) % 0.40/0.61 (define @t54 () (or @t53 @t39)) % 0.40/0.61 (define @t55 () (* -1 100)) % 0.40/0.61 (define @t56 () (+ 4 7 @t55)) % 0.40/0.61 (define @t57 () (>= @t56 1)) % 0.40/0.61 (define @t58 () (+ 4 @t42)) % 0.40/0.61 (define @t59 () (>= @t58 0)) % 0.40/0.61 (define @t60 () (or @t59 @t57 @t53 @t39)) % 0.40/0.61 (define @t61 () (+ 7 @t55)) % 0.40/0.61 (define @t62 () (>= @t61 0)) % 0.40/0.61 (define @t63 () (or @t62 @t52)) % 0.40/0.61 (define @t64 () (forall @t6 (or @t28 @t3))) % 0.40/0.61 (define @t65 () (not @t38)) % 0.40/0.61 (define @t66 () (or @t65 @t23)) % 0.40/0.61 (define @t67 () (+ 1 2 @t45)) % 0.40/0.61 (define @t68 () (>= @t67 1)) % 0.40/0.61 (define @t69 () (* -1 2)) % 0.40/0.61 (define @t70 () (+ 1 @t69)) % 0.40/0.61 (define @t71 () (>= @t70 0)) % 0.40/0.61 (define @t72 () (or @t71 @t68 @t65 @t23)) % 0.40/0.61 (assume @p1 (tptp.fib_sorted tptp.nil)) % 0.40/0.61 (assume @p2 (forall (@list @t1) (tptp.fib_sorted (tptp.mycons @t1 tptp.nil)))) % 0.40/0.61 (assume @p3 @t7) % 0.40/0.61 (assume @p4 @t18) % 0.40/0.61 (assume @p5 (not @t23)) % 0.40/0.61 (assume @p6 true) % 0.40/0.61 (step @p7 :rule aci_norm :args ((= (or (or @t28 @t26 @t24) @t11) @t29))) % 0.40/0.61 (step @p8 :rule refl :args (@t11)) % 0.40/0.61 (step @p9 :rule refl :args (@t24)) % 0.40/0.61 (step @p10 :rule bool-double-not-elim :args (@t26)) % 0.40/0.61 (step @p11 :rule bool-double-not-elim :args (@t28)) % 0.40/0.61 (step @p12 :rule nary_cong :premises (@p11 @p10 @p9) :args (@t34)) % 0.40/0.61 (step @p13 :rule aci_norm :args ((= (or @t33 (or @t31 @t24)) @t34))) % 0.40/0.61 (step @p14 :rule trans :premises (@p13 @p12)) % 0.40/0.61 (step @p15 :rule bool-and-de-morgan :args (@t30 @t12 true)) % 0.40/0.61 (step @p16 :rule refl :args (@t33)) % 0.40/0.61 (step @p17 :rule nary_cong :premises (@p16 @p15) :args ((or @t33 (not (and @t30 @t12))))) % 0.40/0.61 (step @p18 :rule bool-and-de-morgan :args (@t32 @t30 (and @t12))) % 0.40/0.61 (step @p19 :rule trans :premises (@p18 @p17)) % 0.40/0.61 (step @p20 :rule trans :premises (@p19 @p14)) % 0.40/0.61 (step @p21 :rule nary_cong :premises (@p20 @p8) :args ((or (not @t35) @t11))) % 0.40/0.61 (step @p22 :rule trans :premises (@p21 @p7)) % 0.40/0.61 (step @p23 :rule bool-impl-elim :args (@t35 @t11)) % 0.40/0.61 (step @p24 :rule trans :premises (@p23 @p22)) % 0.40/0.61 (step @p25 :rule cong :premises (@p24) :args ((forall @t17 (=> @t35 @t11)))) % 0.40/0.61 (step @p26 :rule refl :args (@t11)) % 0.40/0.61 (step @p27 :rule refl :args (@t12)) % 0.40/0.61 (step @p28 :rule arith_poly_norm :args ((= (* -1 (- 1 @t36)) (* -1 (- @t9 @t13))))) % 0.40/0.61 (step @p29 :rule arith_poly_norm_rel :premises (@p28) :args ((= (>= 1 @t36) @t14))) % 0.40/0.61 (step @p30 :rule arith-geq-tighten :args (@t25 1)) % 0.40/0.61 (step @p31 :rule trans :premises (@p30 @p29)) % 0.40/0.61 (step @p32 :rule symm :premises (@p31)) % 0.40/0.61 (step @p33 :rule arith_poly_norm :args ((= (* 1 (- @t1 @t2)) (* 1 (- @t27 0))))) % 0.40/0.61 (step @p34 :rule arith_poly_norm_rel :premises (@p33) :args ((= @t37 @t28))) % 0.40/0.61 (step @p35 :rule cong :premises (@p34) :args ((not @t37))) % 0.40/0.61 (step @p36 :rule arith-elim-lt :args (@t1 @t2)) % 0.40/0.61 (step @p37 :rule trans :premises (@p36 @p35)) % 0.40/0.61 (step @p38 :rule nary_cong :premises (@p37 @p32 @p27) :args (@t15)) % 0.40/0.61 (step @p39 :rule cong :premises (@p38 @p26) :args (@t16)) % 0.40/0.61 (step @p40 :rule cong :premises (@p39) :args (@t18)) % 0.40/0.61 (step @p41 :rule trans :premises (@p40 @p25)) % 0.40/0.61 (step @p42 :rule eq_resolve :premises (@p4 @p41)) % 0.40/0.61 (step @p43 :rule aci_norm :args ((= (or false false @t40 @t38) @t41))) % 0.40/0.61 (step @p44 :rule refl :args (@t38)) % 0.40/0.61 (step @p45 :rule refl :args (@t40)) % 0.40/0.61 (step @p46 :rule evaluate :args ((>= -1 1))) % 0.40/0.61 (step @p47 :rule refl :args (1)) % 0.40/0.61 (step @p48 :rule evaluate :args ((+ 2 4 -7))) % 0.40/0.61 (step @p49 :rule evaluate :args (@t42)) % 0.40/0.61 (step @p50 :rule refl :args (4)) % 0.40/0.61 (step @p51 :rule refl :args (2)) % 0.40/0.61 (step @p52 :rule nary_cong :premises (@p51 @p50 @p49) :args (@t43)) % 0.40/0.61 (step @p53 :rule trans :premises (@p52 @p48)) % 0.40/0.61 (step @p54 :rule cong :premises (@p53 @p47) :args (@t44)) % 0.40/0.61 (step @p55 :rule trans :premises (@p54 @p46)) % 0.40/0.61 (step @p56 :rule evaluate :args ((>= -2 0))) % 0.40/0.61 (step @p57 :rule refl :args (0)) % 0.40/0.61 (step @p58 :rule evaluate :args ((+ 2 -4))) % 0.40/0.61 (step @p59 :rule evaluate :args (@t45)) % 0.40/0.61 (step @p60 :rule nary_cong :premises (@p51 @p59) :args (@t46)) % 0.40/0.61 (step @p61 :rule trans :premises (@p60 @p58)) % 0.40/0.61 (step @p62 :rule cong :premises (@p61 @p57) :args (@t47)) % 0.40/0.61 (step @p63 :rule trans :premises (@p62 @p56)) % 0.40/0.61 (step @p64 :rule nary_cong :premises (@p63 @p55 @p45 @p44) :args (@t48)) % 0.40/0.61 (step @p65 :rule trans :premises (@p64 @p43)) % 0.40/0.61 (step @p66 :rule refl :args (@t49)) % 0.40/0.61 (step @p67 :rule cong :premises (@p66 @p65) :args ((=> @t49 @t48))) % 0.40/0.61 (assume-push @p165 @t49) % 0.40/0.61 (step @p69 :rule instantiate :premises (@p42) :args ((@list 2 4 7 @t19))) % 0.40/0.61 (step-pop @p166 :rule scope :premises (@p69)) % 0.40/0.61 (step @p70 :rule process_scope :premises (@p166) :args (@t48)) % 0.40/0.61 (step @p72 :rule eq_resolve :premises (@p70 @p67)) % 0.40/0.61 (step @p73 :rule implies_elim :premises (@p72)) % 0.40/0.61 (step @p74 :rule chain_m_resolution :premises (@p73 @p42) :args (@t41 @t50 @t51)) % 0.40/0.61 (step @p75 :rule aci_norm :args ((= (or false false @t53 @t39) @t54))) % 0.40/0.61 (step @p76 :rule refl :args (@t39)) % 0.40/0.61 (step @p77 :rule refl :args (@t53)) % 0.40/0.61 (step @p78 :rule evaluate :args ((>= -89 1))) % 0.40/0.61 (step @p79 :rule evaluate :args ((+ 4 7 -100))) % 0.40/0.61 (step @p80 :rule evaluate :args (@t55)) % 0.40/0.61 (step @p81 :rule refl :args (7)) % 0.40/0.61 (step @p82 :rule nary_cong :premises (@p50 @p81 @p80) :args (@t56)) % 0.40/0.61 (step @p83 :rule trans :premises (@p82 @p79)) % 0.40/0.61 (step @p84 :rule cong :premises (@p83 @p47) :args (@t57)) % 0.40/0.61 (step @p85 :rule trans :premises (@p84 @p78)) % 0.40/0.61 (step @p86 :rule evaluate :args ((>= -3 0))) % 0.40/0.61 (step @p87 :rule evaluate :args ((+ 4 -7))) % 0.40/0.61 (step @p88 :rule nary_cong :premises (@p50 @p49) :args (@t58)) % 0.40/0.61 (step @p89 :rule trans :premises (@p88 @p87)) % 0.40/0.61 (step @p90 :rule cong :premises (@p89 @p57) :args (@t59)) % 0.40/0.61 (step @p91 :rule trans :premises (@p90 @p86)) % 0.40/0.61 (step @p92 :rule nary_cong :premises (@p91 @p85 @p77 @p76) :args (@t60)) % 0.40/0.61 (step @p93 :rule trans :premises (@p92 @p75)) % 0.40/0.61 (step @p94 :rule cong :premises (@p66 @p93) :args ((=> @t49 @t60))) % 0.40/0.61 (assume-push @p167 @t49) % 0.40/0.61 (step @p96 :rule instantiate :premises (@p42) :args ((@list 4 7 100 tptp.nil))) % 0.40/0.61 (step-pop @p168 :rule scope :premises (@p96)) % 0.40/0.61 (step @p97 :rule process_scope :premises (@p168) :args (@t60)) % 0.40/0.61 (step @p99 :rule eq_resolve :premises (@p97 @p94)) % 0.40/0.61 (step @p100 :rule implies_elim :premises (@p99)) % 0.40/0.61 (step @p101 :rule chain_m_resolution :premises (@p100 @p42) :args (@t54 @t50 @t51)) % 0.40/0.61 (step @p102 :rule refl :args (@t3)) % 0.40/0.61 (step @p103 :rule nary_cong :premises (@p11 @p102) :args ((or @t33 @t3))) % 0.40/0.61 (step @p104 :rule bool-impl-elim :args (@t32 @t3)) % 0.40/0.62 (step @p105 :rule trans :premises (@p104 @p103)) % 0.40/0.62 (step @p106 :rule cong :premises (@p105) :args ((forall @t6 (=> @t32 @t3)))) % 0.40/0.62 (step @p107 :rule refl :args (@t3)) % 0.40/0.62 (step @p108 :rule cong :premises (@p37 @p107) :args (@t5)) % 0.40/0.62 (step @p109 :rule cong :premises (@p108) :args (@t7)) % 0.40/0.62 (step @p110 :rule trans :premises (@p109 @p106)) % 0.40/0.62 (step @p111 :rule eq_resolve :premises (@p3 @p110)) % 0.40/0.62 (step @p112 :rule aci_norm :args ((= (or false @t52) @t52))) % 0.40/0.62 (step @p113 :rule refl :args (@t52)) % 0.40/0.62 (step @p114 :rule evaluate :args ((>= -93 0))) % 0.40/0.62 (step @p115 :rule evaluate :args ((+ 7 -100))) % 0.40/0.62 (step @p116 :rule nary_cong :premises (@p81 @p80) :args (@t61)) % 0.40/0.62 (step @p117 :rule trans :premises (@p116 @p115)) % 0.40/0.62 (step @p118 :rule cong :premises (@p117 @p57) :args (@t62)) % 0.40/0.62 (step @p119 :rule trans :premises (@p118 @p114)) % 0.40/0.62 (step @p120 :rule nary_cong :premises (@p119 @p113) :args (@t63)) % 0.40/0.62 (step @p121 :rule trans :premises (@p120 @p112)) % 0.40/0.62 (step @p122 :rule refl :args (@t64)) % 0.40/0.62 (step @p123 :rule cong :premises (@p122 @p121) :args ((=> @t64 @t63))) % 0.40/0.62 (assume-push @p169 @t64) % 0.40/0.62 (step @p125 :rule instantiate :premises (@p111) :args ((@list 7 100))) % 0.40/0.62 (step-pop @p170 :rule scope :premises (@p125)) % 0.40/0.62 (step @p126 :rule process_scope :premises (@p170) :args (@t63)) % 0.40/0.62 (step @p128 :rule eq_resolve :premises (@p126 @p123)) % 0.40/0.62 (step @p129 :rule implies_elim :premises (@p128)) % 0.40/0.62 (step @p130 :rule chain_m_resolution :premises (@p129 @p111) :args (@t52 @t50 (@list @t64))) % 0.40/0.62 (step @p131 :rule cnf_or_pos :args (@t54)) % 0.40/0.62 (step @p132 :rule reordering :premises (@p131) :args ((or @t53 @t39 (not @t54)))) % 0.40/0.62 (step @p133 :rule chain_m_resolution :premises (@p132 @p130 @p101) :args (@t39 (@list false false) (@list @t52 @t54))) % 0.40/0.62 (step @p134 :rule aci_norm :args ((= (or false false @t65 @t23) @t66))) % 0.40/0.62 (step @p135 :rule refl :args (@t23)) % 0.40/0.62 (step @p136 :rule refl :args (@t65)) % 0.40/0.62 (step @p137 :rule evaluate :args ((+ 1 2 -4))) % 0.40/0.62 (step @p138 :rule nary_cong :premises (@p47 @p51 @p59) :args (@t67)) % 0.40/0.62 (step @p139 :rule trans :premises (@p138 @p137)) % 0.40/0.62 (step @p140 :rule cong :premises (@p139 @p47) :args (@t68)) % 0.40/0.62 (step @p141 :rule trans :premises (@p140 @p46)) % 0.40/0.62 (step @p142 :rule evaluate :args ((>= -1 0))) % 0.40/0.62 (step @p143 :rule evaluate :args ((+ 1 -2))) % 0.40/0.62 (step @p144 :rule evaluate :args (@t69)) % 0.40/0.62 (step @p145 :rule nary_cong :premises (@p47 @p144) :args (@t70)) % 0.40/0.62 (step @p146 :rule trans :premises (@p145 @p143)) % 0.40/0.62 (step @p147 :rule cong :premises (@p146 @p57) :args (@t71)) % 0.40/0.62 (step @p148 :rule trans :premises (@p147 @p142)) % 0.40/0.62 (step @p149 :rule nary_cong :premises (@p148 @p141 @p136 @p135) :args (@t72)) % 0.40/0.62 (step @p150 :rule trans :premises (@p149 @p134)) % 0.40/0.62 (step @p151 :rule cong :premises (@p66 @p150) :args ((=> @t49 @t72))) % 0.40/0.62 (assume-push @p171 @t49) % 0.40/0.62 (step @p153 :rule instantiate :premises (@p42) :args ((@list 1 2 4 @t20))) % 0.40/0.62 (step-pop @p172 :rule scope :premises (@p153)) % 0.40/0.62 (step @p154 :rule process_scope :premises (@p172) :args (@t72)) % 0.40/0.62 (step @p156 :rule eq_resolve :premises (@p154 @p151)) % 0.40/0.62 (step @p157 :rule implies_elim :premises (@p156)) % 0.40/0.62 (step @p158 :rule chain_m_resolution :premises (@p157 @p42) :args (@t66 @t50 @t51)) % 0.40/0.62 (step @p159 :rule cnf_or_pos :args (@t66)) % 0.40/0.62 (step @p160 :rule reordering :premises (@p159) :args ((or @t23 @t65 (not @t66)))) % 0.40/0.62 (step @p161 :rule chain_m_resolution :premises (@p160 @p5 @p158) :args (@t65 (@list true false) (@list @t23 @t66))) % 0.40/0.62 (step @p162 :rule cnf_or_pos :args (@t41)) % 0.40/0.62 (step @p163 :rule reordering :premises (@p162) :args ((or @t40 @t38 (not @t41)))) % 0.40/0.62 (step @p164 false :rule chain_m_resolution :premises (@p163 @p161 @p133 @p74) :args (false (@list true false false) (@list @t38 @t39 @t41))) % 0.40/0.62 ) % 0.40/0.62 % SZS output end Proof % 0.40/0.62 % cvc5 exiting %------------------------------------------------------------------------------