%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC050+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:56:40 AM UTC 2026
% Result : Theorem 8.66s 1.96s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 136 ( 12 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 171 ( 64 ~; 54 |; 43 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [Z] :
( ssList(Z)
=> ( ~ rearsegP(W,Z)
| ~ rearsegP(X,Z)
| ~ neq(Z,nil) ) )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) ) )
| 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)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [Z] :
( ssList(Z)
=> ( ~ rearsegP(W,Z)
| ~ rearsegP(X,Z)
| ~ neq(Z,nil) ) )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ? [Z] :
( rearsegP(W,Z)
& rearsegP(X,Z)
& neq(Z,nil)
& ssList(Z) )
& ! [Y] :
( ~ rearsegP(U,Y)
| ~ rearsegP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(V,nil) ) )
& 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,
( ( ( ~ neq(sK2,nil)
& neq(sK3,nil) )
| ( rearsegP(sK0,sK1)
& rearsegP(sK2,sK1)
& neq(sK1,nil)
& ssList(sK1)
& ! [Y] :
( ~ rearsegP(sK4,Y)
| ~ rearsegP(sK3,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(sK3,nil) ) )
& sK0 = sK4
& sK2 = sK3
& ssList(sK2)
& ssList(sK0)
& ssList(sK3)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK3,sK0,sK2,sK1]),skolemize(U,sK4),skolemize(V,sK3),skolemize(W,sK0),skolemize(X,sK2),skolemize(Z,sK1)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( ~ neq(sK2,nil)
| rearsegP(sK0,sK1) )
& ( ~ neq(sK2,nil)
| rearsegP(sK2,sK1) )
& ( ~ neq(sK2,nil)
| neq(sK1,nil) )
& ( ~ neq(sK2,nil)
| ssList(sK1) )
& ! [VAR_0] :
( ~ neq(sK2,nil)
| ~ rearsegP(sK4,VAR_0)
| ~ rearsegP(sK3,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0) )
& neq(sK3,nil)
& sK0 = sK4
& sK2 = sK3
& ssList(sK2)
& ssList(sK0)
& ssList(sK3)
& ssList(sK4) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_190,negated_conjecture,
( ~ neq(sK2,nil)
| rearsegP(sK0,sK1) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_191,negated_conjecture,
( ~ neq(sK2,nil)
| rearsegP(sK2,sK1) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_192,negated_conjecture,
( ~ neq(sK2,nil)
| neq(sK1,nil) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_193,negated_conjecture,
( ~ neq(sK2,nil)
| ssList(sK1) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_194,negated_conjecture,
( ~ neq(sK2,nil)
| ~ rearsegP(sK4,A)
| ~ rearsegP(sK3,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_195,negated_conjecture,
neq(sK3,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_196,negated_conjecture,
sK0 = sK4,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_197,negated_conjecture,
sK2 = sK3,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2445,negated_conjecture,
( ~ neq(sK2,nil)
| rearsegP(sK4,sK1) ),
inference(paramod,[status(thm)],[c_196,c_190]) ).
cnf(c_2446,negated_conjecture,
( ~ neq(sK3,nil)
| rearsegP(sK4,sK1) ),
inference(paramod,[status(thm)],[c_197,c_2445]) ).
cnf(c_547,negated_conjecture,
rearsegP(sK4,sK1),
inference(resolve,[status(thm)],[c_195,c_2446]) ).
cnf(c_2447,negated_conjecture,
( ~ neq(sK3,nil)
| ~ rearsegP(sK4,A)
| ~ rearsegP(sK3,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(paramod,[status(thm)],[c_197,c_194]) ).
cnf(c_548,negated_conjecture,
( ~ rearsegP(sK4,A)
| ~ rearsegP(sK3,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_195,c_2447]) ).
cnf(c_2448,negated_conjecture,
( ~ neq(sK3,nil)
| ssList(sK1) ),
inference(paramod,[status(thm)],[c_197,c_193]) ).
cnf(c_549,negated_conjecture,
ssList(sK1),
inference(resolve,[status(thm)],[c_195,c_2448]) ).
cnf(c_2449,negated_conjecture,
( ~ neq(sK3,nil)
| neq(sK1,nil) ),
inference(paramod,[status(thm)],[c_197,c_192]) ).
cnf(c_550,negated_conjecture,
neq(sK1,nil),
inference(resolve,[status(thm)],[c_195,c_2449]) ).
cnf(c_2450,negated_conjecture,
( ~ neq(sK2,nil)
| rearsegP(sK3,sK1) ),
inference(paramod,[status(thm)],[c_197,c_191]) ).
cnf(c_2451,negated_conjecture,
( ~ neq(sK3,nil)
| rearsegP(sK3,sK1) ),
inference(paramod,[status(thm)],[c_197,c_2450]) ).
cnf(c_551,negated_conjecture,
rearsegP(sK3,sK1),
inference(resolve,[status(thm)],[c_195,c_2451]) ).
cnf(c_2452,negated_conjecture,
( ~ rearsegP(sK3,sK1)
| ~ neq(sK1,nil)
| ~ ssList(sK1) ),
inference(resolve,[status(thm)],[c_548,c_547]) ).
cnf(c_2453,negated_conjecture,
( ~ rearsegP(sK3,sK1)
| ~ neq(sK1,nil) ),
inference(resolve,[status(thm)],[c_549,c_2452]) ).
cnf(c_2454,negated_conjecture,
~ rearsegP(sK3,sK1),
inference(resolve,[status(thm)],[c_550,c_2453]) ).
cnf(c_2444,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_551,c_2454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC050+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.76 % Computer : n015.cluster.edu
% 0.09/0.76 % Model : x86_64 x86_64
% 0.09/0.76 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.76 % Memory : 8046.5625MB
% 0.09/0.76 % OS : Linux 6.8.0-71-generic
% 0.09/0.76 % CPULimit : 300
% 0.09/0.76 % WCLimit : 300
% 0.09/0.76 % DateTime : Sat Sep 26 12:11:46 UTC 2026
% 0.09/0.76 % CPUTime :
% 0.09/0.76 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.76 % Process 3992174 was started by sandbox on n015,
% 0.09/0.76 % Sat Sep 26 12:11:46 2026
% 0.09/0.76 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.79
% 0.09/0.79 % From the command line: assign(max_seconds, 300).
% 8.66/1.96
% 8.66/1.96 % SZS status Theorem for theBenchmark
% 8.66/1.96
% 8.66/1.96 % Proof 1 at 1.04 (+ 0.12) seconds.
% 8.66/1.96 % Length of proof is 15.
% 8.66/1.96 % Level of proof is 3.
% 8.66/1.96 % Maximum clause weight is 16.000.
% 8.66/1.96 % Given clauses 353.
% 8.66/1.96
% 8.66/1.96 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------