%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU171+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:55:44 PM UTC 2026
% Result : Theorem 4.06s 1.52s
% Output : CNFRefutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 86 ( 34 unt; 2 def)
% Number of atoms : 241 ( 41 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 247 ( 101 ~; 86 |; 41 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 125 ( 0 sgn 115 !; 10 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,X1) = set_difference(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f7,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> element(subset_complement(X0,X1),powerset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_subset_1) ).
fof(f10,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f12,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f13,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,subset_complement(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(f20,conjecture,
! [X0] :
( X0 != empty_set
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f21,negated_conjecture,
~ ! [X0] :
( X0 != empty_set
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f23,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f24,axiom,
! [X0,X1] :
~ ( empty(X1)
& X0 != X1
& empty(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
fof(f26,plain,
! [X0,X1] :
( ( ~ empty(X0)
| ( element(X1,X0)
<=> empty(X1) ) )
& ( empty(X0)
| ( element(X1,X0)
<=> in(X1,X0) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| subset_complement(X0,X1) = set_difference(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f28,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| element(subset_complement(X0,X1),powerset(X0)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f29,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| subset_complement(X0,subset_complement(X0,X1)) = X1 ),
inference(ennf_transformation,[],[f13]) ).
fof(f31,plain,
? [X0] :
( X0 != empty_set
& ? [X1] :
( element(X1,powerset(X0))
& ? [X2] :
( element(X2,X0)
& ~ in(X2,X1)
& ~ in(X2,subset_complement(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f32,plain,
? [X0] :
( X0 != empty_set
& ? [X1] :
( element(X1,powerset(X0))
& ? [X2] :
( element(X2,X0)
& ~ in(X2,X1)
& ~ in(X2,subset_complement(X0,X1)) ) ) ),
inference(flattening,[],[f31]) ).
fof(f34,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f35,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f36,plain,
! [X0,X1] :
( ( ~ empty(X0)
| ( ( ~ element(X1,X0)
| empty(X1) )
& ( ~ empty(X1)
| element(X1,X0) ) ) )
& ( empty(X0)
| ( ( ~ element(X1,X0)
| in(X1,X0) )
& ( ~ in(X1,X0)
| element(X1,X0) ) ) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( ~ in(X4,X1)
& in(X4,X0) ) )
& ( in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) )
& ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(rectify,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( ~ in(X4,X1)
& in(X4,X0) ) )
& ( in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ( ( in(sK0(X0,X1,X2),X2)
| ( ~ in(sK0(X0,X1,X2),X1)
& in(sK0(X0,X1,X2),X0) ) )
& ( ~ in(sK0(X0,X1,X2),X2)
| in(sK0(X0,X1,X2),X1)
| ~ in(sK0(X0,X1,X2),X0) ) )
| X2 = set_difference(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f39]) ).
fof(f41,plain,
! [X0] : element(sK1(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f10]) ).
fof(f46,plain,
( empty_set != sK6
& element(sK7,powerset(sK6))
& element(sK8,sK6)
& ~ in(sK8,sK7)
& ~ in(sK8,subset_complement(sK6,sK7)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f32]) ).
fof(f50,plain,
! [X0,X1] :
( empty(X0)
| ~ element(X1,X0)
| in(X1,X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( set_difference(X0,X1) != X2
| in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| set_difference(X0,X1) = subset_complement(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f59,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| element(subset_complement(X0,X1),powerset(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f60,plain,
! [X0] : element(sK1(X0),X0),
inference(cnf_transformation,[],[f41]) ).
fof(f62,plain,
empty(empty_set),
inference(cnf_transformation,[],[f12]) ).
fof(f63,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| subset_complement(X0,subset_complement(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f72,plain,
empty_set != sK6,
inference(cnf_transformation,[],[f46]) ).
fof(f73,plain,
element(sK7,powerset(sK6)),
inference(cnf_transformation,[],[f46]) ).
fof(f74,plain,
element(sK8,sK6),
inference(cnf_transformation,[],[f46]) ).
fof(f75,plain,
~ in(sK8,sK7),
inference(cnf_transformation,[],[f46]) ).
fof(f76,plain,
~ in(sK8,subset_complement(sK6,sK7)),
inference(cnf_transformation,[],[f46]) ).
fof(f78,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f79,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f54]) ).
fof(f81,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f53]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| in(X0,set_difference(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_difference(X1,X2)) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( set_difference(X1,X0) = subset_complement(X1,X0) )
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( element(subset_complement(X1,X0),powerset(X1))
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_62,plain,
! [X0: $i] : element(sK1(X0),X0),
inference(cnf_transformation,[],[f60]) ).
tcf(c_64,plain,
empty(empty_set),
inference(cnf_transformation,[],[f62]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( ( subset_complement(X1,subset_complement(X1,X0)) = X0 )
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_74,negated_conjecture,
~ in(sK8,subset_complement(sK6,sK7)),
inference(cnf_transformation,[],[f76]) ).
tcf(c_75,negated_conjecture,
~ in(sK8,sK7),
inference(cnf_transformation,[],[f75]) ).
tcf(c_76,negated_conjecture,
element(sK8,sK6),
inference(cnf_transformation,[],[f74]) ).
tcf(c_77,negated_conjecture,
element(sK7,powerset(sK6)),
inference(cnf_transformation,[],[f73]) ).
tcf(c_78,negated_conjecture,
empty_set != sK6,
inference(cnf_transformation,[],[f72]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ empty(X1)
| ~ empty(X0) ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_320,definition,
iPr_def_10 = powerset(sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_321,definition,
iPr_def_11 = subset_complement(sK6,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_323,negated_conjecture,
element(sK7,iPr_def_10),
inference(demodulation,[status(thm)],[c_77,c_320]) ).
tcf(c_324,negated_conjecture,
element(sK8,sK6),
inference(demodulation,[status(thm)],[c_76]) ).
tcf(c_325,negated_conjecture,
~ in(sK8,sK7),
inference(demodulation,[status(thm)],[c_75]) ).
tcf(c_326,negated_conjecture,
~ in(sK8,iPr_def_11),
inference(demodulation,[status(thm)],[c_74,c_321]) ).
tcf(c_730,plain,
! [X0: $i] :
( empty(X0)
| in(sK1(X0),X0) ),
inference(superposition,[status(thm)],[c_62,c_51]) ).
tcf(c_732,plain,
( empty(sK6)
| in(sK8,sK6) ),
inference(superposition,[status(thm)],[c_324,c_51]) ).
tcf(c_846,plain,
! [X0: $i,X1: $i] :
( empty(set_difference(X0,X1))
| in(sK1(set_difference(X0,X1)),X0) ),
inference(superposition,[status(thm)],[c_730,c_58]) ).
tcf(c_999,plain,
! [X0: $i] : set_difference(X0,sK1(powerset(X0))) = subset_complement(X0,sK1(powerset(X0))),
inference(superposition,[status(thm)],[c_62,c_60]) ).
tcf(c_1002,plain,
! [X0: $i] :
( ( set_difference(sK6,X0) = subset_complement(sK6,X0) )
| ~ element(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_320,c_60]) ).
tcf(c_1018,plain,
( ( empty_set = sK6 )
| ~ empty(sK6)
| ~ empty(empty_set) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_1027,plain,
! [X0: $i] : subset_complement(X0,subset_complement(X0,sK1(powerset(X0)))) = sK1(powerset(X0)),
inference(superposition,[status(thm)],[c_62,c_65]) ).
tcf(c_1036,plain,
! [X0: $i] : subset_complement(X0,set_difference(X0,sK1(powerset(X0)))) = sK1(powerset(X0)),
inference(light_normalisation,[status(thm)],[c_1027,c_999]) ).
tcf(c_1095,plain,
! [X0: $i] :
( element(set_difference(X0,sK1(powerset(X0))),powerset(X0))
| ~ element(sK1(powerset(X0)),powerset(X0)) ),
inference(superposition,[status(thm)],[c_999,c_61]) ).
tcf(c_1096,plain,
! [X0: $i] : element(set_difference(X0,sK1(powerset(X0))),powerset(X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_1095,c_62]) ).
tcf(c_1205,plain,
! [X0: $i] : set_difference(X0,set_difference(X0,sK1(powerset(X0)))) = subset_complement(X0,set_difference(X0,sK1(powerset(X0)))),
inference(superposition,[status(thm)],[c_1096,c_60]) ).
tcf(c_1207,plain,
! [X0: $i] : set_difference(X0,set_difference(X0,sK1(powerset(X0)))) = sK1(powerset(X0)),
inference(light_normalisation,[status(thm)],[c_1205,c_1036]) ).
tcf(c_1288,plain,
! [X0: $i,X1: $i] :
( empty(set_difference(X0,X1))
| ~ empty(X0) ),
inference(superposition,[status(thm)],[c_846,c_80]) ).
tcf(c_1511,plain,
! [X0: $i] :
( empty(sK1(powerset(X0)))
| ~ empty(X0) ),
inference(superposition,[status(thm)],[c_1207,c_1288]) ).
tcf(c_1697,plain,
( empty(sK1(iPr_def_10))
| ~ empty(sK6) ),
inference(superposition,[status(thm)],[c_320,c_1511]) ).
tcf(c_1735,plain,
~ empty(sK6),
inference(global_subsumption_just,[status(thm)],[c_1697,c_64,c_78,c_1018]) ).
tcf(c_1740,plain,
in(sK8,sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_732,c_1735]) ).
tcf(c_2868,plain,
set_difference(sK6,sK7) = subset_complement(sK6,sK7),
inference(superposition,[status(thm)],[c_323,c_1002]) ).
tcf(c_2879,plain,
set_difference(sK6,sK7) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_2868,c_321]) ).
tcf(c_2930,plain,
! [X0: $i] :
( in(X0,iPr_def_11)
| in(X0,sK7)
| ~ in(X0,sK6) ),
inference(superposition,[status(thm)],[c_2879,c_57]) ).
tcf(c_3208,plain,
( in(sK8,iPr_def_11)
| in(sK8,sK7) ),
inference(superposition,[status(thm)],[c_1740,c_2930]) ).
tcf(c_3215,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3208,c_326,c_325]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU171+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n011.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Thu Sep 24 13:02:27 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.52
% 0.22/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.22/0.52
% 0.22/0.52 % Detected problem language: tptp
% 0.22/0.54 % Proving...
% 4.06/1.52 % SZS status Started for theBenchmark.p
% 4.06/1.52 % SZS status Theorem for theBenchmark.p
% 4.06/1.52
% 4.06/1.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.06/1.52
% 4.06/1.52 % ------ iProver source info
% 4.06/1.52
% 4.06/1.52 % git: date: 2026-07-19 20:42:38 +0200
% 4.06/1.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.06/1.52 % git: non_committed_changes: false
% 4.06/1.52
% 4.06/1.52 % ------ Parsing...
% 4.06/1.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.06/1.52
% 4.06/1.52 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.06/1.52
% 4.06/1.52 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.06/1.52
% 4.06/1.52 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.06/1.52 % ------ Proving...
% 4.06/1.52 % ------ Problem Properties
% 4.06/1.52
% 4.06/1.52 %
% 4.06/1.52 % clauses 35
% 4.06/1.52 % conjectures 5
% 4.06/1.52 % EPR 16
% 4.06/1.52 % Horn 29
% 4.06/1.52 % unary 16
% 4.06/1.52 % binary 11
% 4.06/1.52 % lits 63
% 4.06/1.52 % lits eq 12
% 4.06/1.52 % fd_pure 0
% 4.06/1.52 % fd_pseudo 0
% 4.06/1.52 % fd_cond 1
% 4.06/1.52 % fd_pseudo_cond 4
% 4.06/1.52 % AC symbols 0
% 4.06/1.52
% 4.06/1.52 % ------ Schedule dynamic 5 is on
% 4.06/1.52
% 4.06/1.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.06/1.52
% 4.06/1.52
% 4.06/1.52 % ------
% 4.06/1.52 % Current options:
% 4.06/1.52 % ------
% 4.06/1.52
% 4.06/1.52
% 4.06/1.52 %
% 4.06/1.52
% 4.06/1.52 % ------ Proving...
% 4.06/1.52 %
% 4.06/1.52
% 4.06/1.52 % SZS status Theorem for theBenchmark.p
% 4.06/1.52
% 4.06/1.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.06/1.52
% 4.06/1.52
%------------------------------------------------------------------------------