%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV133+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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 03:12:20 PM UTC 2026
% Result : Theorem 36.82s 10.74s
% Output : Proof 36.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 79 ( 21 ~; 13 |; 41 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f12_nnf,plain,
! [X,Y] :
( ( ~ gt(succ(Y),X)
| leq(X,Y) )
& ( gt(succ(Y),X)
| ~ leq(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [X,Y] :
( ( ~ gt(succ(Y),X)
| leq(X,Y) )
& ( gt(succ(Y),X)
| ~ leq(X,Y) ) ),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c15,plain,
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
fof(f52,conjecture,
( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0003) ).
fof(f52_neg,negated_conjecture,
~ ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
( ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c259,plain,
leq(n2,pv1325),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p404,plain,
gt(succ(pv1325),n2),
inference(resolution,[status(thm)],[c15,c259]) ).
fof(f1,axiom,
! [X,Y,Z] :
( ( gt(Y,Z)
& gt(X,Y) )
=> gt(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_gt) ).
fof(f1_nnf,plain,
! [X,Y,Z] :
( gt(X,Z)
| ~ gt(Y,Z)
| ~ gt(X,Y) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z] :
( gt(X,Z)
| ~ gt(Y,Z)
| ~ gt(X,Y) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p471,plain,
( gt(succ(pv1325),X0)
| ~ gt(n2,X0) ),
inference(resolution,[status(thm)],[p404,c1]) ).
fof(f63,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_0) ).
fof(f63_nnf,plain,
gt(n2,n0),
inference(nnf_transformation,[status(thm)],[f63]) ).
cnf(c276,plain,
gt(n2,n0),
inference(cnf_transformation,[status(esa)],[f63_nnf]) ).
cnf(p10242,plain,
gt(succ(pv1325),n0),
inference(resolution,[status(thm)],[p471,c276]) ).
cnf(c16,plain,
( ~ gt(succ(X1),X0)
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p10339,plain,
leq(n0,pv1325),
inference(resolution,[status(thm)],[p10242,c16]) ).
cnf(c265,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(p10340,plain,
$false,
inference(resolution,[status(thm)],[p10339,c265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV133+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/5.36 % Computer : n016.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Thu Sep 24 18:40:19 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.08/5.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 36.82/10.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.82/10.74 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------