%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : DAT084_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 : n027.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.37s 0.61s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT084_1 : TPTP v9.2.1. Released v6.1.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n027.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:21 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_ARI % 0.37/0.61 --- Run --finite-model-find --decision=internal at 45... % 0.37/0.61 % SZS status Theorem % 0.37/0.61 % SZS output start Proof % 0.37/0.61 ( % 0.37/0.61 (declare-sort tptp.list 0) % 0.37/0.61 (declare-const tptp.count (-> Int tptp.list Int)) % 0.37/0.61 (declare-const tptp.length (-> tptp.list Int)) % 0.37/0.61 (declare-const tptp.inRange (-> Int tptp.list Bool)) % 0.37/0.61 (declare-const tptp.in (-> Int tptp.list Bool)) % 0.37/0.61 (declare-const tptp.nil tptp.list) % 0.37/0.61 (declare-const tptp.append (-> tptp.list tptp.list tptp.list)) % 0.37/0.61 (declare-const tptp.tail (-> tptp.list tptp.list)) % 0.37/0.61 (declare-const tptp.head (-> tptp.list Int)) % 0.37/0.61 (declare-const tptp.cons (-> Int tptp.list tptp.list)) % 0.37/0.61 (define @t1 () (@var "K" Int)) % 0.37/0.61 (define @t2 () (@var "L" tptp.list)) % 0.37/0.61 (define @t3 () (tptp.cons @t1 @t2)) % 0.37/0.61 (define @t4 () (@list @t1 @t2)) % 0.37/0.61 (define @t5 () (= @t2 tptp.nil)) % 0.37/0.61 (define @t6 () (@list @t2)) % 0.37/0.61 (define @t7 () (@var "T" tptp.list)) % 0.37/0.61 (define @t8 () (@var "X" Int)) % 0.37/0.61 (define @t9 () (@var "H" Int)) % 0.37/0.61 (define @t10 () (tptp.cons @t9 @t7)) % 0.37/0.61 (define @t11 () (= @t2 @t10)) % 0.37/0.61 (define @t12 () (@list @t9 @t7)) % 0.37/0.61 (define @t13 () (@var "N" Int)) % 0.37/0.61 (define @t14 () (@list @t13 @t2)) % 0.37/0.61 (define @t15 () (forall @t12 (= (tptp.length @t10) (+ 1 (tptp.length @t7))))) % 0.37/0.61 (define @t16 () (tptp.count @t1 @t7)) % 0.37/0.61 (define @t17 () (tptp.count @t1 @t10)) % 0.37/0.61 (define @t18 () (= @t1 @t9)) % 0.37/0.61 (define @t19 () (@list @t1 @t9 @t7 @t13)) % 0.37/0.61 (define @t20 () (@var "K" tptp.list)) % 0.37/0.61 (define @t21 () (@var "I" Int)) % 0.37/0.61 (define @t22 () (= (tptp.length @t2) (tptp.length (tptp.cons 1 @t2)))) % 0.37/0.61 (define @t23 () (exists @t6 @t22)) % 0.37/0.61 (define @t24 () (forall @t6 (not @t22))) % 0.37/0.61 (define @t25 () (not @t24)) % 0.37/0.61 (define @t26 () (@quantifiers_skolemize @t24 0)) % 0.37/0.61 (define @t27 () (tptp.length (tptp.cons 1 @t26))) % 0.37/0.61 (define @t28 () (tptp.length @t26)) % 0.37/0.61 (define @t29 () (= @t28 @t27)) % 0.37/0.61 (define @t30 () (not (not @t29))) % 0.37/0.61 (define @t31 () (+ -1 @t27)) % 0.37/0.61 (define @t32 () (- @t28 @t31)) % 0.37/0.61 (define @t33 () (+ 1 @t28)) % 0.37/0.61 (define @t34 () (= @t28 @t31)) % 0.37/0.61 (define @t35 () (= @t27 @t33)) % 0.37/0.61 (define @t36 () (@list false)) % 0.37/0.61 (define @t37 () (@list @t15)) % 0.37/0.61 (define @t38 () (+ @t28 (* -1 @t27))) % 0.37/0.61 (define @t39 () (= @t38 -1)) % 0.37/0.61 (define @t40 () (* -1 0)) % 0.37/0.61 (define @t41 () (+ -1 @t40)) % 0.37/0.61 (define @t42 () (* 0 @t28)) % 0.37/0.61 (define @t43 () (* 0 @t27)) % 0.37/0.61 (define @t44 () (+ @t43 @t42)) % 0.37/0.61 (define @t45 () (+ @t38 (* -1 @t38))) % 0.37/0.61 (define @t46 () (= @t38 0)) % 0.37/0.61 (define @t47 () (= (* 1 (- @t38 -1)) (* 1 @t32))) % 0.37/0.61 (define @t48 () (= @t39 @t34)) % 0.37/0.61 (define @t49 () (and @t34 @t29)) % 0.37/0.61 (assume @p1 (forall @t4 (= (tptp.head @t3) @t1))) % 0.37/0.61 (assume @p2 (forall @t4 (= (tptp.tail @t3) @t2))) % 0.37/0.61 (assume @p3 (forall @t6 (or @t5 (= @t2 (tptp.cons (tptp.head @t2) (tptp.tail @t2)))))) % 0.37/0.61 (assume @p4 (forall @t4 (not (= @t3 tptp.nil)))) % 0.37/0.61 (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.37/0.61 (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.37/0.61 (assume @p7 (= (tptp.length tptp.nil) 0)) % 0.37/0.61 (assume @p8 @t15) % 0.37/0.61 (assume @p9 (forall (@list @t1) (= (tptp.count @t1 tptp.nil) 0))) % 0.37/0.61 (assume @p10 (forall @t19 (=> (not @t18) (= @t17 @t16)))) % 0.37/0.61 (assume @p11 (forall @t19 (=> @t18 (= @t17 (+ @t16 1))))) % 0.37/0.61 (assume @p12 (forall @t6 (= (tptp.append tptp.nil @t2) @t2))) % 0.37/0.61 (assume @p13 (forall (@list @t21 @t20 @t2) (= (tptp.append (tptp.cons @t21 @t20) @t2) (tptp.cons @t21 (tptp.append @t20 @t2))))) % 0.37/0.61 (assume @p14 (forall @t14 (= (tptp.in @t13 @t2) (> (tptp.count @t13 @t2) 0)))) % 0.37/0.61 (assume @p15 (not (not @t23))) % 0.37/0.61 (assume @p16 true) % 0.37/0.61 (step @p17 :rule exists-elim :args ((= @t23 @t25))) % 0.37/0.61 (step @p18 :rule bool-double-not-elim :args (@t23)) % 0.37/0.61 (step @p19 :rule trans :premises (@p18 @p17)) % 0.37/0.61 (step @p20 :rule eq_resolve :premises (@p15 @p19)) % 0.37/0.61 (step @p21 :rule refl :args (@t29)) % 0.37/0.61 (step @p22 :rule bool-double-not-elim :args (@t24)) % 0.37/0.61 (step @p23 :rule nary_cong :premises (@p22 @p21) :args ((or (not @t25) @t29))) % 0.37/0.61 (step @p24 :rule bool-double-not-elim :args (@t29)) % 0.37/0.61 (step @p25 :rule refl :args (@t25)) % 0.37/0.61 (step @p26 :rule cong :premises (@p25 @p24) :args ((=> @t25 @t30))) % 0.37/0.61 (assume-push @p97 @t25) % 0.37/0.61 (step @p28 :rule skolemize :premises (@p20)) % 0.37/0.61 (step-pop @p98 :rule scope :premises (@p28)) % 0.37/0.61 (step @p29 :rule process_scope :premises (@p98) :args (@t30)) % 0.37/0.61 (step @p31 :rule eq_resolve :premises (@p29 @p26)) % 0.37/0.61 (step @p32 :rule implies_elim :premises (@p31)) % 0.37/0.61 (step @p33 :rule eq_resolve :premises (@p32 @p23)) % 0.37/0.61 (step @p34 :rule chain_m_resolution :premises (@p33 @p20) :args (@t29 (@list true) (@list @t24))) % 0.37/0.61 (step @p35 :rule arith_poly_norm :args ((= (* 1 (- @t27 @t33)) (* -1 @t32)))) % 0.37/0.61 (step @p36 :rule arith_poly_norm_rel :premises (@p35) :args ((= @t35 @t34))) % 0.37/0.61 (step @p37 :rule refl :args (@t15)) % 0.37/0.61 (step @p38 :rule cong :premises (@p37 @p36) :args ((=> @t15 @t35))) % 0.37/0.61 (assume-push @p99 @t15) % 0.37/0.61 (step @p40 :rule instantiate :premises (@p8) :args ((@list 1 @t26))) % 0.37/0.61 (step-pop @p100 :rule scope :premises (@p40)) % 0.37/0.61 (step @p41 :rule process_scope :premises (@p100) :args (@t35)) % 0.37/0.61 (step @p43 :rule eq_resolve :premises (@p41 @p38)) % 0.37/0.61 (step @p44 :rule implies_elim :premises (@p43)) % 0.37/0.61 (step @p45 :rule chain_m_resolution :premises (@p44 @p8) :args (@t34 @t36 @t37)) % 0.37/0.61 (assume-push @p101 @t34) % 0.37/0.61 (assume-push @p102 @t29) % 0.37/0.61 (assume-push @p103 @t39) % 0.37/0.61 (step @p49 :rule evaluate :args ((<= 0 -1))) % 0.37/0.61 (step @p50 :rule evaluate :args ((+ -1 0))) % 0.37/0.61 (step @p51 :rule evaluate :args (@t40)) % 0.37/0.61 (step @p52 :rule refl :args (-1)) % 0.37/0.61 (step @p53 :rule nary_cong :premises (@p52 @p51) :args (@t41)) % 0.37/0.61 (step @p54 :rule trans :premises (@p53 @p50)) % 0.37/0.61 (step @p55 :rule evaluate :args ((+ 0 0))) % 0.37/0.61 (step @p56 :rule arith_poly_norm :args ((= @t42 0))) % 0.37/0.61 (step @p57 :rule arith_poly_norm :args ((= @t43 0))) % 0.37/0.61 (step @p58 :rule nary_cong :premises (@p57 @p56) :args (@t44)) % 0.37/0.61 (step @p59 :rule trans :premises (@p58 @p55)) % 0.37/0.61 (step @p60 :rule arith_poly_norm :args ((= @t45 @t44))) % 0.37/0.61 (step @p61 :rule trans :premises (@p60 @p59)) % 0.37/0.61 (step @p62 :rule cong :premises (@p61 @p54) :args ((<= @t45 @t41))) % 0.37/0.61 (step @p63 :rule trans :premises (@p62 @p49)) % 0.37/0.61 (step @p64 :rule arith_mult_neg :args (-1 @t46)) % 0.37/0.61 (step @p65 :rule arith_poly_norm :args ((= (* 1 (- @t38 0)) (* 1 (- @t28 @t27))))) % 0.37/0.61 (step @p66 :rule arith_poly_norm_rel :premises (@p65) :args ((= @t46 @t29))) % 0.37/0.61 (step @p67 :rule symm :premises (@p66)) % 0.37/0.61 (step @p68 :rule eq_resolve :premises (@p34 @p67)) % 0.37/0.61 (step @p69 :rule evaluate :args ((< -1 0))) % 0.37/0.61 (step @p70 :rule true_elim :premises (@p69)) % 0.37/0.61 (step @p71 :rule and_intro :premises (@p70 @p68)) % 0.37/0.61 (step @p72 :rule modus_ponens :premises (@p71 @p64)) % 0.37/0.61 (step @p73 :rule arith_poly_norm :args (@t47)) % 0.37/0.61 (step @p74 :rule arith_poly_norm_rel :premises (@p73) :args (@t48)) % 0.37/0.61 (step @p75 :rule symm :premises (@p74)) % 0.37/0.61 (step @p76 :rule chain_m_resolution :premises (@p44 @p8) :args (@t34 @t36 @t37)) % 0.37/0.61 (step @p77 :rule eq_resolve :premises (@p76 @p75)) % 0.37/0.61 (step @p78 :rule arith_sum_ub :premises (@p77 @p72)) % 0.37/0.61 (step @p79 false :rule eq_resolve :premises (@p78 @p63)) % 0.37/0.61 (step-pop @p104 :rule scope :premises (@p79)) % 0.37/0.61 (step @p80 :rule process_scope :premises (@p104) :args (false)) % 0.37/0.61 (step @p73 :rule arith_poly_norm :args (@t47)) % 0.37/0.61 (step @p74 :rule arith_poly_norm_rel :premises (@p73) :args (@t48)) % 0.37/0.61 (step @p75 :rule symm :premises (@p74)) % 0.37/0.61 (step @p82 :rule eq_resolve :premises (@p45 @p75)) % 0.37/0.61 (step @p83 false :rule contra :premises (@p82 @p80)) % 0.37/0.61 (step-pop @p105 :rule scope :premises (@p83)) % 0.37/0.61 (step-pop @p106 :rule scope :premises (@p105)) % 0.37/0.61 (step @p84 :rule process_scope :premises (@p106) :args (false)) % 0.37/0.61 (assume-push @p107 @t29) % 0.37/0.61 (assume-push @p108 @t34) % 0.37/0.61 (step @p89 :rule and_intro :premises (@p45 @p34)) % 0.37/0.61 (step-pop @p109 :rule scope :premises (@p89)) % 0.37/0.61 (step-pop @p110 :rule scope :premises (@p109)) % 0.37/0.61 (step @p90 :rule process_scope :premises (@p110) :args (@t49)) % 0.37/0.61 (step @p93 :rule implies_elim :premises (@p90)) % 0.37/0.61 (step @p94 :rule resolution :premises (@p93 @p84) :args (true @t49)) % 0.37/0.61 (step @p95 :rule not_and :premises (@p94)) % 0.37/0.61 (step @p96 false :rule chain_m_resolution :premises (@p95 @p45 @p34) :args (false (@list false false) (@list @t34 @t29))) % 0.37/0.61 ) % 0.37/0.61 % SZS output end Proof % 0.37/0.61 % cvc5 exiting %------------------------------------------------------------------------------