%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV081+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 : n010.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:12 PM UTC 2026
% Result : Theorem 14.21s 2.26s
% Output : Proof 14.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 25 unt; 0 def)
% Number of atoms : 43 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 3 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-4 aty)
% Number of variables : 10 ( 2 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,conjecture,
( ( leq(pv57,minus(n5,n1))
& leq(n0,pv57) )
=> ( leq(pv57,minus(n5,n1))
& leq(n0,pv57) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0022) ).
fof(f52_neg,negated_conjecture,
~ ( ( leq(pv57,minus(n5,n1))
& leq(n0,pv57) )
=> ( leq(pv57,minus(n5,n1))
& leq(n0,pv57) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ( ~ leq(pv57,minus(n5,n1))
| ~ leq(n0,pv57) )
& leq(pv57,minus(n5,n1))
& leq(n0,pv57) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
( ( ~ leq(pv57,minus(n5,n1))
| ~ leq(n0,pv57) )
& leq(pv57,minus(n5,n1))
& leq(n0,pv57) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c257,plain,
( ~ leq(pv57,minus(n5,n1))
| ~ leq(n0,pv57) ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(t101,plain,
ifeq(leq(n0,pv57),trueq,ifeq(leq(pv57,minus(n5,n1)),trueq,false,trueq),trueq) = trueq,
inference(equality_encoding,[status(esa)],[c257]) ).
cnf(c255,plain,
leq(n0,pv57),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(t29,plain,
leq(n0,pv57) = trueq,
inference(equality_encoding,[status(esa)],[c255]) ).
cnf(t239,plain,
leq(n0,pv57) = trueq,
inference(orient,[status(thm)],[t29]) ).
cnf(t2154,plain,
ifeq(trueq,trueq,ifeq(leq(pv57,minus(n5,n1)),trueq,false,trueq),trueq) = trueq,
inference(step,[status(thm)],[t101,t239]) ).
cnf(t56,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t232,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t56]) ).
cnf(t2155,plain,
ifeq(leq(pv57,minus(n5,n1)),trueq,false,trueq) = trueq,
inference(step,[status(thm)],[t2154,t232]) ).
cnf(c256,plain,
leq(pv57,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(t60,plain,
leq(pv57,minus(n5,n1)) = trueq,
inference(equality_encoding,[status(esa)],[c256]) ).
cnf(t241,plain,
leq(pv57,minus(n5,n1)) = trueq,
inference(orient,[status(thm)],[t60]) ).
cnf(t2156,plain,
ifeq(trueq,trueq,false,trueq) = trueq,
inference(step,[status(thm)],[t2155,t241]) ).
cnf(t2157,plain,
false = trueq,
inference(step,[status(thm)],[t2156,t232]) ).
cnf(t2151,plain,
false = trueq,
inference(orient,[status(thm)],[t2157]) ).
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,c257]) ).
cnf(g0_0,plain,
trueq != trueq,
inference(rw,[status(thm)],[goal_0,t2151]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV081+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 18:28:43 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.21/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.21/2.26 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------