%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC016+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 : n003.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:32 AM UTC 2026
% Result : Theorem 36.86s 5.10s
% Output : CNFRefutation 36.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 9
% Syntax : Number of formulae : 107 ( 21 unt; 0 def)
% Number of atoms : 347 ( 98 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 379 ( 139 ~; 161 |; 54 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 43 ( 0 sgn 24 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('theBenchmark.p',ax15) ).
fof(ax48,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( rearsegP(V,U)
& rearsegP(U,V) )
=> U = V ) ) ),
file('theBenchmark.p',ax48) ).
fof(ax51,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,nil) ),
file('theBenchmark.p',ax51) ).
fof(ax52,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(nil,U)
<=> nil = U ) ),
file('theBenchmark.p',ax52) ).
fof(ax54,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( segmentP(V,U)
& segmentP(U,V) )
=> U = V ) ) ),
file('theBenchmark.p',ax54) ).
fof(ax57,axiom,
! [U] :
( ssList(U)
=> segmentP(U,nil) ),
file('theBenchmark.p',ax57) ).
fof(ax58,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> nil = U ) ),
file('theBenchmark.p',ax58) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ? [Z] :
( frontsegP(U,Z)
& frontsegP(V,Z)
& neq(Z,nil)
& ssList(Z) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( neq(X,nil)
& ! [Y] :
( ssList(Y)
=> ( ~ frontsegP(W,Y)
| ~ frontsegP(X,Y)
| ~ neq(Y,nil) ) ) )
| ( nil = X
& nil != W )
| 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)
=> ( ( ( ? [Z] :
( frontsegP(U,Z)
& frontsegP(V,Z)
& neq(Z,nil)
& ssList(Z) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( neq(X,nil)
& ! [Y] :
( ssList(Y)
=> ( ~ frontsegP(W,Y)
| ~ frontsegP(X,Y)
| ~ neq(Y,nil) ) ) )
| ( nil = X
& nil != W )
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ! [Z] :
( ~ frontsegP(U,Z)
| ~ frontsegP(V,Z)
| ~ neq(Z,nil)
| ~ ssList(Z) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& ( ~ neq(X,nil)
| ? [Y] :
( frontsegP(W,Y)
& frontsegP(X,Y)
& neq(Y,nil)
& ssList(Y) ) )
& ( nil != X
| nil = W )
& 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,
( ( ( ! [Z] :
( ~ frontsegP(sK0,Z)
| ~ frontsegP(sK1,Z)
| ~ neq(Z,nil)
| ~ ssList(Z) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK4,nil)
| ( frontsegP(sK2,sK3)
& frontsegP(sK4,sK3)
& neq(sK3,nil)
& ssList(sK3) ) )
& ( nil != sK4
| nil = sK2 )
& sK2 = sK0
& sK4 = sK1
& ssList(sK4)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK4,sK3]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK4),skolemize(Y,sK3)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ! [VAR_0] :
( ~ frontsegP(sK0,VAR_0)
| ~ frontsegP(sK1,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0)
| nil != sK0 )
& ( neq(sK1,nil)
| nil != sK0 )
& ! [VAR_0] :
( ~ frontsegP(sK0,VAR_0)
| ~ frontsegP(sK1,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0)
| nil = sK1 )
& ( neq(sK1,nil)
| nil = sK1 )
& ( ~ neq(sK4,nil)
| frontsegP(sK2,sK3) )
& ( ~ neq(sK4,nil)
| frontsegP(sK4,sK3) )
& ( ~ neq(sK4,nil)
| neq(sK3,nil) )
& ( ~ neq(sK4,nil)
| ssList(sK3) )
& ( nil != sK4
| nil = sK2 )
& sK2 = sK0
& sK4 = sK1
& ssList(sK4)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_192,negated_conjecture,
( neq(sK1,nil)
| nil != sK0 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_193,negated_conjecture,
( neq(sK1,nil)
| sK0 != nil ),
inference(copy,[status(thm)],[c_192]) ).
cnf(c_194,negated_conjecture,
( ~ frontsegP(sK0,A)
| ~ frontsegP(sK1,A)
| ~ neq(A,nil)
| ~ ssList(A)
| nil = sK1 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_195,negated_conjecture,
( ~ frontsegP(sK0,A)
| ~ frontsegP(sK1,A)
| ~ neq(A,nil)
| ~ ssList(A)
| sK1 = nil ),
inference(copy,[status(thm)],[c_194]) ).
cnf(c_196,negated_conjecture,
( neq(sK1,nil)
| nil = sK1 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_197,negated_conjecture,
( neq(sK1,nil)
| sK1 = nil ),
inference(copy,[status(thm)],[c_196]) ).
cnf(c_198,negated_conjecture,
( ~ neq(sK4,nil)
| frontsegP(sK2,sK3) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_199,negated_conjecture,
( ~ neq(sK4,nil)
| frontsegP(sK4,sK3) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_200,negated_conjecture,
( ~ neq(sK4,nil)
| neq(sK3,nil) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_201,negated_conjecture,
( ~ neq(sK4,nil)
| ssList(sK3) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_202,negated_conjecture,
( nil != sK4
| nil = sK2 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_8923,negated_conjecture,
( nil != sK4
| sK2 = nil ),
inference(copy,[status(thm)],[c_202]) ).
cnf(c_203,negated_conjecture,
( sK4 != nil
| sK2 = nil ),
inference(copy,[status(thm)],[c_8923]) ).
cnf(c_204,negated_conjecture,
sK2 = sK0,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_205,negated_conjecture,
sK4 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_207,negated_conjecture,
ssList(sK2),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_208,negated_conjecture,
ssList(sK1),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_209,negated_conjecture,
ssList(sK0),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_250,plain,
( nil != A
| segmentP(nil,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax58]) ).
cnf(c_252,plain,
( segmentP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax57]) ).
cnf(c_255,plain,
( B = A
| ~ segmentP(B,A)
| ~ segmentP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax54]) ).
cnf(c_257,plain,
( nil != A
| rearsegP(nil,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax52]) ).
cnf(c_259,plain,
( rearsegP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax51]) ).
cnf(c_262,plain,
( B = A
| ~ rearsegP(B,A)
| ~ rearsegP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax48]) ).
fof(ax17,axiom,
ssList(nil),
file('theBenchmark.p',ax17) ).
cnf(c_305,plain,
ssList(nil),
inference(clausify,[status(thm)],[ax17]) ).
cnf(c_308,plain,
( B != A
| ~ neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
cnf(c_1651,plain,
( ~ neq(sK1,nil)
| frontsegP(sK2,sK3) ),
inference(paramod,[status(thm)],[c_205,c_198]) ).
cnf(c_1652,plain,
( ~ neq(sK1,nil)
| frontsegP(sK4,sK3) ),
inference(paramod,[status(thm)],[c_205,c_199]) ).
cnf(c_1653,plain,
( ~ neq(sK1,nil)
| neq(sK3,nil) ),
inference(paramod,[status(thm)],[c_205,c_200]) ).
cnf(c_1654,plain,
( ~ neq(sK1,nil)
| ssList(sK3) ),
inference(paramod,[status(thm)],[c_205,c_201]) ).
cnf(c_1655,plain,
( sK1 != nil
| sK2 = nil ),
inference(paramod,[status(thm)],[c_205,c_203]) ).
cnf(c_8924,negated_conjecture,
( nil != sK2
| segmentP(nil,sK2) ),
inference(resolve,[status(thm)],[c_250,c_207]) ).
cnf(c_1774,negated_conjecture,
( sK2 != nil
| segmentP(nil,sK2) ),
inference(copy,[status(thm)],[c_8924]) ).
cnf(c_1776,plain,
segmentP(sK0,nil),
inference(resolve,[status(thm)],[c_252,c_209]) ).
cnf(c_8925,negated_conjecture,
( nil != sK2
| rearsegP(nil,sK2) ),
inference(resolve,[status(thm)],[c_257,c_207]) ).
cnf(c_1786,negated_conjecture,
( sK2 != nil
| rearsegP(nil,sK2) ),
inference(copy,[status(thm)],[c_8925]) ).
cnf(c_1788,plain,
rearsegP(sK0,nil),
inference(resolve,[status(thm)],[c_259,c_209]) ).
cnf(c_4869,plain,
( sK1 = nil
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_1651,c_197]) ).
cnf(c_4870,plain,
( sK1 = nil
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_1652,c_197]) ).
cnf(c_8926,plain,
( sK0 = nil
| ~ segmentP(nil,sK0)
| ~ ssList(sK0)
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_1776,c_255]) ).
cnf(c_8927,plain,
( sK0 = nil
| ~ segmentP(nil,sK0)
| ~ ssList(sK0) ),
inference(resolve,[status(thm)],[c_305,c_8926]) ).
cnf(c_4889,negated_conjecture,
( sK0 = nil
| ~ segmentP(nil,sK0) ),
inference(resolve,[status(thm)],[c_209,c_8927]) ).
cnf(c_4952,plain,
( sK1 = nil
| neq(sK3,nil) ),
inference(resolve,[status(thm)],[c_1653,c_197]) ).
cnf(c_4953,plain,
( sK1 = nil
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_1654,c_197]) ).
cnf(c_8928,plain,
( sK0 = nil
| ~ rearsegP(nil,sK0)
| ~ ssList(sK0)
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_1788,c_262]) ).
cnf(c_8929,plain,
( sK0 = nil
| ~ rearsegP(nil,sK0)
| ~ ssList(sK0) ),
inference(resolve,[status(thm)],[c_305,c_8928]) ).
cnf(c_4983,negated_conjecture,
( sK0 = nil
| ~ rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_209,c_8929]) ).
cnf(c_5006,plain,
( neq(sK1,nil)
| sK2 = nil ),
inference(resolve,[status(thm)],[c_1655,c_197]) ).
cnf(c_5663,plain,
( sK2 = nil
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_4953,c_1655]) ).
cnf(c_5958,plain,
( ssList(sK3)
| segmentP(nil,sK2) ),
inference(resolve,[status(thm)],[c_1774,c_5663]) ).
cnf(c_6101,plain,
( ssList(sK3)
| segmentP(nil,sK0) ),
inference(paramod,[status(thm)],[c_204,c_5958]) ).
cnf(c_8930,plain,
( nil = sK0
| ~ segmentP(sK0,nil)
| ~ ssList(nil)
| ~ ssList(sK0)
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_6101,c_255]) ).
cnf(c_8931,plain,
( sK0 = nil
| ~ segmentP(sK0,nil)
| ~ ssList(nil)
| ~ ssList(sK0)
| ssList(sK3) ),
inference(copy,[status(thm)],[c_8930]) ).
cnf(c_8932,negated_conjecture,
( sK0 = nil
| ~ segmentP(sK0,nil)
| ~ ssList(nil)
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_209,c_8931]) ).
cnf(c_8933,negated_conjecture,
( sK0 = nil
| ~ segmentP(sK0,nil)
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_305,c_8932]) ).
cnf(c_6123,negated_conjecture,
( sK0 = nil
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_1776,c_8933]) ).
cnf(c_6384,plain,
( neq(sK1,nil)
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_6123,c_193]) ).
cnf(c_8934,plain,
( ssList(sK3)
| ssList(sK3) ),
inference(resolve,[status(thm)],[c_6384,c_1654]) ).
cnf(c_6511,plain,
ssList(sK3),
inference(copy,[status(thm)],[c_8934]) ).
cnf(c_6716,plain,
( sK2 = nil
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_4869,c_1655]) ).
cnf(c_6731,plain,
( sK2 = nil
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_4870,c_1655]) ).
cnf(c_8935,negated_conjecture,
( ~ frontsegP(sK0,sK3)
| ~ frontsegP(sK1,sK3)
| ~ ssList(sK3)
| sK1 = nil
| sK1 = nil ),
inference(resolve,[status(thm)],[c_4952,c_195]) ).
cnf(c_8936,negated_conjecture,
( ~ frontsegP(sK0,sK3)
| ~ frontsegP(sK1,sK3)
| ~ ssList(sK3)
| sK1 = nil ),
inference(copy,[status(thm)],[c_8935]) ).
cnf(c_6744,negated_conjecture,
( ~ frontsegP(sK0,sK3)
| ~ frontsegP(sK1,sK3)
| sK1 = nil ),
inference(resolve,[status(thm)],[c_6511,c_8936]) ).
cnf(c_6769,plain,
( segmentP(nil,sK2)
| neq(sK1,nil) ),
inference(resolve,[status(thm)],[c_5006,c_1774]) ).
cnf(c_7002,plain,
( rearsegP(nil,sK2)
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_6716,c_1786]) ).
cnf(c_7118,plain,
( rearsegP(nil,sK2)
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_6731,c_1786]) ).
cnf(c_8937,plain,
( nil != sK1
| ~ ssList(nil)
| ~ ssList(sK1)
| segmentP(nil,sK2) ),
inference(resolve,[status(thm)],[c_6769,c_308]) ).
cnf(c_8938,plain,
( sK1 != nil
| ~ ssList(nil)
| ~ ssList(sK1)
| segmentP(nil,sK2) ),
inference(copy,[status(thm)],[c_8937]) ).
cnf(c_8939,negated_conjecture,
( sK1 != nil
| ~ ssList(nil)
| segmentP(nil,sK2) ),
inference(resolve,[status(thm)],[c_208,c_8938]) ).
cnf(c_7242,negated_conjecture,
( sK1 != nil
| segmentP(nil,sK2) ),
inference(resolve,[status(thm)],[c_305,c_8939]) ).
cnf(c_7553,plain,
( rearsegP(nil,sK0)
| frontsegP(sK2,sK3) ),
inference(paramod,[status(thm)],[c_204,c_7002]) ).
cnf(c_7766,plain,
( rearsegP(nil,sK0)
| frontsegP(sK4,sK3) ),
inference(paramod,[status(thm)],[c_204,c_7118]) ).
cnf(c_8087,plain,
( sK0 = nil
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_7553,c_4983]) ).
cnf(c_8222,plain,
( sK0 = nil
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_7766,c_4983]) ).
cnf(c_8328,plain,
( neq(sK1,nil)
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_8087,c_193]) ).
cnf(c_8387,plain,
( neq(sK1,nil)
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_8222,c_193]) ).
cnf(c_8940,plain,
( frontsegP(sK2,sK3)
| frontsegP(sK2,sK3) ),
inference(resolve,[status(thm)],[c_8328,c_1651]) ).
cnf(c_8474,plain,
frontsegP(sK2,sK3),
inference(copy,[status(thm)],[c_8940]) ).
cnf(c_8485,plain,
frontsegP(sK0,sK3),
inference(paramod,[status(thm)],[c_204,c_8474]) ).
cnf(c_8494,negated_conjecture,
( ~ frontsegP(sK1,sK3)
| sK1 = nil ),
inference(resolve,[status(thm)],[c_8485,c_6744]) ).
cnf(c_8941,plain,
( frontsegP(sK4,sK3)
| frontsegP(sK4,sK3) ),
inference(resolve,[status(thm)],[c_8387,c_1652]) ).
cnf(c_8536,plain,
frontsegP(sK4,sK3),
inference(copy,[status(thm)],[c_8941]) ).
cnf(c_8559,plain,
frontsegP(sK1,sK3),
inference(paramod,[status(thm)],[c_205,c_8536]) ).
cnf(c_8560,negated_conjecture,
sK1 = nil,
inference(resolve,[status(thm)],[c_8559,c_8494]) ).
cnf(c_8570,negated_conjecture,
segmentP(nil,sK2),
inference(resolve,[status(thm)],[c_8560,c_7242]) ).
cnf(c_8684,plain,
segmentP(nil,sK0),
inference(paramod,[status(thm)],[c_204,c_8570]) ).
cnf(c_8685,negated_conjecture,
sK0 = nil,
inference(resolve,[status(thm)],[c_8684,c_4889]) ).
cnf(c_8701,negated_conjecture,
neq(sK1,nil),
inference(resolve,[status(thm)],[c_8685,c_193]) ).
cnf(c_8942,negated_conjecture,
( nil != sK1
| ~ ssList(nil)
| ~ ssList(sK1) ),
inference(resolve,[status(thm)],[c_8701,c_308]) ).
cnf(c_8943,negated_conjecture,
( sK1 != nil
| ~ ssList(nil)
| ~ ssList(sK1) ),
inference(copy,[status(thm)],[c_8942]) ).
cnf(c_8944,negated_conjecture,
( sK1 != nil
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_208,c_8943]) ).
cnf(c_8945,negated_conjecture,
sK1 != nil,
inference(resolve,[status(thm)],[c_305,c_8944]) ).
cnf(c_8922,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_8560,c_8945]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC016+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.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sat Sep 26 12:05:55 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 2819637 was started by sandbox2 on n003,
% 0.11/0.38 % Sat Sep 26 12:05:55 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.41
% 0.14/0.41 % From the command line: assign(max_seconds, 300).
% 36.86/5.10
% 36.86/5.10 % given #500 (I,wt=47): 701 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(app(A,cons(B,D)),cons(C,E)) != A | C != B | ssList(f35(A)). [factor(371,a,d)].
% 36.86/5.10
% 36.86/5.10 % given #1000 (I,wt=63): 1226 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | app(app(D,cons(B,A)),cons(C,A)) != A | C != B | app(app(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(A))) = A. [factor(723,a,e)].
% 36.86/5.10
% 36.86/5.10 % given #1500 (F,wt=31): 5952 app(app(c3,cons(c1,c5)),cons(c1,c5)) != nil. [para(204(a,1),5524(a,1,1,1))].
% 36.86/5.10
% 36.86/5.10 % SZS status Theorem for theBenchmark
% 36.86/5.10
% 36.86/5.10 % Proof 1 at 4.14 (+ 0.46) seconds.
% 36.86/5.10 % Length of proof is 79.
% 36.86/5.10 % Level of proof is 17.
% 36.86/5.10 % Maximum clause weight is 19.000.
% 36.86/5.10 % Given clauses 1916.
% 36.86/5.10
% 36.86/5.10 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------