%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC028-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 : 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 : Sun Sep 27 08:56:35 AM UTC 2026
% Result : Unsatisfiable 15.17s 7.39s
% Output : CNFRefutation 15.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 15 unt; 0 def)
% Number of atoms : 113 ( 67 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 115 ( 54 ~; 61 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 10 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_11,axiom,
( neq(sk3,nil)
| nil = sk4 ),
file('theBenchmark.p',co1_11) ).
cnf(c_30,plain,
( neq(sk3,nil)
| nil = sk4 ),
inference(clausify,[status(thm)],[co1_11]) ).
fof(clause115,axiom,
! [VAR_0,VAR_1] :
( ~ ssList(VAR_0)
| ~ ssList(VAR_1)
| ~ neq(VAR_0,VAR_1)
| VAR_0 != VAR_1 ),
file('theBenchmark.p',clause115) ).
cnf(c_32,plain,
( ~ ssList(A)
| ~ ssList(B)
| ~ neq(A,B)
| A != B ),
inference(clausify,[status(thm)],[clause115]) ).
cnf(c_36,plain,
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(nil)
| sk3 != nil ),
inference(resolve,[status(thm)],[c_32,c_30]) ).
cnf(c_37,plain,
( sk4 = nil
| ~ ssList(sk3)
| ~ ssList(nil)
| sk3 != nil ),
inference(copy,[status(thm)],[c_36]) ).
fof(clause8,axiom,
ssList(nil),
file('theBenchmark.p',clause8) ).
cnf(c_57,plain,
ssList(nil),
inference(clausify,[status(thm)],[clause8]) ).
fof(clause58,axiom,
! [VAR_0] :
( rearsegP(VAR_0,nil)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause58) ).
cnf(c_107,plain,
( rearsegP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause58]) ).
fof(clause128,axiom,
! [VAR_0,VAR_1] :
( VAR_1 = VAR_0
| ~ ssList(VAR_1)
| ~ ssList(VAR_0)
| ~ rearsegP(VAR_1,VAR_0)
| ~ rearsegP(VAR_0,VAR_1) ),
file('theBenchmark.p',clause128) ).
cnf(c_157,plain,
( B = A
| ~ ssList(B)
| ~ ssList(A)
| ~ rearsegP(B,A)
| ~ rearsegP(A,B) ),
inference(clausify,[status(thm)],[clause128]) ).
fof(co1_3,axiom,
ssList(sk3),
file('theBenchmark.p',co1_3) ).
cnf(c_208,plain,
ssList(sk3),
inference(clausify,[status(thm)],[co1_3]) ).
fof(co1_4,axiom,
ssList(sk4),
file('theBenchmark.p',co1_4) ).
cnf(c_209,plain,
ssList(sk4),
inference(clausify,[status(thm)],[co1_4]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_210,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_211,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_7,axiom,
( nil = sk1
| nil = sk2 ),
file('theBenchmark.p',co1_7) ).
cnf(c_212,plain,
( nil = sk1
| nil = sk2 ),
inference(clausify,[status(thm)],[co1_7]) ).
cnf(c_8407,plain,
( nil = sk1
| nil = sk4 ),
inference(paramod,[status(thm)],[c_210,c_212]) ).
cnf(c_8408,plain,
( nil = sk3
| nil = sk4 ),
inference(paramod,[status(thm)],[c_211,c_8407]) ).
cnf(c_8409,plain,
( nil = sk3
| sk4 = nil ),
inference(copy,[status(thm)],[c_8408]) ).
cnf(c_213,plain,
( sk3 = nil
| sk4 = nil ),
inference(copy,[status(thm)],[c_8409]) ).
fof(co1_10,axiom,
( nil != sk2
| nil != sk1 ),
file('theBenchmark.p',co1_10) ).
cnf(c_216,plain,
( nil != sk2
| nil != sk1 ),
inference(clausify,[status(thm)],[co1_10]) ).
cnf(c_8410,plain,
( nil != sk2
| nil != sk3 ),
inference(paramod,[status(thm)],[c_211,c_216]) ).
cnf(c_8411,plain,
( nil != sk4
| nil != sk3 ),
inference(paramod,[status(thm)],[c_210,c_8410]) ).
cnf(c_8412,plain,
( nil != sk4
| sk3 != nil ),
inference(copy,[status(thm)],[c_8411]) ).
cnf(c_217,plain,
( sk4 != nil
| sk3 != nil ),
inference(copy,[status(thm)],[c_8412]) ).
fof(co1_14,axiom,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('theBenchmark.p',co1_14) ).
cnf(c_220,plain,
( rearsegP(sk4,sk3)
| nil = sk3 ),
inference(clausify,[status(thm)],[co1_14]) ).
cnf(c_221,plain,
( rearsegP(sk4,sk3)
| sk3 = nil ),
inference(copy,[status(thm)],[c_220]) ).
cnf(c_8413,plain,
( sk4 = nil
| ~ ssList(sk3)
| sk3 != nil ),
inference(resolve,[status(thm)],[c_57,c_37]) ).
cnf(c_306,plain,
( sk4 = nil
| sk3 != nil ),
inference(resolve,[status(thm)],[c_208,c_8413]) ).
cnf(c_7081,plain,
rearsegP(sk3,nil),
inference(resolve,[status(thm)],[c_208,c_107]) ).
cnf(c_8414,plain,
( sk4 = sk3
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ rearsegP(sk3,sk4)
| sk3 = nil ),
inference(resolve,[status(thm)],[c_221,c_157]) ).
cnf(c_8415,plain,
( sk4 = sk3
| ~ ssList(sk4)
| ~ rearsegP(sk3,sk4)
| sk3 = nil ),
inference(resolve,[status(thm)],[c_208,c_8414]) ).
cnf(c_7381,plain,
( sk4 = sk3
| ~ rearsegP(sk3,sk4)
| sk3 = nil ),
inference(resolve,[status(thm)],[c_209,c_8415]) ).
cnf(c_8416,plain,
( sk4 = nil
| sk4 = nil ),
inference(resolve,[status(thm)],[c_306,c_213]) ).
cnf(c_8402,plain,
sk4 = nil,
inference(copy,[status(thm)],[c_8416]) ).
cnf(c_8417,plain,
( sk4 = sk3
| ~ rearsegP(sk3,nil)
| sk3 = nil ),
inference(paramod,[status(thm)],[c_8402,c_7381]) ).
cnf(c_8418,plain,
( nil = sk3
| ~ rearsegP(sk3,nil)
| sk3 = nil ),
inference(paramod,[status(thm)],[c_8402,c_8417]) ).
cnf(c_8419,plain,
( sk3 = nil
| ~ rearsegP(sk3,nil)
| sk3 = nil ),
inference(copy,[status(thm)],[c_8418]) ).
cnf(c_8420,plain,
( ~ rearsegP(sk3,nil)
| sk3 = nil ),
inference(copy,[status(thm)],[c_8419]) ).
cnf(c_8405,plain,
sk3 = nil,
inference(resolve,[status(thm)],[c_7081,c_8420]) ).
cnf(c_8421,plain,
( sk4 != nil
| nil != nil ),
inference(paramod,[status(thm)],[c_8405,c_217]) ).
cnf(c_8422,plain,
( nil != nil
| nil != nil ),
inference(paramod,[status(thm)],[c_8402,c_8421]) ).
cnf(c_8423,plain,
nil != nil,
inference(copy,[status(thm)],[c_8422]) ).
cnf(c_8406,plain,
$false,
inference(copy,[status(thm)],[c_8423]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC028-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/5.39 % Computer : n019.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sat Sep 26 12:05:56 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/5.39 % Process 1247365 was started by sandbox2 on n019,
% 0.12/5.39 % Sat Sep 26 12:05:56 2026
% 0.12/5.39 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/5.40
% 0.16/5.40 % From the command line: assign(max_seconds, 300).
% 15.17/7.39
% 15.17/7.39 % SZS status Unsatisfiable for theBenchmark
% 15.17/7.39
% 15.17/7.39 % Proof 1 at 1.54 (+ 0.35) seconds.
% 15.17/7.39 % Length of proof is 23.
% 15.17/7.39 % Level of proof is 6.
% 15.17/7.39 % Maximum clause weight is 15.000.
% 15.17/7.39 % Given clauses 239.
% 15.17/7.39
% 15.17/7.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------