%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM496+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 : n015.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:19 PM UTC 2026
% Result : Theorem 0.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 14 unt; 0 def)
% Number of atoms : 235 ( 91 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 265 ( 78 ~; 99 |; 75 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 25 !; 12 ?)
% 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(mPrimDiv,axiom,
! [X1] :
( ( X1 != sz10
& X1 != sz00
& aNaturalNumber0(X1) )
=> ? [X2] :
( isPrime0(X2)
& doDivides0(X2,X1)
& aNaturalNumber0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mPrimDiv) ).
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(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(m__,conjecture,
( doDivides0(xp,xm)
| ? [X1] :
( xm = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
| doDivides0(xp,xn)
| ? [X1] :
( xn = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDivSum,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X3)
& doDivides0(X1,X2) )
=> doDivides0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivSum) ).
fof(m__2027,hypothesis,
( ( doDivides0(xp,xm)
& ? [X1] :
( xm = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) )
| ( doDivides0(xp,xr)
& ? [X1] :
( xr = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2027) ).
fof(m__1883,hypothesis,
( xr = sdtmndt0(xn,xp)
& sdtpldt0(xp,xr) = xn
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(c_0_10,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_11,plain,
! [X1] :
( ( X1 != sz10
& X1 != sz00
& aNaturalNumber0(X1) )
=> ? [X2] :
( isPrime0(X2)
& doDivides0(X2,X1)
& aNaturalNumber0(X2) ) ),
inference(fof_simplification,[status(thm)],[mPrimDiv]) ).
fof(c_0_12,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_10])])])])])]) ).
fof(c_0_13,plain,
! [X89] :
( ( X89 = sz10
| X89 = sz00
| ~ aNaturalNumber0(X89)
| isPrime0(esk4_1(X89)) )
& ( X89 = sz10
| X89 = sz00
| ~ aNaturalNumber0(X89)
| doDivides0(esk4_1(X89),X89) )
& ( X89 = sz10
| X89 = sz00
| ~ aNaturalNumber0(X89)
| aNaturalNumber0(esk4_1(X89)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_14,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_15,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
cnf(c_0_16,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xp)
| X1 = xp
| X1 = sz10 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X1)
| X1 = sz10
| X1 = sz00
| doDivides0(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_19,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
xp != sz10,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X86,X87] :
( ( ~ aNaturalNumber0(X86)
| isPrime0(X86)
| X86 = sz10
| X86 = sz00
| esk3_1(X86) != X86 )
& ( ~ aNaturalNumber0(X86)
| isPrime0(X86)
| X86 = sz10
| X86 = sz00
| esk3_1(X86) != sz10 )
& ( ~ aNaturalNumber0(X86)
| isPrime0(X86)
| X86 = sz10
| X86 = sz00
| doDivides0(esk3_1(X86),X86) )
& ( ~ aNaturalNumber0(X86)
| isPrime0(X86)
| X86 = sz10
| X86 = sz00
| aNaturalNumber0(esk3_1(X86)) )
& ( ~ aNaturalNumber0(X86)
| ~ isPrime0(X86)
| X87 = X86
| X87 = sz10
| ~ doDivides0(X87,X86)
| ~ aNaturalNumber0(X87) )
& ( ~ aNaturalNumber0(X86)
| ~ isPrime0(X86)
| X86 != sz10 )
& ( ~ aNaturalNumber0(X86)
| ~ isPrime0(X86)
| X86 != 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_14])])])])])]) ).
fof(c_0_22,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
( ~ aNaturalNumber0(esk4_1(xp))
| esk4_1(xp) = sz10
| esk4_1(xp) = xp ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X1)
| X1 = sz10
| X1 = sz00
| aNaturalNumber0(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X1)
| X1 = sz10
| X1 = sz00
| isPrime0(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,hypothesis,
( esk4_1(xp) = xp
| esk4_1(xp) = sz10 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18])]),c_0_19]),c_0_20]) ).
cnf(c_0_29,plain,
~ isPrime0(sz10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26])]) ).
fof(c_0_30,negated_conjecture,
~ ( doDivides0(xp,xm)
| ? [X1] :
( xm = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
| doDivides0(xp,xn)
| ? [X1] :
( xn = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_31,plain,
! [X75,X76,X77] :
( doDivides0(X75,sdtpldt0(X76,X77))
| ~ doDivides0(X75,X77)
| ~ doDivides0(X75,X76)
| ~ aNaturalNumber0(X77)
| ~ aNaturalNumber0(X76)
| ~ aNaturalNumber0(X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivSum])])]) ).
cnf(c_0_32,hypothesis,
esk4_1(xp) = xp,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18])]),c_0_19]),c_0_20]),c_0_29]) ).
fof(c_0_33,hypothesis,
( ( doDivides0(xp,xr)
| doDivides0(xp,xm) )
& ( doDivides0(xp,xr)
| xm = sdtasdt0(xp,esk14_0) )
& ( doDivides0(xp,xr)
| aNaturalNumber0(esk14_0) )
& ( xr = sdtasdt0(xp,esk13_0)
| doDivides0(xp,xm) )
& ( xr = sdtasdt0(xp,esk13_0)
| xm = sdtasdt0(xp,esk14_0) )
& ( xr = sdtasdt0(xp,esk13_0)
| aNaturalNumber0(esk14_0) )
& ( aNaturalNumber0(esk13_0)
| doDivides0(xp,xm) )
& ( aNaturalNumber0(esk13_0)
| xm = sdtasdt0(xp,esk14_0) )
& ( aNaturalNumber0(esk13_0)
| aNaturalNumber0(esk14_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2027])])]) ).
fof(c_0_34,negated_conjecture,
! [X107,X108] :
( ~ doDivides0(xp,xm)
& ( xm != sdtasdt0(xp,X108)
| ~ aNaturalNumber0(X108) )
& ~ doDivides0(xp,xn)
& ( xn != sdtasdt0(xp,X107)
| ~ aNaturalNumber0(X107) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
cnf(c_0_35,plain,
( ~ doDivides0(X1,X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,hypothesis,
doDivides0(xp,xp),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_32]),c_0_18])]),c_0_19]),c_0_20]) ).
cnf(c_0_37,hypothesis,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(xp,X1)
| doDivides0(xp,sdtpldt0(X1,xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18])]) ).
cnf(c_0_40,hypothesis,
doDivides0(xp,xr),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__1883]) ).
fof(c_0_42,plain,
! [X11,X12] :
( sdtpldt0(X11,X12) = sdtpldt0(X12,X11)
| ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_43,hypothesis,
doDivides0(xp,sdtpldt0(xr,xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_44,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,hypothesis,
sdtpldt0(xp,xr) = xn,
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_46,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_18]),c_0_41])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM496+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:38:05 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.21/0.57 % Version: 3.5.1
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 % Starting sh5l with 300s (1) cores
% 0.21/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 373381 completed with status 0
% 0.21/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.57 % No SInE strategy applied
% 0.21/0.57 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.21/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.57 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.57 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.21/0.57 % new_bool_3 with pid 373391 completed with status 0
% 0.21/0.57 % Result found by new_bool_3
% 0.21/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.57 % No SInE strategy applied
% 0.21/0.57 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.21/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.57 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.57 % Preprocessing time : 0.005 s
% 0.21/0.57 % Presaturation interreduction done
% 0.21/0.57
% 0.21/0.57 % Proof found!
% 0.21/0.57 % SZS status Theorem
% 0.21/0.57 % SZS output start CNFRefutation
% See solution above
% 0.21/0.57 % Parsed axioms : 47
% 0.21/0.57 % Removed by relevancy pruning/SinE : 0
% 0.21/0.57 % Initial clauses : 233
% 0.21/0.57 % Removed in clause preprocessing : 3
% 0.21/0.57 % Initial clauses in saturation : 230
% 0.21/0.57 % Processed clauses : 733
% 0.21/0.57 % ...of these trivial : 9
% 0.21/0.57 % ...subsumed : 178
% 0.21/0.57 % ...remaining for further processing : 546
% 0.21/0.57 % Other redundant clauses eliminated : 19
% 0.21/0.57 % Clauses deleted for lack of memory : 0
% 0.21/0.57 % Backward-subsumed : 6
% 0.21/0.57 % Backward-rewritten : 37
% 0.21/0.57 % Generated clauses : 1355
% 0.21/0.57 % ...of the previous two non-redundant : 1197
% 0.21/0.57 % ...aggressively subsumed : 0
% 0.21/0.57 % Contextual simplify-reflections : 7
% 0.21/0.57 % Paramodulations : 1329
% 0.21/0.57 % Factorizations : 3
% 0.21/0.57 % NegExts : 0
% 0.21/0.57 % Equation resolutions : 23
% 0.21/0.57 % Disequality decompositions : 0
% 0.21/0.57 % Total rewrite steps : 1863
% 0.21/0.57 % ...of those cached : 1789
% 0.21/0.57 % Propositional unsat checks : 0
% 0.21/0.57 % Propositional check models : 0
% 0.21/0.57 % Propositional check unsatisfiable : 0
% 0.21/0.57 % Propositional clauses : 0
% 0.21/0.57 % Propositional clauses after purity: 0
% 0.21/0.57 % Propositional unsat core size : 0
% 0.21/0.57 % Propositional preprocessing time : 0.000
% 0.21/0.57 % Propositional encoding time : 0.000
% 0.21/0.57 % Propositional solver time : 0.000
% 0.21/0.57 % Success case prop preproc time : 0.000
% 0.21/0.57 % Success case prop encoding time : 0.000
% 0.21/0.57 % Success case prop solver time : 0.000
% 0.21/0.57 % Current number of processed clauses : 273
% 0.21/0.57 % Positive orientable unit clauses : 98
% 0.21/0.57 % Positive unorientable unit clauses: 0
% 0.21/0.57 % Negative unit clauses : 20
% 0.21/0.57 % Non-unit-clauses : 155
% 0.21/0.57 % Current number of unprocessed clauses: 851
% 0.21/0.57 % ...number of literals in the above : 4385
% 0.21/0.57 % Current number of archived formulas : 0
% 0.21/0.57 % Current number of archived clauses : 262
% 0.21/0.57 % Clause-clause subsumption calls (NU) : 33388
% 0.21/0.57 % Rec. Clause-clause subsumption calls : 1457
% 0.21/0.57 % Non-unit clause-clause subsumptions : 123
% 0.21/0.57 % Unit Clause-clause subsumption calls : 1023
% 0.21/0.57 % Rewrite failures with RHS unbound : 0
% 0.21/0.57 % BW rewrite match attempts : 25
% 0.21/0.57 % BW rewrite match successes : 19
% 0.21/0.57 % Condensation attempts : 0
% 0.21/0.57 % Condensation successes : 0
% 0.21/0.57 % Termbank termtop insertions : 44394
% 0.21/0.57 % Search garbage collected termcells : 2320
% 0.21/0.57
% 0.21/0.57 % -------------------------------------------------
% 0.21/0.57 % User time : 0.090 s
% 0.21/0.57 % System time : 0.011 s
% 0.21/0.57 % Total time : 0.101 s
% 0.21/0.57 % Maximum resident set size: 4208 pages
% 0.21/0.57
% 0.21/0.57 % -------------------------------------------------
% 0.21/0.57 % User time : 0.438 s
% 0.21/0.57 % System time : 0.029 s
% 0.21/0.57 % Total time : 0.467 s
% 0.21/0.57 % Maximum resident set size: 4608 pages
% 0.21/0.57 % E exiting
%------------------------------------------------------------------------------