%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM601+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Thu Sep 24 01:55:39 PM UTC 2026
% Result : Theorem 28.93s 4.81s
% Output : CNFRefutation 28.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 62 ( 15 unt; 0 def)
% Number of atoms : 209 ( 41 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 235 ( 88 ~; 88 |; 39 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 8 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefMin,axiom,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefMin) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
fof(m__3623,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__4660,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4660) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin_01) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__4982,hypothesis,
! [X1] :
( aElementOf0(X1,xO)
=> ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(X2,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
fof(m__,conjecture,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4891) ).
fof(c_0_15,plain,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[mDefMin]) ).
fof(c_0_16,hypothesis,
! [X185,X186] :
( aSubsetOf0(sdtlpdtrp0(xN,X185),sdtlpdtrp0(xN,X186))
| ~ sdtlseqdt0(X186,X185)
| ~ aElementOf0(X186,szNzAzT0)
| ~ aElementOf0(X185,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])]) ).
fof(c_0_17,hypothesis,
! [X183] :
( ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X183))) )
& ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X183)),sdtmndt0(sdtlpdtrp0(xN,X183),szmzizndt0(sdtlpdtrp0(xN,X183)))) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])]) ).
fof(c_0_18,plain,
! [X66] :
( sdtlseqdt0(sz00,X66)
| ~ aElementOf0(X66,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])])]) ).
fof(c_0_19,plain,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
fof(c_0_20,plain,
! [X94,X95,X96,X97] :
( ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| ~ sdtlseqdt0(X97,esk7_2(X94,X97)) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| aElementOf0(esk7_2(X94,X97),X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| sdtlseqdt0(X95,X96)
| ~ aElementOf0(X96,X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| aElementOf0(X95,X94) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])])]) ).
cnf(c_0_21,hypothesis,
( ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_24,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_27,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_28,plain,
( ~ aSubsetOf0(X2,szNzAzT0)
| X1 != szmzizndt0(X2)
| X2 = slcrc0
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_29,hypothesis,
! [X204] :
( ( sdtlpdtrp0(xe,X204) = szmzizndt0(sdtlpdtrp0(xN,X204))
| ~ aElementOf0(X204,szNzAzT0) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])]) ).
fof(c_0_30,hypothesis,
! [X184] :
( ( ~ aElementOf0(X184,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X184)) )
& ( ~ aElementOf0(X184,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X184),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])]) ).
cnf(c_0_31,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),xS) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_33,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,plain,
( ~ aSubsetOf0(X1,szNzAzT0)
| aElementOf0(szmzizndt0(X1),X1)
| X1 = slcrc0 ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_35,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
inference(fof_simplification,[status(thm)],[mCountNFin_01]) ).
fof(c_0_38,plain,
! [X12,X13,X14] :
( ( X14 = slcrc0
| aElementOf0(esk1_1(X14),X14)
| ~ aSet0(X14) )
& ( X12 != slcrc0
| ~ aElementOf0(X13,X12) )
& ( X12 != slcrc0
| aSet0(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefEmp])])])])])])]) ).
cnf(c_0_39,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
| aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_40,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| sdtlpdtrp0(xN,X1) = slcrc0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
fof(c_0_41,hypothesis,
! [X207] :
( ( ~ aElementOf0(X207,xO)
| sdtlpdtrp0(xe,esk25_1(X207)) = X207 )
& ( ~ aElementOf0(X207,xO)
| aElementOf0(esk25_1(X207),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X207,xO)
| aElementOf0(esk25_1(X207),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])]) ).
fof(c_0_42,plain,
! [X18] :
( X18 != slcrc0
| ~ isCountable0(X18)
| ~ aSet0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_43,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X1),xS)
| sdtlpdtrp0(xN,X1) = slcrc0 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,hypothesis,
( ~ aElementOf0(X1,xO)
| sdtlpdtrp0(xe,esk25_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(esk25_1(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_43]) ).
fof(c_0_49,negated_conjecture,
~ aSubsetOf0(xO,xS),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_50,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_51,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS)
| sdtlpdtrp0(xN,esk25_1(X1)) = slcrc0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_48])]) ).
fof(c_0_53,negated_conjecture,
~ aSubsetOf0(xO,xS),
inference(fof_simplification,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_55,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_46]) ).
fof(c_0_56,negated_conjecture,
~ aSubsetOf0(xO,xS),
inference(fof_nnf,[status(thm)],[c_0_53]) ).
cnf(c_0_57,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(esk2_2(xS,X1),xO)
| aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_33])]) ).
cnf(c_0_58,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_59,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_60,negated_conjecture,
~ aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_61,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_33])]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM601+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n015.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 02:47:05 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.93/4.80 % Version: 3.5.1
% 28.93/4.80 % Preprocessing class: FSLSSMSMSSSNFFN.
% 28.93/4.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.93/4.80 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 28.93/4.80 % Starting new_bool_3 with 300s (1) cores
% 28.93/4.80 % Starting new_bool_1 with 300s (1) cores
% 28.93/4.80 % Starting sh5l with 300s (1) cores
% 28.93/4.80 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 389141 completed with status 0
% 28.93/4.80 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 28.93/4.80 % Preprocessing class: FSLSSMSMSSSNFFN.
% 28.93/4.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.93/4.80 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 28.93/4.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.93/4.80 % No SInE strategy applied
% 28.93/4.80 % Search class: FGHSF-FSLM31-MFFFFFNN
% 28.93/4.80 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 28.93/4.80 % Starting SubtermCWHack with 136s (1) cores
% 28.93/4.80 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 28.93/4.80 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 28.93/4.80 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 28.93/4.81 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 28.93/4.81 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 389150 completed with status 0
% 28.93/4.81 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 28.93/4.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 28.93/4.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.93/4.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 28.93/4.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.93/4.81 % No SInE strategy applied
% 28.93/4.81 % Search class: FGHSF-FSLM31-MFFFFFNN
% 28.93/4.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 28.93/4.81 % Starting SubtermCWHack with 136s (1) cores
% 28.93/4.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 28.93/4.81 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 28.93/4.81 % Preprocessing time : 0.004 s
% 28.93/4.81 % Presaturation interreduction done
% 28.93/4.81
% 28.93/4.81 % Proof found!
% 28.93/4.81 % SZS status Theorem
% 28.93/4.81 % SZS output start CNFRefutation
% See solution above
% 28.93/4.81 % Parsed axioms : 98
% 28.93/4.81 % Removed by relevancy pruning/SinE : 0
% 28.93/4.81 % Initial clauses : 200
% 28.93/4.81 % Removed in clause preprocessing : 7
% 28.93/4.81 % Initial clauses in saturation : 193
% 28.93/4.81 % Processed clauses : 19286
% 28.93/4.81 % ...of these trivial : 87
% 28.93/4.81 % ...subsumed : 14659
% 28.93/4.81 % ...remaining for further processing : 4540
% 28.93/4.81 % Other redundant clauses eliminated : 218
% 28.93/4.81 % Clauses deleted for lack of memory : 0
% 28.93/4.81 % Backward-subsumed : 437
% 28.93/4.81 % Backward-rewritten : 49
% 28.93/4.81 % Generated clauses : 125075
% 28.93/4.81 % ...of the previous two non-redundant : 117949
% 28.93/4.81 % ...aggressively subsumed : 0
% 28.93/4.81 % Contextual simplify-reflections : 897
% 28.93/4.81 % Paramodulations : 124848
% 28.93/4.81 % Factorizations : 0
% 28.93/4.81 % NegExts : 0
% 28.93/4.81 % Equation resolutions : 228
% 28.93/4.81 % Disequality decompositions : 0
% 28.93/4.81 % Total rewrite steps : 66106
% 28.93/4.81 % ...of those cached : 66002
% 28.93/4.81 % Propositional unsat checks : 0
% 28.93/4.81 % Propositional check models : 0
% 28.93/4.81 % Propositional check unsatisfiable : 0
% 28.93/4.81 % Propositional clauses : 0
% 28.93/4.81 % Propositional clauses after purity: 0
% 28.93/4.81 % Propositional unsat core size : 0
% 28.93/4.81 % Propositional preprocessing time : 0.000
% 28.93/4.81 % Propositional encoding time : 0.000
% 28.93/4.81 % Propositional solver time : 0.000
% 28.93/4.81 % Success case prop preproc time : 0.000
% 28.93/4.81 % Success case prop encoding time : 0.000
% 28.93/4.81 % Success case prop solver time : 0.000
% 28.93/4.81 % Current number of processed clauses : 3819
% 28.93/4.81 % Positive orientable unit clauses : 105
% 28.93/4.81 % Positive unorientable unit clauses: 0
% 28.93/4.81 % Negative unit clauses : 55
% 28.93/4.81 % Non-unit-clauses : 3659
% 28.93/4.81 % Current number of unprocessed clauses: 96043
% 28.93/4.81 % ...number of literals in the above : 683629
% 28.93/4.81 % Current number of archived formulas : 0
% 28.93/4.81 % Current number of archived clauses : 681
% 28.93/4.81 % Clause-clause subsumption calls (NU) : 1824370
% 28.93/4.81 % Rec. Clause-clause subsumption calls : 346877
% 28.93/4.81 % Non-unit clause-clause subsumptions : 11465
% 28.93/4.81 % Unit Clause-clause subsumption calls : 13737
% 28.93/4.81 % Rewrite failures with RHS unbound : 0
% 28.93/4.81 % BW rewrite match attempts : 31
% 28.93/4.81 % BW rewrite match successes : 26
% 28.93/4.81 % Condensation attempts : 0
% 28.93/4.81 % Condensation successes : 0
% 28.93/4.81 % Termbank termtop insertions : 3114727
% 28.93/4.81 % Search garbage collected termcells : 3728
% 28.93/4.81
% 28.93/4.81 % -------------------------------------------------
% 28.93/4.81 % User time : 4.013 s
% 28.93/4.81 % System time : 0.115 s
% 28.93/4.81 % Total time : 4.127 s
% 28.93/4.81 % Maximum resident set size: 4276 pages
% 28.93/4.81
% 28.93/4.81 % -------------------------------------------------
% 28.93/4.81 % User time : 19.718 s
% 28.93/4.81 % System time : 0.592 s
% 28.93/4.81 % Total time : 20.310 s
% 28.93/4.81 % Maximum resident set size: 4608 pages
% 28.93/4.81 % E exiting
%------------------------------------------------------------------------------