%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM492+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 : n026.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:17 PM UTC 2026
% Result : Theorem 2.93s 0.90s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 54 ( 21 unt; 0 def)
% Number of atoms : 194 ( 58 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 218 ( 78 ~; 75 |; 53 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 34 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1860,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& isPrime0(xp)
& ! [X1] :
( ( ( doDivides0(X1,xp)
| ? [X2] :
( xp = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xp
| X1 = sz10 ) )
& xp != sz10
& xp != sz00 ),
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(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(m__1951,hypothesis,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1951) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__2001,hypothesis,
( doDivides0(xp,sdtasdt0(xp,xm))
& ? [X1] :
( sdtasdt0(xp,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2001) ).
fof(m__1883,hypothesis,
( xr = sdtmndt0(xn,xp)
& sdtpldt0(xp,xr) = xn
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__1978,hypothesis,
( sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
& sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1978) ).
fof(m__,conjecture,
( doDivides0(xp,sdtasdt0(xr,xm))
| ? [X1] :
( sdtasdt0(xr,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDivMin,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,sdtpldt0(X2,X3))
& doDivides0(X1,X2) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivMin) ).
fof(c_0_13,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xm))
& ? [X1] :
( sdtasdt0(xn,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& isPrime0(xp)
& ! [X1] :
( ( ( doDivides0(X1,xp)
| ? [X2] :
( xp = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xp
| X1 = sz10 ) )
& xp != sz10
& xp != sz00 ),
inference(fof_simplification,[status(thm)],[m__1860]) ).
fof(c_0_14,plain,
! [X37,X38,X40] :
( ( ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X37)
| sdtlseqdt0(X37,X38)
| sdtpldt0(X37,X40) != X38
| ~ aNaturalNumber0(X40) )
& ( ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X37)
| ~ sdtlseqdt0(X37,X38)
| sdtpldt0(X37,esk1_2(X37,X38)) = X38 )
& ( ~ aNaturalNumber0(X38)
| ~ aNaturalNumber0(X37)
| ~ sdtlseqdt0(X37,X38)
| aNaturalNumber0(esk1_2(X37,X38)) ) ),
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_15,plain,
! [X7,X8] :
( aNaturalNumber0(sdtpldt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_16,hypothesis,
! [X99,X100] :
( doDivides0(xp,sdtasdt0(xn,xm))
& sdtasdt0(xn,xm) = sdtasdt0(xp,esk9_0)
& aNaturalNumber0(esk9_0)
& isPrime0(xp)
& ( X99 = xp
| X99 = sz10
| ~ aNaturalNumber0(X99)
| ~ doDivides0(X99,xp) )
& ( X99 = xp
| X99 = sz10
| ~ aNaturalNumber0(X99)
| xp != sdtasdt0(X99,X100)
| ~ aNaturalNumber0(X100) )
& xp != sz10
& xp != 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_13])])])])])]) ).
fof(c_0_17,plain,
! [X41,X42,X43] :
( ( ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X41)
| ~ sdtlseqdt0(X41,X42)
| X43 = sdtmndt0(X42,X41)
| sdtpldt0(X41,X43) != X42
| ~ aNaturalNumber0(X43) )
& ( ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X41)
| ~ sdtlseqdt0(X41,X42)
| X43 != sdtmndt0(X42,X41)
| sdtpldt0(X41,X43) = X42 )
& ( ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X41)
| ~ sdtlseqdt0(X41,X42)
| X43 != sdtmndt0(X42,X41)
| aNaturalNumber0(X43) ) ),
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])])])])]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[m__1951]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xp,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X17,X18] :
( sdtasdt0(X17,X18) = sdtasdt0(X18,X17)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_23,plain,
! [X9,X10] :
( aNaturalNumber0(sdtasdt0(X9,X10))
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_24,hypothesis,
( doDivides0(xp,sdtasdt0(xp,xm))
& sdtasdt0(xp,xm) = sdtasdt0(xp,esk13_0)
& aNaturalNumber0(esk13_0)
& sdtasdt0(xn,xm) = sdtasdt0(xp,esk12_0)
& aNaturalNumber0(esk12_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2001])]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X3)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| X1 = sdtmndt0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]) ).
cnf(c_0_27,hypothesis,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xp,esk9_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1978]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xp,xm) = sdtasdt0(xp,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtmndt0(sdtpldt0(X1,X2),X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_19]),c_0_26]) ).
cnf(c_0_37,hypothesis,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xm,xr)) = sdtasdt0(xp,esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_38,hypothesis,
sdtmndt0(sdtasdt0(xp,esk9_0),sdtasdt0(xp,xm)) = sdtasdt0(xr,xm),
inference(rw,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_39,hypothesis,
aNaturalNumber0(sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
fof(c_0_40,negated_conjecture,
~ ( doDivides0(xp,sdtasdt0(xr,xm))
| ? [X1] :
( sdtasdt0(xr,xm) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_41,plain,
! [X78,X79,X80] :
( doDivides0(X78,X80)
| ~ doDivides0(X78,sdtpldt0(X79,X80))
| ~ doDivides0(X78,X79)
| ~ aNaturalNumber0(X80)
| ~ aNaturalNumber0(X79)
| ~ aNaturalNumber0(X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivMin])])]) ).
cnf(c_0_42,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(xm,xr))
| sdtasdt0(xr,xm) = sdtasdt0(xm,xr) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
fof(c_0_43,negated_conjecture,
! [X106] :
( ~ doDivides0(xp,sdtasdt0(xr,xm))
& ( sdtasdt0(xr,xm) != sdtasdt0(xp,X106)
| ~ aNaturalNumber0(X106) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_44,plain,
( ~ doDivides0(X1,sdtpldt0(X2,X3))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,hypothesis,
doDivides0(xp,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_46,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_47,hypothesis,
sdtasdt0(xr,xm) = sdtasdt0(xm,xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_29]),c_0_30])]) ).
cnf(c_0_48,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(xp,sdtpldt0(sdtasdt0(xp,xm),X1))
| doDivides0(xp,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_39]),c_0_35])]) ).
cnf(c_0_50,hypothesis,
doDivides0(xp,sdtasdt0(xp,esk9_0)),
inference(rw,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_51,hypothesis,
aNaturalNumber0(sdtasdt0(xm,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_30]),c_0_29])]) ).
cnf(c_0_52,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xm,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_53,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_37]),c_0_50]),c_0_51])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM492+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 02:37:36 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 2.93/0.90 % Version: 3.5.1
% 2.93/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.93/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.93/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.93/0.90 % Starting new_bool_3 with 300s (1) cores
% 2.93/0.90 % Starting new_bool_1 with 300s (1) cores
% 2.93/0.90 % Starting sh5l with 300s (1) cores
% 2.93/0.90 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1183455 completed with status 0
% 2.93/0.90 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.93/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.93/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.93/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.93/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.93/0.90 % No SInE strategy applied
% 2.93/0.90 % Search class: FGHSF-FSLM32-SFFFFFNN
% 2.93/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.93/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.93/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.93/0.90 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.93/0.90 % Starting new_bool_3 with 136s (1) cores
% 2.93/0.90 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 2.93/0.90 % new_bool_3 with pid 1183465 completed with status 0
% 2.93/0.90 % Result found by new_bool_3
% 2.93/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.93/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.93/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.93/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.93/0.90 % No SInE strategy applied
% 2.93/0.90 % Search class: FGHSF-FSLM32-SFFFFFNN
% 2.93/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.93/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.93/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.93/0.90 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.93/0.90 % Starting new_bool_3 with 136s (1) cores
% 2.93/0.90 % Preprocessing time : 0.005 s
% 2.93/0.90 % Presaturation interreduction done
% 2.93/0.90
% 2.93/0.90 % Proof found!
% 2.93/0.90 % SZS status Theorem
% 2.93/0.90 % SZS output start CNFRefutation
% See solution above
% 2.93/0.90 % Parsed axioms : 49
% 2.93/0.90 % Removed by relevancy pruning/SinE : 0
% 2.93/0.90 % Initial clauses : 228
% 2.93/0.90 % Removed in clause preprocessing : 3
% 2.93/0.90 % Initial clauses in saturation : 225
% 2.93/0.90 % Processed clauses : 2492
% 2.93/0.90 % ...of these trivial : 67
% 2.93/0.90 % ...subsumed : 1137
% 2.93/0.90 % ...remaining for further processing : 1288
% 2.93/0.90 % Other redundant clauses eliminated : 29
% 2.93/0.90 % Clauses deleted for lack of memory : 0
% 2.93/0.90 % Backward-subsumed : 30
% 2.93/0.90 % Backward-rewritten : 137
% 2.93/0.90 % Generated clauses : 8829
% 2.93/0.90 % ...of the previous two non-redundant : 7756
% 2.93/0.90 % ...aggressively subsumed : 0
% 2.93/0.90 % Contextual simplify-reflections : 39
% 2.93/0.90 % Paramodulations : 8789
% 2.93/0.90 % Factorizations : 5
% 2.93/0.90 % NegExts : 0
% 2.93/0.90 % Equation resolutions : 35
% 2.93/0.90 % Disequality decompositions : 0
% 2.93/0.90 % Total rewrite steps : 13214
% 2.93/0.90 % ...of those cached : 13001
% 2.93/0.90 % Propositional unsat checks : 0
% 2.93/0.90 % Propositional check models : 0
% 2.93/0.90 % Propositional check unsatisfiable : 0
% 2.93/0.90 % Propositional clauses : 0
% 2.93/0.90 % Propositional clauses after purity: 0
% 2.93/0.90 % Propositional unsat core size : 0
% 2.93/0.90 % Propositional preprocessing time : 0.000
% 2.93/0.90 % Propositional encoding time : 0.000
% 2.93/0.90 % Propositional solver time : 0.000
% 2.93/0.90 % Success case prop preproc time : 0.000
% 2.93/0.90 % Success case prop encoding time : 0.000
% 2.93/0.90 % Success case prop solver time : 0.000
% 2.93/0.90 % Current number of processed clauses : 892
% 2.93/0.90 % Positive orientable unit clauses : 233
% 2.93/0.90 % Positive unorientable unit clauses: 0
% 2.93/0.90 % Negative unit clauses : 42
% 2.93/0.90 % Non-unit-clauses : 617
% 2.93/0.90 % Current number of unprocessed clauses: 5545
% 2.93/0.90 % ...number of literals in the above : 40058
% 2.93/0.90 % Current number of archived formulas : 0
% 2.93/0.90 % Current number of archived clauses : 385
% 2.93/0.90 % Clause-clause subsumption calls (NU) : 133171
% 2.93/0.90 % Rec. Clause-clause subsumption calls : 12129
% 2.93/0.90 % Non-unit clause-clause subsumptions : 714
% 2.93/0.90 % Unit Clause-clause subsumption calls : 5004
% 2.93/0.90 % Rewrite failures with RHS unbound : 0
% 2.93/0.90 % BW rewrite match attempts : 150
% 2.93/0.90 % BW rewrite match successes : 58
% 2.93/0.90 % Condensation attempts : 0
% 2.93/0.90 % Condensation successes : 0
% 2.93/0.90 % Termbank termtop insertions : 264898
% 2.93/0.90 % Search garbage collected termcells : 2269
% 2.93/0.90
% 2.93/0.90 % -------------------------------------------------
% 2.93/0.90 % User time : 0.451 s
% 2.93/0.90 % System time : 0.015 s
% 2.93/0.90 % Total time : 0.466 s
% 2.93/0.90 % Maximum resident set size: 4208 pages
% 2.93/0.90
% 2.93/0.90 % -------------------------------------------------
% 2.93/0.90 % User time : 2.226 s
% 2.93/0.90 % System time : 0.075 s
% 2.93/0.90 % Total time : 2.302 s
% 2.93/0.90 % Maximum resident set size: 4864 pages
% 2.93/0.90 % E exiting
%------------------------------------------------------------------------------