%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS174+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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:46:15 AM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 52
% Number of leaves : 6
% Syntax : Number of formulae : 96 ( 10 unt; 0 def)
% Number of atoms : 398 ( 91 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 435 ( 133 ~; 276 |; 18 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 26 ( 2 sgn 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
file('theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('theBenchmark.p',axiom_1) ).
fof(axiom_2,axiom,
! [X] :
( cA(X)
<=> X = ia ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X] :
( cA_and_B(X)
<=> ( X = ia
| X = ib ) ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X] :
( cB(X)
<=> X = ib ),
file('theBenchmark.p',axiom_4) ).
fof(the_axiom,conjecture,
( ! [X] :
( cA_and_B(X)
<=> ( cA(X)
| cB(X) ) )
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
file('theBenchmark.p',the_axiom) ).
fof(the_axiom_neg,negated_conjecture,
~ ( ! [X] :
( cA_and_B(X)
<=> ( cA(X)
| cB(X) ) )
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
cnf(c_21,plain,
cowlThing(A),
inference(clausify,[status(thm)],[axiom_0]) ).
cnf(c_22,plain,
~ cowlNothing(A),
inference(clausify,[status(thm)],[axiom_0]) ).
cnf(c_23,plain,
( ~ xsd_integer(A)
| ~ xsd_string(A) ),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_24,plain,
( xsd_integer(A)
| xsd_string(A) ),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_25,plain,
( ia = A
| ~ cA(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
cnf(c_26,plain,
( ia != A
| cA(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
cnf(c_27,plain,
( ia = A
| ib = A
| ~ cA_and_B(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_28,plain,
( ib != A
| cA_and_B(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_29,plain,
( ia != A
| cA_and_B(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_30,plain,
( ib = A
| ~ cB(A) ),
inference(clausify,[status(thm)],[axiom_4]) ).
cnf(c_31,plain,
( ib != A
| cB(A) ),
inference(clausify,[status(thm)],[axiom_4]) ).
fof(nnf_13,plain,
( ? [X] :
( ( ( ~ cA(X)
& ~ cB(X) )
| ~ cA_and_B(X) )
& ( cA(X)
| cB(X)
| cA_and_B(X) ) )
| ? [X1] :
( ( xsd_integer(X1)
| ~ xsd_string(X1) )
& ( ~ xsd_integer(X1)
| xsd_string(X1) ) )
| ? [X0] :
( cowlNothing(X0)
| ~ cowlThing(X0) ) ),
inference(fof_nnf,[status(thm)],[the_axiom_neg]) ).
fof(sk_the_axiom_neg_sk,plain,
( ( ( ( ~ cA(sK2)
& ~ cB(sK2) )
| ~ cA_and_B(sK2) )
& ( cA(sK2)
| cB(sK2)
| cA_and_B(sK2) ) )
| ( ( xsd_integer(sK1)
| ~ xsd_string(sK1) )
& ( ~ xsd_integer(sK1)
| xsd_string(sK1) ) )
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X,sK2)],[nnf_13]) ).
fof(sk_the_axiom_neg,plain,
( ( ~ cA(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( ~ cB(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( ~ cA(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( ~ cB(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) )
& ( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ) ),
inference(cnf_transformation,[status(thm)],[sk_the_axiom_neg_sk]) ).
cnf(c_32,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_89,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_32]) ).
cnf(c_33,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_89]) ).
cnf(c_34,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_90,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_34]) ).
cnf(c_35,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_90]) ).
cnf(c_36,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_91,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_36]) ).
cnf(c_37,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_91]) ).
cnf(c_38,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_92,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_38]) ).
cnf(c_39,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_92]) ).
cnf(c_40,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_93,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_40]) ).
cnf(c_41,negated_conjecture,
( ~ cB(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_93]) ).
cnf(c_42,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0)
| ~ cowlThing(sK0) ),
inference(split_conjunct,[status(thm)],[sk_the_axiom_neg]) ).
cnf(c_94,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK0) ),
inference(resolve,[status(thm)],[c_21,c_42]) ).
cnf(c_43,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_22,c_94]) ).
cnf(c_45,plain,
cA(ia),
inference(xxres,[status(thm)],[c_26]) ).
cnf(c_47,plain,
cA_and_B(ia),
inference(xxres,[status(thm)],[c_29]) ).
cnf(c_48,plain,
cB(ib),
inference(xxres,[status(thm)],[c_31]) ).
cnf(c_95,negated_conjecture,
( xsd_integer(sK1)
| cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(resolve,[status(thm)],[c_39,c_24]) ).
cnf(c_49,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(copy,[status(thm)],[c_95]) ).
cnf(c_96,plain,
( ib = sK2
| cA(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(resolve,[status(thm)],[c_49,c_30]) ).
cnf(c_50,plain,
( sK2 = ib
| cA(sK2)
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(copy,[status(thm)],[c_96]) ).
cnf(c_97,plain,
( ia = sK2
| sK2 = ib
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(resolve,[status(thm)],[c_50,c_25]) ).
cnf(c_52,plain,
( sK2 = ia
| sK2 = ib
| cA_and_B(sK2)
| xsd_integer(sK1) ),
inference(copy,[status(thm)],[c_97]) ).
cnf(c_98,negated_conjecture,
( cA(sK2)
| cB(sK2)
| cA_and_B(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(resolve,[status(thm)],[c_52,c_33]) ).
cnf(c_54,negated_conjecture,
( cA(sK2)
| cB(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_98]) ).
cnf(c_99,plain,
( ib = sK2
| cA(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(resolve,[status(thm)],[c_54,c_30]) ).
cnf(c_100,plain,
( sK2 = ib
| cA(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_99]) ).
cnf(c_56,plain,
( cA(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_100]) ).
cnf(c_101,plain,
( ia = sK2
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(resolve,[status(thm)],[c_56,c_25]) ).
cnf(c_102,plain,
( sK2 = ia
| xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_101]) ).
cnf(c_57,plain,
( xsd_string(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_102]) ).
cnf(c_58,plain,
( ~ xsd_integer(sK1)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(resolve,[status(thm)],[c_57,c_23]) ).
cnf(c_103,plain,
( sK2 = ia
| sK2 = ib
| cA_and_B(sK2)
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(resolve,[status(thm)],[c_58,c_52]) ).
cnf(c_104,plain,
( sK2 = ia
| sK2 = ib
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_103]) ).
cnf(c_105,plain,
( sK2 = ia
| sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_104]) ).
cnf(c_60,plain,
( sK2 = ia
| sK2 = ib
| cA_and_B(sK2) ),
inference(copy,[status(thm)],[c_105]) ).
cnf(c_106,plain,
( ia = sK2
| ib = sK2
| sK2 = ia
| sK2 = ib ),
inference(resolve,[status(thm)],[c_60,c_27]) ).
cnf(c_107,plain,
( ia = sK2
| sK2 = ib
| sK2 = ia
| sK2 = ib ),
inference(copy,[status(thm)],[c_106]) ).
cnf(c_108,plain,
( sK2 = ia
| sK2 = ib
| sK2 = ia
| sK2 = ib ),
inference(copy,[status(thm)],[c_107]) ).
cnf(c_109,plain,
( sK2 = ia
| sK2 = ia
| sK2 = ib ),
inference(copy,[status(thm)],[c_108]) ).
cnf(c_61,plain,
( sK2 = ia
| sK2 = ib ),
inference(copy,[status(thm)],[c_109]) ).
cnf(c_110,plain,
( A != ib
| cA_and_B(A) ),
inference(copy,[status(thm)],[c_28]) ).
cnf(c_65,plain,
( cA_and_B(sK2)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_61,c_110]) ).
cnf(c_111,plain,
( ~ cB(ib)
| ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| sK2 = ia ),
inference(paramod,[status(thm)],[c_61,c_35]) ).
cnf(c_66,plain,
( ~ cA_and_B(sK2)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_48,c_111]) ).
cnf(c_112,plain,
( ~ cB(ib)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| sK2 = ia ),
inference(paramod,[status(thm)],[c_61,c_41]) ).
cnf(c_67,plain,
( ~ cA_and_B(sK2)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_48,c_112]) ).
cnf(c_113,plain,
( xsd_integer(sK1)
| ~ cA_and_B(sK2)
| xsd_integer(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_67,c_24]) ).
cnf(c_74,plain,
( ~ cA_and_B(sK2)
| xsd_integer(sK1)
| sK2 = ia ),
inference(copy,[status(thm)],[c_113]) ).
cnf(c_114,plain,
( sK2 = ia
| xsd_integer(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_74,c_65]) ).
cnf(c_75,plain,
( xsd_integer(sK1)
| sK2 = ia ),
inference(copy,[status(thm)],[c_114]) ).
cnf(c_115,plain,
( ~ cA_and_B(sK2)
| xsd_string(sK1)
| sK2 = ia
| sK2 = ia ),
inference(resolve,[status(thm)],[c_75,c_66]) ).
cnf(c_76,plain,
( ~ cA_and_B(sK2)
| xsd_string(sK1)
| sK2 = ia ),
inference(copy,[status(thm)],[c_115]) ).
cnf(c_116,plain,
( sK2 = ia
| xsd_string(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_76,c_65]) ).
cnf(c_78,plain,
( xsd_string(sK1)
| sK2 = ia ),
inference(copy,[status(thm)],[c_116]) ).
cnf(c_79,plain,
( ~ xsd_integer(sK1)
| sK2 = ia ),
inference(resolve,[status(thm)],[c_78,c_23]) ).
cnf(c_117,plain,
( sK2 = ia
| sK2 = ia ),
inference(resolve,[status(thm)],[c_79,c_75]) ).
cnf(c_82,plain,
sK2 = ia,
inference(copy,[status(thm)],[c_117]) ).
cnf(c_118,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(ia)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(paramod,[status(thm)],[c_82,c_43]) ).
cnf(c_119,negated_conjecture,
( ~ cA(ia)
| ~ cA_and_B(ia)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(paramod,[status(thm)],[c_82,c_118]) ).
cnf(c_120,negated_conjecture,
( ~ cA(ia)
| xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_47,c_119]) ).
cnf(c_83,negated_conjecture,
( xsd_integer(sK1)
| ~ xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_45,c_120]) ).
cnf(c_121,negated_conjecture,
( ~ cA(sK2)
| ~ cA_and_B(ia)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(paramod,[status(thm)],[c_82,c_37]) ).
cnf(c_122,negated_conjecture,
( ~ cA(ia)
| ~ cA_and_B(ia)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(paramod,[status(thm)],[c_82,c_121]) ).
cnf(c_123,negated_conjecture,
( ~ cA(ia)
| ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_47,c_122]) ).
cnf(c_84,negated_conjecture,
( ~ xsd_integer(sK1)
| xsd_string(sK1) ),
inference(resolve,[status(thm)],[c_45,c_123]) ).
cnf(c_124,negated_conjecture,
( xsd_integer(sK1)
| xsd_integer(sK1) ),
inference(resolve,[status(thm)],[c_83,c_24]) ).
cnf(c_85,negated_conjecture,
xsd_integer(sK1),
inference(copy,[status(thm)],[c_124]) ).
cnf(c_86,negated_conjecture,
xsd_string(sK1),
inference(resolve,[status(thm)],[c_85,c_84]) ).
cnf(c_125,plain,
~ xsd_string(sK1),
inference(resolve,[status(thm)],[c_23,c_85]) ).
cnf(c_88,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_86,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS174+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 19:42:30 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 2719157 was started by sandbox on n011,
% 0.09/0.36 % Fri Sep 25 19:42:30 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 55.
% 0.13/0.38 % Level of proof is 22.
% 0.13/0.38 % Maximum clause weight is 14.000.
% 0.13/0.38 % Given clauses 57.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------