%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU309+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 02:56:35 PM UTC 2026
% Result : Theorem 9.65s 2.26s
% Output : CNFRefutation 9.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 86 ( 34 unt; 4 def)
% Number of atoms : 242 ( 64 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 157 ( 72 ~; 64 |; 8 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 119 ( 1 sgn 117 !; 2 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_intersection2(X0,X1,X2) = subset_intersection2(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k5_subset_1) ).
fof(f19,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f26,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(f54,axiom,
! [X0,X1,X2] :
( ( element(X2,powerset(X0))
& element(X1,powerset(X0)) )
=> subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(f55,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(f56,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f57,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc) ).
fof(f59,conjecture,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_pre_topc) ).
fof(f60,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1)) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f59]) ).
fof(f64,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f65,axiom,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f73,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f56]) ).
fof(f74,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = subset_intersection2(X0,X2,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = subset_intersection2(X0,X2,X1) ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(ennf_transformation,[],[f26]) ).
fof(f108,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(flattening,[],[f107]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
inference(ennf_transformation,[],[f54]) ).
fof(f128,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
inference(flattening,[],[f127]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(ennf_transformation,[],[f55]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( ~ element(X1,powerset(the_carrier(X0)))
| subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ) ),
inference(ennf_transformation,[],[f57]) ).
fof(f133,plain,
? [X0] :
( one_sorted_str(X0)
& ? [X1] :
( element(X1,powerset(the_carrier(X0)))
& subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1)) != X1 ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f136,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(ennf_transformation,[],[f74]) ).
fof(f148,plain,
( one_sorted_str(sK5)
& element(sK6,powerset(the_carrier(sK5)))
& sK6 != subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f133]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = subset_intersection2(X0,X2,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f176,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| element(subset_difference(X0,X1,X2),powerset(X0)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_intersection2(X1,X2) ),
inference(cnf_transformation,[],[f128]) ).
fof(f247,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f130]) ).
fof(f248,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f73]) ).
fof(f249,plain,
! [X0,X1] :
( ~ one_sorted_str(X0)
| ~ element(X1,powerset(the_carrier(X0)))
| subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 ),
inference(cnf_transformation,[],[f131]) ).
fof(f251,plain,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f148]) ).
fof(f252,plain,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f148]) ).
fof(f253,plain,
sK6 != subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),sK6)),
inference(cnf_transformation,[],[f148]) ).
fof(f257,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f258,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f65]) ).
fof(f297,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_intersection2(X0,X1,X2) = set_difference(X1,set_difference(X1,X2)) ),
inference(definition_unfolding,[],[f246,f258]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( subset_intersection2(X1,X0,X2) = subset_intersection2(X1,X2,X0) )
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_76,plain,
! [X0: $i] :
( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_79,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,[],[f179]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( set_difference(X0,set_difference(X0,X2)) = subset_intersection2(X1,X0,X2) )
| ~ element(X2,powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f297]) ).
tcf(c_147,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,[],[f247]) ).
tcf(c_148,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f248]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] :
( ( subset_intersection2(the_carrier(X1),X0,cast_as_carrier_subset(X1)) = X0 )
| ~ one_sorted_str(X1)
| ~ element(X0,powerset(the_carrier(X1))) ),
inference(cnf_transformation,[],[f249]) ).
tcf(c_151,negated_conjecture,
subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),sK6)) != sK6,
inference(cnf_transformation,[],[f253]) ).
tcf(c_152,negated_conjecture,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f252]) ).
tcf(c_153,negated_conjecture,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f251]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f257]) ).
tcf(c_981,plain,
! [X0: $i,X1: $i,X2: $i] :
( element(X1,powerset(X2))
| ( X0 != X2 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_148,c_157]) ).
tcf(c_982,plain,
! [X0: $i] : element(X0,powerset(X0)),
inference(unflattening,[status(thm)],[c_981]) ).
tcf(c_997,plain,
! [X0: $i,X1: $i] :
( ( subset_intersection2(the_carrier(X0),X1,cast_as_carrier_subset(X0)) = X1 )
| ~ element(X1,powerset(the_carrier(X0)))
| ( X0 != sK5 ) ),
inference(resolution_lifted,[status(thm)],[c_149,c_153]) ).
tcf(c_998,plain,
! [X0: $i] :
( ( subset_intersection2(the_carrier(sK5),X0,cast_as_carrier_subset(sK5)) = X0 )
| ~ element(X0,powerset(the_carrier(sK5))) ),
inference(unflattening,[status(thm)],[c_997]) ).
tcf(c_1021,plain,
! [X0: $i] :
( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
| ( X0 != sK5 ) ),
inference(resolution_lifted,[status(thm)],[c_76,c_153]) ).
tcf(c_1022,plain,
cast_as_carrier_subset(sK5) = the_carrier(sK5),
inference(unflattening,[status(thm)],[c_1021]) ).
tcf(c_1208,plain,
! [X0: $i] :
( ( subset_intersection2(the_carrier(sK5),X0,the_carrier(sK5)) = X0 )
| ~ element(X0,powerset(the_carrier(sK5))) ),
inference(light_normalisation,[status(thm)],[c_998,c_1022]) ).
tcf(c_1222,plain,
subset_difference(the_carrier(sK5),the_carrier(sK5),subset_difference(the_carrier(sK5),the_carrier(sK5),sK6)) != sK6,
inference(light_normalisation,[status(thm)],[c_151,c_1022]) ).
tcf(c_1495,definition,
iPr_def_10 = the_carrier(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1496,definition,
iPr_def_11 = subset_difference(iPr_def_10,iPr_def_10,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1497,definition,
iPr_def_12 = subset_difference(iPr_def_10,iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1498,definition,
iPr_def_13 = powerset(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1500,plain,
iPr_def_12 != sK6,
inference(demodulation,[status(thm)],[c_1222,c_1496,c_1495,c_1497]) ).
tcf(c_1501,plain,
! [X0: $i] :
( ( subset_intersection2(iPr_def_10,X0,iPr_def_10) = X0 )
| ~ element(X0,iPr_def_13) ),
inference(demodulation,[status(thm)],[c_1208,c_1498]) ).
tcf(c_1503,negated_conjecture,
element(sK6,iPr_def_13),
inference(demodulation,[status(thm)],[c_152]) ).
tcf(c_1900,plain,
subset_intersection2(iPr_def_10,sK6,iPr_def_10) = sK6,
inference(superposition,[status(thm)],[c_1503,c_1501]) ).
tcf(c_1902,plain,
element(iPr_def_10,iPr_def_13),
inference(superposition,[status(thm)],[c_1498,c_982]) ).
tcf(c_2156,plain,
( element(iPr_def_11,powerset(iPr_def_10))
| ~ element(iPr_def_10,powerset(iPr_def_10))
| ~ element(sK6,powerset(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_1496,c_79]) ).
tcf(c_2167,plain,
( element(iPr_def_11,iPr_def_13)
| ~ element(iPr_def_10,iPr_def_13)
| ~ element(sK6,iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_2156,c_1498]) ).
tcf(c_2168,plain,
element(iPr_def_11,iPr_def_13),
inference(forward_subsumption_resolution,[status(thm)],[c_2167,c_1902,c_1503]) ).
tcf(c_2255,plain,
! [X0: $i,X1: $i] :
( ( subset_difference(X1,X1,X0) = set_difference(X1,X0) )
| ~ element(X0,powerset(X1)) ),
inference(superposition,[status(thm)],[c_982,c_147]) ).
tcf(c_2369,plain,
! [X0: $i,X1: $i] :
( ( subset_intersection2(X1,X0,X1) = subset_intersection2(X1,X1,X0) )
| ~ element(X0,powerset(X1)) ),
inference(superposition,[status(thm)],[c_982,c_75]) ).
tcf(c_2407,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X1,set_difference(X1,X0)) = subset_intersection2(X1,X1,X0) )
| ~ element(X0,powerset(X1)) ),
inference(superposition,[status(thm)],[c_982,c_146]) ).
tcf(c_4689,plain,
! [X0: $i] :
( ( subset_difference(iPr_def_10,iPr_def_10,X0) = set_difference(iPr_def_10,X0) )
| ~ element(X0,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1498,c_2255]) ).
tcf(c_5634,plain,
subset_difference(iPr_def_10,iPr_def_10,sK6) = set_difference(iPr_def_10,sK6),
inference(superposition,[status(thm)],[c_1503,c_4689]) ).
tcf(c_5640,plain,
subset_difference(iPr_def_10,iPr_def_10,iPr_def_11) = set_difference(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_2168,c_4689]) ).
tcf(c_5644,plain,
set_difference(iPr_def_10,iPr_def_11) = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_5640,c_1497]) ).
tcf(c_5645,plain,
set_difference(iPr_def_10,sK6) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_5634,c_1496]) ).
tcf(c_10755,plain,
! [X0: $i] :
( ( subset_intersection2(iPr_def_10,X0,iPr_def_10) = subset_intersection2(iPr_def_10,iPr_def_10,X0) )
| ~ element(X0,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1498,c_2369]) ).
tcf(c_11789,plain,
subset_intersection2(iPr_def_10,sK6,iPr_def_10) = subset_intersection2(iPr_def_10,iPr_def_10,sK6),
inference(superposition,[status(thm)],[c_1503,c_10755]) ).
tcf(c_11804,plain,
subset_intersection2(iPr_def_10,iPr_def_10,sK6) = sK6,
inference(light_normalisation,[status(thm)],[c_11789,c_1900]) ).
tcf(c_17049,plain,
! [X0: $i] :
( ( set_difference(iPr_def_10,set_difference(iPr_def_10,X0)) = subset_intersection2(iPr_def_10,iPr_def_10,X0) )
| ~ element(X0,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1498,c_2407]) ).
tcf(c_19911,plain,
set_difference(iPr_def_10,set_difference(iPr_def_10,sK6)) = subset_intersection2(iPr_def_10,iPr_def_10,sK6),
inference(superposition,[status(thm)],[c_1503,c_17049]) ).
tcf(c_19926,plain,
sK6 = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_19911,c_5644,c_5645,c_11804]) ).
tcf(c_20178,plain,
iPr_def_12 != iPr_def_12,
inference(demodulation,[status(thm)],[c_1500,c_19926]) ).
tcf(c_20180,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_20178]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU309+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 13:38:27 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 9.65/2.26 % SZS status Started for theBenchmark.p
% 9.65/2.26 % SZS status Theorem for theBenchmark.p
% 9.65/2.26
% 9.65/2.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 9.65/2.26
% 9.65/2.26 % ------ iProver source info
% 9.65/2.26
% 9.65/2.26 % git: date: 2026-07-19 20:42:38 +0200
% 9.65/2.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 9.65/2.26 % git: non_committed_changes: false
% 9.65/2.26
% 9.65/2.26 % ------ Parsing...
% 9.65/2.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 9.65/2.26
% 9.65/2.26 % ------ Preprocessing... sup_sim: 2 sf_s rm: 70 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 5 sf_s rm: 7 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e %
% 9.65/2.26
% 9.65/2.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 9.65/2.26
% 9.65/2.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.65/2.26 % ------ Proving...
% 9.65/2.26 % ------ Problem Properties
% 9.65/2.26
% 9.65/2.26 %
% 9.65/2.26 % clauses 38
% 9.65/2.26 % conjectures 1
% 9.65/2.26 % EPR 11
% 9.65/2.26 % Horn 36
% 9.65/2.26 % unary 20
% 9.65/2.26 % binary 8
% 9.65/2.26 % lits 66
% 9.65/2.26 % lits eq 20
% 9.65/2.26 % fd_pure 0
% 9.65/2.26 % fd_pseudo 0
% 9.65/2.26 % fd_cond 1
% 9.65/2.26 % fd_pseudo_cond 1
% 9.65/2.26 % AC symbols 0
% 9.65/2.26
% 9.65/2.26 % ------ Schedule dynamic 5 is on
% 9.65/2.26
% 9.65/2.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.65/2.26
% 9.65/2.26
% 9.65/2.26 % ------
% 9.65/2.26 % Current options:
% 9.65/2.26 % ------
% 9.65/2.26
% 9.65/2.26
% 9.65/2.26 %
% 9.65/2.26
% 9.65/2.26 % ------ Proving...
% 9.65/2.26 %
% 9.65/2.26
% 9.65/2.26 % SZS status Theorem for theBenchmark.p
% 9.65/2.26
% 9.65/2.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.65/2.26
% 9.65/2.26
%------------------------------------------------------------------------------