%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC269+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 : n019.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:51 PM UTC 2026
% Result : Theorem 29.12s 4.20s
% Output : Proof 29.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 5 unt; 0 def)
% Number of atoms : 61 ( 9 equ)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 74 ( 22 ~; 18 |; 26 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 10 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( totalorderedP(U)
| ? [Y] :
( totalorderedP(Y)
& segmentP(Y,W)
& frontsegP(X,Y)
& neq(W,Y)
& ssList(Y) )
| ~ totalorderedP(W)
| ~ frontsegP(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)
| ? [Y] :
( totalorderedP(Y)
& segmentP(Y,W)
& frontsegP(X,Y)
& neq(W,Y)
& ssList(Y) )
| ~ totalorderedP(W)
| ~ frontsegP(X,W)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ~ totalorderedP(U)
& ! [Y] :
( ~ totalorderedP(Y)
| ~ segmentP(Y,W)
| ~ frontsegP(X,Y)
| ~ neq(W,Y)
| ~ ssList(Y) )
& totalorderedP(W)
& frontsegP(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)
& ( ~ totalorderedP(Y)
| ~ segmentP(Y,sk49)
| ~ frontsegP(sk50,Y)
| ~ neq(sk49,Y)
| ~ ssList(Y) )
& totalorderedP(sk49)
& frontsegP(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])],[f95_nnf]) ).
cnf(c199,plain,
~ totalorderedP(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c197,plain,
totalorderedP(sk49),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p207,plain,
totalorderedP(sk47),
inference(superposition,[status(thm)],[c195,c197]) ).
cnf(p216,plain,
$false,
inference(resolution,[status(thm)],[c199,p207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC269+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n019.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 17:20:19 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 29.12/4.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.12/4.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------