%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET682+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 : n012.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:48 AM UTC 2026
% Result : Theorem 0.03s 0.33s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 90 ( 21 unt; 0 def)
% Number of atoms : 300 ( 10 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 351 ( 141 ~; 130 |; 34 &)
% ( 5 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 166 ( 8 sgn 56 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p1,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,binary_relation_type)
=> ( member(B,domain_of(C))
=> ? [D] :
( member(D,range_of(C))
& ilf_type(D,set_type) ) ) ) ),
file('theBenchmark.p',p1) ).
fof(p2,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',p2) ).
fof(p4,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',p4) ).
fof(p6,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( empty(B)
<=> ! [C] :
( ilf_type(C,set_type)
=> ~ member(C,B) ) ) ),
file('theBenchmark.p',p6) ).
fof(p10,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( ilf_type(B,binary_relation_type)
<=> ( ilf_type(B,set_type)
& relation_like(B) ) ) ),
file('theBenchmark.p',p10) ).
fof(p12,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',p12) ).
fof(p14,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',p14) ).
fof(p15,axiom,
! [B] :
( ilf_type(B,set_type)
=> ( ilf_type(power_set(B),set_type)
& ~ empty(power_set(B)) ) ),
file('theBenchmark.p',p15) ).
fof(p18,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',p18) ).
fof(p20,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,relation_type(B,C))
=> domain(B,C,D) = domain_of(D) ) ) ),
file('theBenchmark.p',p20) ).
fof(p22,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,relation_type(B,C))
=> range(B,C,D) = range_of(D) ) ) ),
file('theBenchmark.p',p22) ).
fof(p23,axiom,
! [B] :
( ilf_type(B,set_type)
=> ! [C] :
( ilf_type(C,set_type)
=> ! [D] :
( ilf_type(D,relation_type(B,C))
=> ilf_type(range(B,C,D),subset_type(C)) ) ) ),
file('theBenchmark.p',p23) ).
fof(p24,axiom,
! [B] : ilf_type(B,set_type),
file('theBenchmark.p',p24) ).
fof(prove_relset_1_49,conjecture,
! [B] :
( ( ilf_type(B,set_type)
& ~ empty(B) )
=> ! [C] :
( ( ilf_type(C,set_type)
& ~ empty(C) )
=> ! [D] :
( ilf_type(D,relation_type(B,C))
=> ! [E] :
( ilf_type(E,member_type(B))
=> ( member(E,domain(B,C,D))
=> ? [F] :
( member(F,range(B,C,D))
& ilf_type(F,member_type(C)) ) ) ) ) ) ),
file('theBenchmark.p',prove_relset_1_49) ).
fof(prove_relset_1_49_neg,negated_conjecture,
~ ! [B] :
( ( ilf_type(B,set_type)
& ~ empty(B) )
=> ! [C] :
( ( ilf_type(C,set_type)
& ~ empty(C) )
=> ! [D] :
( ilf_type(D,relation_type(B,C))
=> ! [E] :
( ilf_type(E,member_type(B))
=> ( member(E,domain(B,C,D))
=> ? [F] :
( member(F,range(B,C,D))
& ilf_type(F,member_type(C)) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_49]) ).
cnf(c_26,plain,
( ~ relation_like(A)
| ilf_type(A,binary_relation_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p10]) ).
cnf(c_35,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)],[p18]) ).
cnf(c_36,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_35,c_26]) ).
fof(nnf_25,plain,
? [B] :
( ? [C] :
( ? [D] :
( ? [E] :
( ! [F] :
( ~ member(F,range(B,C,D))
| ~ ilf_type(F,member_type(C)) )
& member(E,domain(B,C,D))
& ilf_type(E,member_type(B)) )
& ilf_type(D,relation_type(B,C)) )
& ilf_type(C,set_type)
& ~ empty(C) )
& ilf_type(B,set_type)
& ~ empty(B) ),
inference(fof_nnf,[status(thm)],[prove_relset_1_49_neg]) ).
fof(sk_prove_relset_1_49_neg,plain,
( ! [F] :
( ~ member(F,range(sK1,sK0,sK2))
| ~ ilf_type(F,member_type(sK0)) )
& member(sK3,domain(sK1,sK0,sK2))
& ilf_type(sK3,member_type(sK1))
& ilf_type(sK2,relation_type(sK1,sK0))
& ilf_type(sK0,set_type)
& ~ empty(sK0)
& ilf_type(sK1,set_type)
& ~ empty(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0,sK2,sK3]),skolemize(B,sK1),skolemize(C,sK0),skolemize(D,sK2),skolemize(E,sK3)],[nnf_25]) ).
cnf(c_52,negated_conjecture,
( ~ member(A,range(sK1,sK0,sK2))
| ~ ilf_type(A,member_type(sK0)) ),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_49_neg]) ).
cnf(c_53,negated_conjecture,
member(sK3,domain(sK1,sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_49_neg]) ).
cnf(c_55,negated_conjecture,
ilf_type(sK2,relation_type(sK1,sK0)),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_49_neg]) ).
cnf(c_57,negated_conjecture,
~ empty(sK0),
inference(split_conjunct,[status(thm)],[sk_prove_relset_1_49_neg]) ).
cnf(c_60,plain,
ilf_type(A,set_type),
inference(clausify,[status(thm)],[p24]) ).
cnf(c_61,plain,
( ilf_type(range(A,B,C),subset_type(B))
| ~ ilf_type(C,relation_type(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p23]) ).
cnf(c_282,plain,
( ilf_type(range(C,A,B),subset_type(A))
| ~ ilf_type(B,relation_type(C,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_60,c_61]) ).
cnf(c_62,plain,
( ilf_type(range(B,C,A),subset_type(C))
| ~ ilf_type(A,relation_type(B,C)) ),
inference(resolve,[status(thm)],[c_60,c_282]) ).
cnf(c_63,plain,
( range(A,B,C) = range_of(C)
| ~ ilf_type(C,relation_type(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p22]) ).
cnf(c_283,plain,
( range(C,A,B) = range_of(B)
| ~ ilf_type(B,relation_type(C,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_60,c_63]) ).
cnf(c_64,plain,
( range(B,C,A) = range_of(A)
| ~ ilf_type(A,relation_type(B,C)) ),
inference(resolve,[status(thm)],[c_60,c_283]) ).
cnf(c_67,plain,
( domain(A,B,C) = domain_of(C)
| ~ ilf_type(C,relation_type(A,B))
| ~ ilf_type(B,set_type)
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p20]) ).
cnf(c_284,plain,
( domain(C,A,B) = domain_of(B)
| ~ ilf_type(B,relation_type(C,A))
| ~ ilf_type(A,set_type) ),
inference(resolve,[status(thm)],[c_60,c_67]) ).
cnf(c_68,plain,
( domain(B,C,A) = domain_of(A)
| ~ ilf_type(A,relation_type(B,C)) ),
inference(resolve,[status(thm)],[c_60,c_284]) ).
cnf(c_71,plain,
( ~ empty(power_set(A))
| ~ ilf_type(A,set_type) ),
inference(clausify,[status(thm)],[p15]) ).
cnf(c_72,plain,
~ empty(power_set(A)),
inference(resolve,[status(thm)],[c_60,c_71]) ).
cnf(c_78,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)],[p14]) ).
cnf(c_285,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_60,c_78]) ).
cnf(c_286,plain,
( member(C,B)
| ~ member(C,A)
| ~ ilf_type(C,set_type)
| ~ member(A,power_set(B)) ),
inference(resolve,[status(thm)],[c_60,c_285]) ).
cnf(c_79,plain,
( member(C,B)
| ~ member(C,A)
| ~ member(A,power_set(B)) ),
inference(resolve,[status(thm)],[c_60,c_286]) ).
cnf(c_84,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)],[p12]) ).
cnf(c_287,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_60,c_84]) ).
cnf(c_85,plain,
( ilf_type(A,member_type(power_set(B)))
| ~ ilf_type(A,subset_type(B)) ),
inference(resolve,[status(thm)],[c_60,c_287]) ).
fof(nnf_6,plain,
! [B] :
( ( ( ? [C] :
( member(C,B)
& ilf_type(C,set_type) )
| empty(B) )
& ( ! [X0] :
( ~ member(X0,B)
| ~ ilf_type(X0,set_type) )
| ~ empty(B) ) )
| ~ ilf_type(B,set_type) ),
inference(fof_nnf,[status(thm)],[p6]) ).
fof(sk_p6_sk,plain,
! [B] :
( ( ( ( member(sK4(B),B)
& ilf_type(sK4(B),set_type) )
| empty(B) )
& ( ! [X0] :
( ~ member(X0,B)
| ~ ilf_type(X0,set_type) )
| ~ empty(B) ) )
| ~ ilf_type(B,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(C,sK4(B))],[nnf_6]) ).
fof(sk_p6,plain,
( ! [VAR_0] :
( member(sK4(VAR_0),VAR_0)
| empty(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0] :
( ilf_type(sK4(VAR_0),set_type)
| empty(VAR_0)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0,VAR_1] :
( ~ member(VAR_1,VAR_0)
| ~ ilf_type(VAR_1,set_type)
| ~ empty(VAR_0)
| ~ ilf_type(VAR_0,set_type) ) ),
inference(cnf_transformation,[status(thm)],[sk_p6_sk]) ).
cnf(c_88,plain,
( member(sK4(A),A)
| empty(A)
| ~ ilf_type(A,set_type) ),
inference(split_conjunct,[status(thm)],[sk_p6]) ).
cnf(c_89,plain,
( member(sK4(A),A)
| empty(A) ),
inference(resolve,[status(thm)],[c_60,c_88]) ).
cnf(c_91,plain,
( ~ member(B,A)
| ~ ilf_type(B,set_type)
| ~ empty(A)
| ~ ilf_type(A,set_type) ),
inference(split_conjunct,[status(thm)],[sk_p6]) ).
cnf(c_288,plain,
( ~ member(B,A)
| ~ ilf_type(B,set_type)
| ~ empty(A) ),
inference(resolve,[status(thm)],[c_60,c_91]) ).
cnf(c_92,plain,
( ~ member(B,A)
| ~ empty(A) ),
inference(resolve,[status(thm)],[c_60,c_288]) ).
cnf(c_95,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)],[p4]) ).
cnf(c_289,plain,
( ~ member(B,A)
| ilf_type(B,member_type(A))
| ~ ilf_type(A,set_type)
| empty(A) ),
inference(resolve,[status(thm)],[c_60,c_95]) ).
cnf(c_96,plain,
( ~ member(B,A)
| ilf_type(B,member_type(A))
| empty(A) ),
inference(resolve,[status(thm)],[c_60,c_289]) ).
cnf(c_97,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)],[p4]) ).
cnf(c_290,plain,
( member(B,A)
| ~ ilf_type(B,member_type(A))
| ~ ilf_type(A,set_type)
| empty(A) ),
inference(resolve,[status(thm)],[c_60,c_97]) ).
cnf(c_98,plain,
( member(B,A)
| ~ ilf_type(B,member_type(A))
| empty(A) ),
inference(resolve,[status(thm)],[c_60,c_290]) ).
cnf(c_101,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)],[p2]) ).
cnf(c_291,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_60,c_101]) ).
cnf(c_102,plain,
( ilf_type(A,subset_type(cross_product(B,C)))
| ~ ilf_type(A,relation_type(B,C)) ),
inference(resolve,[status(thm)],[c_60,c_291]) ).
fof(nnf_1,plain,
! [B] :
( ! [C] :
( ? [D] :
( member(D,range_of(C))
& ilf_type(D,set_type) )
| ~ member(B,domain_of(C))
| ~ ilf_type(C,binary_relation_type) )
| ~ ilf_type(B,set_type) ),
inference(fof_nnf,[status(thm)],[p1]) ).
fof(sk_p1_sk,plain,
! [B] :
( ! [C] :
( ( member(sK5(B,C),range_of(C))
& ilf_type(sK5(B,C),set_type) )
| ~ member(B,domain_of(C))
| ~ ilf_type(C,binary_relation_type) )
| ~ ilf_type(B,set_type) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(D,sK5(B,C))],[nnf_1]) ).
fof(sk_p1,plain,
( ! [VAR_0,VAR_1] :
( member(sK5(VAR_0,VAR_1),range_of(VAR_1))
| ~ member(VAR_0,domain_of(VAR_1))
| ~ ilf_type(VAR_1,binary_relation_type)
| ~ ilf_type(VAR_0,set_type) )
& ! [VAR_0,VAR_1] :
( ilf_type(sK5(VAR_0,VAR_1),set_type)
| ~ member(VAR_0,domain_of(VAR_1))
| ~ ilf_type(VAR_1,binary_relation_type)
| ~ ilf_type(VAR_0,set_type) ) ),
inference(cnf_transformation,[status(thm)],[sk_p1_sk]) ).
cnf(c_105,plain,
( member(sK5(A,B),range_of(B))
| ~ member(A,domain_of(B))
| ~ ilf_type(B,binary_relation_type)
| ~ ilf_type(A,set_type) ),
inference(split_conjunct,[status(thm)],[sk_p1]) ).
cnf(c_106,plain,
( member(sK5(B,A),range_of(A))
| ~ member(B,domain_of(A))
| ~ ilf_type(A,binary_relation_type) ),
inference(resolve,[status(thm)],[c_60,c_105]) ).
cnf(c_292,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_60,c_36]) ).
cnf(c_293,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_60,c_292]) ).
cnf(c_135,plain,
( ilf_type(A,binary_relation_type)
| ~ ilf_type(A,subset_type(cross_product(B,C))) ),
inference(resolve,[status(thm)],[c_60,c_293]) ).
cnf(c_137,plain,
ilf_type(range(sK1,sK0,sK2),subset_type(sK0)),
inference(resolve,[status(thm)],[c_62,c_55]) ).
cnf(c_138,plain,
range(sK1,sK0,sK2) = range_of(sK2),
inference(resolve,[status(thm)],[c_64,c_55]) ).
cnf(c_139,plain,
ilf_type(range_of(sK2),subset_type(sK0)),
inference(paramod,[status(thm)],[c_138,c_137]) ).
cnf(c_140,negated_conjecture,
( ~ member(A,range_of(sK2))
| ~ ilf_type(A,member_type(sK0)) ),
inference(paramod,[status(thm)],[c_138,c_52]) ).
cnf(c_142,plain,
domain(sK1,sK0,sK2) = domain_of(sK2),
inference(resolve,[status(thm)],[c_68,c_55]) ).
cnf(c_144,negated_conjecture,
member(sK3,domain_of(sK2)),
inference(paramod,[status(thm)],[c_142,c_53]) ).
cnf(c_150,plain,
( member(sK4(A),B)
| ~ member(A,power_set(B))
| empty(A) ),
inference(resolve,[status(thm)],[c_89,c_79]) ).
cnf(c_163,plain,
ilf_type(sK2,subset_type(cross_product(sK1,sK0))),
inference(resolve,[status(thm)],[c_102,c_55]) ).
cnf(c_181,plain,
( empty(range_of(sK2))
| ~ ilf_type(sK4(range_of(sK2)),member_type(sK0)) ),
inference(resolve,[status(thm)],[c_140,c_89]) ).
cnf(c_192,plain,
( member(sK5(sK3,sK2),range_of(sK2))
| ~ ilf_type(sK2,binary_relation_type) ),
inference(resolve,[status(thm)],[c_144,c_106]) ).
cnf(c_203,plain,
ilf_type(range_of(sK2),member_type(power_set(sK0))),
inference(resolve,[status(thm)],[c_139,c_85]) ).
cnf(c_234,plain,
ilf_type(sK2,binary_relation_type),
inference(resolve,[status(thm)],[c_163,c_135]) ).
cnf(c_236,plain,
member(sK5(sK3,sK2),range_of(sK2)),
inference(resolve,[status(thm)],[c_234,c_192]) ).
cnf(c_294,plain,
( member(range_of(sK2),power_set(sK0))
| empty(power_set(sK0)) ),
inference(resolve,[status(thm)],[c_203,c_98]) ).
cnf(c_237,plain,
member(range_of(sK2),power_set(sK0)),
inference(resolve,[status(thm)],[c_72,c_294]) ).
cnf(c_246,plain,
( member(sK4(range_of(sK2)),sK0)
| empty(range_of(sK2)) ),
inference(resolve,[status(thm)],[c_150,c_237]) ).
cnf(c_271,plain,
~ empty(range_of(sK2)),
inference(resolve,[status(thm)],[c_236,c_92]) ).
cnf(c_274,plain,
member(sK4(range_of(sK2)),sK0),
inference(resolve,[status(thm)],[c_271,c_246]) ).
cnf(c_276,plain,
~ ilf_type(sK4(range_of(sK2)),member_type(sK0)),
inference(resolve,[status(thm)],[c_271,c_181]) ).
cnf(c_295,plain,
( ilf_type(sK4(range_of(sK2)),member_type(sK0))
| empty(sK0) ),
inference(resolve,[status(thm)],[c_274,c_96]) ).
cnf(c_296,negated_conjecture,
ilf_type(sK4(range_of(sK2)),member_type(sK0)),
inference(resolve,[status(thm)],[c_57,c_295]) ).
cnf(c_281,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_276,c_296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET682+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sat Sep 26 08:04:51 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.03/0.30 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.30 % Process 88041 was started by sandbox2 on n012,
% 0.03/0.30 % Sat Sep 26 08:04:51 2026
% 0.03/0.30 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.03/0.30
% 0.03/0.30 % From the command line: assign(max_seconds, 300).
% 0.03/0.33
% 0.03/0.33 % SZS status Theorem for theBenchmark
% 0.03/0.33
% 0.03/0.33 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.03/0.33 % Length of proof is 66.
% 0.03/0.33 % Level of proof is 9.
% 0.03/0.33 % Maximum clause weight is 18.000.
% 0.03/0.33 % Given clauses 69.
% 0.03/0.33
% 0.03/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------