%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWV189+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 : n006.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:27 PM UTC 2026
% Result : Theorem 57.95s 17.71s
% Output : Proof 57.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 31 unt; 0 def)
% Number of atoms : 95 ( 33 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 35 ~; 19 |; 18 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 46 ( 0 sgn 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/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(f56,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).
fof(f56_nnf,plain,
gt(n0,tptp_minus_1),
inference(nnf_transformation,[status(thm)],[f56]) ).
cnf(c264,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f56_nnf]) ).
cnf(hi261,axiom,
gt(n0,tptp_minus_1) = trueq,
inference(equality_encoding,[status(esa)],[c264]) ).
cnf(h1814,plain,
leq(tptp_minus_1,n0) = trueq,
inference(hyper_resolution,[status(thm)],[hi8,hi261]) ).
fof(f4,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& leq(X,Y) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/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]) ).
fof(f52,conjecture,
( ! [A] :
( ( leq(A,n4)
& leq(n0,A) )
=> a_select3(center_init,A,n0) = init )
=> ! [B] :
( ( leq(B,tptp_minus_1)
& leq(n0,B) )
=> ! [C] :
( ( leq(C,n4)
& leq(n0,C) )
=> a_select3(q_init,B,C) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
fof(f52_neg,negated_conjecture,
~ ( ! [A] :
( ( leq(A,n4)
& leq(n0,A) )
=> a_select3(center_init,A,n0) = init )
=> ! [B] :
( ( leq(B,tptp_minus_1)
& leq(n0,B) )
=> ! [C] :
( ( leq(C,n4)
& leq(n0,C) )
=> a_select3(q_init,B,C) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f52_nnf,plain,
( ? [B] :
( ? [C] :
( a_select3(q_init,B,C) != init
& leq(C,n4)
& leq(n0,C) )
& leq(B,tptp_minus_1)
& leq(n0,B) )
& ! [A] :
( a_select3(center_init,A,n0) = init
| ~ leq(A,n4)
| ~ leq(n0,A) ) ),
inference(nnf_transformation,[status(thm)],[f52_neg]) ).
fof(f52_sk,plain,
! [A] :
( a_select3(q_init,sk27,sk28) != init
& leq(sk28,n4)
& leq(n0,sk28)
& leq(sk27,tptp_minus_1)
& leq(n0,sk27)
& ( a_select3(center_init,A,n0) = init
| ~ leq(A,n4)
| ~ leq(n0,A) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk27,sk28])],[f52_nnf]) ).
cnf(c256,plain,
leq(n0,sk27),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi254,negated_conjecture,
leq(n0,sk27) = trueq,
inference(equality_encoding,[status(esa)],[c256]) ).
cnf(c257,plain,
leq(sk27,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(hi255,negated_conjecture,
leq(sk27,tptp_minus_1) = trueq,
inference(equality_encoding,[status(esa)],[c257]) ).
cnf(h882,plain,
leq(n0,tptp_minus_1) = trueq,
inference(hyper_resolution,[status(thm)],[hi3,hi254,hi255]) ).
fof(f76,axiom,
! [X] :
( ( leq(X,n0)
& leq(n0,X) )
=> X = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f76_nnf,plain,
! [X] :
( X = n0
| ~ leq(X,n0)
| ~ leq(n0,X) ),
inference(nnf_transformation,[status(thm)],[f76]) ).
fof(f76_sk,plain,
! [X] :
( X = n0
| ~ leq(X,n0)
| ~ leq(n0,X) ),
inference(skolemisation,[status(esa)],[f76_nnf]) ).
cnf(c284,plain,
( X0 = n0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f76_sk]) ).
cnf(hi281,axiom,
ifeq(leq(n0,X0),trueq,ifeq(leq(X0,n0),trueq,X0,n0),n0) = n0,
inference(equality_encoding,[status(esa)],[c284]) ).
cnf(t0,plain,
tptp_minus_1 = n0,
inference(hyper_resolution,[status(thm)],[hi281,h882,h1814]) ).
cnf(t1058,plain,
n0 = tptp_minus_1,
inference(orient,[status(thm)],[t0]) ).
fof(f2,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/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]) ).
cnf(t19,plain,
gt(X1,X1) = false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t1122,plain,
gt(X1,X1) = false,
inference(orient,[status(thm)],[t19]) ).
fof(f51,axiom,
def != use,
file('/export/starexec/sandbox/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(c260,plain,
a_select3(q_init,sk27,sk28) != init,
inference(cnf_transformation,[status(esa)],[f52_sk]) ).
cnf(goal_0,negated_conjecture,
trueq != false,
inference(equality_encoding,[status(esa)],[c2,c254,c260]) ).
cnf(g0_0,plain,
trueq != gt(n0,tptp_minus_1),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
trueq != gt(tptp_minus_1,tptp_minus_1),
inference(rw,[status(thm)],[g0_0,t1058]) ).
cnf(g0_2,plain,
trueq != false,
inference(rw,[status(thm)],[g0_1,t1122]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/10.39 % Computer : n006.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Thu Sep 24 18:43:08 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 57.95/17.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 57.95/17.71 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------