%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC369+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Sun Sep 27 08:57:37 AM UTC 2026
% Result : Theorem 13.00s 2.23s
% Output : CNFRefutation 13.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 114 ( 41 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 118 ( 40 ~; 35 |; 31 &)
% ( 1 <=>; 11 =>; 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 : 19 ( 0 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('theBenchmark.p',ax15) ).
fof(ax55,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('theBenchmark.p',ax55) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ~ segmentP(X,W)
| ~ neq(W,nil) )
& neq(X,nil) )
| ( nil = X
& nil != W )
| segmentP(V,U)
| U != W
| V != X ) ) ) ) ),
file('theBenchmark.p',co1) ).
fof(co1_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ~ segmentP(X,W)
| ~ neq(W,nil) )
& neq(X,nil) )
| ( nil = X
& nil != W )
| segmentP(V,U)
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( segmentP(X,W)
& neq(W,nil) )
| ~ neq(X,nil) )
& ( nil != X
| nil = W )
& ~ segmentP(V,U)
& W = U
& X = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(fof_nnf,[status(thm)],[co1_neg]) ).
fof(sk_co1_neg_sk,plain,
( ( ( segmentP(sK0,sK1)
& neq(sK1,nil) )
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil = sK1 )
& ~ segmentP(sK2,sK3)
& sK1 = sK3
& sK0 = sK2
& ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK2,sK1,sK0]),skolemize(U,sK3),skolemize(V,sK2),skolemize(W,sK1),skolemize(X,sK0)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( segmentP(sK0,sK1)
| ~ neq(sK0,nil) )
& ( neq(sK1,nil)
| ~ neq(sK0,nil) )
& ( nil != sK0
| nil = sK1 )
& ~ segmentP(sK2,sK3)
& sK1 = sK3
& sK0 = sK2
& ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_190,negated_conjecture,
( segmentP(sK0,sK1)
| ~ neq(sK0,nil) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_192,negated_conjecture,
( nil != sK0
| nil = sK1 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_1805,negated_conjecture,
( nil != sK0
| sK1 = nil ),
inference(copy,[status(thm)],[c_192]) ).
cnf(c_193,negated_conjecture,
( sK0 != nil
| sK1 = nil ),
inference(copy,[status(thm)],[c_1805]) ).
cnf(c_194,negated_conjecture,
~ segmentP(sK2,sK3),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_195,negated_conjecture,
sK1 = sK3,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_196,negated_conjecture,
sK0 = sK2,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_197,negated_conjecture,
ssList(sK0),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_198,negated_conjecture,
ssList(sK2),
inference(paramod,[status(thm)],[c_196,c_197]) ).
cnf(c_245,plain,
( segmentP(A,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax55]) ).
fof(ax17,axiom,
ssList(nil),
file('theBenchmark.p',ax17) ).
cnf(c_296,plain,
ssList(nil),
inference(clausify,[status(thm)],[ax17]) ).
cnf(c_298,plain,
( B = A
| neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
cnf(c_1806,negated_conjecture,
( sK0 != nil
| sK3 = nil ),
inference(paramod,[status(thm)],[c_195,c_193]) ).
cnf(c_545,negated_conjecture,
( sK2 != nil
| sK3 = nil ),
inference(paramod,[status(thm)],[c_196,c_1806]) ).
cnf(c_1807,negated_conjecture,
( segmentP(sK0,sK1)
| ~ neq(sK2,nil) ),
inference(paramod,[status(thm)],[c_196,c_190]) ).
cnf(c_1808,negated_conjecture,
( segmentP(sK2,sK1)
| ~ neq(sK2,nil) ),
inference(paramod,[status(thm)],[c_196,c_1807]) ).
cnf(c_1809,negated_conjecture,
( segmentP(sK2,sK3)
| ~ neq(sK2,nil) ),
inference(paramod,[status(thm)],[c_195,c_1808]) ).
cnf(c_547,negated_conjecture,
~ neq(sK2,nil),
inference(resolve,[status(thm)],[c_194,c_1809]) ).
cnf(c_1761,plain,
segmentP(nil,nil),
inference(resolve,[status(thm)],[c_296,c_245]) ).
cnf(c_1810,negated_conjecture,
( A = sK2
| neq(sK2,A)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_298,c_198]) ).
cnf(c_1811,negated_conjecture,
( nil = sK2
| neq(sK2,nil) ),
inference(resolve,[status(thm)],[c_1810,c_296]) ).
cnf(c_1812,negated_conjecture,
( sK2 = nil
| neq(sK2,nil) ),
inference(copy,[status(thm)],[c_1811]) ).
cnf(c_1800,negated_conjecture,
sK2 = nil,
inference(resolve,[status(thm)],[c_547,c_1812]) ).
cnf(c_1813,negated_conjecture,
( nil != nil
| sK3 = nil ),
inference(paramod,[status(thm)],[c_1800,c_545]) ).
cnf(c_1802,negated_conjecture,
sK3 = nil,
inference(copy,[status(thm)],[c_1813]) ).
cnf(c_1814,negated_conjecture,
~ segmentP(nil,sK3),
inference(paramod,[status(thm)],[c_1800,c_194]) ).
cnf(c_1815,negated_conjecture,
~ segmentP(nil,nil),
inference(paramod,[status(thm)],[c_1802,c_1814]) ).
cnf(c_1804,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1761,c_1815]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC369+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n004.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sat Sep 26 12:53:36 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.43 % Process 1756934 was started by sandbox2 on n004,
% 0.16/0.43 % Sat Sep 26 12:53:36 2026
% 0.16/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.47
% 0.16/0.47 % From the command line: assign(max_seconds, 300).
% 13.00/2.23
% 13.00/2.23 % SZS status Theorem for theBenchmark
% 13.00/2.23
% 13.00/2.23 % Proof 1 at 1.60 (+ 0.13) seconds.
% 13.00/2.23 % Length of proof is 20.
% 13.00/2.23 % Level of proof is 5.
% 13.00/2.23 % Maximum clause weight is 15.000.
% 13.00/2.23 % Given clauses 126.
% 13.00/2.23
% 13.00/2.23 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------