%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM596+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:38 PM UTC 2026
% Result : Theorem 0.24s 0.60s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 18 unt; 0 def)
% Number of atoms : 220 ( 38 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 277 ( 116 ~; 115 |; 29 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 79 ( 0 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4730,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
& aSet0(X2) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(mDefPtt,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aFunction0(X1) )
=> ! [X3] :
( X3 = sdtlbdtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sdtlpdtrp0(X1,X4) = X2
& aElementOf0(X4,szDzozmdt0(X1)) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPtt) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4758,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4758) ).
fof(mImgRng,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mImgRng) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin_01) ).
fof(m__3291,hypothesis,
( isFinite0(xT)
& aSet0(xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3291) ).
fof(mSubFSet,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubFSet) ).
fof(m__,conjecture,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDirichlet,axiom,
! [X1] :
( aFunction0(X1)
=> ( ( isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
& isCountable0(szDzozmdt0(X1)) )
=> ( isCountable0(sdtlbdtrb0(X1,szDzizrdt0(X1)))
& aElement0(szDzizrdt0(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDirichlet) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(c_0_12,hypothesis,
! [X205,X206] :
( ( sdtlpdtrp0(xd,X205) = sdtlpdtrp0(sdtlpdtrp0(xC,X205),X206)
| ~ aElementOf0(X206,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X205)),xk))
| ~ aSet0(X206)
| ~ aElementOf0(X205,szNzAzT0) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])])]) ).
fof(c_0_13,plain,
! [X144,X145,X146,X147,X148,X149] :
( ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X149 = sdtlbdtrb0(X144,X145)
| ~ aSet0(X149)
| aElementOf0(esk13_3(X144,X145,X149),X149)
| sdtlpdtrp0(X144,esk13_3(X144,X145,X149)) = X145 )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X149 = sdtlbdtrb0(X144,X145)
| ~ aSet0(X149)
| aElementOf0(esk13_3(X144,X145,X149),X149)
| aElementOf0(esk13_3(X144,X145,X149),szDzozmdt0(X144)) )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X149 = sdtlbdtrb0(X144,X145)
| ~ aSet0(X149)
| sdtlpdtrp0(X144,esk13_3(X144,X145,X149)) != X145
| ~ aElementOf0(esk13_3(X144,X145,X149),szDzozmdt0(X144))
| ~ aElementOf0(esk13_3(X144,X145,X149),X149) )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X146 != sdtlbdtrb0(X144,X145)
| aElementOf0(X148,X146)
| sdtlpdtrp0(X144,X148) != X145
| ~ aElementOf0(X148,szDzozmdt0(X144)) )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X146 != sdtlbdtrb0(X144,X145)
| ~ aElementOf0(X147,X146)
| sdtlpdtrp0(X144,X147) = X145 )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X146 != sdtlbdtrb0(X144,X145)
| ~ aElementOf0(X147,X146)
| aElementOf0(X147,szDzozmdt0(X144)) )
& ( ~ aElement0(X145)
| ~ aFunction0(X144)
| X146 != sdtlbdtrb0(X144,X145)
| aSet0(X146) ) ),
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)],[mDefPtt])])])])])])]) ).
fof(c_0_14,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])])])])])])]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
inference(split_conjunct,[status(thm)],[m__4758]) ).
cnf(c_0_16,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X164,X165] :
( aElementOf0(sdtlpdtrp0(X164,X165),sdtlcdtrc0(X164,szDzozmdt0(X164)))
| ~ aElementOf0(X165,szDzozmdt0(X164))
| ~ aFunction0(X164) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mImgRng])])])]) ).
cnf(c_0_18,plain,
( ~ aElement0(X4)
| ~ aFunction0(X2)
| X3 != sdtlbdtrb0(X2,X4)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,szDzozmdt0(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,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_20,plain,
( ~ aElement0(X3)
| ~ aFunction0(X2)
| X1 != sdtlbdtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
inference(fof_simplification,[status(thm)],[mCountNFin_01]) ).
cnf(c_0_22,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szNzAzT0),xT),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_25,plain,
( ~ aElementOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( ~ aElement0(X3)
| ~ aFunction0(X1)
| X4 != sdtlbdtrb0(X1,X3)
| ~ aElementOf0(X2,X4)
| sdtlpdtrp0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( ~ aElement0(X3)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3))
| ~ aFunction0(X2)
| aElementOf0(X1,szDzozmdt0(X2)) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| aSet0(sdtlbdtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_20]) ).
fof(c_0_31,plain,
! [X24,X25] :
( isFinite0(X25)
| ~ aSubsetOf0(X25,X24)
| ~ isFinite0(X24)
| ~ aSet0(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])])]) ).
fof(c_0_32,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_21])])]) ).
fof(c_0_33,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_34,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0))
| aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_35,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),sdtlcdtrc0(xd,szNzAzT0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26])]) ).
cnf(c_0_36,plain,
( ~ aElement0(X3)
| ~ aElementOf0(X2,sdtlbdtrb0(X1,X3))
| ~ aFunction0(X1)
| sdtlpdtrp0(X1,X2) = X3 ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| aElementOf0(esk1_1(sdtlbdtrb0(X1,X2)),szDzozmdt0(X1))
| sdtlbdtrb0(X1,X2) = slcrc0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
fof(c_0_38,plain,
! [X176] :
( ( ~ aFunction0(X176)
| ~ isFinite0(sdtlcdtrc0(X176,szDzozmdt0(X176)))
| ~ isCountable0(szDzozmdt0(X176))
| isCountable0(sdtlbdtrb0(X176,szDzizrdt0(X176))) )
& ( ~ aFunction0(X176)
| ~ isFinite0(sdtlcdtrc0(X176,szDzozmdt0(X176)))
| ~ isCountable0(szDzozmdt0(X176))
| aElement0(szDzizrdt0(X176)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDirichlet])])])]) ).
cnf(c_0_39,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,hypothesis,
isFinite0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_41,plain,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_43,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
cnf(c_0_44,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),xT) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| sdtlbdtrb0(X1,X2) = slcrc0
| sdtlpdtrp0(X1,esk1_1(sdtlbdtrb0(X1,X2))) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_30]) ).
cnf(c_0_46,hypothesis,
( ~ aElement0(X1)
| aElementOf0(esk1_1(sdtlbdtrb0(xd,X1)),szNzAzT0)
| sdtlbdtrb0(xd,X1) = slcrc0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_26])]) ).
cnf(c_0_47,plain,
( ~ aFunction0(X1)
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ isCountable0(szDzozmdt0(X1))
| aElement0(szDzizrdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
isCountable0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_49,hypothesis,
isFinite0(sdtlcdtrc0(xd,szNzAzT0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_40]),c_0_24])]) ).
cnf(c_0_50,plain,
( ~ aSet0(slcrc0)
| ~ isCountable0(slcrc0) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_51,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_42]) ).
fof(c_0_52,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_nnf,[status(thm)],[c_0_43]) ).
cnf(c_0_53,plain,
( ~ aFunction0(X1)
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ isCountable0(szDzozmdt0(X1))
| isCountable0(sdtlbdtrb0(X1,szDzizrdt0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_54,hypothesis,
( ~ aElement0(X1)
| aElementOf0(X1,xT)
| sdtlbdtrb0(xd,X1) = slcrc0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_26])]),c_0_46]) ).
cnf(c_0_55,hypothesis,
aElement0(szDzizrdt0(xd)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_16]),c_0_26]),c_0_48]),c_0_49])]) ).
cnf(c_0_56,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_57,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_26]),c_0_16]),c_0_48]),c_0_16]),c_0_49]),c_0_55])]),c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM596+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n002.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 02:45:47 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.24/0.60 % Version: 3.5.1
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60 % Starting sh5l with 300s (1) cores
% 0.24/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2258539 completed with status 0
% 0.24/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.60 % No SInE strategy applied
% 0.24/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.24/0.60 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.24/0.60 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2258553 completed with status 0
% 0.24/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.24/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.60 % No SInE strategy applied
% 0.24/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.60 % Preprocessing time : 0.003 s
% 0.24/0.60 % Presaturation interreduction done
% 0.24/0.60
% 0.24/0.60 % Proof found!
% 0.24/0.60 % SZS status Theorem
% 0.24/0.60 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 94
% 0.24/0.61 % Removed by relevancy pruning/SinE : 0
% 0.24/0.61 % Initial clauses : 191
% 0.24/0.61 % Removed in clause preprocessing : 7
% 0.24/0.61 % Initial clauses in saturation : 184
% 0.24/0.61 % Processed clauses : 1666
% 0.24/0.61 % ...of these trivial : 5
% 0.24/0.61 % ...subsumed : 756
% 0.24/0.61 % ...remaining for further processing : 905
% 0.24/0.61 % Other redundant clauses eliminated : 66
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 49
% 0.24/0.61 % Backward-rewritten : 7
% 0.24/0.61 % Generated clauses : 3772
% 0.24/0.61 % ...of the previous two non-redundant : 3439
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 126
% 0.24/0.61 % Paramodulations : 3707
% 0.24/0.61 % Factorizations : 0
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 70
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 2191
% 0.24/0.61 % ...of those cached : 2130
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 626
% 0.24/0.61 % Positive orientable unit clauses : 64
% 0.24/0.61 % Positive unorientable unit clauses: 0
% 0.24/0.61 % Negative unit clauses : 29
% 0.24/0.61 % Non-unit-clauses : 533
% 0.24/0.61 % Current number of unprocessed clauses: 2088
% 0.24/0.61 % ...number of literals in the above : 12179
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 239
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 48770
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 17865
% 0.24/0.61 % Non-unit clause-clause subsumptions : 561
% 0.24/0.61 % Unit Clause-clause subsumption calls : 886
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 7
% 0.24/0.61 % BW rewrite match successes : 7
% 0.24/0.61 % Condensation attempts : 0
% 0.24/0.61 % Condensation successes : 0
% 0.24/0.61 % Termbank termtop insertions : 86251
% 0.24/0.61 % Search garbage collected termcells : 3702
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.099 s
% 0.24/0.61 % System time : 0.010 s
% 0.24/0.61 % Total time : 0.109 s
% 0.24/0.61 % Maximum resident set size: 3964 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.438 s
% 0.24/0.61 % System time : 0.040 s
% 0.24/0.61 % Total time : 0.478 s
% 0.24/0.61 % Maximum resident set size: 4608 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------