%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV136+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n013.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 51.80s 7.37s
% Output : Proof 51.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 29 unt; 0 def)
% Number of atoms : 89 ( 19 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 71 ( 23 ~; 9 |; 35 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-4 aty)
% Number of variables : 35 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(n0,pv1325) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0006) ).
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(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) ),
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) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c264,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(t177,plain,
ifeq(leq(n0,pv1325),trueq,false,trueq) = trueq,
inference(equality_encoding,[status(esa)],[c264]) ).
fof(f7,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt1) ).
fof(f7_nnf,plain,
! [X,Y] :
( leq(X,Y)
| ~ gt(Y,X) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [Y,X] :
( leq(X,Y)
| ~ gt(Y,X) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c9,plain,
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(hi8,axiom,
ifeq(gt(X0,X1),trueq,leq(X1,X0),trueq) = trueq,
inference(equality_encoding,[status(esa)],[c9]) ).
fof(f63,axiom,
gt(n2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_0) ).
fof(f63_nnf,plain,
gt(n2,n0),
inference(nnf_transformation,[status(thm)],[f63]) ).
cnf(c275,plain,
gt(n2,n0),
inference(cnf_transformation,[status(esa)],[f63_nnf]) ).
cnf(hi272,axiom,
gt(n2,n0) = trueq,
inference(equality_encoding,[status(esa)],[c275]) ).
cnf(h4369,plain,
leq(n0,n2) = trueq,
inference(hyper_resolution,[status(thm)],[hi8,hi272]) ).
fof(f4,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& leq(X,Y) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f4_nnf,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi3,axiom,
ifeq(leq(X0,X1),trueq,ifeq(leq(X1,X2),trueq,leq(X0,X2),trueq),trueq) = trueq,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(c258,plain,
leq(n2,pv1325),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi256,negated_conjecture,
leq(n2,pv1325) = trueq,
inference(equality_encoding,[status(esa)],[c258]) ).
cnf(t56,plain,
leq(n0,pv1325) = trueq,
inference(hyper_resolution,[status(thm)],[hi3,h4369,hi256]) ).
cnf(t483,plain,
leq(n0,pv1325) = trueq,
inference(orient,[status(thm)],[t56]) ).
cnf(t1070,plain,
ifeq(trueq,trueq,false,trueq) = trueq,
inference(step,[status(thm)],[t177,t483]) ).
cnf(t116,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t280,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t116]) ).
cnf(t1071,plain,
false = trueq,
inference(step,[status(thm)],[t1070,t280]) ).
cnf(t1046,plain,
false = trueq,
inference(orient,[status(thm)],[t1071]) ).
fof(f2,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f2_nnf,plain,
! [X] : ~ gt(X,X),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] : ~ gt(X,X),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
fof(f51,axiom,
def != use,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',defuse) ).
fof(f51_nnf,plain,
def != use,
inference(nnf_transformation,[status(thm)],[f51]) ).
fof(f51_sk,plain,
def != use,
inference(skolemisation,[status(esa)],[f51_nnf]) ).
cnf(c254,plain,
def != use,
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
cnf(goal_0,negated_conjecture,
trueq != false,
inference(equality_encoding,[status(esa)],[c2,c254,c264]) ).
cnf(g0_0,plain,
trueq != trueq,
inference(rw,[status(thm)],[goal_0,t1046]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV136+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 18:35:06 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 51.80/7.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 51.80/7.37 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------