%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV078+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 : n004.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:11 PM UTC 2026
% Result : Theorem 17.00s 2.79s
% Output : Proof 17.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 22 unt; 0 def)
% Number of atoms : 55 ( 21 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 7 |; 14 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-4 aty)
% Number of variables : 4 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,conjecture,
( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv70
=> true )
& ( n0 != pv70
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0019) ).
fof(f52_neg,negated_conjecture,
~ ( ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) )
=> ( ( n0 = pv70
=> true )
& ( n0 != pv70
=> ( leq(pv31,minus(n5,n1))
& leq(n0,pv31) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ( ( ~ true
& n0 = pv70 )
| ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv70 ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
( ( ( ~ true
& n0 = pv70 )
| ( ( ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) )
& n0 != pv70 ) )
& leq(pv31,minus(n5,n1))
& leq(n0,pv31) ),
inference(skolemisation,[status(esa)],[f52_nnf]) ).
cnf(c260,plain,
( ~ true
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31) ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi291,negated_conjecture,
ifeq(leq(n0,pv31),trueq,ifeq(leq(pv31,minus(n5,n1)),trueq,ifeq(true,trueq,false,trueq),trueq),trueq) = trueq,
inference(equality_encoding,[status(esa)],[c260]) ).
cnf(c255,plain,
leq(n0,pv31),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi253,negated_conjecture,
leq(n0,pv31) = trueq,
inference(equality_encoding,[status(esa)],[c255]) ).
cnf(c256,plain,
leq(pv31,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi254,negated_conjecture,
leq(pv31,minus(n5,n1)) = trueq,
inference(equality_encoding,[status(esa)],[c256]) ).
fof(f50,axiom,
true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).
fof(f50_nnf,plain,
true,
inference(nnf_transformation,[status(thm)],[f50]) ).
cnf(c253,plain,
true,
inference(cnf_transformation,[status(esa)],[f50_nnf]) ).
cnf(hi252,axiom,
true = trueq,
inference(equality_encoding,[status(esa)],[c253]) ).
cnf(t0,plain,
trueq = false,
inference(hyper_resolution,[status(thm)],[hi291,hi253,hi254,hi252]) ).
cnf(t3460,plain,
false = trueq,
inference(orient,[status(thm)],[t0]) ).
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(c258,plain,
( ~ true
| n0 != pv70 ),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(goal_0,negated_conjecture,
trueq != false,
inference(equality_encoding,[status(esa)],[c2,c254,c258,c260]) ).
cnf(g0_0,plain,
trueq != trueq,
inference(rw,[status(thm)],[goal_0,t3460]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV078+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.55 % Computer : n004.cluster.edu
% 0.08/0.55 % Model : x86_64 x86_64
% 0.08/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.55 % Memory : 8046.5625MB
% 0.08/0.55 % OS : Linux 6.8.0-71-generic
% 0.08/0.55 % CPULimit : 300
% 0.08/0.55 % WCLimit : 300
% 0.08/0.55 % DateTime : Thu Sep 24 18:27:22 UTC 2026
% 0.08/0.55 % CPUTime :
% 0.08/0.55 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 17.00/2.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.00/2.79 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------