%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET611+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 02:47:33 PM UTC 2026
% Result : Theorem 3.13s 0.98s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 103 ( 22 unt; 2 def)
% Number of atoms : 342 ( 76 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 264 ( 112 ~; 120 |; 23 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 160 ( 0 sgn 154 !; 6 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f11,conjecture,
! [X0,X1] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th84) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1] :
( intersection(X0,X1) = empty_set
<~> difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ~ member(X2,intersection(X0,X1))
| ( member(X2,X1)
& member(X2,X0) ) )
& ( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( ~ member(X2,difference(X0,X1))
| ( ~ member(X2,X1)
& member(X2,X0) ) )
& ( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( ~ member(X2,difference(X0,X1))
| ( ~ member(X2,X1)
& member(X2,X0) ) )
& ( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f22]) ).
fof(f27,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK2(X0,X1),X0)
& ~ member(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f28]) ).
fof(f30,plain,
? [X0,X1] :
( ( intersection(X0,X1) = empty_set
| difference(X0,X1) = X0 )
& ( intersection(X0,X1) != empty_set
| difference(X0,X1) != X0 ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f31,plain,
( ( empty_set = intersection(sK3,sK4)
| sK3 = difference(sK3,sK4) )
& ( empty_set != intersection(sK3,sK4)
| sK3 != difference(sK3,sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f30]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f50,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
( empty_set = intersection(sK3,sK4)
| sK3 = difference(sK3,sK4) ),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
( empty_set != intersection(sK3,sK4)
| sK3 != difference(sK3,sK4) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,difference(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ member(X0,X2)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_57,plain,
! [X0: $i] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f40]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f44]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subset(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_68,negated_conjecture,
( ( difference(sK3,sK4) != sK3 )
| ( intersection(sK3,sK4) != empty_set ) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_69,negated_conjecture,
( ( difference(sK3,sK4) = sK3 )
| ( intersection(sK3,sK4) = empty_set ) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_542,definition,
iPr_def_10 = intersection(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_543,definition,
iPr_def_11 = difference(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_544,negated_conjecture,
( ( iPr_def_11 = sK3 )
| ( iPr_def_10 = empty_set ) ),
inference(demodulation,[status(thm)],[c_69,c_543,c_542]) ).
tcf(c_545,negated_conjecture,
( ( iPr_def_11 != sK3 )
| ( iPr_def_10 != empty_set ) ),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_546,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_548,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_549,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X0,X2)
| ~ member(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_941,plain,
! [X0: $i] :
( ( sK3 = iPr_def_11 )
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_544,c_57]) ).
tcf(c_957,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,sK4)
| ~ member(X0,sK3) ),
inference(superposition,[status(thm)],[c_542,c_51]) ).
tcf(c_969,plain,
! [X0: $i] : subset(empty_set,X0),
inference(superposition,[status(thm)],[c_65,c_57]) ).
tcf(c_970,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ( sK3 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_65,c_941]) ).
tcf(c_980,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(intersection(X0,X1),X2)
| member(sK2(intersection(X0,X1),X2),X0) ),
inference(superposition,[status(thm)],[c_65,c_52]) ).
tcf(c_983,plain,
! [X0: $i] :
( member(X0,sK3)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_542,c_52]) ).
tcf(c_998,plain,
! [X0: $i] :
( member(X0,sK4)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_542,c_53]) ).
tcf(c_1009,plain,
! [X0: $i] :
( member(X0,sK3)
| ~ member(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_543,c_55]) ).
tcf(c_1025,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK2(iPr_def_10,X0),sK3) ),
inference(superposition,[status(thm)],[c_65,c_983]) ).
tcf(c_1033,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK2(iPr_def_10,X0),sK4) ),
inference(superposition,[status(thm)],[c_65,c_998]) ).
tcf(c_1041,plain,
! [X0: $i] :
( subset(iPr_def_11,X0)
| member(sK2(iPr_def_11,X0),sK3) ),
inference(superposition,[status(thm)],[c_65,c_1009]) ).
tcf(c_1065,plain,
subset(iPr_def_11,sK3),
inference(superposition,[status(thm)],[c_1041,c_64]) ).
tcf(c_1076,plain,
! [X0: $i] :
( member(X0,iPr_def_11)
| member(X0,sK4)
| ~ member(X0,sK3) ),
inference(superposition,[status(thm)],[c_543,c_54]) ).
tcf(c_1092,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_11)
| ~ member(X0,sK4) ),
inference(superposition,[status(thm)],[c_543,c_56]) ).
tcf(c_1108,plain,
! [X0: $i,X1: $i] :
( subset(iPr_def_10,X1)
| member(sK2(iPr_def_10,X1),X0)
| ~ subset(sK3,X0) ),
inference(superposition,[status(thm)],[c_1025,c_66]) ).
tcf(c_1132,plain,
! [X0: $i] :
( ( iPr_def_11 = sK3 )
| ( iPr_def_11 != X0 )
| ( sK3 != X0 ) ),
inference(instantiation,[status(thm)],[c_548]) ).
tcf(c_1142,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ~ subset(X0,empty_set) ),
inference(superposition,[status(thm)],[c_969,c_58]) ).
tcf(c_1143,plain,
! [X0: $i] :
( ( sK3 = iPr_def_11 )
| ( X0 = iPr_def_10 )
| ~ subset(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_970,c_58]) ).
tcf(c_1145,plain,
( ( sK3 = iPr_def_11 )
| ~ subset(sK3,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1065,c_58]) ).
tcf(c_1294,plain,
( subset(sK3,iPr_def_11)
| member(sK2(sK3,iPr_def_11),sK3) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_1295,plain,
( subset(sK3,iPr_def_11)
| ~ member(sK2(sK3,iPr_def_11),iPr_def_11) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_1311,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ member(sK2(iPr_def_10,X0),iPr_def_11) ),
inference(superposition,[status(thm)],[c_1033,c_1092]) ).
tcf(c_1332,plain,
! [X0: $i] :
( ( sK3 = iPr_def_11 )
| ( X0 = empty_set )
| ~ subset(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_544,c_1142]) ).
tcf(c_1783,plain,
( ( iPr_def_11 = sK3 )
| ( iPr_def_11 != iPr_def_11 )
| ( sK3 != iPr_def_11 ) ),
inference(instantiation,[status(thm)],[c_1132]) ).
tcf(c_1784,plain,
iPr_def_11 = iPr_def_11,
inference(instantiation,[status(thm)],[c_546]) ).
tcf(c_1904,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| ~ member(sK2(sK3,iPr_def_11),sK3)
| ( X1 != sK3 )
| ( X0 != sK2(sK3,iPr_def_11) ) ),
inference(instantiation,[status(thm)],[c_549]) ).
tcf(c_2527,plain,
! [X0: $i,X1: $i] : subset(intersection(X0,X1),X0),
inference(superposition,[status(thm)],[c_980,c_64]) ).
tcf(c_2697,plain,
! [X0: $i,X1: $i] : subset(intersection(X0,X1),X1),
inference(superposition,[status(thm)],[c_61,c_2527]) ).
tcf(c_2702,plain,
! [X0: $i] :
( ( sK3 = iPr_def_11 )
| ( intersection(iPr_def_10,X0) = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2527,c_1143]) ).
tcf(c_2738,plain,
! [X0: $i] :
( ( sK3 = iPr_def_11 )
| ( intersection(X0,iPr_def_10) = empty_set ) ),
inference(superposition,[status(thm)],[c_2697,c_1332]) ).
tcf(c_2821,plain,
! [X0: $i,X1: $i] :
( subset(intersection(X1,iPr_def_10),X0)
| member(sK2(empty_set,X0),X1)
| ( sK3 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_2738,c_980]) ).
tcf(c_3828,plain,
sK2(sK3,iPr_def_11) = sK2(sK3,iPr_def_11),
inference(instantiation,[status(thm)],[c_546]) ).
tcf(c_5010,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK2(empty_set,X0),iPr_def_10)
| ( sK3 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_2702,c_2821]) ).
tcf(c_5038,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ subset(sK3,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1108,c_1311]) ).
tcf(c_7238,plain,
! [X0: $i] :
( member(sK2(X0,iPr_def_11),iPr_def_11)
| ~ member(sK2(sK3,iPr_def_11),sK3)
| ( iPr_def_11 != sK3 )
| ( sK2(X0,iPr_def_11) != sK2(sK3,iPr_def_11) ) ),
inference(instantiation,[status(thm)],[c_1904]) ).
tcf(c_7239,plain,
( member(sK2(sK3,iPr_def_11),iPr_def_11)
| ~ member(sK2(sK3,iPr_def_11),sK3)
| ( iPr_def_11 != sK3 )
| ( sK2(sK3,iPr_def_11) != sK2(sK3,iPr_def_11) ) ),
inference(instantiation,[status(thm)],[c_7238]) ).
tcf(c_8511,plain,
! [X0: $i] : subset(iPr_def_10,X0),
inference(global_subsumption_just,[status(thm)],[c_5010,c_970,c_1295,c_1294,c_1783,c_1784,c_3828,c_5038,c_7239]) ).
tcf(c_8519,plain,
empty_set = iPr_def_10,
inference(superposition,[status(thm)],[c_8511,c_1142]) ).
tcf(c_8560,plain,
( ( iPr_def_10 != iPr_def_10 )
| ( sK3 != iPr_def_11 ) ),
inference(demodulation,[status(thm)],[c_545,c_8519]) ).
tcf(c_8562,plain,
sK3 != iPr_def_11,
inference(equality_resolution_simp,[status(thm)],[c_8560]) ).
tcf(c_8633,plain,
~ subset(sK3,iPr_def_11),
inference(backward_subsumption_resolution,[status(thm)],[c_1145,c_8562]) ).
tcf(c_8634,plain,
! [X0: $i] : ~ member(X0,iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_941,c_8562]) ).
tcf(c_8731,plain,
! [X0: $i] :
( ~ member(X0,sK4)
| ~ member(X0,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_957,c_8634]) ).
tcf(c_8990,plain,
! [X0: $i] :
( member(X0,iPr_def_11)
| ~ member(X0,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1076,c_8731]) ).
tcf(c_9043,plain,
! [X0: $i] :
( subset(sK3,X0)
| member(sK2(sK3,X0),iPr_def_11) ),
inference(superposition,[status(thm)],[c_65,c_8990]) ).
tcf(c_9086,plain,
subset(sK3,iPr_def_11),
inference(superposition,[status(thm)],[c_9043,c_64]) ).
tcf(c_9088,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9086,c_8633]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET611+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Thu Sep 24 11:27:05 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.33
% 0.06/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.06/0.33
% 0.06/0.33 % Detected problem language: tptp
% 0.06/0.34 % Proving...
% 3.13/0.98 % SZS status Started for theBenchmark.p
% 3.13/0.98 % SZS status Theorem for theBenchmark.p
% 3.13/0.98
% 3.13/0.98 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.13/0.98
% 3.13/0.98 % ------ iProver source info
% 3.13/0.98
% 3.13/0.98 % git: date: 2026-07-19 20:42:38 +0200
% 3.13/0.98 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.13/0.98 % git: non_committed_changes: false
% 3.13/0.98
% 3.13/0.98 % ------ Parsing...
% 3.13/0.98 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.13/0.98
% 3.13/0.98 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.13/0.98
% 3.13/0.98 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.13/0.98
% 3.13/0.98 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.13/0.98 % ------ Proving...
% 3.13/0.98 % ------ Problem Properties
% 3.13/0.98
% 3.13/0.98 %
% 3.13/0.98 % clauses 21
% 3.13/0.98 % conjectures 2
% 3.13/0.98 % EPR 6
% 3.13/0.98 % Horn 16
% 3.13/0.98 % unary 5
% 3.13/0.98 % binary 8
% 3.13/0.98 % lits 45
% 3.13/0.98 % lits eq 12
% 3.13/0.98 % fd_pure 0
% 3.13/0.98 % fd_pseudo 0
% 3.13/0.98 % fd_cond 0
% 3.13/0.98 % fd_pseudo_cond 5
% 3.13/0.98 % AC symbols 0
% 3.13/0.98
% 3.13/0.98 % ------ Schedule dynamic 5 is on
% 3.13/0.98
% 3.13/0.98 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.13/0.98
% 3.13/0.98
% 3.13/0.98 % ------
% 3.13/0.98 % Current options:
% 3.13/0.98 % ------
% 3.13/0.98
% 3.13/0.98
% 3.13/0.98 %
% 3.13/0.98
% 3.13/0.98 % ------ Proving...
% 3.13/0.98 %
% 3.13/0.98
% 3.13/0.98 % SZS status Theorem for theBenchmark.p
% 3.13/0.98
% 3.13/0.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.13/0.98
% 3.13/0.98
%------------------------------------------------------------------------------