%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU325+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 : n018.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:52 PM UTC 2026
% Result : Theorem 2.60s 6.20s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 89 ( 34 unt; 2 def)
% Number of atoms : 241 ( 57 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 240 ( 99 ~; 83 |; 44 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 15 ( 13 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 98 !; 12 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,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(f18,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f19,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_pre_topc) ).
fof(f30,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f33,axiom,
( v5_membered(empty_set)
& v4_membered(empty_set)
& v3_membered(empty_set)
& v2_membered(empty_set)
& v1_membered(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).
fof(f36,axiom,
! [X0] :
? [X1] :
( empty(X1)
& element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(f39,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> union_of_subsets(X0,X1) = union(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(f45,axiom,
! [X0,X1,X2] :
~ ( empty(X2)
& element(X1,powerset(X2))
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(f46,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( X1 = empty_set
& is_a_cover_of_carrier(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( X1 = empty_set
& is_a_cover_of_carrier(X0,X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f48,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f49,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f79,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f80,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( ~ element(X1,powerset(powerset(the_carrier(X0))))
| ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f83,plain,
! [X0] :
( ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ empty(the_carrier(X0)) ),
inference(ennf_transformation,[],[f30]) ).
fof(f84,plain,
! [X0] :
( ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ empty(the_carrier(X0)) ),
inference(flattening,[],[f83]) ).
fof(f90,plain,
! [X0,X1] :
( ~ element(X1,powerset(powerset(X0)))
| union_of_subsets(X0,X1) = union(X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ empty(X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f98,plain,
? [X0] :
( one_sorted_str(X0)
& ~ empty_carrier(X0)
& ? [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
& X1 = empty_set
& is_a_cover_of_carrier(X0,X1) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f99,plain,
? [X0] :
( one_sorted_str(X0)
& ~ empty_carrier(X0)
& ? [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
& X1 = empty_set
& is_a_cover_of_carrier(X0,X1) ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ~ empty(X0)
| X0 = empty_set ),
inference(ennf_transformation,[],[f48]) ).
fof(f101,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f103,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| ? [X3] :
( in(X3,X0)
& in(X2,X3) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X3] :
( in(X3,X0)
& in(X2,X3) ) )
& ( ~ in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) ) )
| X1 = union(X0) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f104,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| ? [X7] :
( in(X7,X0)
& in(X5,X7) ) )
& ( ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) )
| in(X5,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X4] :
( in(X4,X0)
& in(X2,X4) ) )
& ( ~ in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) ) )
| X1 = union(X0) ) ),
inference(rectify,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| ( in(sK2(X0,X5),X0)
& in(X5,sK2(X0,X5)) ) )
& ( ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) )
| in(X5,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| ( in(sK1(X0,X1),X0)
& in(sK0(X0,X1),sK1(X0,X1)) ) )
& ( ~ in(sK0(X0,X1),X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(sK0(X0,X1),X3) ) ) )
| X1 = union(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0,X1)),skolemize(X4,sK1(X0,X1)),skolemize(X7,sK2(X0,X5))],[f104]) ).
fof(f106,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( ~ element(X1,powerset(powerset(the_carrier(X0))))
| ( ( ~ is_a_cover_of_carrier(X0,X1)
| cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) )
& ( cast_as_carrier_subset(X0) != union_of_subsets(the_carrier(X0),X1)
| is_a_cover_of_carrier(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f111,plain,
! [X0] :
( empty(sK7(X0))
& element(sK7(X0),powerset(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X1,sK7(X0))],[f36]) ).
fof(f114,plain,
( one_sorted_str(sK10)
& ~ empty_carrier(sK10)
& element(sK11,powerset(powerset(the_carrier(sK10))))
& empty_set = sK11
& is_a_cover_of_carrier(sK10,sK11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f99]) ).
fof(f140,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f144,plain,
! [X0,X1] :
( in(sK0(X0,X1),X1)
| in(sK1(X0,X1),X0)
| union(X0) = X1 ),
inference(cnf_transformation,[],[f105]) ).
fof(f147,plain,
! [X0,X1] :
( ~ one_sorted_str(X0)
| ~ element(X1,powerset(powerset(the_carrier(X0))))
| ~ is_a_cover_of_carrier(X0,X1)
| cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f153,plain,
! [X0] :
( ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ empty(the_carrier(X0)) ),
inference(cnf_transformation,[],[f84]) ).
fof(f161,plain,
empty(empty_set),
inference(cnf_transformation,[],[f33]) ).
fof(f170,plain,
! [X0] : empty(sK7(X0)),
inference(cnf_transformation,[],[f111]) ).
fof(f171,plain,
! [X0] : element(sK7(X0),powerset(X0)),
inference(cnf_transformation,[],[f111]) ).
fof(f176,plain,
! [X0,X1] :
( ~ element(X1,powerset(powerset(X0)))
| union_of_subsets(X0,X1) = union(X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f182,plain,
! [X2,X0,X1] :
( ~ empty(X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f183,plain,
one_sorted_str(sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f184,plain,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f185,plain,
element(sK11,powerset(powerset(the_carrier(sK10)))),
inference(cnf_transformation,[],[f114]) ).
fof(f186,plain,
empty_set = sK11,
inference(cnf_transformation,[],[f114]) ).
fof(f187,plain,
is_a_cover_of_carrier(sK10,sK11),
inference(cnf_transformation,[],[f114]) ).
fof(f188,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f100]) ).
fof(f189,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f191,plain,
empty(sK11),
inference(definition_unfolding,[],[f161,f186]) ).
fof(f197,plain,
! [X0] :
( ~ empty(X0)
| sK11 = X0 ),
inference(definition_unfolding,[],[f188,f186]) ).
tcf(c_74,plain,
! [X0: $i] :
( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( in(sK1(X0,X1),X0)
| in(sK0(X0,X1),X1)
| ( union(X0) = X1 ) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( ( union_of_subsets(the_carrier(X1),X0) = cast_as_carrier_subset(X1) )
| ~ one_sorted_str(X1)
| ~ is_a_cover_of_carrier(X1,X0)
| ~ element(X0,powerset(powerset(the_carrier(X1)))) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_87,plain,
! [X0: $i] :
( empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ empty(the_carrier(X0)) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_90,negated_conjecture,
empty(sK11),
inference(cnf_transformation,[],[f191]) ).
tcf(c_104,plain,
! [X0: $i] : element(sK7(X0),powerset(X0)),
inference(cnf_transformation,[],[f171]) ).
tcf(c_105,plain,
! [X0: $i] : empty(sK7(X0)),
inference(cnf_transformation,[],[f170]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i] :
( ( union_of_subsets(X1,X0) = union(X0) )
| ~ element(X0,powerset(powerset(X1))) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ empty(X1)
| ~ in(X2,X0)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_117,negated_conjecture,
is_a_cover_of_carrier(sK10,sK11),
inference(cnf_transformation,[],[f187]) ).
tcf(c_118,negated_conjecture,
element(sK11,powerset(powerset(the_carrier(sK10)))),
inference(cnf_transformation,[],[f185]) ).
tcf(c_119,negated_conjecture,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f184]) ).
tcf(c_120,negated_conjecture,
one_sorted_str(sK10),
inference(cnf_transformation,[],[f183]) ).
tcf(c_121,negated_conjecture,
! [X0: $i] :
( ( X0 = sK11 )
| ~ empty(X0) ),
inference(cnf_transformation,[],[f197]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_756,plain,
! [X0: $i,X1: $i] :
( ( union_of_subsets(the_carrier(X1),X0) = cast_as_carrier_subset(X1) )
| ~ one_sorted_str(X1)
| ~ element(X0,powerset(powerset(the_carrier(X1))))
| ( X1 != sK10 )
| ( X0 != sK11 ) ),
inference(resolution_lifted,[status(thm)],[c_82,c_117]) ).
tcf(c_757,plain,
( ( union_of_subsets(the_carrier(sK10),sK11) = cast_as_carrier_subset(sK10) )
| ~ one_sorted_str(sK10)
| ~ element(sK11,powerset(powerset(the_carrier(sK10)))) ),
inference(unflattening,[status(thm)],[c_756]) ).
tcf(c_758,plain,
union_of_subsets(the_carrier(sK10),sK11) = cast_as_carrier_subset(sK10),
inference(global_subsumption_just,[status(thm)],[c_757,c_120,c_118,c_757]) ).
tcf(c_813,plain,
! [X0: $i] :
( ~ one_sorted_str(X0)
| ~ empty(the_carrier(X0))
| ( X0 != sK10 ) ),
inference(resolution_lifted,[status(thm)],[c_87,c_119]) ).
tcf(c_814,plain,
( ~ one_sorted_str(sK10)
| ~ empty(the_carrier(sK10)) ),
inference(unflattening,[status(thm)],[c_813]) ).
tcf(c_815,plain,
~ empty(the_carrier(sK10)),
inference(global_subsumption_just,[status(thm)],[c_814,c_120,c_814]) ).
tcf(c_853,plain,
! [X0: $i] :
( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
| ( X0 != sK10 ) ),
inference(resolution_lifted,[status(thm)],[c_74,c_120]) ).
tcf(c_854,plain,
cast_as_carrier_subset(sK10) = the_carrier(sK10),
inference(unflattening,[status(thm)],[c_853]) ).
tcf(c_1023,plain,
union_of_subsets(the_carrier(sK10),sK11) = the_carrier(sK10),
inference(light_normalisation,[status(thm)],[c_758,c_854]) ).
tcf(c_1330,definition,
iPr_def_10 = the_carrier(sK10),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1331,definition,
iPr_def_11 = union_of_subsets(iPr_def_10,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1336,plain,
iPr_def_11 = iPr_def_10,
inference(demodulation,[status(thm)],[c_1023,c_1330,c_1331]) ).
tcf(c_1338,plain,
~ empty(iPr_def_10),
inference(demodulation,[status(thm)],[c_815]) ).
tcf(c_1341,negated_conjecture,
! [X0: $i] :
( ( X0 = sK11 )
| ~ empty(X0) ),
inference(demodulation,[status(thm)],[c_121]) ).
tcf(c_1343,negated_conjecture,
empty(sK11),
inference(demodulation,[status(thm)],[c_90]) ).
tcf(c_1747,plain,
! [X0: $i] : sK7(X0) = sK11,
inference(superposition,[status(thm)],[c_105,c_1341]) ).
tcf(c_1750,plain,
! [X0: $i] : element(sK11,powerset(X0)),
inference(light_normalisation,[status(thm)],[c_104,c_1747]) ).
tcf(c_1762,plain,
union_of_subsets(iPr_def_10,sK11) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_1331,c_1336]) ).
tcf(c_2085,plain,
! [X0: $i,X1: $i] :
( ~ empty(X1)
| ~ in(X0,sK11) ),
inference(superposition,[status(thm)],[c_1750,c_116]) ).
tcf(c_2105,plain,
! [X0: $i] : union_of_subsets(X0,sK11) = union(sK11),
inference(superposition,[status(thm)],[c_1750,c_110]) ).
tcf(c_2116,plain,
union(sK11) = iPr_def_10,
inference(demodulation,[status(thm)],[c_1762,c_2105]) ).
tcf(c_2254,plain,
! [X0: $i,X1: $i] :
( in(sK1(X1,sK11),X1)
| ( union(X1) = sK11 )
| ~ empty(X0) ),
inference(superposition,[status(thm)],[c_77,c_2085]) ).
tcf(c_2522,plain,
! [X0: $i] :
( in(sK1(X0,sK11),X0)
| ( union(X0) = sK11 ) ),
inference(superposition,[status(thm)],[c_1343,c_2254]) ).
tcf(c_2597,plain,
! [X0: $i] :
( ( union(X0) = sK11 )
| ~ empty(X0) ),
inference(superposition,[status(thm)],[c_2522,c_122]) ).
tcf(c_2650,plain,
union(sK11) = sK11,
inference(superposition,[status(thm)],[c_1343,c_2597]) ).
tcf(c_2651,plain,
sK11 = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2650,c_2116]) ).
tcf(c_2673,plain,
empty(iPr_def_10),
inference(demodulation,[status(thm)],[c_1343,c_2651]) ).
tcf(c_2674,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2673,c_1338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU325+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.09/5.38 % Computer : n018.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Thu Sep 24 13:44:24 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 2.60/6.20 % SZS status Started for theBenchmark.p
% 2.60/6.20 % SZS status Theorem for theBenchmark.p
% 2.60/6.20
% 2.60/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.60/6.20
% 2.60/6.20 % ------ iProver source info
% 2.60/6.20
% 2.60/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 2.60/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.60/6.20 % git: non_committed_changes: false
% 2.60/6.20
% 2.60/6.20 % ------ Parsing...
% 2.60/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.60/6.20
% 2.60/6.20 % ------ Preprocessing... sup_sim: 0 sf_s rm: 40 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 8 sf_s rm: 9 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e %
% 2.60/6.20
% 2.60/6.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.60/6.20
% 2.60/6.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.60/6.20 % ------ Proving...
% 2.60/6.20 % ------ Problem Properties
% 2.60/6.20
% 2.60/6.20 %
% 2.60/6.20 % clauses 42
% 2.60/6.20 % conjectures 3
% 2.60/6.20 % EPR 14
% 2.60/6.20 % Horn 38
% 2.60/6.20 % unary 24
% 2.60/6.20 % binary 10
% 2.60/6.20 % lits 69
% 2.60/6.20 % lits eq 16
% 2.60/6.20 % fd_pure 0
% 2.60/6.20 % fd_pseudo 0
% 2.60/6.20 % fd_cond 1
% 2.60/6.20 % fd_pseudo_cond 4
% 2.60/6.20 % AC symbols 0
% 2.60/6.20
% 2.60/6.20 % ------ Schedule dynamic 5 is on
% 2.60/6.20
% 2.60/6.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.60/6.20
% 2.60/6.20
% 2.60/6.20 % ------
% 2.60/6.20 % Current options:
% 2.60/6.20 % ------
% 2.60/6.20
% 2.60/6.20
% 2.60/6.20 %
% 2.60/6.20
% 2.60/6.20 % ------ Proving...
% 2.60/6.20 %
% 2.60/6.20
% 2.60/6.20 % SZS status Theorem for theBenchmark.p
% 2.60/6.20
% 2.60/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.60/6.20
% 2.60/6.20
%------------------------------------------------------------------------------