%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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:26:11 PM UTC 2026
% Result : Theorem 4.81s 2.19s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 78 ( 24 unt; 0 def)
% Number of atoms : 251 ( 52 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 285 ( 112 ~; 109 |; 50 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 81 !; 10 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( X0 = slcrc0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(f9,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin_01) ).
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(f23,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(f47,axiom,
! [X0] :
( ( X0 != slcrc0
& aSubsetOf0(X0,szNzAzT0) )
=> ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( ! [X2] :
( aElementOf0(X2,X0)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).
fof(f75,axiom,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(f82,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(f91,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(f99,axiom,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
fof(f100,axiom,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5045) ).
fof(f101,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f102,negated_conjecture,
~ aElementOf0(xx,xS),
inference(negated_conjecture,[status(cth)],[f101]) ).
fof(f103,plain,
~ aElementOf0(xx,xS),
inference(flattening,[],[f102]) ).
fof(f115,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f131,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(ennf_transformation,[],[f91]) ).
fof(f150,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f189,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f190,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) ) ),
inference(flattening,[],[f189]) ).
fof(f211,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| X0 != slcrc0 ),
inference(ennf_transformation,[],[f9]) ).
fof(f212,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| X0 != slcrc0 ),
inference(flattening,[],[f211]) ).
fof(f213,plain,
! [X0] :
( X0 = slcrc0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f242,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(nnf_transformation,[],[f150]) ).
fof(f243,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(flattening,[],[f242]) ).
fof(f244,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ( aElementOf0(sK11(X0,X1),X1)
& ~ aElementOf0(sK11(X0,X1),X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X0,X1))],[f244]) ).
fof(f260,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( ( szmzizndt0(X0) != X1
| ( ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) )
& ( ? [X2] :
( aElementOf0(X2,X0)
& ~ sdtlseqdt0(X1,X2) )
| ~ aElementOf0(X1,X0)
| X1 = szmzizndt0(X0) ) ) ),
inference(nnf_transformation,[],[f190]) ).
fof(f261,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( ( szmzizndt0(X0) != X1
| ( ! [X2] :
( ~ aElementOf0(X2,X0)
| sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) )
& ( ? [X2] :
( aElementOf0(X2,X0)
& ~ sdtlseqdt0(X1,X2) )
| ~ aElementOf0(X1,X0)
| X1 = szmzizndt0(X0) ) ) ),
inference(flattening,[],[f260]) ).
fof(f262,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( ( szmzizndt0(X0) != X1
| ( ! [X3] :
( ~ aElementOf0(X3,X0)
| sdtlseqdt0(X1,X3) )
& aElementOf0(X1,X0) ) )
& ( ? [X2] :
( aElementOf0(X2,X0)
& ~ sdtlseqdt0(X1,X2) )
| ~ aElementOf0(X1,X0)
| X1 = szmzizndt0(X0) ) ) ),
inference(rectify,[],[f261]) ).
fof(f263,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| ! [X1] :
( ( szmzizndt0(X0) != X1
| ( ! [X3] :
( ~ aElementOf0(X3,X0)
| sdtlseqdt0(X1,X3) )
& aElementOf0(X1,X0) ) )
& ( ( aElementOf0(sK19(X0,X1),X0)
& ~ sdtlseqdt0(X1,sK19(X0,X1)) )
| ~ aElementOf0(X1,X0)
| X1 = szmzizndt0(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X2,sK19(X0,X1))],[f262]) ).
fof(f274,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(nnf_transformation,[],[f213]) ).
fof(f275,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(flattening,[],[f274]) ).
fof(f276,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(rectify,[],[f275]) ).
fof(f277,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) ) )
& ( aElementOf0(sK22(X0),X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22]),skolemize(X1,sK22(X0))],[f276]) ).
fof(f296,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f75]) ).
fof(f313,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f115]) ).
fof(f314,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f331,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f348,plain,
xx = sdtlpdtrp0(xe,xi),
inference(cnf_transformation,[],[f99]) ).
fof(f349,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f99]) ).
fof(f350,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnf_transformation,[],[f100]) ).
fof(f351,plain,
~ aElementOf0(xx,xS),
inference(cnf_transformation,[],[f103]) ).
fof(f360,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f364,plain,
! [X3,X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f365,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| aSet0(X1) ),
inference(cnf_transformation,[],[f245]) ).
fof(f419,plain,
! [X0,X1] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| szmzizndt0(X0) != X1
| aElementOf0(X1,X0) ),
inference(cnf_transformation,[],[f263]) ).
fof(f452,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f212]) ).
fof(f455,plain,
! [X0] :
( slcrc0 != X0
| aSet0(X0) ),
inference(cnf_transformation,[],[f277]) ).
fof(f494,plain,
! [X0] :
( slcrc0 = X0
| ~ aSubsetOf0(X0,szNzAzT0)
| aElementOf0(szmzizndt0(X0),X0) ),
inference(equality_resolution,[],[f419]) ).
fof(f503,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(equality_resolution,[],[f452]) ).
fof(f504,plain,
aSet0(slcrc0),
inference(equality_resolution,[],[f455]) ).
tcf(c_52,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f296]) ).
tcf(c_70,plain,
! [X0: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f314]) ).
tcf(c_71,plain,
! [X0: $i] :
( isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f313]) ).
tcf(c_90,plain,
! [X0: $i] :
( ( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0) )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f331]) ).
tcf(c_105,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f349]) ).
tcf(c_106,plain,
sdtlpdtrp0(xe,xi) = xx,
inference(cnf_transformation,[],[f348]) ).
tcf(c_107,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnf_transformation,[],[f350]) ).
tcf(c_108,negated_conjecture,
~ aElementOf0(xx,xS),
inference(cnf_transformation,[],[f351]) ).
tcf(c_116,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f360]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( aSet0(X0)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1) ),
inference(cnf_transformation,[],[f365]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f364]) ).
tcf(c_177,plain,
! [X0: $i] :
( aElementOf0(szmzizndt0(X0),X0)
| ( X0 = slcrc0 )
| ~ aSubsetOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f494]) ).
tcf(c_209,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_212,plain,
aSet0(slcrc0),
inference(cnf_transformation,[],[f504]) ).
tcf(c_372,plain,
~ isCountable0(slcrc0),
inference(global_subsumption_just,[status(thm)],[c_209,c_212,c_209]) ).
tcf(c_24122,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(superposition,[status(thm)],[c_52,c_123]) ).
tcf(c_24128,plain,
aSet0(xS),
inference(forward_subsumption_resolution,[status(thm)],[c_24122,c_116]) ).
tcf(c_25113,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_25207,plain,
szmzizndt0(sdtlpdtrp0(xN,xi)) = sdtlpdtrp0(xe,xi),
inference(superposition,[status(thm)],[c_105,c_90]) ).
tcf(c_25216,plain,
szmzizndt0(sdtlpdtrp0(xN,xi)) = xx,
inference(light_normalisation,[status(thm)],[c_25207,c_106]) ).
tcf(c_25721,plain,
! [X0: $i] :
( aElementOf0(X0,xS)
| ~ aSet0(xS)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(superposition,[status(thm)],[c_107,c_124]) ).
tcf(c_25737,plain,
! [X0: $i] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_25721,c_24128]) ).
tcf(c_26127,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS)
| ( sdtlpdtrp0(xN,xi) = slcrc0 )
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(superposition,[status(thm)],[c_177,c_25737]) ).
tcf(c_26132,plain,
( aElementOf0(xx,xS)
| ( sdtlpdtrp0(xN,xi) = slcrc0 )
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(light_normalisation,[status(thm)],[c_26127,c_25216]) ).
tcf(c_26133,plain,
( ( sdtlpdtrp0(xN,xi) = slcrc0 )
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26132,c_108]) ).
tcf(c_26386,plain,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(global_subsumption_just,[status(thm)],[c_26133,c_105,c_25113,c_26133]) ).
tcf(c_26397,plain,
( isCountable0(slcrc0)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(superposition,[status(thm)],[c_26386,c_71]) ).
tcf(c_26398,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_26397,c_372,c_105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n009.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.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 04:52:29 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 4.81/2.19 % SZS status Started for theBenchmark.p
% 4.81/2.19 % SZS status Theorem for theBenchmark.p
% 4.81/2.19
% 4.81/2.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.81/2.19
% 4.81/2.19 % ------ iProver source info
% 4.81/2.19
% 4.81/2.19 % git: date: 2026-07-19 20:42:38 +0200
% 4.81/2.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.81/2.19 % git: non_committed_changes: false
% 4.81/2.19
% 4.81/2.19 % ------ Parsing...
% 4.81/2.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.81/2.19
% 4.81/2.19 % ------ Preprocessing... sup_sim: 2 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.81/2.19
% 4.81/2.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.81/2.19
% 4.81/2.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.81/2.19 % ------ Proving...
% 4.81/2.19 % ------ Problem Properties
% 4.81/2.19
% 4.81/2.19 %
% 4.81/2.19 % clauses 189
% 4.81/2.19 % conjectures 1
% 4.81/2.19 % EPR 46
% 4.81/2.19 % Horn 155
% 4.81/2.19 % unary 40
% 4.81/2.19 % binary 32
% 4.81/2.19 % lits 611
% 4.81/2.19 % lits eq 93
% 4.81/2.19 % fd_pure 0
% 4.81/2.19 % fd_pseudo 0
% 4.81/2.19 % fd_cond 8
% 4.81/2.19 % fd_pseudo_cond 23
% 4.81/2.19 % AC symbols 0
% 4.81/2.19
% 4.81/2.19 % ------ Schedule dynamic 5 is on
% 4.81/2.19
% 4.81/2.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.81/2.19
% 4.81/2.19
% 4.81/2.19 % ------
% 4.81/2.19 % Current options:
% 4.81/2.19 % ------
% 4.81/2.19
% 4.81/2.19
% 4.81/2.19 %
% 4.81/2.19
% 4.81/2.19 % ------ Proving...
% 4.81/2.19 %
% 4.81/2.19
% 4.81/2.19 % SZS status Theorem for theBenchmark.p
% 4.81/2.19
% 4.81/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.81/2.19
% 4.81/2.19
%------------------------------------------------------------------------------