%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n014.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:06:01 PM UTC 2026
% Result : Theorem 28.98s 4.20s
% Output : Proof 28.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 142 ( 10 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 177 ( 70 ~; 59 |; 38 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 12 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( totalorderedP(U)
& segmentP(V,U)
& ! [Z] :
( ssList(Z)
=> ( ~ totalorderedP(Z)
| ~ segmentP(Z,U)
| ~ segmentP(V,Z)
| ~ neq(U,Z) ) ) )
| ? [Y] :
( totalorderedP(Y)
& segmentP(Y,W)
& segmentP(X,Y)
& neq(W,Y)
& ssList(Y) )
| ~ totalorderedP(W)
| ~ segmentP(X,W)
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( totalorderedP(U)
& segmentP(V,U)
& ! [Z] :
( ssList(Z)
=> ( ~ totalorderedP(Z)
| ~ segmentP(Z,U)
| ~ segmentP(V,Z)
| ~ neq(U,Z) ) ) )
| ? [Y] :
( totalorderedP(Y)
& segmentP(Y,W)
& segmentP(X,Y)
& neq(W,Y)
& ssList(Y) )
| ~ totalorderedP(W)
| ~ segmentP(X,W)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ~ totalorderedP(U)
| ~ segmentP(V,U)
| ? [Z] :
( totalorderedP(Z)
& segmentP(Z,U)
& segmentP(V,Z)
& neq(U,Z)
& ssList(Z) ) )
& ! [Y] :
( ~ totalorderedP(Y)
| ~ segmentP(Y,W)
| ~ segmentP(X,Y)
| ~ neq(W,Y)
| ~ ssList(Y) )
& totalorderedP(W)
& segmentP(X,W)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
! [Y] :
( ( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| ( totalorderedP(sk51)
& segmentP(sk51,sk47)
& segmentP(sk48,sk51)
& neq(sk47,sk51)
& ssList(sk51) ) )
& ( ~ totalorderedP(Y)
| ~ segmentP(Y,sk49)
| ~ segmentP(sk50,Y)
| ~ neq(sk49,Y)
| ~ ssList(Y) )
& totalorderedP(sk49)
& segmentP(sk50,sk49)
& sk47 = sk49
& sk48 = sk50
& ssList(sk50)
& ssList(sk49)
& ssList(sk48)
& ssList(sk47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50,sk51])],[f95_nnf]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c198,plain,
( ~ totalorderedP(X4)
| ~ segmentP(X4,sk49)
| ~ segmentP(sk50,X4)
| ~ neq(sk49,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c196,plain,
segmentP(sk50,sk49),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p205,plain,
segmentP(sk48,sk49),
inference(superposition,[status(thm)],[c194,c196]) ).
cnf(p207,plain,
segmentP(sk48,sk47),
inference(superposition,[status(thm)],[c195,p205]) ).
cnf(c199,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| ssList(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p208,plain,
( ~ totalorderedP(sk47)
| ssList(sk51) ),
inference(resolution,[status(thm)],[p207,c199]) ).
cnf(c197,plain,
totalorderedP(sk49),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p204,plain,
totalorderedP(sk47),
inference(superposition,[status(thm)],[c195,c197]) ).
cnf(p210,plain,
ssList(sk51),
inference(resolution,[status(thm)],[p208,p204]) ).
cnf(p222,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk49)
| ~ segmentP(sk50,sk51)
| ~ neq(sk49,sk51) ),
inference(resolution,[status(thm)],[c198,p210]) ).
cnf(p229,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk49)
| ~ segmentP(sk50,sk51)
| ~ neq(sk47,sk51) ),
inference(superposition,[status(thm)],[c195,p222]) ).
cnf(c200,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| neq(sk47,sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p212,plain,
( ~ totalorderedP(sk47)
| neq(sk47,sk51) ),
inference(resolution,[status(thm)],[c200,p207]) ).
cnf(p213,plain,
neq(sk47,sk51),
inference(resolution,[status(thm)],[p212,p204]) ).
cnf(p232,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk49)
| ~ segmentP(sk50,sk51) ),
inference(resolution,[status(thm)],[p229,p213]) ).
cnf(p233,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk49)
| ~ segmentP(sk48,sk51) ),
inference(superposition,[status(thm)],[c194,p232]) ).
cnf(c201,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| segmentP(sk48,sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p214,plain,
( ~ totalorderedP(sk47)
| segmentP(sk48,sk51) ),
inference(resolution,[status(thm)],[c201,p207]) ).
cnf(p215,plain,
segmentP(sk48,sk51),
inference(resolution,[status(thm)],[p214,p204]) ).
cnf(p234,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk49) ),
inference(resolution,[status(thm)],[p233,p215]) ).
cnf(p235,plain,
( ~ totalorderedP(sk51)
| ~ segmentP(sk51,sk47) ),
inference(superposition,[status(thm)],[c195,p234]) ).
cnf(c202,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| segmentP(sk51,sk47) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p216,plain,
( ~ totalorderedP(sk47)
| segmentP(sk51,sk47) ),
inference(resolution,[status(thm)],[c202,p207]) ).
cnf(p217,plain,
segmentP(sk51,sk47),
inference(resolution,[status(thm)],[p216,p204]) ).
cnf(p236,plain,
~ totalorderedP(sk51),
inference(resolution,[status(thm)],[p235,p217]) ).
cnf(c203,plain,
( ~ totalorderedP(sk47)
| ~ segmentP(sk48,sk47)
| totalorderedP(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
( ~ totalorderedP(sk47)
| totalorderedP(sk51) ),
inference(resolution,[status(thm)],[p207,c203]) ).
cnf(p211,plain,
totalorderedP(sk51),
inference(resolution,[status(thm)],[p209,p204]) ).
cnf(p237,plain,
$false,
inference(resolution,[status(thm)],[p236,p211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.16/0.43 % Computer : n014.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Thu Sep 24 17:40:32 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 28.98/4.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.98/4.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------