%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM343+1 : TPTP v9.2.1. Released v3.1.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 : n026.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:53:14 PM UTC 2026
% Result : Theorem 0.41s 1.63s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 27 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 5 |; 8 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 13 ( 1 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(sum_something_n0_samething,conjecture,
? [X1] :
( ( less(nn1,X1)
& less(X1,n1) )
=> sum(n21,X1,n21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_something_n0_samething) ).
fof(c_0_2,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_3,plain,
! [X183,X184] :
( ( ~ less(X184,X183)
| ~ less(X183,X184) )
& ( X184 != X183
| ~ less(X183,X184) )
& ( less(X184,X183)
| X184 = X183
| less(X183,X184) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( ( less(nn1,X1)
& less(X1,n1) )
=> sum(n21,X1,n21) ),
inference(assume_negation,[status(cth)],[sum_something_n0_samething]) ).
cnf(c_0_5,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
! [X276] :
( less(nn1,X276)
& less(X276,n1)
& ~ sum(n21,X276,n21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
less(nn1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM343+1 : TPTP v9.2.1. Released v3.1.0.
% 0.12/0.13 % 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.16/0.34 % Computer : n026.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 : Tue May 5 00:27:53 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.41/1.63 % Version : CSE_E---1.7
% 0.41/1.63 % Problem : theBenchmark.p
% 0.41/1.63 % SZS status Theorem for theBenchmark.p
% 0.41/1.63 % SZS output start CNFRefutation
% See solution above
% 0.41/1.63 % Total time : 1.273s
%------------------------------------------------------------------------------