%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:36:43 AM UTC 2026
% Result : Theorem 1.71s 0.72s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 15 unt; 0 def)
% Number of atoms : 324 ( 22 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 416 ( 169 ~; 162 |; 45 &)
% ( 6 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 183 ( 19 sgn 56 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p2,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,set_type)
=> ! [E] :
( ilf_type(E,set_type)
=> ( member(ordered_pair(B,C),cross_product(D,E))
<=> ( member(C,E)
& member(B,D) ) ) ) ) ) ),
file('theBenchmark.p',p2) ).
fof(p5,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ( ! [E] :
( ilf_type(E,relation_type(B,C))
=> ilf_type(E,subset_type(cross_product(B,C))) )
& ! [D] :
( ilf_type(D,subset_type(cross_product(B,C)))
=> ilf_type(D,relation_type(B,C)) ) ) ) ),
file('theBenchmark.p',p5) ).
fof(p12,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( ilf_type(B,binary_relation_type)
<=> ( ilf_type(B,set_type)
& relation_like(B) ) ) ),
file('theBenchmark.p',p12) ).
fof(p14,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ( ilf_type(C,subset_type(B))
<=> ilf_type(C,member_type(power_set(B))) ) ) ),
file('theBenchmark.p',p14) ).
fof(p19,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ( member(B,power_set(C))
<=> ! [D] :
( ilf_type(D,set_type)
=> ( member(D,B)
=> member(D,C) ) ) ) ) ),
file('theBenchmark.p',p19) ).
fof(p20,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( ilf_type(power_set(B),set_type)
& ~ empty(power_set(B)) ) ),
file('theBenchmark.p',p20) ).
fof(p21,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ( ilf_type(C,set_type)
& ~ empty(C) )
=> ( ilf_type(B,member_type(C))
<=> member(B,C) ) ) ),
file('theBenchmark.p',p21) ).
fof(p23,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( relation_like(B)
<=> ! [C] :
( ilf_type(C,set_type)
=> ( member(C,B)
=> ? [D] :
( ? [E] :
( C = ordered_pair(D,E)
& ilf_type(E,set_type) )
& ilf_type(D,set_type) ) ) ) ) ),
file('theBenchmark.p',p23) ).
fof(p24,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,subset_type(cross_product(B,C)))
=> relation_like(D) ) ) ),
file('theBenchmark.p',p24) ).
fof(p27,axiom,
! [B] : ilf_type(B,set_type),
file('theBenchmark.p',p27) ).
fof(prove_relset_1_6,conjecture,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,set_type)
=> ! [E] :
( ilf_type(E,relation_type(B,C))
=> ( member(D,E)
=> ? [F] :
( ? [G] :
( member(G,C)
& member(F,B)
& D = ordered_pair(F,G)
& ilf_type(G,set_type) )
& ilf_type(F,set_type) ) ) ) ) ) ),
file('theBenchmark.p',prove_relset_1_6) ).
fof(prove_relset_1_6_neg,negated_conjecture,
~ ! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,set_type)
=> ! [E] :
( ilf_type(E,relation_type(B,C))
=> ( member(D,E)
=> ? [F] :
( ? [G] :
( member(G,C)
& member(F,B)
& D = ordered_pair(F,G)
& ilf_type(G,set_type) )
& ilf_type(F,set_type) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_6]) ).
cnf(c_29,plain,
( ~ relation_like(A)
| ilf_type(A,binary_relation_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p12]) ).
cnf(c_30,plain,
( relation_like(A)
| ~ ilf_type(A,binary_relation_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p12]) ).
fof(nnf_23,plain,
! [B] :
( ( ( ? [C] :
( ! [D] :
( ! [E] :
( ordered_pair(D,E) != C
| ~ ilf_type(E,set_type) )
| ~ ilf_type(D,set_type) )
& member(C,B)
& ilf_type(C,set_type) )
| relation_like(B) )
& ( ! [X0] :
( ? [X1] :
( ? [X2] :
( ordered_pair(X1,X2) = X0
& ilf_type(X2,set_type) )
& ilf_type(X1,set_type) )
| ~ member(X0,B)
| ~ ilf_type(X0,set_type) )
| ~ relation_like(B) ) )
| ~ ilf_type(B,set_type) ),
inference(fof_nnf,[status(thm)],[p23]) ).
fof(sk_p23_sk,plain,
! [B] :
( ( ( ( ! [D] :
( ! [E] :
( ordered_pair(D,E) != sK6(B)
| ~ ilf_type(E,set_type) )
| ~ ilf_type(D,set_type) )
& member(sK6(B),B)
& ilf_type(sK6(B),set_type) )
| relation_like(B) )
& ( ! [X0] :
( ( ordered_pair(sK0(B,X0),sK1(B,X0)) = X0
& ilf_type(sK1(B,X0),set_type)
& ilf_type(sK0(B,X0),set_type) )
| ~ member(X0,B)
| ~ ilf_type(X0,set_type) )
| ~ relation_like(B) ) )
| ~ ilf_type(B,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK6]),skolemize(X1,sK0(B,X0)),skolemize(X2,sK1(B,X0)),skolemize(C,sK6(B))],[nnf_23]) ).
fof(sk_p23,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ordered_pair(VAR_1,VAR_2) != sK6(VAR_0)
| ~ ilf_type(VAR_2,set_type)
| ~ ilf_type(VAR_1,set_type)
| relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0] :
( member(sK6(VAR_0),VAR_0)
| relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0] :
( ilf_type(sK6(VAR_0),set_type)
| relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0,VAR_1] :
( ordered_pair(sK0(VAR_0,VAR_1),sK1(VAR_0,VAR_1)) = VAR_1
| ~ member(VAR_1,VAR_0)
| ~ ilf_type(VAR_1,set_type)
| ~ relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0,VAR_1] :
( ilf_type(sK1(VAR_0,VAR_1),set_type)
| ~ member(VAR_1,VAR_0)
| ~ ilf_type(VAR_1,set_type)
| ~ relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0,VAR_1] :
( ilf_type(sK0(VAR_0,VAR_1),set_type)
| ~ member(VAR_1,VAR_0)
| ~ ilf_type(VAR_1,set_type)
| ~ relation_like(VAR_0)
| ~ ilf_type(VAR_0,set_type) ) ),
inference(cnf_transformation,[status(thm)],[sk_p23_sk]) ).
cnf(c_33,plain,
( ordered_pair(sK0(A,B),sK1(A,B)) = B
| ~ member(B,A)
| ~ ilf_type(B,set_type)
| ~ relation_like(A)
| ~ ilf_type(A,set_type) ),
inference(split_conjunct,[status(thm)],[sk_p23]) ).
cnf(c_37,plain,
( relation_like(C)
| ~ ilf_type(C,subset_type(cross_product(A,B)))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p24]) ).
cnf(c_43,plain,
( ilf_type(C,binary_relation_type)
| ~ ilf_type(C,set_type)
| ~ ilf_type(C,subset_type(cross_product(A,B)))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_37,c_29]) ).
cnf(c_53,plain,
( ~ ilf_type(A,binary_relation_type)
| ~ ilf_type(A,set_type)
| ordered_pair(sK0(A,B),sK1(A,B)) = B
| ~ member(B,A)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_33,c_30]) ).
cnf(c_54,plain,
( ~ ilf_type(A,binary_relation_type)
| ordered_pair(sK0(A,B),sK1(A,B)) = B
| ~ member(B,A)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(copy,[status(thm)],[c_53]) ).
fof(nnf_28,plain,
? [B] :
( ? [C] :
( ? [D] :
( ? [E] :
( ! [F] :
( ! [G] :
( ~ member(G,C)
| ~ member(F,B)
| ordered_pair(F,G) != D
| ~ ilf_type(G,set_type) )
| ~ ilf_type(F,set_type) )
& member(D,E)
& ilf_type(E,relation_type(B,C)) )
& ilf_type(D,set_type) )
& ilf_type(C,set_type) )
& ilf_type(B,set_type) ),
inference(fof_nnf,[status(thm)],[prove_relset_1_6_neg]) ).
fof(sk_prove_relset_1_6_neg_sk,plain,
( ! [F] :
( ! [G] :
( ~ member(G,sK4)
| ~ member(F,sK3)
| ordered_pair(F,G) != sK2
| ~ ilf_type(G,set_type) )
| ~ ilf_type(F,set_type) )
& member(sK2,sK5)
& ilf_type(sK5,relation_type(sK3,sK4))
& ilf_type(sK2,set_type)
& ilf_type(sK4,set_type)
& ilf_type(sK3,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK2,sK5]),skolemize(B,sK3),skolemize(C,sK4),skolemize(D,sK2),skolemize(E,sK5)],[nnf_28]) ).
fof(sk_prove_relset_1_6_neg,plain,
( ! [VAR_0,VAR_1] :
( ~ member(VAR_1,sK4)
| ~ member(VAR_0,sK3)
| ordered_pair(VAR_0,VAR_1) != sK2
| ~ ilf_type(VAR_1,set_type)
| ~ ilf_type(VAR_0,set_type) )
& member(sK2,sK5)
& ilf_type(sK5,relation_type(sK3,sK4))
& ilf_type(sK2,set_type)
& ilf_type(sK4,set_type)
& ilf_type(sK3,set_type) ),
inference(cnf_transformation,[status(thm)],[sk_prove_relset_1_6_neg_sk]) ).
cnf(c_55,negated_conjecture,
( ~ member(B,sK4)
| ~ member(A,sK3)
| ordered_pair(A,B) != sK2
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_6_neg]) ).
cnf(c_56,negated_conjecture,
member(sK2,sK5),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_6_neg]) ).
cnf(c_57,negated_conjecture,
ilf_type(sK5,relation_type(sK3,sK4)),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_6_neg]) ).
cnf(c_61,plain,
ilf_type(A,set_type),
inference(clausify,[status(thm)],[p27]) ).
cnf(c_71,plain,
( member(A,B)
| ~ ilf_type(A,member_type(B))
| ~ ilf_type(B,set_type)
| empty(B)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p21]) ).
cnf(c_1384,plain,
( member(B,A)
| ~ ilf_type(B,member_type(A))
| ~ ilf_type(A,set_type)
| empty(A) ),
inference(resolve,[status(thm)],[c_61,c_71]) ).
cnf(c_72,plain,
( member(B,A)
| ~ ilf_type(B,member_type(A))
| empty(A) ),
inference(resolve,[status(thm)],[c_61,c_1384]) ).
cnf(c_74,plain,
( ~ empty(power_set(A))
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p20]) ).
cnf(c_75,plain,
~ empty(power_set(A)),
inference(resolve,[status(thm)],[c_61,c_74]) ).
cnf(c_81,plain,
( member(C,B)
| ~ member(C,A)
| ~ ilf_type(C,set_type)
| ~ member(A,power_set(B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p19]) ).
cnf(c_1385,plain,
( member(C,A)
| ~ member(C,B)
| ~ ilf_type(C,set_type)
| ~ member(B,power_set(A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_81]) ).
cnf(c_1386,plain,
( member(C,B)
| ~ member(C,A)
| ~ ilf_type(C,set_type)
| ~ member(A,power_set(B)) ),
inference(resolve,[status(thm)],[c_61,c_1385]) ).
cnf(c_82,plain,
( member(C,B)
| ~ member(C,A)
| ~ member(A,power_set(B)) ),
inference(resolve,[status(thm)],[c_61,c_1386]) ).
cnf(c_105,plain,
( ilf_type(B,member_type(power_set(A)))
| ~ ilf_type(B,subset_type(A))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p14]) ).
cnf(c_1387,plain,
( ilf_type(A,member_type(power_set(B)))
| ~ ilf_type(A,subset_type(B))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_105]) ).
cnf(c_106,plain,
( ilf_type(A,member_type(power_set(B)))
| ~ ilf_type(A,subset_type(B)) ),
inference(resolve,[status(thm)],[c_61,c_1387]) ).
cnf(c_121,plain,
( ilf_type(C,subset_type(cross_product(A,B)))
| ~ ilf_type(C,relation_type(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p5]) ).
cnf(c_1388,plain,
( ilf_type(B,subset_type(cross_product(C,A)))
| ~ ilf_type(B,relation_type(C,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_121]) ).
cnf(c_122,plain,
( ilf_type(A,subset_type(cross_product(B,C)))
| ~ ilf_type(A,relation_type(B,C)) ),
inference(resolve,[status(thm)],[c_61,c_1388]) ).
cnf(c_132,plain,
( member(B,D)
| ~ member(ordered_pair(A,B),cross_product(C,D))
| ~ ilf_type(D,set_type)
| ~ ilf_type(C,set_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p2]) ).
cnf(c_1389,plain,
( member(A,C)
| ~ member(ordered_pair(D,A),cross_product(B,C))
| ~ ilf_type(C,set_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_132]) ).
cnf(c_1390,plain,
( member(D,B)
| ~ member(ordered_pair(C,D),cross_product(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_1389]) ).
cnf(c_1391,plain,
( member(C,A)
| ~ member(ordered_pair(B,C),cross_product(D,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_1390]) ).
cnf(c_133,plain,
( member(B,D)
| ~ member(ordered_pair(A,B),cross_product(C,D)) ),
inference(resolve,[status(thm)],[c_61,c_1391]) ).
cnf(c_134,plain,
( member(A,C)
| ~ member(ordered_pair(A,B),cross_product(C,D))
| ~ ilf_type(D,set_type)
| ~ ilf_type(C,set_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p2]) ).
cnf(c_1392,plain,
( member(D,B)
| ~ member(ordered_pair(D,A),cross_product(B,C))
| ~ ilf_type(C,set_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_134]) ).
cnf(c_1393,plain,
( member(C,A)
| ~ member(ordered_pair(C,D),cross_product(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_1392]) ).
cnf(c_1394,plain,
( member(B,D)
| ~ member(ordered_pair(B,C),cross_product(D,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_1393]) ).
cnf(c_135,plain,
( member(A,C)
| ~ member(ordered_pair(A,B),cross_product(C,D)) ),
inference(resolve,[status(thm)],[c_61,c_1394]) ).
cnf(c_1395,negated_conjecture,
( ~ member(A,sK4)
| ~ member(B,sK3)
| ordered_pair(B,A) != sK2
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_55]) ).
cnf(c_161,negated_conjecture,
( ~ member(B,sK4)
| ~ member(A,sK3)
| ordered_pair(A,B) != sK2 ),
inference(resolve,[status(thm)],[c_61,c_1395]) ).
cnf(c_1396,plain,
( ~ ilf_type(B,binary_relation_type)
| ordered_pair(sK0(B,A),sK1(B,A)) = A
| ~ member(A,B)
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_54]) ).
cnf(c_162,plain,
( ~ ilf_type(B,binary_relation_type)
| ordered_pair(sK0(B,A),sK1(B,A)) = A
| ~ member(A,B) ),
inference(resolve,[status(thm)],[c_61,c_1396]) ).
cnf(c_1397,plain,
( ilf_type(B,binary_relation_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(B,subset_type(cross_product(C,A)))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_61,c_43]) ).
cnf(c_1398,plain,
( ilf_type(A,binary_relation_type)
| ~ ilf_type(A,set_type)
| ~ ilf_type(A,subset_type(cross_product(B,C))) ),
inference(resolve,[status(thm)],[c_61,c_1397]) ).
cnf(c_168,plain,
( ilf_type(A,binary_relation_type)
| ~ ilf_type(A,subset_type(cross_product(B,C))) ),
inference(resolve,[status(thm)],[c_61,c_1398]) ).
cnf(c_183,plain,
( member(sK2,A)
| ~ member(sK5,power_set(A)) ),
inference(resolve,[status(thm)],[c_82,c_56]) ).
cnf(c_215,plain,
ilf_type(sK5,subset_type(cross_product(sK3,sK4))),
inference(resolve,[status(thm)],[c_122,c_57]) ).
cnf(c_247,plain,
( ~ ilf_type(sK5,binary_relation_type)
| ordered_pair(sK0(sK5,sK2),sK1(sK5,sK2)) = sK2 ),
inference(resolve,[status(thm)],[c_162,c_56]) ).
cnf(c_340,plain,
ilf_type(sK5,binary_relation_type),
inference(resolve,[status(thm)],[c_215,c_168]) ).
cnf(c_341,plain,
ilf_type(sK5,member_type(power_set(cross_product(sK3,sK4)))),
inference(resolve,[status(thm)],[c_215,c_106]) ).
cnf(c_342,plain,
ordered_pair(sK0(sK5,sK2),sK1(sK5,sK2)) = sK2,
inference(resolve,[status(thm)],[c_340,c_247]) ).
cnf(c_1399,plain,
( member(sK5,power_set(cross_product(sK3,sK4)))
| empty(power_set(cross_product(sK3,sK4))) ),
inference(resolve,[status(thm)],[c_341,c_72]) ).
cnf(c_409,plain,
member(sK5,power_set(cross_product(sK3,sK4))),
inference(resolve,[status(thm)],[c_75,c_1399]) ).
cnf(c_410,plain,
member(sK2,cross_product(sK3,sK4)),
inference(resolve,[status(thm)],[c_409,c_183]) ).
cnf(c_637,plain,
( member(sK1(sK5,sK2),B)
| ~ member(sK2,cross_product(A,B)) ),
inference(paramod,[status(thm)],[c_342,c_133]) ).
cnf(c_638,plain,
( member(sK0(sK5,sK2),A)
| ~ member(sK2,cross_product(A,B)) ),
inference(paramod,[status(thm)],[c_342,c_135]) ).
cnf(c_1300,plain,
member(sK1(sK5,sK2),sK4),
inference(resolve,[status(thm)],[c_637,c_410]) ).
cnf(c_1400,negated_conjecture,
( ~ member(sK1(sK5,sK2),sK4)
| ~ member(sK0(sK5,sK2),sK3) ),
inference(resolve,[status(thm)],[c_161,c_342]) ).
cnf(c_1318,negated_conjecture,
~ member(sK0(sK5,sK2),sK3),
inference(resolve,[status(thm)],[c_1400,c_1300]) ).
cnf(c_1401,plain,
member(sK0(sK5,sK2),sK3),
inference(resolve,[status(thm)],[c_638,c_410]) ).
cnf(c_1383,plain,
$false,
inference(resolve,[status(thm)],[c_1318,c_1401]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n001.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 08:08:27 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 1329336 was started by sandbox2 on n001,
% 0.17/0.43 % Sat Sep 26 08:08:27 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 1.71/0.72
% 1.71/0.72 % SZS status Theorem for theBenchmark
% 1.71/0.72
% 1.71/0.72 % Proof 1 at 0.18 (+ 0.06) seconds.
% 1.71/0.72 % Length of proof is 52.
% 1.71/0.72 % Level of proof is 10.
% 1.71/0.72 % Maximum clause weight is 21.000.
% 1.71/0.72 % Given clauses 215.
% 1.71/0.72
% 1.71/0.72 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------