%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM596+3 : 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 : n018.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:49:42 PM UTC 2026
% Result : Theorem 70.93s 13.27s
% Output : CNFRefutation 70.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 58 ( 21 unt; 0 def)
% Number of atoms : 222 ( 44 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 274 ( 110 ~; 111 |; 38 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 0 sgn 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4758,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
=> aElementOf0(X1,xT) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
<=> ? [X2] :
( sdtlpdtrp0(xd,X2) = X1
& aElementOf0(X2,szDzozmdt0(xd)) ) )
& aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4758) ).
fof(m__4730,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( ( aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
| ( sbrdtbr0(X2) = xk
& ( aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
| ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) )
& aSet0(X2) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mDefPtt) ).
fof(mSubFSet,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubFSet) ).
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/sandbox/benchmark/theBenchmark.p',mDirichlet) ).
fof(m__3291,hypothesis,
( isFinite0(xT)
& aSet0(xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3291) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__,conjecture,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(c_0_11,hypothesis,
! [X240,X242,X243,X244] :
( aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
& ( aElementOf0(X244,xT)
| ~ aElementOf0(X244,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( aElementOf0(X242,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| sdtlpdtrp0(xd,X243) != X242
| ~ aElementOf0(X243,szDzozmdt0(xd)) )
& ( ~ aElementOf0(X240,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| sdtlpdtrp0(xd,esk37_1(X240)) = X240 )
& ( ~ aElementOf0(X240,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(esk37_1(X240),szDzozmdt0(xd)) )
& aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
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)],[m__4758])])])])])])]) ).
fof(c_0_12,hypothesis,
! [X237,X238] :
( ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| ~ aElementOf0(X238,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X237)),xk)) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| ~ aSubsetOf0(X238,sdtlpdtrp0(xN,szszuzczcdt0(X237))) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| ~ aElementOf0(esk36_2(X237,X238),sdtlpdtrp0(xN,szszuzczcdt0(X237))) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| aElementOf0(esk36_2(X237,X238),X238) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])])])])]) ).
fof(c_0_13,plain,
! [X145,X146,X147,X148,X149,X150] :
( ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X150 = sdtlbdtrb0(X145,X146)
| ~ aSet0(X150)
| aElementOf0(esk13_3(X145,X146,X150),X150)
| sdtlpdtrp0(X145,esk13_3(X145,X146,X150)) = X146 )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X150 = sdtlbdtrb0(X145,X146)
| ~ aSet0(X150)
| aElementOf0(esk13_3(X145,X146,X150),X150)
| aElementOf0(esk13_3(X145,X146,X150),szDzozmdt0(X145)) )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X150 = sdtlbdtrb0(X145,X146)
| ~ aSet0(X150)
| sdtlpdtrp0(X145,esk13_3(X145,X146,X150)) != X146
| ~ aElementOf0(esk13_3(X145,X146,X150),szDzozmdt0(X145))
| ~ aElementOf0(esk13_3(X145,X146,X150),X150) )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X147 != sdtlbdtrb0(X145,X146)
| aElementOf0(X149,X147)
| sdtlpdtrp0(X145,X149) != X146
| ~ aElementOf0(X149,szDzozmdt0(X145)) )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X147 != sdtlbdtrb0(X145,X146)
| ~ aElementOf0(X148,X147)
| sdtlpdtrp0(X145,X148) = X146 )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X147 != sdtlbdtrb0(X145,X146)
| ~ aElementOf0(X148,X147)
| aElementOf0(X148,szDzozmdt0(X145)) )
& ( ~ aElement0(X146)
| ~ aFunction0(X145)
| X147 != sdtlbdtrb0(X145,X146)
| aSet0(X147) ) ),
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,
! [X25,X26] :
( isFinite0(X26)
| ~ aSubsetOf0(X26,X25)
| ~ isFinite0(X25)
| ~ aSet0(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])])]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ aElement0(X3)
| ~ aFunction0(X2)
| X1 != sdtlbdtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X177] :
( ( ~ aFunction0(X177)
| ~ isFinite0(sdtlcdtrc0(X177,szDzozmdt0(X177)))
| ~ isCountable0(szDzozmdt0(X177))
| isCountable0(sdtlbdtrb0(X177,szDzizrdt0(X177))) )
& ( ~ aFunction0(X177)
| ~ isFinite0(sdtlcdtrc0(X177,szDzozmdt0(X177)))
| ~ isCountable0(szDzozmdt0(X177))
| aElement0(szDzizrdt0(X177)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDirichlet])])])]) ).
cnf(c_0_19,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szNzAzT0),xT),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
isFinite0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_22,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_23,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| aSet0(sdtlbdtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( ~ aFunction0(X1)
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ isCountable0(szDzozmdt0(X1))
| aElement0(szDzizrdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
isCountable0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_27,hypothesis,
isFinite0(sdtlcdtrc0(xd,szNzAzT0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
fof(c_0_28,plain,
! [X13,X14,X15] :
( ( X15 = slcrc0
| aElementOf0(esk1_1(X15),X15)
| ~ aSet0(X15) )
& ( X13 != slcrc0
| ~ aElementOf0(X14,X13) )
& ( X13 != slcrc0
| aSet0(X13) ) ),
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_29,hypothesis,
( ~ aElement0(X1)
| aSet0(sdtlbdtrb0(xd,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,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_25,c_0_16]),c_0_24]),c_0_26]),c_0_27])]) ).
fof(c_0_31,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_32,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
cnf(c_0_33,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,hypothesis,
( sdtlpdtrp0(xd,X1) != X2
| ~ aElementOf0(X1,szDzozmdt0(xd))
| aElementOf0(X2,sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,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_36,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,hypothesis,
aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_38,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_39,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_40,plain,
! [X18] :
( ~ isFinite0(X18)
| ~ isCountable0(X18)
| ~ aSet0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
cnf(c_0_41,plain,
( ~ aFunction0(X1)
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ isCountable0(szDzozmdt0(X1))
| isCountable0(sdtlbdtrb0(X1,szDzizrdt0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_42,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0))
| aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_43,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),sdtlcdtrc0(xd,szNzAzT0)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_16]),c_0_16])]) ).
cnf(c_0_44,plain,
( ~ aElement0(X3)
| ~ aElementOf0(X2,sdtlbdtrb0(X1,X3))
| ~ aFunction0(X1)
| sdtlpdtrp0(X1,X2) = X3 ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_45,hypothesis,
( aElementOf0(esk1_1(sdtlbdtrb0(xd,szDzizrdt0(xd))),sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlbdtrb0(xd,szDzizrdt0(xd)) = slcrc0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_46,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_nnf,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
( ~ aElement0(X3)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3))
| ~ aFunction0(X2)
| aElementOf0(X1,szDzozmdt0(X2)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,hypothesis,
isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_16]),c_0_24]),c_0_26]),c_0_27])]) ).
cnf(c_0_50,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),xT) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,hypothesis,
( sdtlbdtrb0(xd,szDzizrdt0(xd)) = slcrc0
| sdtlpdtrp0(xd,esk1_1(sdtlbdtrb0(xd,szDzizrdt0(xd)))) = szDzizrdt0(xd) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_24]),c_0_30])]) ).
cnf(c_0_52,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,hypothesis,
( aElementOf0(esk1_1(sdtlbdtrb0(xd,szDzizrdt0(xd))),szNzAzT0)
| sdtlbdtrb0(xd,szDzizrdt0(xd)) = slcrc0 ),
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_45]),c_0_16]),c_0_24]),c_0_30])]) ).
cnf(c_0_54,hypothesis,
~ isFinite0(sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37])]) ).
cnf(c_0_55,hypothesis,
sdtlbdtrb0(xd,szDzizrdt0(xd)) = slcrc0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]) ).
cnf(c_0_56,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[mEmpFin]) ).
cnf(c_0_57,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM596+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n018.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.45 % DateTime : Mon Sep 21 02:45:14 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.54 Running first-order theorem proving
% 0.24/0.54 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
% 70.93/13.27 % Version: 3.5.1
% 70.93/13.27 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.93/13.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.93/13.27 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.93/13.27 % Starting new_bool_3 with 300s (1) cores
% 70.93/13.27 % Starting new_bool_1 with 300s (1) cores
% 70.93/13.27 % Starting sh5l with 300s (1) cores
% 70.93/13.27 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 796908 completed with status 0
% 70.93/13.27 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 70.93/13.27 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.93/13.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.93/13.27 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.93/13.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.93/13.27 % No SInE strategy applied
% 70.93/13.27 % Search class: FGHSF-SMLM32-MFFFFFNN
% 70.93/13.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.93/13.27 % Starting SubtermCWHack with 136s (1) cores
% 70.93/13.27 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 70.93/13.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 70.93/13.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 70.93/13.27 % Starting new_bool_3 with 136s (1) cores
% 70.93/13.27 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 796916 completed with status 0
% 70.93/13.27 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 70.93/13.27 % Preprocessing class: FSLSSMSMSSSNFFN.
% 70.93/13.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.93/13.27 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 70.93/13.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.93/13.27 % No SInE strategy applied
% 70.93/13.27 % Search class: FGHSF-SMLM32-MFFFFFNN
% 70.93/13.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.93/13.27 % Starting SubtermCWHack with 136s (1) cores
% 70.93/13.27 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 70.93/13.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 70.93/13.27 % Preprocessing time : 0.206 s
% 70.93/13.27 % Presaturation interreduction done
% 70.93/13.27
% 70.93/13.27 % Proof found!
% 70.93/13.27 % SZS status Theorem
% 70.93/13.27 % SZS output start CNFRefutation
% See solution above
% 70.93/13.27 % Parsed axioms : 94
% 70.93/13.27 % Removed by relevancy pruning/SinE : 0
% 70.93/13.27 % Initial clauses : 4851
% 70.93/13.27 % Removed in clause preprocessing : 7
% 70.93/13.27 % Initial clauses in saturation : 4844
% 70.93/13.27 % Processed clauses : 9376
% 70.93/13.27 % ...of these trivial : 33
% 70.93/13.27 % ...subsumed : 1317
% 70.93/13.27 % ...remaining for further processing : 8026
% 70.93/13.27 % Other redundant clauses eliminated : 2037
% 70.93/13.27 % Clauses deleted for lack of memory : 0
% 70.93/13.27 % Backward-subsumed : 132
% 70.93/13.27 % Backward-rewritten : 72
% 70.93/13.27 % Generated clauses : 35682
% 70.93/13.27 % ...of the previous two non-redundant : 31976
% 70.93/13.27 % ...aggressively subsumed : 0
% 70.93/13.27 % Contextual simplify-reflections : 129
% 70.93/13.27 % Paramodulations : 33844
% 70.93/13.27 % Factorizations : 0
% 70.93/13.27 % NegExts : 0
% 70.93/13.27 % Equation resolutions : 2038
% 70.93/13.27 % Disequality decompositions : 0
% 70.93/13.27 % Total rewrite steps : 7856
% 70.93/13.27 % ...of those cached : 7603
% 70.93/13.27 % Propositional unsat checks : 2
% 70.93/13.27 % Propositional check models : 2
% 70.93/13.27 % Propositional check unsatisfiable : 0
% 70.93/13.27 % Propositional clauses : 0
% 70.93/13.27 % Propositional clauses after purity: 0
% 70.93/13.27 % Propositional unsat core size : 0
% 70.93/13.27 % Propositional preprocessing time : 0.000
% 70.93/13.27 % Propositional encoding time : 0.039
% 70.93/13.27 % Propositional solver time : 0.002
% 70.93/13.27 % Success case prop preproc time : 0.000
% 70.93/13.27 % Success case prop encoding time : 0.000
% 70.93/13.27 % Success case prop solver time : 0.000
% 70.93/13.27 % Current number of processed clauses : 2038
% 70.93/13.27 % Positive orientable unit clauses : 683
% 70.93/13.27 % Positive unorientable unit clauses: 0
% 70.93/13.27 % Negative unit clauses : 157
% 70.93/13.27 % Non-unit-clauses : 1198
% 70.93/13.27 % Current number of unprocessed clauses: 31225
% 70.93/13.27 % ...number of literals in the above : 105753
% 70.93/13.27 % Current number of archived formulas : 0
% 70.93/13.27 % Current number of archived clauses : 4151
% 70.93/13.27 % Clause-clause subsumption calls (NU) : 10053819
% 70.93/13.27 % Rec. Clause-clause subsumption calls : 156467
% 70.93/13.27 % Non-unit clause-clause subsumptions : 1271
% 70.93/13.27 % Unit Clause-clause subsumption calls : 31064
% 70.93/13.27 % Rewrite failures with RHS unbound : 0
% 70.93/13.27 % BW rewrite match attempts : 6288
% 70.93/13.27 % BW rewrite match successes : 28
% 70.93/13.27 % Condensation attempts : 0
% 70.93/13.27 % Condensation successes : 0
% 70.93/13.27 % Termbank termtop insertions : 1423511
% 70.93/13.27 % Search garbage collected termcells : 31617
% 70.93/13.27
% 70.93/13.27 % -------------------------------------------------
% 70.93/13.27 % User time : 11.388 s
% 70.93/13.27 % System time : 0.105 s
% 70.93/13.27 % Total time : 11.493 s
% 70.93/13.27 % Maximum resident set size: 15832 pages
% 70.93/13.27
% 70.93/13.27 % -------------------------------------------------
% 70.93/13.27 % User time : 58.647 s
% 70.93/13.27 % System time : 0.455 s
% 70.93/13.27 % Total time : 59.103 s
% 70.93/13.27 % Maximum resident set size: 5120 pages
% 70.93/13.27 % E exiting
%------------------------------------------------------------------------------