%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU159+2 : 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 : n007.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:39 PM UTC 2026
% Result : Theorem 198.16s 28.50s
% Output : CNFRefutation 100.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 9 unt; 0 def)
% Number of atoms : 258 ( 72 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 296 ( 115 ~; 134 |; 37 &)
% ( 7 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 146 ( 0 sgn 132 !; 14 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X1
| X3 = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f13,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f56,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f67,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_zfmisc_1) ).
fof(f68,conjecture,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f69,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
inference(negated_conjecture,[status(cth)],[f68]) ).
fof(f81,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f100,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f116,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(ennf_transformation,[],[f56]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(flattening,[],[f116]) ).
fof(f123,plain,
? [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<~> ( in(X1,X2)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f69]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f151,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(flattening,[],[f150]) ).
fof(f152,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(rectify,[],[f151]) ).
fof(f153,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ( ( in(sK3(X0,X1,X2),X2)
| sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0 )
& ( ~ in(sK3(X0,X1,X2),X2)
| ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f152]) ).
fof(f161,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f162,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f161]) ).
fof(f163,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK10(X0,X1),X0)
& ~ in(sK10(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0,X1))],[f162]) ).
fof(f187,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f188,plain,
? [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ( in(X1,X2)
& in(X0,X2) ) )
& ( ~ subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ) ),
inference(nnf_transformation,[],[f123]) ).
fof(f189,plain,
? [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ( in(X1,X2)
& in(X0,X2) ) )
& ( ~ subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ) ),
inference(flattening,[],[f188]) ).
fof(f190,plain,
( ( subset(unordered_pair(sK19,sK20),sK21)
| ( in(sK20,sK21)
& in(sK19,sK21) ) )
& ( ~ subset(unordered_pair(sK19,sK20),sK21)
| ~ in(sK20,sK21)
| ~ in(sK19,sK21) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21]),skolemize(X0,sK19),skolemize(X1,sK20),skolemize(X2,sK21)],[f189]) ).
fof(f212,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| ~ in(X4,X2)
| X1 = X4
| X0 = X4 ),
inference(cnf_transformation,[],[f153]) ).
fof(f213,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X1 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f153]) ).
fof(f214,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f153]) ).
fof(f232,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f233,plain,
! [X0,X1] :
( in(sK10(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f234,plain,
! [X0,X1] :
( ~ in(sK10(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f163]) ).
fof(f289,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f303,plain,
! [X0,X1] :
( ~ subset(singleton(X0),X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f187]) ).
fof(f304,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f187]) ).
fof(f305,plain,
( subset(unordered_pair(sK19,sK20),sK21)
| in(sK20,sK21) ),
inference(cnf_transformation,[],[f190]) ).
fof(f306,plain,
( subset(unordered_pair(sK19,sK20),sK21)
| in(sK19,sK21) ),
inference(cnf_transformation,[],[f190]) ).
fof(f307,plain,
( ~ subset(unordered_pair(sK19,sK20),sK21)
| ~ in(sK20,sK21)
| ~ in(sK19,sK21) ),
inference(cnf_transformation,[],[f190]) ).
fof(f322,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f81]) ).
fof(f374,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f304,f322]) ).
fof(f375,plain,
! [X0,X1] :
( ~ subset(unordered_pair(X0,X0),X1)
| in(X0,X1) ),
inference(definition_unfolding,[],[f303,f322]) ).
fof(f389,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f214]) ).
fof(f390,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f389]) ).
fof(f391,plain,
! [X2,X0,X4] :
( unordered_pair(X0,X4) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f213]) ).
fof(f392,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f391]) ).
fof(f393,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f212]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f390]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f392]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f393]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK10(X0,X1),X1) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK10(X0,X1),X0) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f232]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X2,X1)
| ~ subset(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f289]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f374]) ).
tcf(c_158,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| ~ subset(unordered_pair(X0,X0),X1) ),
inference(cnf_transformation,[],[f375]) ).
tcf(c_159,negated_conjecture,
( ~ in(sK20,sK21)
| ~ in(sK19,sK21)
| ~ subset(unordered_pair(sK19,sK20),sK21) ),
inference(cnf_transformation,[],[f307]) ).
tcf(c_160,negated_conjecture,
( in(sK19,sK21)
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(cnf_transformation,[],[f306]) ).
tcf(c_161,negated_conjecture,
( in(sK20,sK21)
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(cnf_transformation,[],[f305]) ).
tcf(c_2150,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( in(X0,X2)
| ~ in(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_4161,plain,
( in(sK19,sK21)
| ~ subset(unordered_pair(sK19,sK19),sK21) ),
inference(instantiation,[status(thm)],[c_158]) ).
tcf(c_4196,plain,
( in(sK20,sK21)
| ~ subset(unordered_pair(sK20,sK20),sK21) ),
inference(instantiation,[status(thm)],[c_158]) ).
tcf(c_11859,plain,
! [X0: $i] :
( in(sK20,sK21)
| subset(X0,sK21)
| ~ subset(X0,unordered_pair(sK19,sK20)) ),
inference(superposition,[status(thm)],[c_161,c_143]) ).
tcf(c_11860,plain,
! [X0: $i] :
( in(sK19,sK21)
| subset(X0,sK21)
| ~ subset(X0,unordered_pair(sK19,sK20)) ),
inference(superposition,[status(thm)],[c_160,c_143]) ).
tcf(c_11980,plain,
! [X0: $i] :
( in(sK20,sK21)
| subset(unordered_pair(X0,X0),sK21)
| ~ in(X0,unordered_pair(sK19,sK20)) ),
inference(superposition,[status(thm)],[c_157,c_11859]) ).
tcf(c_11989,plain,
! [X0: $i] :
( in(sK19,sK21)
| subset(unordered_pair(X0,X0),sK21)
| ~ in(X0,unordered_pair(sK19,sK20)) ),
inference(superposition,[status(thm)],[c_157,c_11860]) ).
tcf(c_14689,plain,
! [X0: $i] :
( in(sK19,sK21)
| in(X0,sK21)
| ~ in(X0,unordered_pair(sK19,sK20)) ),
inference(resolution,[status(thm)],[c_89,c_160]) ).
tcf(c_15165,plain,
( in(sK20,sK21)
| subset(unordered_pair(sK20,sK20),sK21) ),
inference(superposition,[status(thm)],[c_71,c_11980]) ).
tcf(c_15217,plain,
( in(sK19,sK21)
| subset(unordered_pair(sK19,sK19),sK21) ),
inference(superposition,[status(thm)],[c_70,c_11989]) ).
tcf(c_15275,plain,
in(sK19,sK21),
inference(global_subsumption_just,[status(thm)],[c_14689,c_4161,c_15217]) ).
tcf(c_15283,plain,
( ~ in(sK20,sK21)
| ~ subset(unordered_pair(sK19,sK20),sK21) ),
inference(backward_subsumption_resolution,[status(thm)],[c_159,c_15275]) ).
tcf(c_15286,plain,
~ subset(unordered_pair(sK19,sK20),sK21),
inference(global_subsumption_just,[status(thm)],[c_15283,c_159,c_4196,c_15165,c_15275]) ).
tcf(c_46713,plain,
( subset(unordered_pair(sK19,sK20),sK21)
| ~ in(sK10(unordered_pair(sK19,sK20),sK21),sK21) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_46715,plain,
( subset(unordered_pair(sK19,sK20),sK21)
| in(sK10(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20)) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_46761,plain,
! [X0: $i,X1: $i] :
( in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| ~ in(X0,X1)
| ( sK21 != X1 )
| ( sK10(unordered_pair(sK19,sK20),sK21) != X0 ) ),
inference(instantiation,[status(thm)],[c_2150]) ).
tcf(c_48625,plain,
( in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| ~ in(sK19,sK21)
| ( sK21 != sK21 )
| ( sK10(unordered_pair(sK19,sK20),sK21) != sK19 ) ),
inference(instantiation,[status(thm)],[c_46761]) ).
tcf(c_48626,plain,
( in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| ~ in(sK19,sK21)
| ( sK10(unordered_pair(sK19,sK20),sK21) != sK19 ) ),
inference(equality_resolution_simp,[status(thm)],[c_48625]) ).
tcf(c_48627,plain,
( in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| ~ in(sK20,sK21)
| ( sK21 != sK21 )
| ( sK10(unordered_pair(sK19,sK20),sK21) != sK20 ) ),
inference(instantiation,[status(thm)],[c_46761]) ).
tcf(c_48628,plain,
( in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| ~ in(sK20,sK21)
| ( sK10(unordered_pair(sK19,sK20),sK21) != sK20 ) ),
inference(equality_resolution_simp,[status(thm)],[c_48627]) ).
tcf(c_50359,plain,
! [X0: $i] :
( ( sK10(unordered_pair(sK19,sK20),sK21) = sK19 )
| ( sK10(unordered_pair(sK19,sK20),sK21) = X0 )
| ~ in(sK10(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,X0)) ),
inference(instantiation,[status(thm)],[c_72]) ).
tcf(c_141070,plain,
( ( sK10(unordered_pair(sK19,sK20),sK21) = sK20 )
| ( sK10(unordered_pair(sK19,sK20),sK21) = sK19 )
| ~ in(sK10(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20)) ),
inference(instantiation,[status(thm)],[c_50359]) ).
tcf(c_141071,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_141070,c_48628,c_48626,c_46713,c_46715,c_15286,c_15275,c_161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 % Computer : n007.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Thu Sep 24 12:57:23 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 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.12/0.45
% 0.12/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.45
% 0.12/0.46 % Detected problem language: tptp
% 0.12/0.47 % Proving...
% 198.16/28.50 % SZS status Started for theBenchmark.p
% 198.16/28.50 % SZS status Theorem for theBenchmark.p
% 198.16/28.50
% 198.16/28.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 198.16/28.50
% 198.16/28.50 % ------ iProver source info
% 198.16/28.50
% 198.16/28.50 % git: date: 2026-07-19 20:42:38 +0200
% 198.16/28.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 198.16/28.50 % git: non_committed_changes: false
% 198.16/28.50
% 198.16/28.50 % ------ Parsing...
% 198.16/28.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 198.16/28.50
% 198.16/28.50 % ------ Preprocessing... sup_sim: 5 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 %
% 198.16/28.50
% 198.16/28.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 198.16/28.50
% 198.16/28.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 198.16/28.50 % ------ Proving...
% 198.16/28.50 % ------ Problem Properties
% 198.16/28.50
% 198.16/28.50 %
% 198.16/28.50 % clauses 122
% 198.16/28.50 % conjectures 3
% 198.16/28.50 % EPR 21
% 198.16/28.50 % Horn 92
% 198.16/28.50 % unary 24
% 198.16/28.50 % binary 54
% 198.16/28.50 % lits 271
% 198.16/28.50 % lits eq 78
% 198.16/28.50 % fd_pure 0
% 198.16/28.50 % fd_pseudo 0
% 198.16/28.50 % fd_cond 3
% 198.16/28.50 % fd_pseudo_cond 35
% 198.16/28.50 % AC symbols 0
% 198.16/28.50
% 198.16/28.50 % ------ Input Options Time Limit: Unbounded
% 198.16/28.50
% 198.16/28.50
% 198.16/28.50 % ------
% 198.16/28.50 % Current options:
% 198.16/28.50 % ------
% 198.16/28.50
% 198.16/28.50
% 198.16/28.50 %
% 198.16/28.50
% 198.16/28.50 % ------ Proving...
% 198.16/28.50 %
% 198.16/28.50
% 198.16/28.50 % SZS status Theorem for theBenchmark.p
% 198.16/28.50
% 198.16/28.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 100.36/28.50
% 100.36/28.50
%------------------------------------------------------------------------------