%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUN135-1.006 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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:19:29 AM UTC 2026
% Result : Unsatisfiable 18.50s 2.74s
% Output : CNFRefutation 18.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 13
% Syntax : Number of formulae : 100 ( 100 unt; 0 def)
% Number of atoms : 100 ( 99 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 163 ( 19 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rule12,axiom,
! [VAR_0,VAR_1,VAR_2] : f(s(VAR_0),zero,VAR_1,VAR_2) = f(VAR_0,VAR_2,minus(VAR_1,s(VAR_0)),VAR_2),
file('theBenchmark.p',rule12) ).
cnf(c_1,plain,
f(s(A),zero,B,C) = f(A,C,minus(B,s(A)),C),
inference(clausify,[status(thm)],[rule12]) ).
fof(rule13,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] : f(s(VAR_0),s(VAR_1),VAR_2,VAR_3) = if('<='(VAR_0,VAR_1),f(s(VAR_0),minus(VAR_1,VAR_0),VAR_2,VAR_3),f(VAR_0,VAR_3,VAR_2,VAR_3)),
file('theBenchmark.p',rule13) ).
cnf(c_2,plain,
f(s(A),s(B),C,D) = if('<='(A,B),f(s(A),minus(B,A),C,D),f(A,D,C,D)),
inference(clausify,[status(thm)],[rule13]) ).
cnf(c_3,plain,
if('<='(A,B),f(s(A),minus(B,A),C,D),f(A,D,C,D)) = f(s(A),s(B),C,D),
inference(copy,[status(thm)],[c_2]) ).
fof(goal,axiom,
! [VAR_0] : perfectp(VAR_0) != true,
file('theBenchmark.p',goal) ).
cnf(c_4,plain,
perfectp(A) != true,
inference(clausify,[status(thm)],[goal]) ).
fof(rule10,axiom,
! [VAR_0,VAR_1] : f(zero,VAR_0,zero,VAR_1) = true,
file('theBenchmark.p',rule10) ).
cnf(c_6,plain,
f(zero,A,zero,B) = true,
inference(clausify,[status(thm)],[rule10]) ).
fof(rule9,axiom,
! [VAR_0] : perfectp(s(VAR_0)) = f(VAR_0,s(zero),s(VAR_0),s(VAR_0)),
file('theBenchmark.p',rule9) ).
cnf(c_7,plain,
perfectp(s(A)) = f(A,s(zero),s(A),s(A)),
inference(clausify,[status(thm)],[rule9]) ).
cnf(c_8,plain,
f(A,s(zero),s(A),s(A)) = perfectp(s(A)),
inference(copy,[status(thm)],[c_7]) ).
fof(rule8,axiom,
perfectp(zero) = false,
file('theBenchmark.p',rule8) ).
cnf(c_9,plain,
perfectp(zero) = false,
inference(clausify,[status(thm)],[rule8]) ).
cnf(c_10,plain,
false = perfectp(zero),
inference(copy,[status(thm)],[c_9]) ).
fof(rule7,axiom,
! [VAR_0,VAR_1] : if(false,VAR_0,VAR_1) = VAR_1,
file('theBenchmark.p',rule7) ).
cnf(c_11,plain,
if(false,A,B) = B,
inference(clausify,[status(thm)],[rule7]) ).
cnf(c_12,plain,
if(perfectp(zero),A,B) = B,
inference(paramod,[status(thm)],[c_10,c_11]) ).
fof(rule6,axiom,
! [VAR_0,VAR_1] : if(true,VAR_0,VAR_1) = VAR_0,
file('theBenchmark.p',rule6) ).
cnf(c_13,plain,
if(true,A,B) = A,
inference(clausify,[status(thm)],[rule6]) ).
fof(rule5,axiom,
! [VAR_0,VAR_1] : '<='(s(VAR_0),s(VAR_1)) = '<='(VAR_0,VAR_1),
file('theBenchmark.p',rule5) ).
cnf(c_14,plain,
'<='(s(A),s(B)) = '<='(A,B),
inference(clausify,[status(thm)],[rule5]) ).
fof(rule4,axiom,
! [VAR_0] : '<='(s(VAR_0),zero) = false,
file('theBenchmark.p',rule4) ).
cnf(c_15,plain,
'<='(s(A),zero) = false,
inference(clausify,[status(thm)],[rule4]) ).
cnf(c_16,plain,
'<='(s(A),zero) = perfectp(zero),
inference(paramod,[status(thm)],[c_10,c_15]) ).
fof(rule3,axiom,
! [VAR_0] : '<='(zero,VAR_0) = true,
file('theBenchmark.p',rule3) ).
cnf(c_17,plain,
'<='(zero,A) = true,
inference(clausify,[status(thm)],[rule3]) ).
fof(rule2,axiom,
! [VAR_0,VAR_1] : minus(s(VAR_0),s(VAR_1)) = minus(VAR_0,VAR_1),
file('theBenchmark.p',rule2) ).
cnf(c_18,plain,
minus(s(A),s(B)) = minus(A,B),
inference(clausify,[status(thm)],[rule2]) ).
fof(rule1,axiom,
! [VAR_0] : minus(VAR_0,zero) = VAR_0,
file('theBenchmark.p',rule1) ).
cnf(c_19,plain,
minus(A,zero) = A,
inference(clausify,[status(thm)],[rule1]) ).
cnf(c_21,plain,
if('<='(s(A),B),f(s(s(A)),minus(B,s(A)),C,zero),f(A,zero,minus(C,s(A)),zero)) = f(s(s(A)),s(B),C,zero),
inference(paramod,[status(thm)],[c_1,c_3]) ).
cnf(c_109,plain,
perfectp(A) != f(zero,B,zero,C),
inference(paramod,[status(thm)],[c_6,c_4]) ).
cnf(c_23,plain,
f(zero,A,zero,B) != perfectp(C),
inference(copy,[status(thm)],[c_109]) ).
cnf(c_26,plain,
if(f(zero,A,zero,B),C,D) = C,
inference(paramod,[status(thm)],[c_6,c_13]) ).
cnf(c_110,plain,
if('<='(A,B),f(s(s(A)),minus(s(B),s(A)),C,D),f(s(A),D,C,D)) = f(s(s(A)),s(s(B)),C,D),
inference(paramod,[status(thm)],[c_14,c_3]) ).
cnf(c_27,plain,
if('<='(A,B),f(s(s(A)),minus(B,A),C,D),f(s(A),D,C,D)) = f(s(s(A)),s(s(B)),C,D),
inference(paramod,[status(thm)],[c_18,c_110]) ).
cnf(c_111,plain,
if(perfectp(zero),f(s(s(A)),minus(zero,s(A)),B,C),f(s(A),C,B,C)) = f(s(s(A)),s(zero),B,C),
inference(paramod,[status(thm)],[c_16,c_3]) ).
cnf(c_112,plain,
f(s(A),C,B,C) = f(s(s(A)),s(zero),B,C),
inference(paramod,[status(thm)],[c_12,c_111]) ).
cnf(c_28,plain,
f(s(s(A)),s(zero),B,C) = f(s(A),C,B,C),
inference(copy,[status(thm)],[c_112]) ).
cnf(c_113,plain,
if(true,f(s(zero),minus(A,zero),B,C),f(zero,C,B,C)) = f(s(zero),s(A),B,C),
inference(paramod,[status(thm)],[c_17,c_3]) ).
cnf(c_114,plain,
if(true,f(s(zero),A,B,C),f(zero,C,B,C)) = f(s(zero),s(A),B,C),
inference(paramod,[status(thm)],[c_19,c_113]) ).
cnf(c_115,plain,
f(s(zero),A,B,C) = f(s(zero),s(A),B,C),
inference(paramod,[status(thm)],[c_13,c_114]) ).
cnf(c_29,plain,
f(s(zero),s(A),B,C) = f(s(zero),A,B,C),
inference(copy,[status(thm)],[c_115]) ).
cnf(c_33,plain,
if('<='(s(A),B),f(s(s(A)),minus(B,s(A)),s(C),zero),f(A,zero,minus(C,A),zero)) = f(s(s(A)),s(B),s(C),zero),
inference(paramod,[status(thm)],[c_18,c_21]) ).
cnf(c_116,plain,
if('<='(A,B),f(s(s(s(A))),minus(s(B),s(A)),C,D),f(s(s(A)),D,C,D)) = f(s(s(s(A))),s(s(s(B))),C,D),
inference(paramod,[status(thm)],[c_14,c_27]) ).
cnf(c_37,plain,
if('<='(A,B),f(s(s(s(A))),minus(B,A),C,D),f(s(s(A)),D,C,D)) = f(s(s(s(A))),s(s(s(B))),C,D),
inference(paramod,[status(thm)],[c_18,c_116]) ).
cnf(c_117,plain,
if(perfectp(zero),f(s(s(s(A))),minus(zero,s(A)),B,C),f(s(s(A)),C,B,C)) = f(s(s(s(A))),s(s(zero)),B,C),
inference(paramod,[status(thm)],[c_16,c_27]) ).
cnf(c_118,plain,
f(s(s(A)),C,B,C) = f(s(s(s(A))),s(s(zero)),B,C),
inference(paramod,[status(thm)],[c_12,c_117]) ).
cnf(c_38,plain,
f(s(s(s(A))),s(s(zero)),B,C) = f(s(s(A)),C,B,C),
inference(copy,[status(thm)],[c_118]) ).
cnf(c_119,plain,
if(true,f(s(s(zero)),minus(A,zero),B,C),f(s(zero),C,B,C)) = f(s(s(zero)),s(s(A)),B,C),
inference(paramod,[status(thm)],[c_17,c_27]) ).
cnf(c_120,plain,
if(true,f(s(s(zero)),A,B,C),f(s(zero),C,B,C)) = f(s(s(zero)),s(s(A)),B,C),
inference(paramod,[status(thm)],[c_19,c_119]) ).
cnf(c_121,plain,
f(s(s(zero)),A,B,C) = f(s(s(zero)),s(s(A)),B,C),
inference(paramod,[status(thm)],[c_13,c_120]) ).
cnf(c_39,plain,
f(s(s(zero)),s(s(A)),B,C) = f(s(s(zero)),A,B,C),
inference(copy,[status(thm)],[c_121]) ).
cnf(c_41,plain,
f(s(A),s(s(s(A))),s(s(s(A))),s(s(s(A)))) = perfectp(s(s(s(A)))),
inference(paramod,[status(thm)],[c_28,c_8]) ).
cnf(c_57,plain,
if('<='(s(zero),A),f(s(s(zero)),minus(A,s(zero)),s(B),zero),f(zero,zero,B,zero)) = f(s(s(zero)),s(A),s(B),zero),
inference(paramod,[status(thm)],[c_19,c_33]) ).
cnf(c_58,plain,
if('<='(s(zero),A),f(s(s(zero)),minus(A,s(zero)),s(zero),zero),true) = f(s(s(zero)),s(A),s(zero),zero),
inference(paramod,[status(thm)],[c_6,c_57]) ).
cnf(c_122,plain,
if(perfectp(zero),f(s(s(zero)),minus(zero,s(zero)),s(zero),zero),true) = f(s(s(zero)),s(zero),s(zero),zero),
inference(paramod,[status(thm)],[c_16,c_58]) ).
cnf(c_123,plain,
true = f(s(s(zero)),s(zero),s(zero),zero),
inference(paramod,[status(thm)],[c_12,c_122]) ).
cnf(c_124,plain,
true = f(s(zero),zero,s(zero),zero),
inference(paramod,[status(thm)],[c_28,c_123]) ).
cnf(c_125,plain,
true = f(zero,zero,minus(s(zero),s(zero)),zero),
inference(paramod,[status(thm)],[c_1,c_124]) ).
cnf(c_126,plain,
true = f(zero,zero,minus(zero,zero),zero),
inference(paramod,[status(thm)],[c_18,c_125]) ).
cnf(c_61,plain,
true = f(zero,zero,zero,zero),
inference(paramod,[status(thm)],[c_19,c_126]) ).
cnf(c_62,plain,
'<='(zero,A) = f(zero,zero,zero,zero),
inference(paramod,[status(thm)],[c_61,c_17]) ).
cnf(c_127,plain,
if('<='(A,B),f(s(s(s(s(A)))),minus(s(B),s(A)),C,D),f(s(s(s(A))),D,C,D)) = f(s(s(s(s(A)))),s(s(s(s(B)))),C,D),
inference(paramod,[status(thm)],[c_14,c_37]) ).
cnf(c_69,plain,
if('<='(A,B),f(s(s(s(s(A)))),minus(B,A),C,D),f(s(s(s(A))),D,C,D)) = f(s(s(s(s(A)))),s(s(s(s(B)))),C,D),
inference(paramod,[status(thm)],[c_18,c_127]) ).
cnf(c_128,plain,
if('<='(zero,A),f(s(s(s(zero))),A,B,C),f(s(s(zero)),C,B,C)) = f(s(s(s(zero))),s(s(s(A))),B,C),
inference(paramod,[status(thm)],[c_19,c_37]) ).
cnf(c_129,plain,
if(f(zero,zero,zero,zero),f(s(s(s(zero))),A,B,C),f(s(s(zero)),C,B,C)) = f(s(s(s(zero))),s(s(s(A))),B,C),
inference(paramod,[status(thm)],[c_62,c_128]) ).
cnf(c_130,plain,
f(s(s(s(zero))),A,B,C) = f(s(s(s(zero))),s(s(s(A))),B,C),
inference(paramod,[status(thm)],[c_26,c_129]) ).
cnf(c_71,plain,
f(s(s(s(zero))),s(s(s(A))),B,C) = f(s(s(s(zero))),A,B,C),
inference(copy,[status(thm)],[c_130]) ).
cnf(c_131,plain,
if('<='(zero,A),f(s(s(s(s(zero)))),A,B,C),f(s(s(s(zero))),C,B,C)) = f(s(s(s(s(zero)))),s(s(s(s(A)))),B,C),
inference(paramod,[status(thm)],[c_19,c_69]) ).
cnf(c_132,plain,
if(f(zero,zero,zero,zero),f(s(s(s(s(zero)))),A,B,C),f(s(s(s(zero))),C,B,C)) = f(s(s(s(s(zero)))),s(s(s(s(A)))),B,C),
inference(paramod,[status(thm)],[c_62,c_131]) ).
cnf(c_133,plain,
f(s(s(s(s(zero)))),A,B,C) = f(s(s(s(s(zero)))),s(s(s(s(A)))),B,C),
inference(paramod,[status(thm)],[c_26,c_132]) ).
cnf(c_101,plain,
f(s(s(s(s(zero)))),s(s(s(s(A)))),B,C) = f(s(s(s(s(zero)))),A,B,C),
inference(copy,[status(thm)],[c_133]) ).
cnf(c_134,plain,
f(s(s(s(s(zero)))),s(s(zero)),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_101,c_41]) ).
cnf(c_135,plain,
f(s(s(s(zero))),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_38,c_134]) ).
cnf(c_136,plain,
f(s(s(s(zero))),s(s(s(zero))),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_71,c_135]) ).
cnf(c_137,plain,
f(s(s(s(zero))),zero,s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_71,c_136]) ).
cnf(c_138,plain,
f(s(s(zero)),s(s(s(s(s(s(zero)))))),minus(s(s(s(s(s(s(zero)))))),s(s(s(zero)))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_1,c_137]) ).
cnf(c_139,plain,
f(s(s(zero)),s(s(s(s(s(s(zero)))))),minus(s(s(s(s(s(zero))))),s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_138]) ).
cnf(c_140,plain,
f(s(s(zero)),s(s(s(s(s(s(zero)))))),minus(s(s(s(s(zero)))),s(zero)),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_139]) ).
cnf(c_141,plain,
f(s(s(zero)),s(s(s(s(s(s(zero)))))),minus(s(s(s(zero))),zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_140]) ).
cnf(c_142,plain,
f(s(s(zero)),s(s(s(s(s(s(zero)))))),s(s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_19,c_141]) ).
cnf(c_143,plain,
f(s(s(zero)),s(s(s(s(zero)))),s(s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_39,c_142]) ).
cnf(c_144,plain,
f(s(s(zero)),s(s(zero)),s(s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_39,c_143]) ).
cnf(c_145,plain,
f(s(s(zero)),zero,s(s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_39,c_144]) ).
cnf(c_146,plain,
f(s(zero),s(s(s(s(s(s(zero)))))),minus(s(s(s(zero))),s(s(zero))),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_1,c_145]) ).
cnf(c_147,plain,
f(s(zero),s(s(s(s(s(s(zero)))))),minus(s(s(zero)),s(zero)),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_146]) ).
cnf(c_148,plain,
f(s(zero),s(s(s(s(s(s(zero)))))),minus(s(zero),zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_147]) ).
cnf(c_149,plain,
f(s(zero),s(s(s(s(s(s(zero)))))),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_19,c_148]) ).
cnf(c_150,plain,
f(s(zero),s(s(s(s(s(zero))))),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_149]) ).
cnf(c_151,plain,
f(s(zero),s(s(s(s(zero)))),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_150]) ).
cnf(c_152,plain,
f(s(zero),s(s(s(zero))),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_151]) ).
cnf(c_153,plain,
f(s(zero),s(s(zero)),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_152]) ).
cnf(c_154,plain,
f(s(zero),s(zero),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_153]) ).
cnf(c_155,plain,
f(s(zero),zero,s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_29,c_154]) ).
cnf(c_156,plain,
f(zero,s(s(s(s(s(s(zero)))))),minus(s(zero),s(zero)),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_1,c_155]) ).
cnf(c_157,plain,
f(zero,s(s(s(s(s(s(zero)))))),minus(zero,zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_18,c_156]) ).
cnf(c_107,plain,
f(zero,s(s(s(s(s(s(zero)))))),zero,s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
inference(paramod,[status(thm)],[c_19,c_157]) ).
cnf(c_108,plain,
$false,
inference(resolve,[status(thm)],[c_107,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN135-1.006 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n002.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 04:39:50 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 841907 was started by sandbox on n002,
% 0.08/0.37 % Sat Sep 26 04:39:50 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 18.50/2.74
% 18.50/2.74 % SZS status Unsatisfiable for theBenchmark
% 18.50/2.74
% 18.50/2.74 % Proof 1 at 2.36 (+ 0.01) seconds.
% 18.50/2.74 % Length of proof is 38.
% 18.50/2.74 % Level of proof is 10.
% 18.50/2.74 % Maximum clause weight is 37.000.
% 18.50/2.74 % Given clauses 56.
% 18.50/2.74
% 18.50/2.74 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------