%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC286+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:05:53 PM UTC 2026
% Result : Theorem 21.84s 3.62s
% Output : Proof 21.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 96 ( 31 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 104 ( 33 ~; 34 |; 30 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 15 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ( ( nil != W
| nil != X )
& ! [Y] :
( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W
| ~ ssItem(Y) ) )
| strictorderedP(U)
| U != W
| V != X
| ~ ssList(X) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ( ( nil != W
| nil != X )
& ! [Y] :
( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W
| ~ ssItem(Y) ) )
| strictorderedP(U)
| U != W
| V != X
| ~ ssList(X) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] :
( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) ) )
& ~ strictorderedP(U)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
! [Z] :
( ( ( nil = sk49
& nil = sk50 )
| ( ( ~ leq(sk51,Z)
| ~ memberP(sk50,Z)
| sk51 = Z
| ~ ssItem(Z) )
& memberP(sk50,sk51)
& cons(sk51,nil) = sk49
& ssItem(sk51) ) )
& ~ strictorderedP(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(f67,axiom,
! [U] :
( ssItem(U)
=> strictorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f67_nnf,plain,
! [U] :
( strictorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(nnf_transformation,[status(thm)],[f67]) ).
fof(f67_sk,plain,
! [U] :
( strictorderedP(cons(U,nil))
| ~ ssItem(U) ),
inference(skolemisation,[status(esa)],[f67_nnf]) ).
cnf(c152,plain,
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f67_sk]) ).
fof(f68,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f68_nnf,plain,
strictorderedP(nil),
inference(nnf_transformation,[status(thm)],[f68]) ).
cnf(c153,plain,
strictorderedP(nil),
inference(cnf_transformation,[status(esa)],[f68_nnf]) ).
cnf(c198,plain,
( nil = sk49
| ssItem(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p206,plain,
( nil = sk47
| ssItem(sk51) ),
inference(superposition,[status(thm)],[c195,c198]) ).
cnf(c196,plain,
~ strictorderedP(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p210,plain,
( ~ strictorderedP(nil)
| ssItem(sk51) ),
inference(superposition,[status(thm)],[p206,c196]) ).
cnf(p227,plain,
ssItem(sk51),
inference(resolution,[status(thm)],[c153,p210]) ).
cnf(p449,plain,
strictorderedP(cons(sk51,nil)),
inference(resolution,[status(thm)],[c152,p227]) ).
cnf(p451,plain,
( strictorderedP(sk49)
| nil = sk49 ),
inference(superposition,[status(thm)],[c200,p449]) ).
cnf(p462,plain,
( sk47 = nil
| strictorderedP(sk49) ),
inference(superposition,[status(thm)],[p451,c195]) ).
cnf(p486,plain,
( ~ strictorderedP(nil)
| strictorderedP(sk49) ),
inference(superposition,[status(thm)],[p462,c196]) ).
cnf(p487,plain,
strictorderedP(sk49),
inference(resolution,[status(thm)],[p486,c153]) ).
cnf(p488,plain,
strictorderedP(sk47),
inference(superposition,[status(thm)],[c195,p487]) ).
cnf(p489,plain,
$false,
inference(resolution,[status(thm)],[p488,c196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC286+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 17:25:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 21.84/3.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.84/3.62 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------