%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU108+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.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:55:26 PM UTC 2026
% Result : Theorem 15.70s 3.30s
% Output : CNFRefutation 15.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 80 ( 14 unt; 1 def)
% Number of atoms : 306 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 246 ( 103 ~; 113 |; 20 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 138 ( 0 sgn 133 !; 5 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> element(subset_union2(X0,X1,X2),powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k4_subset_1) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> element(subset_difference(X0,X1,X2),powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_subset_1) ).
fof(f12,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f28,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_union2(X0,X1,X2) = set_union2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_subset_1) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(f31,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X2,X0)
& in(X1,X0) )
=> ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f33,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(f34,conjecture,
! [X0] : preboolean(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_finsub_1) ).
fof(f35,negated_conjecture,
~ ! [X0] : preboolean(powerset(X0)),
inference(negated_conjecture,[status(cth)],[f34]) ).
fof(f36,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f64,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_union2(X0,X1,X2),powerset(X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_union2(X0,X1,X2),powerset(X0)) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(flattening,[],[f66]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_union2(X0,X1,X2) = set_union2(X1,X2) ),
inference(ennf_transformation,[],[f28]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_union2(X0,X1,X2) = set_union2(X1,X2) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f83,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) ),
inference(flattening,[],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f85,plain,
? [X0] : ~ preboolean(powerset(X0)),
inference(ennf_transformation,[],[f35]) ).
fof(f86,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f87,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(flattening,[],[f86]) ).
fof(f105,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X1,X2] :
( ~ in(X2,X0)
| ~ in(X1,X0)
| ( in(set_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) )
& ( ? [X1,X2] :
( in(X2,X0)
& in(X1,X0)
& ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) ) )
| preboolean(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f106,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X3,X4] :
( ~ in(X4,X0)
| ~ in(X3,X0)
| ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) ) ) )
& ( ? [X1,X2] :
( in(X2,X0)
& in(X1,X0)
& ( ~ in(set_difference(X1,X2),X0)
| ~ in(set_union2(X1,X2),X0) ) )
| preboolean(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ~ preboolean(X0)
| ! [X3,X4] :
( ~ in(X4,X0)
| ~ in(X3,X0)
| ( in(set_difference(X3,X4),X0)
& in(set_union2(X3,X4),X0) ) ) )
& ( ( in(sK11(X0),X0)
& in(sK10(X0),X0)
& ( ~ in(set_difference(sK10(X0),sK11(X0)),X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0) ) )
| preboolean(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0))],[f106]) ).
fof(f108,plain,
~ preboolean(powerset(sK12)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f85]) ).
fof(f117,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_union2(X0,X1,X2),powerset(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(cnf_transformation,[],[f67]) ).
fof(f121,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f149,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_union2(X0,X1,X2) = set_union2(X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f154,plain,
! [X0] :
( in(sK11(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f155,plain,
! [X0] :
( in(sK10(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f156,plain,
! [X0] :
( ~ in(set_difference(sK10(X0),sK11(X0)),X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f158,plain,
! [X0,X1] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f159,plain,
~ preboolean(powerset(sK12)),
inference(cnf_transformation,[],[f108]) ).
fof(f160,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( element(subset_union2(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( element(subset_difference(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_61,plain,
! [X0: $i] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f121]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( subset_union2(X1,X0,X2) = set_union2(X0,X2) )
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( subset_difference(X1,X0,X2) = set_difference(X0,X2) )
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_92,plain,
! [X0: $i] :
( preboolean(X0)
| ~ in(set_difference(sK10(X0),sK11(X0)),X0)
| ~ in(set_union2(sK10(X0),sK11(X0)),X0) ),
inference(cnf_transformation,[],[f156]) ).
tcf(c_93,plain,
! [X0: $i] :
( preboolean(X0)
| in(sK10(X0),X0) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_94,plain,
! [X0: $i] :
( preboolean(X0)
| in(sK11(X0),X0) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
tcf(c_99,negated_conjecture,
~ preboolean(powerset(sK12)),
inference(cnf_transformation,[],[f159]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f160]) ).
tcf(c_1242,definition,
iPr_def_10 = powerset(sK12),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1243,negated_conjecture,
~ preboolean(iPr_def_10),
inference(demodulation,[status(thm)],[c_99,c_1242]) ).
tcf(c_2113,plain,
( preboolean(iPr_def_10)
| in(sK10(iPr_def_10),iPr_def_10) ),
inference(instantiation,[status(thm)],[c_93]) ).
tcf(c_2123,plain,
( preboolean(iPr_def_10)
| in(sK11(iPr_def_10),iPr_def_10) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_2167,plain,
( preboolean(iPr_def_10)
| ~ in(set_difference(sK10(iPr_def_10),sK11(iPr_def_10)),iPr_def_10)
| ~ in(set_union2(sK10(iPr_def_10),sK11(iPr_def_10)),iPr_def_10) ),
inference(instantiation,[status(thm)],[c_92]) ).
tcf(c_2695,plain,
( element(sK10(iPr_def_10),iPr_def_10)
| ~ in(sK10(iPr_def_10),iPr_def_10) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_2752,plain,
( element(sK11(iPr_def_10),iPr_def_10)
| ~ in(sK11(iPr_def_10),iPr_def_10) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_20831,plain,
! [X0: $i] :
( preboolean(X0)
| element(sK10(X0),X0) ),
inference(superposition,[status(thm)],[c_93,c_98]) ).
tcf(c_20832,plain,
! [X0: $i] :
( preboolean(X0)
| element(sK11(X0),X0) ),
inference(superposition,[status(thm)],[c_94,c_98]) ).
tcf(c_21164,plain,
! [X0: $i,X1: $i,X2: $i] :
( empty(powerset(X1))
| in(subset_union2(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(superposition,[status(thm)],[c_57,c_100]) ).
tcf(c_21169,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(subset_union2(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_21164,c_61]) ).
tcf(c_21190,plain,
! [X0: $i,X1: $i,X2: $i] :
( empty(powerset(X1))
| in(subset_difference(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(superposition,[status(thm)],[c_58,c_100]) ).
tcf(c_21195,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(subset_difference(X1,X0,X2),powerset(X1))
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_21190,c_61]) ).
tcf(c_21438,plain,
! [X0: $i,X1: $i] :
( ( subset_union2(sK12,X1,X0) = set_union2(X1,X0) )
| ~ element(X1,iPr_def_10)
| ~ element(X0,powerset(sK12)) ),
inference(superposition,[status(thm)],[c_1242,c_89]) ).
tcf(c_21444,plain,
! [X0: $i,X1: $i] :
( ( subset_union2(sK12,X1,X0) = set_union2(X1,X0) )
| ~ element(X1,iPr_def_10)
| ~ element(X0,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_21438,c_1242]) ).
tcf(c_21489,plain,
! [X0: $i,X1: $i] :
( ( subset_difference(sK12,X1,X0) = set_difference(X1,X0) )
| ~ element(X1,iPr_def_10)
| ~ element(X0,powerset(sK12)) ),
inference(superposition,[status(thm)],[c_1242,c_90]) ).
tcf(c_21495,plain,
! [X0: $i,X1: $i] :
( ( subset_difference(sK12,X1,X0) = set_difference(X1,X0) )
| ~ element(X1,iPr_def_10)
| ~ element(X0,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_21489,c_1242]) ).
tcf(c_35254,plain,
! [X0: $i] :
( preboolean(iPr_def_10)
| ( subset_union2(sK12,X0,sK11(iPr_def_10)) = set_union2(X0,sK11(iPr_def_10)) )
| ~ element(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_20832,c_21444]) ).
tcf(c_35282,plain,
! [X0: $i] :
( ( subset_union2(sK12,X0,sK11(iPr_def_10)) = set_union2(X0,sK11(iPr_def_10)) )
| ~ element(X0,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_35254,c_1243]) ).
tcf(c_36867,plain,
! [X0: $i] :
( preboolean(iPr_def_10)
| ( subset_difference(sK12,X0,sK11(iPr_def_10)) = set_difference(X0,sK11(iPr_def_10)) )
| ~ element(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_20832,c_21495]) ).
tcf(c_36895,plain,
! [X0: $i] :
( ( subset_difference(sK12,X0,sK11(iPr_def_10)) = set_difference(X0,sK11(iPr_def_10)) )
| ~ element(X0,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_36867,c_1243]) ).
tcf(c_38322,plain,
( preboolean(iPr_def_10)
| ( subset_union2(sK12,sK10(iPr_def_10),sK11(iPr_def_10)) = set_union2(sK10(iPr_def_10),sK11(iPr_def_10)) ) ),
inference(superposition,[status(thm)],[c_20831,c_35282]) ).
tcf(c_38345,plain,
subset_union2(sK12,sK10(iPr_def_10),sK11(iPr_def_10)) = set_union2(sK10(iPr_def_10),sK11(iPr_def_10)),
inference(forward_subsumption_resolution,[status(thm)],[c_38322,c_1243]) ).
tcf(c_38446,plain,
( in(set_union2(sK10(iPr_def_10),sK11(iPr_def_10)),powerset(sK12))
| ~ element(sK11(iPr_def_10),powerset(sK12))
| ~ element(sK10(iPr_def_10),powerset(sK12)) ),
inference(superposition,[status(thm)],[c_38345,c_21169]) ).
tcf(c_38454,plain,
( in(set_union2(sK10(iPr_def_10),sK11(iPr_def_10)),iPr_def_10)
| ~ element(sK11(iPr_def_10),iPr_def_10)
| ~ element(sK10(iPr_def_10),iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_38446,c_1242]) ).
tcf(c_39522,plain,
( preboolean(iPr_def_10)
| ( subset_difference(sK12,sK10(iPr_def_10),sK11(iPr_def_10)) = set_difference(sK10(iPr_def_10),sK11(iPr_def_10)) ) ),
inference(superposition,[status(thm)],[c_20831,c_36895]) ).
tcf(c_39545,plain,
subset_difference(sK12,sK10(iPr_def_10),sK11(iPr_def_10)) = set_difference(sK10(iPr_def_10),sK11(iPr_def_10)),
inference(forward_subsumption_resolution,[status(thm)],[c_39522,c_1243]) ).
tcf(c_42829,plain,
( in(set_difference(sK10(iPr_def_10),sK11(iPr_def_10)),powerset(sK12))
| ~ element(sK11(iPr_def_10),powerset(sK12))
| ~ element(sK10(iPr_def_10),powerset(sK12)) ),
inference(superposition,[status(thm)],[c_39545,c_21195]) ).
tcf(c_42837,plain,
( in(set_difference(sK10(iPr_def_10),sK11(iPr_def_10)),iPr_def_10)
| ~ element(sK11(iPr_def_10),iPr_def_10)
| ~ element(sK10(iPr_def_10),iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_42829,c_1242]) ).
tcf(c_42846,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_42837,c_38454,c_2752,c_2695,c_2167,c_2123,c_2113,c_1243]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU108+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 12:46:19 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 15.70/3.30 % SZS status Started for theBenchmark.p
% 15.70/3.30 % SZS status Theorem for theBenchmark.p
% 15.70/3.30
% 15.70/3.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 15.70/3.30
% 15.70/3.30 % ------ iProver source info
% 15.70/3.30
% 15.70/3.30 % git: date: 2026-07-19 20:42:38 +0200
% 15.70/3.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 15.70/3.30 % git: non_committed_changes: false
% 15.70/3.30
% 15.70/3.30 % ------ Parsing...
% 15.70/3.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 15.70/3.30
% 15.70/3.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 10 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 15.70/3.30
% 15.70/3.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 15.70/3.30
% 15.70/3.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 15.70/3.30 % ------ Proving...
% 15.70/3.30 % ------ Problem Properties
% 15.70/3.30
% 15.70/3.30 %
% 15.70/3.30 % clauses 47
% 15.70/3.30 % conjectures 1
% 15.70/3.30 % EPR 13
% 15.70/3.30 % Horn 41
% 15.70/3.30 % unary 20
% 15.70/3.30 % binary 14
% 15.70/3.30 % lits 89
% 15.70/3.30 % lits eq 12
% 15.70/3.30 % fd_pure 0
% 15.70/3.30 % fd_pseudo 0
% 15.70/3.30 % fd_cond 1
% 15.70/3.30 % fd_pseudo_cond 1
% 15.70/3.30 % AC symbols 0
% 15.70/3.30
% 15.70/3.30 % ------ Schedule dynamic 5 is on
% 15.70/3.30
% 15.70/3.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 15.70/3.30
% 15.70/3.30
% 15.70/3.30 % ------
% 15.70/3.30 % Current options:
% 15.70/3.30 % ------
% 15.70/3.30
% 15.70/3.30
% 15.70/3.30 %
% 15.70/3.30
% 15.70/3.30 % ------ Proving...
% 15.70/3.30 %
% 15.70/3.30
% 15.70/3.30 % SZS status Theorem for theBenchmark.p
% 15.70/3.30
% 15.70/3.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 15.70/3.30
% 15.70/3.30
%------------------------------------------------------------------------------