%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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 07:59:20 AM UTC 2026
% Result : Theorem 8.40s 2.43s
% Output : CNFRefutation 8.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 59 ( 15 unt; 0 def)
% Number of atoms : 319 ( 0 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 503 ( 243 ~; 217 |; 43 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 161 ( 0 sgn 93 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
! [X] : r1(X,X),
file('theBenchmark.p',reflexivity) ).
fof(main,conjecture,
~ ? [X] :
~ ( ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ! [X] :
( ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ! [X] : ~ r1(Y,X)
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( ~ ! [X] :
( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
& ~ ! [X] :
( ~ ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ r1(Y,X) ) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ! [X] :
( ~ ( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
& ~ ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ~ r1(X,Y) ) )
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( p1(Y)
& ~ ! [X] :
( ~ ! [Y] :
( ~ p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) ) )
| ~ r1(X,Y) ) ),
file('theBenchmark.p',main) ).
fof(main_neg,negated_conjecture,
~ ~ ? [X] :
~ ( ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ! [X] :
( ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ! [X] : ~ r1(Y,X)
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( ~ ! [X] :
( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
& ~ ! [X] :
( ~ ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ r1(Y,X) ) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ! [X] :
( ~ ( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
& ~ ! [Y] :
( ~ ! [X] :
( p1(X)
| ~ r1(Y,X) )
| ~ r1(X,Y) ) )
| ~ r1(Y,X) )
| ~ r1(X,Y) )
| ~ ! [Y] :
( ~ ( p1(Y)
& ~ ! [X] :
( ~ ! [Y] :
( ~ p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) ) )
| ~ r1(X,Y) ) ),
inference(assume_negation,[status(cth)],[main]) ).
cnf(c_3,plain,
r1(A,A),
inference(clausify,[status(thm)],[reflexivity]) ).
fof(nnf_2,plain,
? [X] :
( ? [Y] :
( ! [X18] :
( p1(X18)
| ~ r1(Y,X18) )
& ? [X16] :
( ? [X17] :
( ~ p1(X17)
& r1(X16,X17) )
& r1(Y,X16) )
& r1(X,Y) )
& ! [X14] :
( ? [X15] : r1(X14,X15)
| ~ r1(X,X14) )
& ! [X8] :
( ! [X12] :
( ? [X13] :
( ~ p1(X13)
& r1(X12,X13) )
| ~ r1(X8,X12) )
| ! [X9] :
( ? [X10] :
( ! [X11] :
( p1(X11)
| ~ r1(X10,X11) )
& r1(X9,X10) )
| ~ r1(X8,X9) )
| ~ r1(X,X8) )
& ! [X3] :
( ! [X4] :
( ! [X7] :
( p1(X7)
| ~ r1(X4,X7) )
| ! [X5] :
( ? [X6] :
( ~ p1(X6)
& r1(X5,X6) )
| ~ r1(X4,X5) )
| ~ r1(X3,X4) )
| ~ r1(X,X3) )
& ! [X0] :
( ~ p1(X0)
| ! [X1] :
( ? [X2] :
( p1(X2)
& r1(X1,X2) )
| ~ r1(X0,X1) )
| ~ r1(X,X0) ) ),
inference(fof_nnf,[status(thm)],[main_neg]) ).
fof(sk_main_neg_sk,plain,
( ! [X18] :
( p1(X18)
| ~ r1(sK4,X18) )
& ~ p1(sK6)
& r1(sK5,sK6)
& r1(sK4,sK5)
& r1(sK0,sK4)
& ! [X14] :
( r1(X14,sK8(X14))
| ~ r1(sK0,X14) )
& ! [X8] :
( ! [X12] :
( ( ~ p1(sK3(X8,X12))
& r1(X12,sK3(X8,X12)) )
| ~ r1(X8,X12) )
| ! [X9] :
( ( ! [X11] :
( p1(X11)
| ~ r1(sK2(X8,X9),X11) )
& r1(X9,sK2(X8,X9)) )
| ~ r1(X8,X9) )
| ~ r1(sK0,X8) )
& ! [X3] :
( ! [X4] :
( ! [X7] :
( p1(X7)
| ~ r1(X4,X7) )
| ! [X5] :
( ( ~ p1(sK1(X3,X4,X5))
& r1(X5,sK1(X3,X4,X5)) )
| ~ r1(X4,X5) )
| ~ r1(X3,X4) )
| ~ r1(sK0,X3) )
& ! [X0] :
( ~ p1(X0)
| ! [X1] :
( ( p1(sK7(X0,X1))
& r1(X1,sK7(X0,X1)) )
| ~ r1(X0,X1) )
| ~ r1(sK0,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK7,sK1,sK2,sK3,sK8,sK4,sK5,sK6]),skolemize(X,sK0),skolemize(X2,sK7(X0,X1)),skolemize(X6,sK1(X3,X4,X5)),skolemize(X10,sK2(X8,X9)),skolemize(X13,sK3(X8,X12)),skolemize(X15,sK8(X14)),skolemize(Y,sK4),skolemize(X16,sK5),skolemize(X17,sK6)],[nnf_2]) ).
fof(sk_main_neg,plain,
( ! [VAR_0] :
( p1(VAR_0)
| ~ r1(sK4,VAR_0) )
& ~ p1(sK6)
& r1(sK5,sK6)
& r1(sK4,sK5)
& r1(sK0,sK4)
& ! [VAR_0] :
( r1(VAR_0,sK8(VAR_0))
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p1(sK3(VAR_0,VAR_3))
| ~ r1(VAR_0,VAR_3)
| p1(VAR_2)
| ~ r1(sK2(VAR_0,VAR_1),VAR_2)
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( r1(VAR_3,sK3(VAR_0,VAR_3))
| ~ r1(VAR_0,VAR_3)
| p1(VAR_2)
| ~ r1(sK2(VAR_0,VAR_1),VAR_2)
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2] :
( ~ p1(sK3(VAR_0,VAR_2))
| ~ r1(VAR_0,VAR_2)
| r1(VAR_1,sK2(VAR_0,VAR_1))
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2] :
( r1(VAR_2,sK3(VAR_0,VAR_2))
| ~ r1(VAR_0,VAR_2)
| r1(VAR_1,sK2(VAR_0,VAR_1))
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( p1(VAR_3)
| ~ r1(VAR_1,VAR_3)
| ~ p1(sK1(VAR_0,VAR_1,VAR_2))
| ~ r1(VAR_1,VAR_2)
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( p1(VAR_3)
| ~ r1(VAR_1,VAR_3)
| r1(VAR_2,sK1(VAR_0,VAR_1,VAR_2))
| ~ r1(VAR_1,VAR_2)
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1] :
( ~ p1(VAR_0)
| p1(sK7(VAR_0,VAR_1))
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) )
& ! [VAR_0,VAR_1] :
( ~ p1(VAR_0)
| r1(VAR_1,sK7(VAR_0,VAR_1))
| ~ r1(VAR_0,VAR_1)
| ~ r1(sK0,VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_main_neg_sk]) ).
cnf(c_6,negated_conjecture,
( p1(D)
| ~ r1(B,D)
| r1(C,sK1(A,B,C))
| ~ r1(B,C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_7,negated_conjecture,
( p1(D)
| ~ r1(B,D)
| ~ p1(sK1(A,B,C))
| ~ r1(B,C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_8,negated_conjecture,
( r1(C,sK3(A,C))
| ~ r1(A,C)
| r1(B,sK2(A,B))
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_9,negated_conjecture,
( ~ p1(sK3(A,C))
| ~ r1(A,C)
| r1(B,sK2(A,B))
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_10,negated_conjecture,
( r1(D,sK3(A,D))
| ~ r1(A,D)
| p1(C)
| ~ r1(sK2(A,B),C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_11,negated_conjecture,
( ~ p1(sK3(A,D))
| ~ r1(A,D)
| p1(C)
| ~ r1(sK2(A,B),C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_13,negated_conjecture,
r1(sK0,sK4),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_14,negated_conjecture,
r1(sK4,sK5),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_15,negated_conjecture,
r1(sK5,sK6),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_16,negated_conjecture,
~ p1(sK6),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_17,negated_conjecture,
( p1(A)
| ~ r1(sK4,A) ),
inference(split_conjunct,[status(thm)],[sk_main_neg]) ).
cnf(c_66,plain,
( p1(C)
| ~ r1(B,C)
| r1(B,sK1(A,B,B))
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_6,c_3]) ).
cnf(c_82,plain,
( r1(A,sK3(A,A))
| r1(B,sK2(A,B))
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_8,c_3]) ).
cnf(c_86,plain,
( ~ p1(sK3(A,A))
| r1(B,sK2(A,B))
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_9,c_3]) ).
cnf(c_89,plain,
( r1(A,sK3(A,A))
| p1(C)
| ~ r1(sK2(A,B),C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_10,c_3]) ).
cnf(c_95,plain,
( ~ p1(sK3(A,A))
| p1(C)
| ~ r1(sK2(A,B),C)
| ~ r1(A,B)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_11,c_3]) ).
cnf(c_115,plain,
( p1(C)
| ~ r1(A,C)
| r1(B,sK1(sK4,A,B))
| ~ r1(A,B)
| ~ r1(sK4,A) ),
inference(resolve,[status(thm)],[c_13,c_6]) ).
cnf(c_4247,negated_conjecture,
( p1(sK6)
| ~ p1(sK1(A,sK5,B))
| ~ r1(sK5,B)
| ~ r1(A,sK5)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_15,c_7]) ).
cnf(c_162,negated_conjecture,
( ~ p1(sK1(A,sK5,B))
| ~ r1(sK5,B)
| ~ r1(A,sK5)
| ~ r1(sK0,A) ),
inference(resolve,[status(thm)],[c_16,c_4247]) ).
cnf(c_4248,negated_conjecture,
( p1(C)
| ~ r1(A,C)
| ~ p1(sK1(sK4,A,B))
| ~ r1(A,B)
| ~ r1(sK4,A) ),
inference(resolve,[status(thm)],[c_7,c_13]) ).
cnf(c_4249,negated_conjecture,
( p1(B)
| ~ r1(sK5,B)
| ~ p1(sK1(sK4,sK5,A))
| ~ r1(sK5,A) ),
inference(resolve,[status(thm)],[c_4248,c_14]) ).
cnf(c_4250,negated_conjecture,
( p1(A)
| ~ r1(sK5,A)
| ~ p1(sK1(sK4,sK5,sK5)) ),
inference(resolve,[status(thm)],[c_4249,c_3]) ).
cnf(c_4251,negated_conjecture,
( p1(sK6)
| ~ p1(sK1(sK4,sK5,sK5)) ),
inference(resolve,[status(thm)],[c_4250,c_15]) ).
cnf(c_177,negated_conjecture,
~ p1(sK1(sK4,sK5,sK5)),
inference(resolve,[status(thm)],[c_4251,c_16]) ).
cnf(c_4252,negated_conjecture,
( p1(A)
| ~ r1(sK5,A)
| r1(sK5,sK1(sK4,sK5,sK5))
| ~ r1(sK0,sK4) ),
inference(resolve,[status(thm)],[c_66,c_14]) ).
cnf(c_511,negated_conjecture,
( p1(A)
| ~ r1(sK5,A)
| r1(sK5,sK1(sK4,sK5,sK5)) ),
inference(resolve,[status(thm)],[c_13,c_4252]) ).
cnf(c_4253,negated_conjecture,
( ~ p1(sK1(sK4,sK5,A))
| ~ r1(sK5,A)
| ~ r1(sK4,sK5) ),
inference(resolve,[status(thm)],[c_162,c_13]) ).
cnf(c_536,negated_conjecture,
( ~ p1(sK1(sK4,sK5,A))
| ~ r1(sK5,A) ),
inference(resolve,[status(thm)],[c_14,c_4253]) ).
cnf(c_4254,negated_conjecture,
( r1(sK4,sK3(sK4,sK4))
| r1(sK5,sK2(sK4,sK5))
| ~ r1(sK0,sK4) ),
inference(resolve,[status(thm)],[c_82,c_14]) ).
cnf(c_930,negated_conjecture,
( r1(sK4,sK3(sK4,sK4))
| r1(sK5,sK2(sK4,sK5)) ),
inference(resolve,[status(thm)],[c_13,c_4254]) ).
cnf(c_4255,negated_conjecture,
( ~ p1(sK3(sK4,sK4))
| r1(sK5,sK2(sK4,sK5))
| ~ r1(sK0,sK4) ),
inference(resolve,[status(thm)],[c_86,c_14]) ).
cnf(c_1645,negated_conjecture,
( ~ p1(sK3(sK4,sK4))
| r1(sK5,sK2(sK4,sK5)) ),
inference(resolve,[status(thm)],[c_13,c_4255]) ).
cnf(c_2188,plain,
( p1(sK3(sK4,sK4))
| r1(sK5,sK2(sK4,sK5)) ),
inference(resolve,[status(thm)],[c_930,c_17]) ).
cnf(c_4256,plain,
( r1(sK5,sK2(sK4,sK5))
| r1(sK5,sK2(sK4,sK5)) ),
inference(resolve,[status(thm)],[c_2188,c_1645]) ).
cnf(c_2237,plain,
r1(sK5,sK2(sK4,sK5)),
inference(copy,[status(thm)],[c_4256]) ).
cnf(c_2256,plain,
~ p1(sK1(sK4,sK5,sK2(sK4,sK5))),
inference(resolve,[status(thm)],[c_2237,c_536]) ).
cnf(c_4257,negated_conjecture,
( p1(sK6)
| r1(sK5,sK1(sK4,sK5,sK5)) ),
inference(resolve,[status(thm)],[c_511,c_15]) ).
cnf(c_2587,negated_conjecture,
r1(sK5,sK1(sK4,sK5,sK5)),
inference(resolve,[status(thm)],[c_16,c_4257]) ).
cnf(c_4258,plain,
( p1(sK1(sK4,sK5,sK5))
| r1(A,sK1(sK4,sK5,A))
| ~ r1(sK5,A)
| ~ r1(sK4,sK5) ),
inference(resolve,[status(thm)],[c_115,c_2587]) ).
cnf(c_4259,negated_conjecture,
( p1(sK1(sK4,sK5,sK5))
| r1(A,sK1(sK4,sK5,A))
| ~ r1(sK5,A) ),
inference(resolve,[status(thm)],[c_14,c_4258]) ).
cnf(c_2657,negated_conjecture,
( r1(A,sK1(sK4,sK5,A))
| ~ r1(sK5,A) ),
inference(resolve,[status(thm)],[c_177,c_4259]) ).
cnf(c_2663,plain,
r1(sK2(sK4,sK5),sK1(sK4,sK5,sK2(sK4,sK5))),
inference(resolve,[status(thm)],[c_2657,c_2237]) ).
cnf(c_4260,plain,
( ~ p1(sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5)))
| ~ r1(sK4,sK5)
| ~ r1(sK0,sK4) ),
inference(resolve,[status(thm)],[c_2663,c_95]) ).
cnf(c_4261,negated_conjecture,
( ~ p1(sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5)))
| ~ r1(sK4,sK5) ),
inference(resolve,[status(thm)],[c_13,c_4260]) ).
cnf(c_4262,negated_conjecture,
( ~ p1(sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5))) ),
inference(resolve,[status(thm)],[c_14,c_4261]) ).
cnf(c_4199,negated_conjecture,
~ p1(sK3(sK4,sK4)),
inference(resolve,[status(thm)],[c_2256,c_4262]) ).
cnf(c_4263,plain,
( r1(sK4,sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5)))
| ~ r1(sK4,sK5)
| ~ r1(sK0,sK4) ),
inference(resolve,[status(thm)],[c_2663,c_89]) ).
cnf(c_4264,negated_conjecture,
( r1(sK4,sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5)))
| ~ r1(sK4,sK5) ),
inference(resolve,[status(thm)],[c_13,c_4263]) ).
cnf(c_4265,negated_conjecture,
( r1(sK4,sK3(sK4,sK4))
| p1(sK1(sK4,sK5,sK2(sK4,sK5))) ),
inference(resolve,[status(thm)],[c_14,c_4264]) ).
cnf(c_4203,negated_conjecture,
r1(sK4,sK3(sK4,sK4)),
inference(resolve,[status(thm)],[c_2256,c_4265]) ).
cnf(c_4266,negated_conjecture,
~ r1(sK4,sK3(sK4,sK4)),
inference(resolve,[status(thm)],[c_17,c_4199]) ).
cnf(c_4246,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_4203,c_4266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n006.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 22:59:55 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 3967992 was started by sandbox on n006,
% 0.09/0.35 % Fri Sep 25 22:59:55 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 8.40/2.43
% 8.40/2.43 % SZS status Theorem for theBenchmark
% 8.40/2.43
% 8.40/2.43 % Proof 1 at 0.98 (+ 0.13) seconds.
% 8.40/2.43 % Length of proof is 35.
% 8.40/2.43 % Level of proof is 8.
% 8.40/2.43 % Maximum clause weight is 31.000.
% 8.40/2.43 % Given clauses 426.
% 8.40/2.43
% 8.40/2.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------