%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC049-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 : n001.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 : Unsatisfiable 28.36s 4.16s
% Output : CNFRefutation 28.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 57 ( 24 unt; 0 def)
% Number of atoms : 117 ( 38 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 119 ( 59 ~; 60 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 18 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_11,axiom,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
file('theBenchmark.p',co1_11) ).
cnf(c_51,plain,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(clausify,[status(thm)],[co1_11]) ).
fof(co1_10,axiom,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('theBenchmark.p',co1_10) ).
cnf(c_52,plain,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
inference(clausify,[status(thm)],[co1_10]) ).
fof(co1_9,axiom,
( nil != sk1
| nil != sk2 ),
file('theBenchmark.p',co1_9) ).
cnf(c_53,plain,
( nil != sk1
| nil != sk2 ),
inference(clausify,[status(thm)],[co1_9]) ).
cnf(c_20288,plain,
( nil != sk1
| sk2 != nil ),
inference(copy,[status(thm)],[c_53]) ).
cnf(c_54,plain,
( sk1 != nil
| sk2 != nil ),
inference(copy,[status(thm)],[c_20288]) ).
fof(co1_8,axiom,
( nil != sk4
| nil = sk3 ),
file('theBenchmark.p',co1_8) ).
cnf(c_55,plain,
( nil != sk4
| nil = sk3 ),
inference(clausify,[status(thm)],[co1_8]) ).
cnf(c_20289,plain,
( nil != sk4
| sk3 = nil ),
inference(copy,[status(thm)],[c_55]) ).
cnf(c_56,plain,
( sk4 != nil
| sk3 = nil ),
inference(copy,[status(thm)],[c_20289]) ).
fof(co1_7,axiom,
! [VAR_0] :
( ~ rearsegP(sk1,VAR_0)
| ~ rearsegP(sk2,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',co1_7) ).
cnf(c_57,plain,
( ~ rearsegP(sk1,A)
| ~ rearsegP(sk2,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_58,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_59,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_4,axiom,
ssList(sk4),
file('theBenchmark.p',co1_4) ).
cnf(c_60,plain,
ssList(sk4),
inference(clausify,[status(thm)],[co1_4]) ).
fof(co1_3,axiom,
ssList(sk3),
file('theBenchmark.p',co1_3) ).
cnf(c_61,plain,
ssList(sk3),
inference(clausify,[status(thm)],[co1_3]) ).
fof(co1_2,axiom,
ssList(sk2),
file('theBenchmark.p',co1_2) ).
cnf(c_62,plain,
ssList(sk2),
inference(clausify,[status(thm)],[co1_2]) ).
fof(co1_1,axiom,
ssList(sk1),
file('theBenchmark.p',co1_1) ).
cnf(c_63,plain,
ssList(sk1),
inference(clausify,[status(thm)],[co1_1]) ).
fof(clause153,axiom,
! [VAR_0,VAR_1,VAR_2] :
( rearsegP(VAR_0,VAR_2)
| ~ ssList(VAR_0)
| ~ ssList(VAR_1)
| ~ ssList(VAR_2)
| ~ rearsegP(VAR_1,VAR_2)
| ~ rearsegP(VAR_0,VAR_1) ),
file('theBenchmark.p',clause153) ).
cnf(c_88,plain,
( rearsegP(A,C)
| ~ ssList(A)
| ~ ssList(B)
| ~ ssList(C)
| ~ rearsegP(B,C)
| ~ rearsegP(A,B) ),
inference(clausify,[status(thm)],[clause153]) ).
fof(clause100,axiom,
! [VAR_0,VAR_1] :
( VAR_1 = VAR_0
| neq(VAR_1,VAR_0)
| ~ ssList(VAR_1)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause100) ).
cnf(c_139,plain,
( B = A
| neq(B,A)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause100]) ).
fof(clause59,axiom,
! [VAR_0] :
( rearsegP(VAR_0,VAR_0)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause59) ).
cnf(c_165,plain,
( rearsegP(A,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause59]) ).
fof(clause8,axiom,
ssList(nil),
file('theBenchmark.p',clause8) ).
cnf(c_216,plain,
ssList(nil),
inference(clausify,[status(thm)],[clause8]) ).
cnf(c_1046,plain,
( sk4 = A
| neq(sk4,A)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_139,c_60]) ).
cnf(c_1091,plain,
rearsegP(sk1,sk1),
inference(resolve,[status(thm)],[c_165,c_63]) ).
cnf(c_1092,plain,
rearsegP(sk2,sk2),
inference(resolve,[status(thm)],[c_165,c_62]) ).
cnf(c_4985,plain,
rearsegP(sk1,sk3),
inference(paramod,[status(thm)],[c_58,c_1091]) ).
cnf(c_4990,plain,
rearsegP(sk2,sk4),
inference(paramod,[status(thm)],[c_59,c_1092]) ).
cnf(c_20290,plain,
( rearsegP(sk2,A)
| ~ ssList(sk2)
| ~ ssList(sk4)
| ~ ssList(A)
| ~ rearsegP(sk4,A) ),
inference(resolve,[status(thm)],[c_4990,c_88]) ).
cnf(c_20291,plain,
( rearsegP(sk2,A)
| ~ ssList(sk2)
| ~ ssList(A)
| ~ rearsegP(sk4,A) ),
inference(resolve,[status(thm)],[c_60,c_20290]) ).
cnf(c_6863,plain,
( rearsegP(sk2,A)
| ~ ssList(A)
| ~ rearsegP(sk4,A) ),
inference(resolve,[status(thm)],[c_62,c_20291]) ).
cnf(c_12945,plain,
( sk4 = nil
| neq(sk4,nil) ),
inference(resolve,[status(thm)],[c_1046,c_216]) ).
cnf(c_12974,plain,
( neq(sk3,nil)
| sk4 = nil ),
inference(resolve,[status(thm)],[c_12945,c_52]) ).
cnf(c_12975,plain,
( rearsegP(sk4,sk3)
| sk4 = nil ),
inference(resolve,[status(thm)],[c_12945,c_51]) ).
cnf(c_20292,plain,
( ~ rearsegP(sk1,sk3)
| ~ rearsegP(sk2,sk3)
| ~ ssList(sk3)
| sk4 = nil ),
inference(resolve,[status(thm)],[c_12974,c_57]) ).
cnf(c_20293,plain,
( ~ rearsegP(sk1,sk3)
| ~ rearsegP(sk2,sk3)
| sk4 = nil ),
inference(resolve,[status(thm)],[c_61,c_20292]) ).
cnf(c_12977,plain,
( ~ rearsegP(sk2,sk3)
| sk4 = nil ),
inference(resolve,[status(thm)],[c_4985,c_20293]) ).
cnf(c_20294,plain,
( sk4 = nil
| rearsegP(sk2,sk3)
| ~ ssList(sk3) ),
inference(resolve,[status(thm)],[c_6863,c_12975]) ).
cnf(c_19629,plain,
( sk4 = nil
| rearsegP(sk2,sk3) ),
inference(resolve,[status(thm)],[c_61,c_20294]) ).
cnf(c_20295,plain,
( sk4 = nil
| sk4 = nil ),
inference(resolve,[status(thm)],[c_19629,c_12977]) ).
cnf(c_19638,plain,
sk4 = nil,
inference(copy,[status(thm)],[c_20295]) ).
cnf(c_19697,plain,
sk3 = nil,
inference(resolve,[status(thm)],[c_19638,c_56]) ).
cnf(c_19801,plain,
sk2 = nil,
inference(paramod,[status(thm)],[c_19638,c_59]) ).
cnf(c_19903,plain,
sk1 != nil,
inference(resolve,[status(thm)],[c_19801,c_54]) ).
cnf(c_20296,plain,
sk3 != nil,
inference(paramod,[status(thm)],[c_58,c_19903]) ).
cnf(c_20287,plain,
$false,
inference(resolve,[status(thm)],[c_19697,c_20296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC049-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.45 % Computer : n001.cluster.edu
% 0.16/0.45 % Model : x86_64 x86_64
% 0.16/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.45 % Memory : 8046.5625MB
% 0.16/0.45 % OS : Linux 6.8.0-71-generic
% 0.16/0.45 % CPULimit : 300
% 0.16/0.45 % WCLimit : 300
% 0.16/0.45 % DateTime : Sat Sep 26 12:13:42 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.45 % Process 1753992 was started by sandbox2 on n001,
% 0.16/0.45 % Sat Sep 26 12:13:42 2026
% 0.16/0.45 % 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).
% 28.36/4.16
% 28.36/4.16 % given #500 (I,wt=35): 557 app(app(A,cons(B,C)),cons(B,D)) != A | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | lt(B,B) | -lt(skaf59(A),skaf60(A)). [factor(296,e,f),merge(g)].
% 28.36/4.16
% 28.36/4.16 % given #1000 (F,wt=13): 4844 cons(skac2,skaf42(A,B)) != nil. [resolve(3343,b,171,a)].
% 28.36/4.16
% 28.36/4.16 % given #1500 (W,wt=8): 12923 sk3 = nil | -rearsegP(sk2,sk3). [resolve(12895,a,57,b),unit_del(b,61),unit_del(d,4985)].
% 28.36/4.16
% 28.36/4.16 % SZS status Unsatisfiable for theBenchmark
% 28.36/4.16
% 28.36/4.16 % Proof 1 at 2.74 (+ 0.91) seconds.
% 28.36/4.16 % Length of proof is 33.
% 28.36/4.16 % Level of proof is 8.
% 28.36/4.16 % Maximum clause weight is 17.000.
% 28.36/4.16 % Given clauses 1959.
% 28.36/4.16
% 28.36/4.16 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------