TSTP Solution File: NUM596+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM596+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:53 EDT 2023
% Result : Theorem 1.17s 0.70s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 57 ( 16 unt; 0 def)
% Number of atoms : 219 ( 38 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 277 ( 115 ~; 118 |; 28 &)
% ( 4 <=>; 12 =>; 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; 37 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4730,hypothesis,
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',m__4730) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mDefSub) ).
fof(m__4758,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.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/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mImgRng) ).
fof(mDefPtt,axiom,
! [X1,X2] :
( ( aFunction0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtlbdtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElementOf0(X4,szDzozmdt0(X1))
& sdtlpdtrp0(X1,X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mDefPtt) ).
fof(m__3291,hypothesis,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',m__3291) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mDefEmp) ).
fof(mSubFSet,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mSubFSet) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mCountNFin_01) ).
fof(mDirichlet,axiom,
! [X1] :
( aFunction0(X1)
=> ( ( isCountable0(szDzozmdt0(X1))
& isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1))) )
=> ( aElement0(szDzizrdt0(X1))
& isCountable0(sdtlbdtrb0(X1,szDzizrdt0(X1))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mDirichlet) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',mNATSet) ).
fof(m__,conjecture,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p',m__) ).
fof(c_0_12,hypothesis,
! [X196,X197] :
( aFunction0(xd)
& szDzozmdt0(xd) = szNzAzT0
& ( ~ aElementOf0(X196,szNzAzT0)
| ~ aSet0(X197)
| ~ aElementOf0(X197,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X196)),xk))
| sdtlpdtrp0(xd,X196) = sdtlpdtrp0(sdtlpdtrp0(xC,X196),X197) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])]) ).
fof(c_0_13,plain,
! [X15,X16,X17,X18] :
( ( aSet0(X16)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(X17,X16)
| aElementOf0(X17,X15)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( aElementOf0(esk2_2(X15,X18),X18)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(esk2_2(X15,X18),X15)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) ) ),
inference(distribute,[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_14,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
inference(split_conjunct,[status(thm)],[m__4758]) ).
cnf(c_0_15,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X155,X156] :
( ~ aFunction0(X155)
| ~ aElementOf0(X156,szDzozmdt0(X155))
| aElementOf0(sdtlpdtrp0(X155,X156),sdtlcdtrc0(X155,szDzozmdt0(X155))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mImgRng])])]) ).
fof(c_0_17,plain,
! [X135,X136,X137,X138,X139,X140] :
( ( aSet0(X137)
| X137 != sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( aElementOf0(X138,szDzozmdt0(X135))
| ~ aElementOf0(X138,X137)
| X137 != sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( sdtlpdtrp0(X135,X138) = X136
| ~ aElementOf0(X138,X137)
| X137 != sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( ~ aElementOf0(X139,szDzozmdt0(X135))
| sdtlpdtrp0(X135,X139) != X136
| aElementOf0(X139,X137)
| X137 != sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( ~ aElementOf0(esk13_3(X135,X136,X140),X140)
| ~ aElementOf0(esk13_3(X135,X136,X140),szDzozmdt0(X135))
| sdtlpdtrp0(X135,esk13_3(X135,X136,X140)) != X136
| ~ aSet0(X140)
| X140 = sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( aElementOf0(esk13_3(X135,X136,X140),szDzozmdt0(X135))
| aElementOf0(esk13_3(X135,X136,X140),X140)
| ~ aSet0(X140)
| X140 = sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) )
& ( sdtlpdtrp0(X135,esk13_3(X135,X136,X140)) = X136
| aElementOf0(esk13_3(X135,X136,X140),X140)
| ~ aSet0(X140)
| X140 = sdtlbdtrb0(X135,X136)
| ~ aFunction0(X135)
| ~ aElement0(X136) ) ),
inference(distribute,[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])])])])])]) ).
cnf(c_0_18,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szNzAzT0),xT),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_21,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aFunction0(X1)
| ~ aElementOf0(X2,szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( sdtlpdtrp0(X1,X2) = X3
| ~ aElementOf0(X2,X4)
| X4 != sdtlbdtrb0(X1,X3)
| ~ aFunction0(X1)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X9,X10,X11] :
( ( aSet0(X9)
| X9 != slcrc0 )
& ( ~ aElementOf0(X10,X9)
| X9 != slcrc0 )
& ( ~ aSet0(X11)
| aElementOf0(esk1_1(X11),X11)
| X11 = slcrc0 ) ),
inference(distribute,[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_25,plain,
( aSet0(X1)
| X1 != sdtlbdtrb0(X2,X3)
| ~ aFunction0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| ~ aElementOf0(X1,X3)
| X3 != sdtlbdtrb0(X2,X4)
| ~ aFunction0(X2)
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_28,hypothesis,
( aElementOf0(sdtlpdtrp0(xd,X1),sdtlcdtrc0(xd,szNzAzT0))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_22])]) ).
cnf(c_0_29,plain,
( sdtlpdtrp0(X1,X2) = X3
| ~ aFunction0(X1)
| ~ aElementOf0(X2,sdtlbdtrb0(X1,X3))
| ~ aElement0(X3) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( aElementOf0(esk1_1(X1),X1)
| X1 = slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( aSet0(sdtlbdtrb0(X1,X2))
| ~ aFunction0(X1)
| ~ aElement0(X2) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| ~ aFunction0(X2)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3))
| ~ aElement0(X3) ),
inference(er,[status(thm)],[c_0_26]) ).
fof(c_0_33,plain,
! [X20,X21] :
( ~ aSet0(X20)
| ~ isFinite0(X20)
| ~ aSubsetOf0(X21,X20)
| isFinite0(X21) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])]) ).
fof(c_0_34,plain,
! [X14] :
( ~ aSet0(X14)
| ~ isCountable0(X14)
| X14 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
cnf(c_0_35,hypothesis,
( aElementOf0(sdtlpdtrp0(xd,X1),xT)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( sdtlpdtrp0(X1,esk1_1(sdtlbdtrb0(X1,X2))) = X2
| sdtlbdtrb0(X1,X2) = slcrc0
| ~ aFunction0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_37,plain,
( sdtlbdtrb0(X1,X2) = slcrc0
| aElementOf0(esk1_1(sdtlbdtrb0(X1,X2)),szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_31]) ).
fof(c_0_38,plain,
! [X167] :
( ( aElement0(szDzizrdt0(X167))
| ~ isCountable0(szDzozmdt0(X167))
| ~ isFinite0(sdtlcdtrc0(X167,szDzozmdt0(X167)))
| ~ aFunction0(X167) )
& ( isCountable0(sdtlbdtrb0(X167,szDzizrdt0(X167)))
| ~ isCountable0(szDzozmdt0(X167))
| ~ isFinite0(sdtlcdtrc0(X167,szDzozmdt0(X167)))
| ~ aFunction0(X167) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDirichlet])])]) ).
cnf(c_0_39,plain,
( isFinite0(X2)
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,hypothesis,
isFinite0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_41,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,hypothesis,
( sdtlbdtrb0(xd,X1) = slcrc0
| aElementOf0(X1,xT)
| ~ aElementOf0(esk1_1(sdtlbdtrb0(xd,X1)),szNzAzT0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22])]) ).
cnf(c_0_44,hypothesis,
( sdtlbdtrb0(xd,X1) = slcrc0
| aElementOf0(esk1_1(sdtlbdtrb0(xd,X1)),szNzAzT0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_15]),c_0_22])]) ).
cnf(c_0_45,plain,
( aElement0(szDzizrdt0(X1))
| ~ isCountable0(szDzozmdt0(X1))
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
isCountable0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_47,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_19]),c_0_40]),c_0_20])]) ).
cnf(c_0_48,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_42]) ).
fof(c_0_50,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_51,plain,
( isCountable0(sdtlbdtrb0(X1,szDzizrdt0(X1)))
| ~ isCountable0(szDzozmdt0(X1))
| ~ isFinite0(sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_52,hypothesis,
( sdtlbdtrb0(xd,X1) = slcrc0
| aElementOf0(X1,xT)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_53,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_45,c_0_15]),c_0_22]),c_0_46]),c_0_47])]) ).
cnf(c_0_54,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_55,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,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_51,c_0_52]),c_0_22]),c_0_15]),c_0_46]),c_0_15]),c_0_47]),c_0_53])]),c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM596+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 13:11:01 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.NiUzrMxzbi/E---3.1_23486.p
% 1.17/0.70 # Version: 3.1pre001
% 1.17/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.17/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.17/0.70 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.70 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.70 # Starting sh5l with 300s (1) cores
% 1.17/0.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23563 completed with status 0
% 1.17/0.70 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.17/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.17/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.17/0.70 # No SInE strategy applied
% 1.17/0.70 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.17/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.70 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 1.17/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.17/0.70 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.17/0.70 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 1.17/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 1.17/0.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23568 completed with status 0
% 1.17/0.70 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.17/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.17/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.17/0.70 # No SInE strategy applied
% 1.17/0.70 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.17/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.70 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 1.17/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.17/0.70 # Preprocessing time : 0.004 s
% 1.17/0.70 # Presaturation interreduction done
% 1.17/0.70
% 1.17/0.70 # Proof found!
% 1.17/0.70 # SZS status Theorem
% 1.17/0.70 # SZS output start CNFRefutation
% See solution above
% 1.17/0.70 # Parsed axioms : 94
% 1.17/0.70 # Removed by relevancy pruning/SinE : 0
% 1.17/0.70 # Initial clauses : 191
% 1.17/0.70 # Removed in clause preprocessing : 7
% 1.17/0.70 # Initial clauses in saturation : 184
% 1.17/0.70 # Processed clauses : 1246
% 1.17/0.70 # ...of these trivial : 3
% 1.17/0.70 # ...subsumed : 433
% 1.17/0.70 # ...remaining for further processing : 810
% 1.17/0.70 # Other redundant clauses eliminated : 57
% 1.17/0.70 # Clauses deleted for lack of memory : 0
% 1.17/0.70 # Backward-subsumed : 23
% 1.17/0.70 # Backward-rewritten : 11
% 1.17/0.70 # Generated clauses : 3434
% 1.17/0.70 # ...of the previous two non-redundant : 3086
% 1.17/0.70 # ...aggressively subsumed : 0
% 1.17/0.70 # Contextual simplify-reflections : 86
% 1.17/0.70 # Paramodulations : 3379
% 1.17/0.70 # Factorizations : 0
% 1.17/0.70 # NegExts : 0
% 1.17/0.70 # Equation resolutions : 60
% 1.17/0.70 # Total rewrite steps : 1982
% 1.17/0.70 # Propositional unsat checks : 0
% 1.17/0.70 # Propositional check models : 0
% 1.17/0.70 # Propositional check unsatisfiable : 0
% 1.17/0.70 # Propositional clauses : 0
% 1.17/0.70 # Propositional clauses after purity: 0
% 1.17/0.70 # Propositional unsat core size : 0
% 1.17/0.70 # Propositional preprocessing time : 0.000
% 1.17/0.70 # Propositional encoding time : 0.000
% 1.17/0.70 # Propositional solver time : 0.000
% 1.17/0.70 # Success case prop preproc time : 0.000
% 1.17/0.70 # Success case prop encoding time : 0.000
% 1.17/0.70 # Success case prop solver time : 0.000
% 1.17/0.70 # Current number of processed clauses : 553
% 1.17/0.70 # Positive orientable unit clauses : 70
% 1.17/0.70 # Positive unorientable unit clauses: 0
% 1.17/0.70 # Negative unit clauses : 18
% 1.17/0.70 # Non-unit-clauses : 465
% 1.17/0.70 # Current number of unprocessed clauses: 2176
% 1.17/0.70 # ...number of literals in the above : 12600
% 1.17/0.70 # Current number of archived formulas : 0
% 1.17/0.70 # Current number of archived clauses : 217
% 1.17/0.70 # Clause-clause subsumption calls (NU) : 31742
% 1.17/0.70 # Rec. Clause-clause subsumption calls : 11568
% 1.17/0.70 # Non-unit clause-clause subsumptions : 374
% 1.17/0.70 # Unit Clause-clause subsumption calls : 2634
% 1.17/0.70 # Rewrite failures with RHS unbound : 0
% 1.17/0.70 # BW rewrite match attempts : 11
% 1.17/0.70 # BW rewrite match successes : 11
% 1.17/0.70 # Condensation attempts : 0
% 1.17/0.70 # Condensation successes : 0
% 1.17/0.70 # Termbank termtop insertions : 77717
% 1.17/0.70
% 1.17/0.70 # -------------------------------------------------
% 1.17/0.70 # User time : 0.140 s
% 1.17/0.70 # System time : 0.011 s
% 1.17/0.70 # Total time : 0.150 s
% 1.17/0.70 # Maximum resident set size: 2432 pages
% 1.17/0.70
% 1.17/0.70 # -------------------------------------------------
% 1.17/0.70 # User time : 0.733 s
% 1.17/0.70 # System time : 0.032 s
% 1.17/0.70 # Total time : 0.764 s
% 1.17/0.70 # Maximum resident set size: 1808 pages
% 1.17/0.70 % E---3.1 exiting
%------------------------------------------------------------------------------