TSTP Solution File: NUM544+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM544+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 18:56:17 EDT 2023
% Result : Theorem 29.57s 4.26s
% Output : CNFRefutation 29.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 219 ( 41 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 291 ( 123 ~; 125 |; 28 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 1 sgn; 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mDefSub) ).
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mDefSeg) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mSuccNum) ).
fof(mDefMax,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& isFinite0(X1)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mDefMax) ).
fof(m__1986,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',m__1986) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mNATSet) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mSuccLess) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.d5uNu5REeo/E---3.1_9006.p',mDefEmp) ).
fof(c_0_9,negated_conjecture,
~ ( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,plain,
! [X13,X14,X15,X16] :
( ( aSet0(X14)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(X15,X14)
| aElementOf0(X15,X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSet0(X13) )
& ( aElementOf0(esk2_2(X13,X16),X16)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) )
& ( ~ aElementOf0(esk2_2(X13,X16),X13)
| ~ aSet0(X16)
| aSubsetOf0(X16,X13)
| ~ aSet0(X13) ) ),
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])])])])])]) ).
fof(c_0_11,plain,
! [X96,X97,X98,X99,X100] :
( ( aSet0(X97)
| X97 != slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( aElementOf0(X98,szNzAzT0)
| ~ aElementOf0(X98,X97)
| X97 != slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X98),X96)
| ~ aElementOf0(X98,X97)
| X97 != slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( ~ aElementOf0(X99,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X99),X96)
| aElementOf0(X99,X97)
| X97 != slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( ~ aElementOf0(esk9_2(X96,X100),X100)
| ~ aElementOf0(esk9_2(X96,X100),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk9_2(X96,X100)),X96)
| ~ aSet0(X100)
| X100 = slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( aElementOf0(esk9_2(X96,X100),szNzAzT0)
| aElementOf0(esk9_2(X96,X100),X100)
| ~ aSet0(X100)
| X100 = slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(esk9_2(X96,X100)),X96)
| aElementOf0(esk9_2(X96,X100),X100)
| ~ aSet0(X100)
| X100 = slbdtrb0(X96)
| ~ aElementOf0(X96,szNzAzT0) ) ),
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)],[mDefSeg])])])])])]) ).
fof(c_0_12,plain,
! [X52] :
( ( aElementOf0(szszuzczcdt0(X52),szNzAzT0)
| ~ aElementOf0(X52,szNzAzT0) )
& ( szszuzczcdt0(X52) != sz00
| ~ aElementOf0(X52,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
fof(c_0_13,plain,
! [X89,X90,X91,X92] :
( ( aElementOf0(X90,X89)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ aElementOf0(X91,X89)
| sdtlseqdt0(X91,X90)
| X90 != szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( aElementOf0(esk8_2(X89,X92),X89)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = slcrc0 )
& ( ~ sdtlseqdt0(esk8_2(X89,X92),X92)
| ~ aElementOf0(X92,X89)
| X92 = szmzazxdt0(X89)
| ~ aSubsetOf0(X89,szNzAzT0)
| ~ isFinite0(X89)
| X89 = 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)],[mDefMax])])])])])]) ).
fof(c_0_14,negated_conjecture,
( xS != slcrc0
& ~ aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_17,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_18,plain,
( aSet0(X1)
| X1 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_22,negated_conjecture,
xS != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X60,X61] :
( ( ~ sdtlseqdt0(X60,X61)
| sdtlseqdt0(szszuzczcdt0(X60),szszuzczcdt0(X61))
| ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X61,szNzAzT0) )
& ( ~ sdtlseqdt0(szszuzczcdt0(X60),szszuzczcdt0(X61))
| sdtlseqdt0(X60,X61)
| ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X61,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])]) ).
fof(c_0_24,plain,
! [X7,X8,X9] :
( ( aSet0(X7)
| X7 != slcrc0 )
& ( ~ aElementOf0(X8,X7)
| X7 != slcrc0 )
& ( ~ aSet0(X9)
| aElementOf0(esk1_1(X9),X9)
| X9 = 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,
( aElementOf0(esk2_2(X1,X2),X2)
| aSubsetOf0(X2,X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_27,plain,
( aSet0(X1)
| X1 != slbdtrb0(szszuzczcdt0(X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,hypothesis,
( aElementOf0(X1,xS)
| X1 != szmzazxdt0(xS) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_21])]),c_0_22]) ).
cnf(c_0_30,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( sdtlseqdt0(X1,X3)
| X2 = slcrc0
| ~ aElementOf0(X1,X2)
| X3 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,plain,
( ~ aElementOf0(X1,X2)
| X2 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,hypothesis,
( aSubsetOf0(xS,X1)
| aElementOf0(esk2_2(X1,xS),xS)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( aSet0(slbdtrb0(szszuzczcdt0(X1)))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_36,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_17])]) ).
cnf(c_0_37,hypothesis,
aElementOf0(szmzazxdt0(xS),xS),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
( aElementOf0(X1,X2)
| X2 != slbdtrb0(szszuzczcdt0(X3))
| ~ sdtlseqdt0(X1,X3)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]) ).
cnf(c_0_39,plain,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(X3)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ isFinite0(X3)
| ~ aElementOf0(X1,X3) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,hypothesis,
( aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(X1)))
| aElementOf0(esk2_2(slbdtrb0(szszuzczcdt0(X1)),xS),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,hypothesis,
aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,plain,
( aSubsetOf0(X2,X1)
| ~ aElementOf0(esk2_2(X1,X2),X1)
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,plain,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_45,hypothesis,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_21])]) ).
cnf(c_0_46,hypothesis,
aElementOf0(esk2_2(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))),xS),xS),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( aSubsetOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
| ~ sdtlseqdt0(esk2_2(slbdtrb0(szszuzczcdt0(X2)),X1),X2)
| ~ aElementOf0(esk2_2(slbdtrb0(szszuzczcdt0(X2)),X1),szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_48,hypothesis,
( sdtlseqdt0(esk2_2(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))),xS),X1)
| X1 != szmzazxdt0(xS) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,hypothesis,
~ aElementOf0(esk2_2(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))),xS),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_41]),c_0_26])]),c_0_42]) ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUM544+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 13:38:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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/tmp/tmp.d5uNu5REeo/E---3.1_9006.p
% 29.57/4.26 # Version: 3.1pre001
% 29.57/4.26 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.57/4.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.57/4.26 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.57/4.26 # Starting new_bool_3 with 300s (1) cores
% 29.57/4.26 # Starting new_bool_1 with 300s (1) cores
% 29.57/4.26 # Starting sh5l with 300s (1) cores
% 29.57/4.26 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9084 completed with status 0
% 29.57/4.26 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 29.57/4.26 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.57/4.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.57/4.26 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.57/4.26 # No SInE strategy applied
% 29.57/4.26 # Search class: FGHSF-FFMM31-MFFFFFNN
% 29.57/4.26 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.57/4.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 29.57/4.26 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 29.57/4.26 # Starting new_bool_3 with 136s (1) cores
% 29.57/4.26 # Starting new_bool_1 with 136s (1) cores
% 29.57/4.26 # Starting sh5l with 136s (1) cores
% 29.57/4.26 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9090 completed with status 0
% 29.57/4.26 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 29.57/4.26 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.57/4.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.57/4.26 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.57/4.26 # No SInE strategy applied
% 29.57/4.26 # Search class: FGHSF-FFMM31-MFFFFFNN
% 29.57/4.26 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.57/4.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 29.57/4.26 # Preprocessing time : 0.003 s
% 29.57/4.26
% 29.57/4.26 # Proof found!
% 29.57/4.26 # SZS status Theorem
% 29.57/4.26 # SZS output start CNFRefutation
% See solution above
% 29.57/4.26 # Parsed axioms : 56
% 29.57/4.26 # Removed by relevancy pruning/SinE : 0
% 29.57/4.26 # Initial clauses : 101
% 29.57/4.26 # Removed in clause preprocessing : 6
% 29.57/4.26 # Initial clauses in saturation : 95
% 29.57/4.26 # Processed clauses : 10637
% 29.57/4.26 # ...of these trivial : 194
% 29.57/4.26 # ...subsumed : 6505
% 29.57/4.26 # ...remaining for further processing : 3937
% 29.57/4.26 # Other redundant clauses eliminated : 33
% 29.57/4.26 # Clauses deleted for lack of memory : 0
% 29.57/4.26 # Backward-subsumed : 699
% 29.57/4.26 # Backward-rewritten : 66
% 29.57/4.26 # Generated clauses : 148941
% 29.57/4.26 # ...of the previous two non-redundant : 142851
% 29.57/4.26 # ...aggressively subsumed : 0
% 29.57/4.26 # Contextual simplify-reflections : 1006
% 29.57/4.26 # Paramodulations : 148359
% 29.57/4.26 # Factorizations : 277
% 29.57/4.26 # NegExts : 0
% 29.57/4.26 # Equation resolutions : 268
% 29.57/4.26 # Total rewrite steps : 61673
% 29.57/4.26 # Propositional unsat checks : 0
% 29.57/4.26 # Propositional check models : 0
% 29.57/4.26 # Propositional check unsatisfiable : 0
% 29.57/4.26 # Propositional clauses : 0
% 29.57/4.26 # Propositional clauses after purity: 0
% 29.57/4.26 # Propositional unsat core size : 0
% 29.57/4.26 # Propositional preprocessing time : 0.000
% 29.57/4.26 # Propositional encoding time : 0.000
% 29.57/4.26 # Propositional solver time : 0.000
% 29.57/4.26 # Success case prop preproc time : 0.000
% 29.57/4.26 # Success case prop encoding time : 0.000
% 29.57/4.26 # Success case prop solver time : 0.000
% 29.57/4.26 # Current number of processed clauses : 3132
% 29.57/4.26 # Positive orientable unit clauses : 141
% 29.57/4.26 # Positive unorientable unit clauses: 0
% 29.57/4.27 # Negative unit clauses : 42
% 29.57/4.27 # Non-unit-clauses : 2949
% 29.57/4.27 # Current number of unprocessed clauses: 131242
% 29.57/4.27 # ...number of literals in the above : 721573
% 29.57/4.27 # Current number of archived formulas : 0
% 29.57/4.27 # Current number of archived clauses : 802
% 29.57/4.27 # Clause-clause subsumption calls (NU) : 1375616
% 29.57/4.27 # Rec. Clause-clause subsumption calls : 247449
% 29.57/4.27 # Non-unit clause-clause subsumptions : 5426
% 29.57/4.27 # Unit Clause-clause subsumption calls : 43617
% 29.57/4.27 # Rewrite failures with RHS unbound : 0
% 29.57/4.27 # BW rewrite match attempts : 121
% 29.57/4.27 # BW rewrite match successes : 35
% 29.57/4.27 # Condensation attempts : 0
% 29.57/4.27 # Condensation successes : 0
% 29.57/4.27 # Termbank termtop insertions : 3739809
% 29.57/4.27
% 29.57/4.27 # -------------------------------------------------
% 29.57/4.27 # User time : 3.553 s
% 29.57/4.27 # System time : 0.101 s
% 29.57/4.27 # Total time : 3.654 s
% 29.57/4.27 # Maximum resident set size: 2052 pages
% 29.57/4.27
% 29.57/4.27 # -------------------------------------------------
% 29.57/4.27 # User time : 18.000 s
% 29.57/4.27 # System time : 0.251 s
% 29.57/4.27 # Total time : 18.251 s
% 29.57/4.27 # Maximum resident set size: 1740 pages
% 29.57/4.27 % E---3.1 exiting
% 29.57/4.27 % E---3.1 exiting
%------------------------------------------------------------------------------