%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC023-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 : 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:34 AM UTC 2026
% Result : Unsatisfiable 14.97s 2.62s
% Output : CNFRefutation 14.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 17 unt; 0 def)
% Number of atoms : 79 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 78 ( 39 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 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 : 8 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_13,axiom,
( nil = sk4
| frontsegP(sk3,sk5) ),
file('theBenchmark.p',co1_13) ).
cnf(c_57,plain,
( nil = sk4
| frontsegP(sk3,sk5) ),
inference(clausify,[status(thm)],[co1_13]) ).
cnf(c_58,plain,
( sk4 = nil
| frontsegP(sk3,sk5) ),
inference(copy,[status(thm)],[c_57]) ).
fof(co1_12,axiom,
( nil = sk4
| frontsegP(sk4,sk5) ),
file('theBenchmark.p',co1_12) ).
cnf(c_59,plain,
( nil = sk4
| frontsegP(sk4,sk5) ),
inference(clausify,[status(thm)],[co1_12]) ).
cnf(c_60,plain,
( sk4 = nil
| frontsegP(sk4,sk5) ),
inference(copy,[status(thm)],[c_59]) ).
fof(co1_11,axiom,
( nil = sk4
| neq(sk5,nil) ),
file('theBenchmark.p',co1_11) ).
cnf(c_61,plain,
( nil = sk4
| neq(sk5,nil) ),
inference(clausify,[status(thm)],[co1_11]) ).
cnf(c_62,plain,
( sk4 = nil
| neq(sk5,nil) ),
inference(copy,[status(thm)],[c_61]) ).
fof(co1_9,axiom,
( nil = sk4
| ssList(sk5) ),
file('theBenchmark.p',co1_9) ).
cnf(c_65,plain,
( nil = sk4
| ssList(sk5) ),
inference(clausify,[status(thm)],[co1_9]) ).
cnf(c_66,plain,
( sk4 = nil
| ssList(sk5) ),
inference(copy,[status(thm)],[c_65]) ).
fof(co1_8,axiom,
! [VAR_0] :
( ~ frontsegP(sk1,VAR_0)
| ~ frontsegP(sk2,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',co1_8) ).
cnf(c_67,plain,
( ~ frontsegP(sk1,A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[co1_8]) ).
fof(co1_7,axiom,
neq(sk2,nil),
file('theBenchmark.p',co1_7) ).
cnf(c_68,plain,
neq(sk2,nil),
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_69,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_70,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_4,axiom,
ssList(sk4),
file('theBenchmark.p',co1_4) ).
cnf(c_71,plain,
ssList(sk4),
inference(clausify,[status(thm)],[co1_4]) ).
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_135,plain,
( ~ ssList(A)
| ~ ssList(B)
| ~ neq(A,B)
| A != B ),
inference(clausify,[status(thm)],[clause115]) ).
fof(clause8,axiom,
ssList(nil),
file('theBenchmark.p',clause8) ).
cnf(c_227,plain,
ssList(nil),
inference(clausify,[status(thm)],[clause8]) ).
cnf(c_9885,plain,
( ~ frontsegP(sk1,A)
| ~ frontsegP(sk4,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(paramod,[status(thm)],[c_70,c_67]) ).
cnf(c_331,plain,
( ~ frontsegP(sk3,A)
| ~ frontsegP(sk4,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(paramod,[status(thm)],[c_69,c_9885]) ).
cnf(c_332,plain,
neq(sk4,nil),
inference(paramod,[status(thm)],[c_70,c_68]) ).
cnf(c_9757,plain,
( sk4 = nil
| ~ frontsegP(sk3,sk5)
| ~ frontsegP(sk4,sk5)
| ~ ssList(sk5) ),
inference(resolve,[status(thm)],[c_331,c_62]) ).
cnf(c_9886,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| sk4 != nil ),
inference(resolve,[status(thm)],[c_332,c_135]) ).
cnf(c_9887,plain,
( ~ ssList(sk4)
| sk4 != nil ),
inference(resolve,[status(thm)],[c_227,c_9886]) ).
cnf(c_9760,plain,
sk4 != nil,
inference(resolve,[status(thm)],[c_71,c_9887]) ).
cnf(c_9761,plain,
( ~ frontsegP(sk3,sk5)
| ~ frontsegP(sk4,sk5)
| ~ ssList(sk5) ),
inference(resolve,[status(thm)],[c_9760,c_9757]) ).
cnf(c_9861,plain,
ssList(sk5),
inference(resolve,[status(thm)],[c_9760,c_66]) ).
cnf(c_9863,plain,
frontsegP(sk4,sk5),
inference(resolve,[status(thm)],[c_9760,c_60]) ).
cnf(c_9864,plain,
frontsegP(sk3,sk5),
inference(resolve,[status(thm)],[c_9760,c_58]) ).
cnf(c_9888,plain,
( ~ frontsegP(sk3,sk5)
| ~ frontsegP(sk4,sk5) ),
inference(resolve,[status(thm)],[c_9861,c_9761]) ).
cnf(c_9889,plain,
~ frontsegP(sk3,sk5),
inference(resolve,[status(thm)],[c_9863,c_9888]) ).
cnf(c_9884,plain,
$false,
inference(resolve,[status(thm)],[c_9864,c_9889]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC023-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 12:10:43 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 1748454 was started by sandbox on n001,
% 0.09/0.37 % Sat Sep 26 12:10:43 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 14.97/2.62
% 14.97/2.62 % SZS status Unsatisfiable for theBenchmark
% 14.97/2.62
% 14.97/2.62 % Proof 1 at 1.90 (+ 0.26) seconds.
% 14.97/2.62 % Length of proof is 24.
% 14.97/2.62 % Level of proof is 4.
% 14.97/2.62 % Maximum clause weight is 11.000.
% 14.97/2.62 % Given clauses 269.
% 14.97/2.62
% 14.97/2.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------