%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : DAT083_1 : TPTP v9.2.1. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:29 AM UTC 2026 % Result : Theorem 0.62s 0.81s % Output : Proof 0.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT083_1 : TPTP v9.2.1. Released v6.1.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:27:55 EDT 2026 % 0.18/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_ARI % 0.62/0.81 --- Run --finite-model-find --decision=internal at 45... % 0.62/0.81 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60... % 0.62/0.81 % SZS status Theorem % 0.62/0.81 % SZS output start Proof % 0.62/0.81 ( % 0.62/0.81 (declare-sort tptp.list 0) % 0.62/0.81 (declare-const tptp.count (-> Int tptp.list Int)) % 0.62/0.81 (declare-const tptp.length (-> tptp.list Int)) % 0.62/0.81 (declare-const tptp.inRange (-> Int tptp.list Bool)) % 0.62/0.81 (declare-const tptp.in (-> Int tptp.list Bool)) % 0.62/0.81 (declare-const tptp.nil tptp.list) % 0.62/0.81 (declare-const tptp.append (-> tptp.list tptp.list tptp.list)) % 0.62/0.81 (declare-const tptp.tail (-> tptp.list tptp.list)) % 0.62/0.81 (declare-const tptp.head (-> tptp.list Int)) % 0.62/0.81 (declare-const tptp.cons (-> Int tptp.list tptp.list)) % 0.62/0.81 (define @t1 () (@var "K" Int)) % 0.62/0.81 (define @t2 () (@var "L" tptp.list)) % 0.62/0.81 (define @t3 () (tptp.cons @t1 @t2)) % 0.62/0.81 (define @t4 () (@list @t1 @t2)) % 0.62/0.81 (define @t5 () (= @t2 tptp.nil)) % 0.62/0.81 (define @t6 () (@list @t2)) % 0.62/0.81 (define @t7 () (@var "T" tptp.list)) % 0.62/0.81 (define @t8 () (@var "X" Int)) % 0.62/0.81 (define @t9 () (@var "H" Int)) % 0.62/0.81 (define @t10 () (tptp.cons @t9 @t7)) % 0.62/0.81 (define @t11 () (= @t2 @t10)) % 0.62/0.81 (define @t12 () (@list @t9 @t7)) % 0.62/0.81 (define @t13 () (@var "N" Int)) % 0.62/0.81 (define @t14 () (@list @t13 @t2)) % 0.62/0.81 (define @t15 () (tptp.length tptp.nil)) % 0.62/0.81 (define @t16 () (= @t15 0)) % 0.62/0.81 (define @t17 () (forall @t12 (= (tptp.length @t10) (+ 1 (tptp.length @t7))))) % 0.62/0.81 (define @t18 () (tptp.count @t1 @t7)) % 0.62/0.81 (define @t19 () (tptp.count @t1 @t10)) % 0.62/0.81 (define @t20 () (= @t1 @t9)) % 0.62/0.81 (define @t21 () (@list @t1 @t9 @t7 @t13)) % 0.62/0.81 (define @t22 () (@var "K" tptp.list)) % 0.62/0.81 (define @t23 () (@var "I" Int)) % 0.62/0.81 (define @t24 () (tptp.cons 2 tptp.nil)) % 0.62/0.81 (define @t25 () (tptp.length (tptp.cons 1 @t24))) % 0.62/0.81 (define @t26 () (= @t25 3)) % 0.62/0.81 (define @t27 () (not @t26)) % 0.62/0.81 (define @t28 () (@list 1 @t24)) % 0.62/0.81 (define @t29 () (tptp.length @t24)) % 0.62/0.81 (define @t30 () (+ -1 @t29)) % 0.62/0.81 (define @t31 () (- @t15 @t30)) % 0.62/0.81 (define @t32 () (+ 1 @t15)) % 0.62/0.81 (define @t33 () (= @t15 @t30)) % 0.62/0.81 (define @t34 () (= @t29 @t32)) % 0.62/0.81 (define @t35 () (+ 1 @t29)) % 0.62/0.81 (define @t36 () (= @t25 @t35)) % 0.62/0.81 (define @t37 () (* -1 @t29)) % 0.62/0.81 (define @t38 () (+ @t25 @t37)) % 0.62/0.81 (define @t39 () (= @t38 1)) % 0.62/0.81 (define @t40 () (* -1 3)) % 0.62/0.81 (define @t41 () (* -1 -1)) % 0.62/0.81 (define @t42 () (+ 1 @t41 0 @t40)) % 0.62/0.81 (define @t43 () (* -1 @t25)) % 0.62/0.81 (define @t44 () (* 0 @t15)) % 0.62/0.81 (define @t45 () (* 0 @t29)) % 0.62/0.81 (define @t46 () (+ @t43 @t45 @t25 @t44)) % 0.62/0.81 (define @t47 () (+ @t15 @t37)) % 0.62/0.81 (define @t48 () (+ @t38 (* -1 @t47) @t15 @t43)) % 0.62/0.81 (define @t49 () (= @t47 -1)) % 0.62/0.81 (define @t50 () (= (* -1 (- @t38 1)) (* -1 (- @t25 @t35)))) % 0.62/0.81 (define @t51 () (= @t39 @t36)) % 0.62/0.81 (define @t52 () (and @t26 @t16 @t33 @t36)) % 0.62/0.81 (assume @p1 (forall @t4 (= (tptp.head @t3) @t1))) % 0.62/0.81 (assume @p2 (forall @t4 (= (tptp.tail @t3) @t2))) % 0.62/0.81 (assume @p3 (forall @t6 (or @t5 (= @t2 (tptp.cons (tptp.head @t2) (tptp.tail @t2)))))) % 0.62/0.81 (assume @p4 (forall @t4 (not (= @t3 tptp.nil)))) % 0.62/0.81 (assume @p5 (forall (@list @t8 @t2) (= (tptp.in @t8 @t2) (or (exists @t12 (and @t11 (= @t8 @t9))) (exists @t12 (and @t11 (tptp.in @t8 @t7))))))) % 0.62/0.81 (assume @p6 (forall @t14 (= (tptp.inRange @t13 @t2) (or @t5 (exists (@list @t1 @t7) (and (= @t2 (tptp.cons @t1 @t7)) (<= 0 @t1) (< @t1 @t13) (tptp.inRange @t13 @t7))))))) % 0.62/0.81 (assume @p7 @t16) % 0.62/0.81 (assume @p8 @t17) % 0.62/0.81 (assume @p9 (forall (@list @t1) (= (tptp.count @t1 tptp.nil) 0))) % 0.62/0.81 (assume @p10 (forall @t21 (=> (not @t20) (= @t19 @t18)))) % 0.62/0.81 (assume @p11 (forall @t21 (=> @t20 (= @t19 (+ @t18 1))))) % 0.62/0.81 (assume @p12 (forall @t6 (= (tptp.append tptp.nil @t2) @t2))) % 0.62/0.81 (assume @p13 (forall (@list @t23 @t22 @t2) (= (tptp.append (tptp.cons @t23 @t22) @t2) (tptp.cons @t23 (tptp.append @t22 @t2))))) % 0.62/0.81 (assume @p14 (forall @t14 (= (tptp.in @t13 @t2) (> (tptp.count @t13 @t2) 0)))) % 0.62/0.81 (assume @p15 (not @t27)) % 0.62/0.81 (assume @p16 true) % 0.62/0.81 (step @p17 :rule bool-double-not-elim :args (@t26)) % 0.62/0.81 (step @p18 :rule eq_resolve :premises (@p15 @p17)) % 0.62/0.81 (step @p19 :rule instantiate :premises (@p8) :args (@t28)) % 0.62/0.81 (step @p20 :rule arith_poly_norm :args ((= (* 1 (- @t29 @t32)) (* -1 @t31)))) % 0.62/0.81 (step @p21 :rule arith_poly_norm_rel :premises (@p20) :args ((= @t34 @t33))) % 0.62/0.81 (step @p22 :rule refl :args (@t17)) % 0.62/0.81 (step @p23 :rule cong :premises (@p22 @p21) :args ((=> @t17 @t34))) % 0.62/0.81 (assume-push @p98 @t17) % 0.62/0.81 (step @p25 :rule instantiate :premises (@p8) :args ((@list 2 tptp.nil))) % 0.62/0.81 (step-pop @p99 :rule scope :premises (@p25)) % 0.62/0.81 (step @p26 :rule process_scope :premises (@p99) :args (@t34)) % 0.62/0.81 (step @p28 :rule eq_resolve :premises (@p26 @p23)) % 0.62/0.81 (step @p29 :rule implies_elim :premises (@p28)) % 0.62/0.81 (step @p30 :rule chain_m_resolution :premises (@p29 @p8) :args (@t33 (@list false) (@list @t17))) % 0.62/0.81 (assume-push @p100 @t26) % 0.62/0.81 (assume-push @p101 @t16) % 0.62/0.81 (assume-push @p102 @t33) % 0.62/0.81 (assume-push @p103 @t36) % 0.62/0.81 (assume-push @p104 @t39) % 0.62/0.81 (step @p36 :rule evaluate :args ((<= 0 -1))) % 0.62/0.81 (step @p37 :rule evaluate :args ((+ 1 1 0 -3))) % 0.62/0.81 (step @p38 :rule evaluate :args (@t40)) % 0.62/0.81 (step @p39 :rule refl :args (0)) % 0.62/0.81 (step @p40 :rule evaluate :args (@t41)) % 0.62/0.81 (step @p41 :rule refl :args (1)) % 0.62/0.81 (step @p42 :rule nary_cong :premises (@p41 @p40 @p39 @p38) :args (@t42)) % 0.62/0.81 (step @p43 :rule trans :premises (@p42 @p37)) % 0.62/0.81 (step @p44 :rule arith_poly_norm :args ((= (+ @t43 0 @t25 0) 0))) % 0.62/0.81 (step @p45 :rule arith_poly_norm :args ((= @t44 0))) % 0.62/0.81 (step @p46 :rule refl :args (@t25)) % 0.62/0.81 (step @p47 :rule arith_poly_norm :args ((= @t45 0))) % 0.62/0.81 (step @p48 :rule refl :args (@t43)) % 0.62/0.81 (step @p49 :rule nary_cong :premises (@p48 @p47 @p46 @p45) :args (@t46)) % 0.62/0.81 (step @p50 :rule trans :premises (@p49 @p44)) % 0.62/0.81 (step @p51 :rule arith_poly_norm :args ((= @t48 @t46))) % 0.62/0.81 (step @p52 :rule trans :premises (@p51 @p50)) % 0.62/0.81 (step @p53 :rule cong :premises (@p52 @p43) :args ((<= @t48 @t42))) % 0.62/0.81 (step @p54 :rule trans :premises (@p53 @p36)) % 0.62/0.81 (step @p55 :rule arith_mult_neg :args (-1 @t26)) % 0.62/0.81 (step @p56 :rule evaluate :args ((< -1 0))) % 0.62/0.81 (step @p57 :rule true_elim :premises (@p56)) % 0.62/0.81 (step @p58 :rule and_intro :premises (@p57 @p18)) % 0.62/0.81 (step @p59 :rule modus_ponens :premises (@p58 @p55)) % 0.62/0.81 (step @p60 :rule arith_mult_neg :args (-1 @t49)) % 0.62/0.81 (step @p61 :rule arith_poly_norm :args ((= (* 1 (- @t47 -1)) (* 1 @t31)))) % 0.62/0.81 (step @p62 :rule arith_poly_norm_rel :premises (@p61) :args ((= @t49 @t33))) % 0.62/0.81 (step @p63 :rule symm :premises (@p62)) % 0.62/0.81 (step @p64 :rule eq_resolve :premises (@p30 @p63)) % 0.62/0.81 (step @p65 :rule and_intro :premises (@p57 @p64)) % 0.62/0.81 (step @p66 :rule modus_ponens :premises (@p65 @p60)) % 0.62/0.81 (step @p67 :rule arith_poly_norm :args (@t50)) % 0.62/0.81 (step @p68 :rule arith_poly_norm_rel :premises (@p67) :args (@t51)) % 0.62/0.81 (step @p69 :rule symm :premises (@p68)) % 0.62/0.81 (step @p70 :rule instantiate :premises (@p8) :args (@t28)) % 0.62/0.81 (step @p71 :rule eq_resolve :premises (@p70 @p69)) % 0.62/0.81 (step @p72 :rule arith_sum_ub :premises (@p71 @p66 @p7 @p59)) % 0.62/0.81 (step @p73 false :rule eq_resolve :premises (@p72 @p54)) % 0.62/0.81 (step-pop @p105 :rule scope :premises (@p73)) % 0.62/0.81 (step @p74 :rule process_scope :premises (@p105) :args (false)) % 0.62/0.81 (step @p67 :rule arith_poly_norm :args (@t50)) % 0.62/0.81 (step @p68 :rule arith_poly_norm_rel :premises (@p67) :args (@t51)) % 0.62/0.81 (step @p69 :rule symm :premises (@p68)) % 0.62/0.81 (step @p76 :rule eq_resolve :premises (@p19 @p69)) % 0.62/0.81 (step @p77 false :rule contra :premises (@p76 @p74)) % 0.62/0.81 (step-pop @p106 :rule scope :premises (@p77)) % 0.62/0.81 (step-pop @p107 :rule scope :premises (@p106)) % 0.62/0.81 (step-pop @p108 :rule scope :premises (@p107)) % 0.62/0.81 (step-pop @p109 :rule scope :premises (@p108)) % 0.62/0.81 (step @p78 :rule process_scope :premises (@p109) :args (false)) % 0.62/0.81 (assume-push @p110 @t16) % 0.62/0.81 (assume-push @p111 @t26) % 0.62/0.81 (assume-push @p112 @t36) % 0.62/0.81 (assume-push @p113 @t33) % 0.62/0.81 (step @p87 :rule and_intro :premises (@p18 @p7 @p30 @p19)) % 0.62/0.81 (step-pop @p114 :rule scope :premises (@p87)) % 0.62/0.81 (step-pop @p115 :rule scope :premises (@p114)) % 0.62/0.81 (step-pop @p116 :rule scope :premises (@p115)) % 0.62/0.81 (step-pop @p117 :rule scope :premises (@p116)) % 0.62/0.81 (step @p88 :rule process_scope :premises (@p117) :args (@t52)) % 0.62/0.81 (step @p93 :rule implies_elim :premises (@p88)) % 0.62/0.81 (step @p94 :rule resolution :premises (@p93 @p78) :args (true @t52)) % 0.62/0.81 (step @p95 :rule not_and :premises (@p94)) % 0.62/0.81 (step @p96 :rule reordering :premises (@p95) :args ((or @t27 (not @t16) (not @t36) (not @t33)))) % 0.62/0.81 (step @p97 false :rule chain_m_resolution :premises (@p96 @p30 @p19 @p18 @p7) :args (false (@list false false false false) (@list @t33 @t36 @t26 @t16))) % 0.62/0.81 ) % 0.62/0.81 % SZS output end Proof % 0.62/0.81 % cvc5 exiting %------------------------------------------------------------------------------