%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM487+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 : n003.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:16 PM UTC 2026
% Result : Theorem 0.23s 0.65s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 62 ( 15 unt; 0 def)
% Number of atoms : 247 ( 81 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 308 ( 123 ~; 125 |; 40 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 43 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtlseqdt0(xr,xn)
& xr != xn ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ! [X2] :
( ( doDivides0(X2,X1)
& aNaturalNumber0(X2) )
=> ( X2 = X1
| X2 = sz10 ) )
& X1 != sz10
& X1 != sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrime) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
fof(mAddCanc,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtpldt0(X2,X1) = sdtpldt0(X3,X1)
| sdtpldt0(X1,X2) = sdtpldt0(X1,X3) )
=> X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddCanc) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__1860,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEAsym) ).
fof(c_0_15,negated_conjecture,
~ ( sdtlseqdt0(xr,xn)
& xr != xn ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_16,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ! [X2] :
( ( doDivides0(X2,X1)
& aNaturalNumber0(X2) )
=> ( X2 = X1
| X2 = sz10 ) )
& X1 != sz10
& X1 != sz00 ) ) ),
inference(fof_simplification,[status(thm)],[mDefPrime]) ).
fof(c_0_17,negated_conjecture,
~ ( sdtlseqdt0(xr,xn)
& xr != xn ),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
fof(c_0_19,plain,
! [X25,X26,X27] :
( ( ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X25)
| X26 = X27
| sdtpldt0(X26,X25) != sdtpldt0(X27,X25) )
& ( ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X25)
| X26 = X27
| sdtpldt0(X25,X26) != sdtpldt0(X25,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])])]) ).
fof(c_0_20,plain,
! [X14] :
( ( ~ aNaturalNumber0(X14)
| X14 = sdtpldt0(sz00,X14) )
& ( ~ aNaturalNumber0(X14)
| sdtpldt0(X14,sz00) = X14 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
fof(c_0_21,plain,
! [X39,X40,X41] :
( ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 = sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) != X40
| ~ aNaturalNumber0(X41) )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) = X40 )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| aNaturalNumber0(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
fof(c_0_22,plain,
! [X84,X85] :
( ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| esk3_1(X84) != X84 )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| esk3_1(X84) != sz10 )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| doDivides0(esk3_1(X84),X84) )
& ( ~ aNaturalNumber0(X84)
| isPrime0(X84)
| X84 = sz10
| X84 = sz00
| aNaturalNumber0(esk3_1(X84)) )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X85 = X84
| X85 = sz10
| ~ doDivides0(X85,X84)
| ~ aNaturalNumber0(X85) )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X84 != sz10 )
& ( ~ aNaturalNumber0(X84)
| ~ isPrime0(X84)
| X84 != sz00 ) ),
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)],[c_0_16])])])])])]) ).
fof(c_0_23,negated_conjecture,
( ~ sdtlseqdt0(xr,xn)
| xr = xn ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
fof(c_0_24,plain,
! [X48,X49] :
( ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| sdtlseqdt0(X49,X48) )
& ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| X49 != X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X1,X2) != sdtpldt0(X3,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_28,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X3)
| X2 != sdtmndt0(X3,X1)
| sdtpldt0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_30,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_33,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_36,negated_conjecture,
( ~ sdtlseqdt0(xr,xn)
| xr = xn ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X1,X2) != X2
| X1 = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_39,hypothesis,
( X1 != xr
| sdtpldt0(xp,X1) = xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_40,hypothesis,
xp != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32])]) ).
cnf(c_0_41,hypothesis,
( X1 != xr
| aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_30]),c_0_32]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aNaturalNumber0(xr)
| sdtlseqdt0(xn,xr)
| xr = xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]) ).
cnf(c_0_43,hypothesis,
( X1 != xr
| xn != X1 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]),c_0_40]),c_0_41]) ).
fof(c_0_44,plain,
! [X35,X36,X38] :
( ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| sdtlseqdt0(X35,X36)
| sdtpldt0(X35,X38) != X36
| ~ aNaturalNumber0(X38) )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| sdtpldt0(X35,esk1_2(X35,X36)) = X36 )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| aNaturalNumber0(esk1_2(X35,X36)) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_45,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_46,plain,
! [X9,X10] :
( sdtpldt0(X9,X10) = sdtpldt0(X10,X9)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
fof(c_0_47,plain,
! [X43,X44] :
( X43 = X44
| ~ sdtlseqdt0(X44,X43)
| ~ sdtlseqdt0(X43,X44)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_48,negated_conjecture,
( sdtlseqdt0(xn,xr)
| xr = xn ),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_49,hypothesis,
xr != xn,
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_51,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
sdtlseqdt0(xn,xr),
inference(sr,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_29]),c_0_30]),c_0_32]),c_0_31])]) ).
cnf(c_0_57,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_52]) ).
cnf(c_0_58,hypothesis,
( X1 != xr
| sdtpldt0(X1,xp) = xn ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_39]),c_0_32])]),c_0_41]) ).
cnf(c_0_59,negated_conjecture,
~ sdtlseqdt0(xr,xn),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_31]),c_0_56])]),c_0_49]) ).
cnf(c_0_60,hypothesis,
( X1 != xr
| sdtlseqdt0(X1,xn) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_32])]),c_0_41]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_59,c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM487+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.19/0.45 % Computer : n003.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 02:35:30 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/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
% 0.23/0.65 % Version: 3.5.1
% 0.23/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.65 % Starting sh5l with 300s (1) cores
% 0.23/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3217914 completed with status 0
% 0.23/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.65 % No SInE strategy applied
% 0.23/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.23/0.65 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.23/0.65 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.23/0.65 % G-E--_208_C18_F1_AE_CS_SP_PS_S3S with pid 3217922 completed with status 0
% 0.23/0.65 % Result found by G-E--_208_C18_F1_AE_CS_SP_PS_S3S
% 0.23/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.65 % No SInE strategy applied
% 0.23/0.65 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.23/0.65 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.23/0.65 % Preprocessing time : 0.002 s
% 0.23/0.65 % Presaturation interreduction done
% 0.23/0.65
% 0.23/0.65 % Proof found!
% 0.23/0.65 % SZS status Theorem
% 0.23/0.65 % SZS output start CNFRefutation
% See solution above
% 0.23/0.65 % Parsed axioms : 44
% 0.23/0.65 % Removed by relevancy pruning/SinE : 0
% 0.23/0.65 % Initial clauses : 79
% 0.23/0.65 % Removed in clause preprocessing : 3
% 0.23/0.65 % Initial clauses in saturation : 76
% 0.23/0.65 % Processed clauses : 706
% 0.23/0.65 % ...of these trivial : 9
% 0.23/0.65 % ...subsumed : 321
% 0.23/0.65 % ...remaining for further processing : 376
% 0.23/0.65 % Other redundant clauses eliminated : 20
% 0.23/0.65 % Clauses deleted for lack of memory : 0
% 0.23/0.65 % Backward-subsumed : 66
% 0.23/0.65 % Backward-rewritten : 3
% 0.23/0.65 % Generated clauses : 1750
% 0.23/0.65 % ...of the previous two non-redundant : 1489
% 0.23/0.65 % ...aggressively subsumed : 0
% 0.23/0.65 % Contextual simplify-reflections : 18
% 0.23/0.65 % Paramodulations : 1688
% 0.23/0.65 % Factorizations : 4
% 0.23/0.65 % NegExts : 0
% 0.23/0.65 % Equation resolutions : 41
% 0.23/0.65 % Disequality decompositions : 0
% 0.23/0.65 % Total rewrite steps : 1544
% 0.23/0.65 % ...of those cached : 1522
% 0.23/0.65 % Propositional unsat checks : 0
% 0.23/0.65 % Propositional check models : 0
% 0.23/0.65 % Propositional check unsatisfiable : 0
% 0.23/0.65 % Propositional clauses : 0
% 0.23/0.65 % Propositional clauses after purity: 0
% 0.23/0.65 % Propositional unsat core size : 0
% 0.23/0.65 % Propositional preprocessing time : 0.000
% 0.23/0.65 % Propositional encoding time : 0.000
% 0.23/0.65 % Propositional solver time : 0.000
% 0.23/0.65 % Success case prop preproc time : 0.000
% 0.23/0.65 % Success case prop encoding time : 0.000
% 0.23/0.65 % Success case prop solver time : 0.000
% 0.23/0.65 % Current number of processed clauses : 218
% 0.23/0.65 % Positive orientable unit clauses : 26
% 0.23/0.65 % Positive unorientable unit clauses: 0
% 0.23/0.65 % Negative unit clauses : 12
% 0.23/0.65 % Non-unit-clauses : 180
% 0.23/0.65 % Current number of unprocessed clauses: 877
% 0.23/0.65 % ...number of literals in the above : 4565
% 0.23/0.65 % Current number of archived formulas : 0
% 0.23/0.65 % Current number of archived clauses : 157
% 0.23/0.65 % Clause-clause subsumption calls (NU) : 13925
% 0.23/0.65 % Rec. Clause-clause subsumption calls : 5389
% 0.23/0.65 % Non-unit clause-clause subsumptions : 350
% 0.23/0.65 % Unit Clause-clause subsumption calls : 1214
% 0.23/0.65 % Rewrite failures with RHS unbound : 0
% 0.23/0.65 % BW rewrite match attempts : 2
% 0.23/0.65 % BW rewrite match successes : 2
% 0.23/0.65 % Condensation attempts : 0
% 0.23/0.65 % Condensation successes : 0
% 0.23/0.65 % Termbank termtop insertions : 36128
% 0.23/0.65 % Search garbage collected termcells : 1359
% 0.23/0.65
% 0.23/0.65 % -------------------------------------------------
% 0.23/0.65 % User time : 0.066 s
% 0.23/0.65 % System time : 0.006 s
% 0.23/0.65 % Total time : 0.072 s
% 0.23/0.65 % Maximum resident set size: 3428 pages
% 0.23/0.65
% 0.23/0.65 % -------------------------------------------------
% 0.23/0.65 % User time : 0.275 s
% 0.23/0.65 % System time : 0.028 s
% 0.23/0.65 % Total time : 0.303 s
% 0.23/0.65 % Maximum resident set size: 4608 pages
% 0.23/0.65 % E exiting
%------------------------------------------------------------------------------