%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC048+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 : n016.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:39 AM UTC 2026
% Result : Theorem 21.38s 3.27s
% Output : CNFRefutation 21.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 11
% Syntax : Number of formulae : 99 ( 26 unt; 0 def)
% Number of atoms : 334 ( 86 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 379 ( 144 ~; 159 |; 48 &)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 54 ( 0 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('theBenchmark.p',ax15) ).
fof(ax41,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( frontsegP(V,U)
& frontsegP(U,V) )
=> U = V ) ) ),
file('theBenchmark.p',ax41) ).
fof(ax45,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,nil) ),
file('theBenchmark.p',ax45) ).
fof(ax46,axiom,
! [U] :
( ssList(U)
=> ( frontsegP(nil,U)
<=> nil = U ) ),
file('theBenchmark.p',ax46) ).
fof(ax47,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ( ( rearsegP(V,W)
& rearsegP(U,V) )
=> rearsegP(U,W) ) ) ) ),
file('theBenchmark.p',ax47) ).
fof(ax48,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( rearsegP(V,U)
& rearsegP(U,V) )
=> U = V ) ) ),
file('theBenchmark.p',ax48) ).
fof(ax49,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,U) ),
file('theBenchmark.p',ax49) ).
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(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ( ( ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| 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)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ( ( ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( rearsegP(X,W)
& neq(W,nil) )
| ( nil = W
& nil = X ) )
& ( ( ! [Y] :
( ~ rearsegP(U,Y)
| ~ rearsegP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& 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,
( ( ( rearsegP(sK1,sK0)
& neq(sK0,nil) )
| ( nil = sK0
& nil = sK1 ) )
& ( ( ! [Y] :
( ~ rearsegP(sK2,Y)
| ~ rearsegP(sK3,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(sK3,nil) )
| ( nil != sK2
& nil = sK3 ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK1)
& ssList(sK0)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK0,sK1]),skolemize(U,sK2),skolemize(V,sK3),skolemize(W,sK0),skolemize(X,sK1)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( rearsegP(sK1,sK0)
| nil = sK0 )
& ( neq(sK0,nil)
| nil = sK0 )
& ( rearsegP(sK1,sK0)
| nil = sK1 )
& ( neq(sK0,nil)
| nil = sK1 )
& ! [VAR_0] :
( ~ rearsegP(sK2,VAR_0)
| ~ rearsegP(sK3,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0)
| nil != sK2 )
& ( neq(sK3,nil)
| nil != sK2 )
& ! [VAR_0] :
( ~ rearsegP(sK2,VAR_0)
| ~ rearsegP(sK3,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0)
| nil = sK3 )
& ( neq(sK3,nil)
| nil = sK3 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK1)
& ssList(sK0)
& ssList(sK3)
& ssList(sK2) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_190,negated_conjecture,
( rearsegP(sK1,sK0)
| nil = sK0 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_191,negated_conjecture,
( rearsegP(sK1,sK0)
| sK0 = nil ),
inference(copy,[status(thm)],[c_190]) ).
cnf(c_192,negated_conjecture,
( neq(sK0,nil)
| nil = sK0 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_193,negated_conjecture,
( neq(sK0,nil)
| sK0 = nil ),
inference(copy,[status(thm)],[c_192]) ).
cnf(c_196,negated_conjecture,
( neq(sK0,nil)
| nil = sK1 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_197,negated_conjecture,
( neq(sK0,nil)
| sK1 = nil ),
inference(copy,[status(thm)],[c_196]) ).
cnf(c_200,negated_conjecture,
( neq(sK3,nil)
| nil != sK2 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_201,negated_conjecture,
( neq(sK3,nil)
| sK2 != nil ),
inference(copy,[status(thm)],[c_200]) ).
cnf(c_202,negated_conjecture,
( ~ rearsegP(sK2,A)
| ~ rearsegP(sK3,A)
| ~ neq(A,nil)
| ~ ssList(A)
| nil = sK3 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_203,negated_conjecture,
( ~ rearsegP(sK2,A)
| ~ rearsegP(sK3,A)
| ~ neq(A,nil)
| ~ ssList(A)
| sK3 = nil ),
inference(copy,[status(thm)],[c_202]) ).
cnf(c_206,negated_conjecture,
sK0 = sK2,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_207,negated_conjecture,
sK1 = sK3,
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_210,negated_conjecture,
ssList(sK3),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_211,negated_conjecture,
ssList(sK2),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_259,plain,
( nil != A
| rearsegP(nil,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax52]) ).
cnf(c_261,plain,
( rearsegP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax51]) ).
cnf(c_263,plain,
( rearsegP(A,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax49]) ).
cnf(c_264,plain,
( B = A
| ~ rearsegP(B,A)
| ~ rearsegP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax48]) ).
cnf(c_265,plain,
( rearsegP(A,C)
| ~ rearsegP(B,C)
| ~ rearsegP(A,B)
| ~ ssList(C)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax47]) ).
cnf(c_266,plain,
( nil != A
| frontsegP(nil,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax46]) ).
cnf(c_268,plain,
( frontsegP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax45]) ).
cnf(c_274,plain,
( B = A
| ~ frontsegP(B,A)
| ~ frontsegP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax41]) ).
fof(ax17,axiom,
ssList(nil),
file('theBenchmark.p',ax17) ).
cnf(c_307,plain,
ssList(nil),
inference(clausify,[status(thm)],[ax17]) ).
cnf(c_310,plain,
( B != A
| ~ neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
cnf(c_6309,negated_conjecture,
( nil != sK3
| rearsegP(nil,sK3) ),
inference(resolve,[status(thm)],[c_259,c_210]) ).
cnf(c_1786,negated_conjecture,
( sK3 != nil
| rearsegP(nil,sK3) ),
inference(copy,[status(thm)],[c_6309]) ).
cnf(c_6310,negated_conjecture,
( nil != sK0
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_259,c_209]) ).
cnf(c_1787,negated_conjecture,
( sK0 != nil
| rearsegP(nil,sK0) ),
inference(copy,[status(thm)],[c_6310]) ).
cnf(c_1789,plain,
rearsegP(sK2,nil),
inference(resolve,[status(thm)],[c_261,c_211]) ).
cnf(c_1791,plain,
rearsegP(sK0,nil),
inference(resolve,[status(thm)],[c_261,c_209]) ).
cnf(c_1792,plain,
rearsegP(sK1,nil),
inference(resolve,[status(thm)],[c_261,c_208]) ).
cnf(c_1797,plain,
rearsegP(sK0,sK0),
inference(resolve,[status(thm)],[c_263,c_209]) ).
cnf(c_6311,negated_conjecture,
( nil != sK1
| frontsegP(nil,sK1) ),
inference(resolve,[status(thm)],[c_266,c_208]) ).
cnf(c_1809,negated_conjecture,
( sK1 != nil
| frontsegP(nil,sK1) ),
inference(copy,[status(thm)],[c_6311]) ).
cnf(c_1811,plain,
frontsegP(sK3,nil),
inference(resolve,[status(thm)],[c_268,c_210]) ).
cnf(c_6312,plain,
( sK2 = nil
| ~ rearsegP(nil,sK2)
| ~ ssList(sK2)
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_1789,c_264]) ).
cnf(c_6313,plain,
( sK2 = nil
| ~ rearsegP(nil,sK2)
| ~ ssList(sK2) ),
inference(resolve,[status(thm)],[c_307,c_6312]) ).
cnf(c_5005,negated_conjecture,
( sK2 = nil
| ~ rearsegP(nil,sK2) ),
inference(resolve,[status(thm)],[c_211,c_6313]) ).
cnf(c_6314,plain,
( sK0 = nil
| ~ rearsegP(nil,sK0)
| ~ ssList(sK0)
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_1791,c_264]) ).
cnf(c_6315,plain,
( sK0 = nil
| ~ rearsegP(nil,sK0)
| ~ ssList(sK0) ),
inference(resolve,[status(thm)],[c_307,c_6314]) ).
cnf(c_5019,negated_conjecture,
( sK0 = nil
| ~ rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_209,c_6315]) ).
cnf(c_5052,plain,
rearsegP(sK2,sK0),
inference(paramod,[status(thm)],[c_206,c_1797]) ).
cnf(c_6316,plain,
( sK3 = nil
| ~ frontsegP(nil,sK3)
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_1811,c_274]) ).
cnf(c_6317,plain,
( sK3 = nil
| ~ frontsegP(nil,sK3)
| ~ ssList(sK3) ),
inference(resolve,[status(thm)],[c_307,c_6316]) ).
cnf(c_5079,negated_conjecture,
( sK3 = nil
| ~ frontsegP(nil,sK3) ),
inference(resolve,[status(thm)],[c_210,c_6317]) ).
cnf(c_5584,plain,
( neq(sK0,nil)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_1787,c_193]) ).
cnf(c_5585,plain,
( rearsegP(sK1,sK0)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_1787,c_191]) ).
cnf(c_5602,plain,
( neq(sK0,nil)
| frontsegP(nil,sK1) ),
inference(resolve,[status(thm)],[c_1809,c_197]) ).
cnf(c_6318,negated_conjecture,
( ~ rearsegP(sK2,sK0)
| ~ rearsegP(sK3,sK0)
| ~ ssList(sK0)
| sK3 = nil
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_5584,c_203]) ).
cnf(c_6319,negated_conjecture,
( ~ rearsegP(sK2,sK0)
| ~ rearsegP(sK3,sK0)
| sK3 = nil
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_209,c_6318]) ).
cnf(c_5741,negated_conjecture,
( ~ rearsegP(sK3,sK0)
| sK3 = nil
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_5052,c_6319]) ).
cnf(c_6320,plain,
( rearsegP(A,sK0)
| ~ rearsegP(A,nil)
| ~ ssList(sK0)
| ~ ssList(nil)
| ~ ssList(A)
| rearsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_5585,c_265]) ).
cnf(c_6321,plain,
( rearsegP(A,sK0)
| ~ rearsegP(A,nil)
| ~ ssList(sK0)
| ~ ssList(A)
| rearsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_307,c_6320]) ).
cnf(c_5747,negated_conjecture,
( rearsegP(A,sK0)
| ~ rearsegP(A,nil)
| ~ ssList(A)
| rearsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_209,c_6321]) ).
cnf(c_6322,plain,
( ~ rearsegP(sK1,nil)
| ~ ssList(sK1)
| rearsegP(sK1,sK0) ),
inference(factor,[status(thm)],[c_5747]) ).
cnf(c_6323,negated_conjecture,
( ~ rearsegP(sK1,nil)
| rearsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_208,c_6322]) ).
cnf(c_5758,negated_conjecture,
rearsegP(sK1,sK0),
inference(resolve,[status(thm)],[c_1792,c_6323]) ).
cnf(c_5769,plain,
rearsegP(sK3,sK0),
inference(paramod,[status(thm)],[c_207,c_5758]) ).
cnf(c_5771,negated_conjecture,
( sK3 = nil
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_5769,c_5741]) ).
cnf(c_6324,plain,
( nil != sK0
| ~ ssList(nil)
| ~ ssList(sK0)
| frontsegP(nil,sK1) ),
inference(resolve,[status(thm)],[c_5602,c_310]) ).
cnf(c_6325,plain,
( sK0 != nil
| ~ ssList(nil)
| ~ ssList(sK0)
| frontsegP(nil,sK1) ),
inference(copy,[status(thm)],[c_6324]) ).
cnf(c_6326,negated_conjecture,
( sK0 != nil
| ~ ssList(nil)
| frontsegP(nil,sK1) ),
inference(resolve,[status(thm)],[c_209,c_6325]) ).
cnf(c_5872,negated_conjecture,
( sK0 != nil
| frontsegP(nil,sK1) ),
inference(resolve,[status(thm)],[c_307,c_6326]) ).
cnf(c_5886,plain,
( rearsegP(nil,sK3)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_5771,c_1786]) ).
cnf(c_6327,plain,
( rearsegP(nil,A)
| ~ rearsegP(sK3,A)
| ~ ssList(A)
| ~ ssList(sK3)
| ~ ssList(nil)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_5886,c_265]) ).
cnf(c_6328,plain,
( rearsegP(nil,A)
| ~ rearsegP(sK3,A)
| ~ ssList(A)
| ~ ssList(sK3)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_307,c_6327]) ).
cnf(c_6058,negated_conjecture,
( rearsegP(nil,A)
| ~ rearsegP(sK3,A)
| ~ ssList(A)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_210,c_6328]) ).
cnf(c_6329,plain,
( ~ rearsegP(sK3,sK0)
| ~ ssList(sK0)
| rearsegP(nil,sK0) ),
inference(factor,[status(thm)],[c_6058]) ).
cnf(c_6330,negated_conjecture,
( ~ rearsegP(sK3,sK0)
| rearsegP(nil,sK0) ),
inference(resolve,[status(thm)],[c_209,c_6329]) ).
cnf(c_6061,negated_conjecture,
rearsegP(nil,sK0),
inference(resolve,[status(thm)],[c_5769,c_6330]) ).
cnf(c_6062,negated_conjecture,
sK0 = nil,
inference(resolve,[status(thm)],[c_6061,c_5019]) ).
cnf(c_6063,negated_conjecture,
frontsegP(nil,sK1),
inference(resolve,[status(thm)],[c_6062,c_5872]) ).
cnf(c_6108,plain,
rearsegP(nil,sK2),
inference(paramod,[status(thm)],[c_206,c_6061]) ).
cnf(c_6109,negated_conjecture,
sK2 = nil,
inference(resolve,[status(thm)],[c_6108,c_5005]) ).
cnf(c_6126,negated_conjecture,
neq(sK3,nil),
inference(resolve,[status(thm)],[c_6109,c_201]) ).
cnf(c_6163,plain,
frontsegP(nil,sK3),
inference(paramod,[status(thm)],[c_207,c_6063]) ).
cnf(c_6164,negated_conjecture,
sK3 = nil,
inference(resolve,[status(thm)],[c_6163,c_5079]) ).
cnf(c_6331,negated_conjecture,
( nil != sK3
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(resolve,[status(thm)],[c_6126,c_310]) ).
cnf(c_6332,negated_conjecture,
( sK3 != nil
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(copy,[status(thm)],[c_6331]) ).
cnf(c_6333,negated_conjecture,
( sK3 != nil
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_210,c_6332]) ).
cnf(c_6334,negated_conjecture,
sK3 != nil,
inference(resolve,[status(thm)],[c_307,c_6333]) ).
cnf(c_6308,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_6164,c_6334]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC048+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.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 12:12:45 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 829514 was started by sandbox on n016,
% 0.09/0.37 % Sat Sep 26 12:12:45 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.40
% 0.09/0.40 % From the command line: assign(max_seconds, 300).
% 21.38/3.27
% 21.38/3.27 % given #500 (I,wt=47): 704 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(app(D,cons(B,A)),cons(C,E)) != A | C != B | ssList(f35(A)). [factor(373,a,e)].
% 21.38/3.27
% 21.38/3.27 % given #1000 (I,wt=60): 1229 -ssList(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(app(C,cons(B,A)),cons(B,D)) != A | app(app(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(A))) = A. [factor(725,b,c),xx(f)].
% 21.38/3.27
% 21.38/3.27 % given #1500 (F,wt=31): 5580 app(app(c4,cons(c1,c6)),cons(c1,c6)) != nil. [para(207(a,1),5550(a,1,1,1))].
% 21.38/3.27
% 21.38/3.27 % SZS status Theorem for theBenchmark
% 21.38/3.27
% 21.38/3.27 % Proof 1 at 2.56 (+ 0.23) seconds.
% 21.38/3.27 % Length of proof is 68.
% 21.38/3.27 % Level of proof is 15.
% 21.38/3.27 % Maximum clause weight is 20.000.
% 21.38/3.27 % Given clauses 1657.
% 21.38/3.27
% 21.38/3.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------