%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ANA021-1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.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 : Tue May 5 04:09:19 PM UTC 2026
% Result : Unsatisfiable 8.02s 5.82s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 2 nHn; 10 RR)
% Number of literals : 23 ( 9 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_SetInterval_Ocard__atMost_0,axiom,
c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_Ocard__atMost_0) ).
cnf(cls_NatBin_OSuc__pred_H_0,axiom,
( X1 = c_Suc(c_minus(X1,c_1,tc_nat))
| ~ c_less(c_0,X1,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_NatBin_OSuc__pred_H_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Nat_Onot__gr0_0,axiom,
( c_less(c_0,X1,tc_nat)
| X1 = c_0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__gr0_0) ).
cnf(cls_conjecture_3,negated_conjecture,
v_x != c_0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_6,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a),
cls_conjecture_2 ).
cnf(c_0_7,axiom,
c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
cls_SetInterval_Ocard__atMost_0 ).
cnf(c_0_8,axiom,
( X1 = c_Suc(c_minus(X1,c_1,tc_nat))
| ~ c_less(c_0,X1,tc_nat) ),
cls_NatBin_OSuc__pred_H_0 ).
cnf(c_0_9,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_f(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat)),t_a),t_a),t_a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
( X1 = c_Finite__Set_Ocard(c_SetInterval_OatMost(c_minus(X1,c_1,tc_nat),tc_nat),tc_nat)
| ~ c_less(c_0,X1,tc_nat) ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
cls_conjecture_4 ).
cnf(c_0_12,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_f(X1),t_a),c_times(v_c,c_HOL_Oabs(v_h(X1),t_a),t_a),t_a)
| ~ c_less(c_0,X1,tc_nat) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ c_less(c_0,v_x,tc_nat),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( c_less(c_0,X1,tc_nat)
| X1 = c_0 ),
cls_Nat_Onot__gr0_0 ).
cnf(c_0_15,negated_conjecture,
v_x != c_0,
cls_conjecture_3 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ANA021-1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n031.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 10:37:54 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 8.02/5.82 % Version : CSE_E---1.7
% 8.02/5.82 % Problem : theBenchmark.p
% 8.02/5.82 % SZS status Unsatisfiable for theBenchmark.p
% 8.02/5.82 % SZS output start CNFRefutation
% See solution above
% 8.02/5.84 % Total time : 4.540s
%------------------------------------------------------------------------------