%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC276+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 : n018.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:52 PM UTC 2026
% Result : Theorem 26.02s 3.99s
% Output : Proof 26.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 80 ( 27 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 76 ( 21 ~; 22 |; 22 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 13 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ( ~ memberP(X,Y)
| cons(Y,nil) != W ) ) )
| totalorderedP(U)
| 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)
=> ( ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ( ~ memberP(X,Y)
| cons(Y,nil) != W ) ) )
| totalorderedP(U)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] :
( memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) ) )
& ~ totalorderedP(U)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
( ( ( nil = sk49
& nil = sk50 )
| ( memberP(sk50,sk51)
& cons(sk51,nil) = sk49
& ssItem(sk51) ) )
& ~ totalorderedP(sk47)
& 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(c200,plain,
( nil = sk49
| cons(sk51,nil) = sk49 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
fof(f64,axiom,
! [U] :
( ssItem(U)
=> totalorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(f64_nnf,plain,
! [U] :
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f64]) ).
fof(f64_sk,plain,
! [U] :
( totalorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f64_nnf]) ).
cnf(c145,plain,
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f64_sk]) ).
fof(f65,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax66) ).
fof(f65_nnf,plain,
totalorderedP(nil),
inference(nnf_transformation,[status(thm)],[f65]) ).
cnf(c146,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f65_nnf]) ).
cnf(c198,plain,
( nil = sk49
| ssItem(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p204,plain,
( nil = sk47
| ssItem(sk51) ),
inference(superposition,[status(thm)],[c195,c198]) ).
cnf(c196,plain,
~ totalorderedP(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p208,plain,
( ~ totalorderedP(nil)
| ssItem(sk51) ),
inference(superposition,[status(thm)],[p204,c196]) ).
cnf(p217,plain,
ssItem(sk51),
inference(resolution,[status(thm)],[c146,p208]) ).
cnf(p397,plain,
totalorderedP(cons(sk51,nil)),
inference(resolution,[status(thm)],[c145,p217]) ).
cnf(p399,plain,
( totalorderedP(sk49)
| nil = sk49 ),
inference(superposition,[status(thm)],[c200,p397]) ).
cnf(p410,plain,
( sk47 = nil
| totalorderedP(sk49) ),
inference(superposition,[status(thm)],[p399,c195]) ).
cnf(p434,plain,
( ~ totalorderedP(nil)
| totalorderedP(sk49) ),
inference(superposition,[status(thm)],[p410,c196]) ).
cnf(p435,plain,
totalorderedP(sk49),
inference(resolution,[status(thm)],[p434,c146]) ).
cnf(p436,plain,
totalorderedP(sk47),
inference(superposition,[status(thm)],[c195,p435]) ).
cnf(p437,plain,
$false,
inference(resolution,[status(thm)],[p436,c196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC276+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 17:23:50 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.02/3.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.02/3.99 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------