%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC121+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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:05:24 PM UTC 2026
% Result : Theorem 21.15s 13.91s
% Output : Proof 21.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 78 ( 10 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 86 ( 30 ~; 24 |; 24 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ( segmentP(V,U)
& neq(U,nil) )
| ~ segmentP(X,W)
| ~ neq(W,nil)
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ( segmentP(V,U)
& neq(U,nil) )
| ~ segmentP(X,W)
| ~ neq(W,nil)
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ( ~ segmentP(V,U)
| ~ neq(U,nil) )
& segmentP(X,W)
& neq(W,nil)
& neq(V,nil) ) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
( ( ( ~ neq(sk50,nil)
& neq(sk48,nil) )
| ( ( ~ segmentP(sk48,sk47)
| ~ neq(sk47,nil) )
& segmentP(sk50,sk49)
& neq(sk49,nil)
& neq(sk48,nil) ) )
& sk47 = sk49
& sk48 = sk50
& ssList(sk50)
& ssList(sk49)
& ssList(sk48)
& ssList(sk47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50])],[f95_nnf]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c199,plain,
( ~ neq(sk50,nil)
| neq(sk49,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p206,plain,
( ~ neq(sk48,nil)
| neq(sk49,nil) ),
inference(superposition,[status(thm)],[c194,c199]) ).
cnf(c196,plain,
( neq(sk48,nil)
| neq(sk48,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p205,plain,
neq(sk48,nil),
inference(factoring,[status(thm)],[c196]) ).
cnf(p208,plain,
neq(sk49,nil),
inference(resolution,[status(thm)],[p206,p205]) ).
cnf(p209,plain,
neq(sk47,nil),
inference(superposition,[status(thm)],[c195,p208]) ).
cnf(c203,plain,
( ~ neq(sk50,nil)
| ~ segmentP(sk48,sk47)
| ~ neq(sk47,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p210,plain,
( ~ neq(sk50,nil)
| ~ segmentP(sk48,sk47) ),
inference(resolution,[status(thm)],[p209,c203]) ).
cnf(c201,plain,
( ~ neq(sk50,nil)
| segmentP(sk50,sk49) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p207,plain,
( ~ neq(sk48,nil)
| segmentP(sk50,sk49) ),
inference(superposition,[status(thm)],[c194,c201]) ).
cnf(p211,plain,
segmentP(sk50,sk49),
inference(resolution,[status(thm)],[p207,p205]) ).
cnf(p212,plain,
segmentP(sk48,sk49),
inference(superposition,[status(thm)],[c194,p211]) ).
cnf(p214,plain,
segmentP(sk48,sk47),
inference(superposition,[status(thm)],[c195,p212]) ).
cnf(p215,plain,
~ neq(sk50,nil),
inference(resolution,[status(thm)],[p210,p214]) ).
cnf(p216,plain,
~ neq(sk48,nil),
inference(superposition,[status(thm)],[c194,p215]) ).
cnf(p217,plain,
$false,
inference(resolution,[status(thm)],[p216,p205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC121+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/10.76 % Computer : n004.cluster.edu
% 0.11/10.76 % Model : x86_64 x86_64
% 0.11/10.76 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.76 % Memory : 8046.5625MB
% 0.11/10.76 % OS : Linux 6.8.0-71-generic
% 0.11/10.77 % CPULimit : 300
% 0.11/10.77 % WCLimit : 300
% 0.11/10.77 % DateTime : Thu Sep 24 16:30:36 UTC 2026
% 0.11/10.77 % CPUTime :
% 0.11/10.77 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 21.15/13.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.15/13.91 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------