%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:19:03 PM UTC 2026
% Result : Theorem 7.06s 1.72s
% Output : Proof 7.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 32 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 14 ~; 7 |; 11 &)
% ( 1 <=>; 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 : 14 ( 2 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f283,axiom,
! [X,Y] :
( less(X,Y)
<=> ( Y != X
& ~ less(Y,X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(f283_nnf,plain,
! [X,Y] :
( ( Y = X
| less(Y,X)
| less(X,Y) )
& ( ( Y != X
& ~ less(Y,X) )
| ~ less(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f283]) ).
fof(f283_sk,plain,
! [X,Y] :
( ( Y = X
| less(Y,X)
| less(X,Y) )
& ( ( Y != X
& ~ less(Y,X) )
| ~ less(X,Y) ) ),
inference(skolemisation,[status(esa)],[f283_nnf]) ).
cnf(c283,plain,
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f283_sk]) ).
fof(f401,conjecture,
? [X] :
( ( less(X,n1)
& less(nn1,X) )
=> sum(n21,X,n21) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_something_n0_samething) ).
fof(f401_neg,negated_conjecture,
~ ? [X] :
( ( less(X,n1)
& less(nn1,X) )
=> sum(n21,X,n21) ),
inference(negated_conjecture,[status(cth)],[f401]) ).
fof(f401_nnf,plain,
! [X] :
( ~ sum(n21,X,n21)
& less(X,n1)
& less(nn1,X) ),
inference(nnf_transformation,[status(thm)],[f401_neg]) ).
fof(f401_sk,plain,
! [X] :
( ~ sum(n21,X,n21)
& less(X,n1)
& less(nn1,X) ),
inference(skolemisation,[status(esa)],[f401_nnf]) ).
cnf(c406,plain,
less(nn1,X0),
inference(cnf_transformation,[status(esa)],[f401_sk]) ).
cnf(p419,plain,
~ less(X0,nn1),
inference(resolution,[status(thm)],[c283,c406]) ).
cnf(p421,plain,
$false,
inference(resolution,[status(thm)],[p419,c406]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 03:41:05 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.06/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.06/1.72 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------