%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM518+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:55:20 PM UTC 2026
% Result : Theorem 1.49s 0.71s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 57 ( 20 unt; 0 def)
% Number of atoms : 210 ( 68 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 246 ( 93 ~; 97 |; 37 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( doDivides0(xp,xm)
| doDivides0(xp,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2504,hypothesis,
( sdtlseqdt0(sdtsldt0(xn,xr),xn)
& sdtsldt0(xn,xr) != xn ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2504) ).
fof(mDivLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( X2 != sz00
& doDivides0(X1,X2) )
=> sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivLE) ).
fof(mLETran,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(X1,X2) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETran) ).
fof(m__2645,hypothesis,
( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2645) ).
fof(m__1870,hypothesis,
~ sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1870) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
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/sandbox2/benchmark/theBenchmark.p',mDefPrime) ).
fof(m__2487,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2487) ).
fof(m__2342,hypothesis,
( isPrime0(xr)
& doDivides0(xr,xk)
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2342) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(c_0_13,negated_conjecture,
~ ( doDivides0(xp,xm)
| doDivides0(xp,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,hypothesis,
( sdtlseqdt0(sdtsldt0(xn,xr),xn)
& sdtsldt0(xn,xr) != xn ),
inference(fof_simplification,[status(thm)],[m__2504]) ).
fof(c_0_15,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( X2 != sz00
& doDivides0(X1,X2) )
=> sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mDivLE]) ).
fof(c_0_16,negated_conjecture,
( ~ doDivides0(xp,xm)
& ~ doDivides0(xp,xn) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_17,plain,
! [X45,X46,X47] :
( sdtlseqdt0(X45,X47)
| ~ sdtlseqdt0(X46,X47)
| ~ sdtlseqdt0(X45,X46)
| ~ aNaturalNumber0(X47)
| ~ aNaturalNumber0(X46)
| ~ aNaturalNumber0(X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETran])])]) ).
fof(c_0_18,hypothesis,
( sdtlseqdt0(sdtsldt0(xn,xr),xn)
& sdtsldt0(xn,xr) != xn ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X79,X80] :
( sdtlseqdt0(X79,X80)
| X80 = sz00
| ~ doDivides0(X79,X80)
| ~ aNaturalNumber0(X80)
| ~ aNaturalNumber0(X79) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_20,hypothesis,
( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
inference(split_conjunct,[status(thm)],[m__2645]) ).
cnf(c_0_21,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(fof_simplification,[status(thm)],[m__1870]) ).
fof(c_0_23,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
cnf(c_0_24,plain,
( ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
sdtlseqdt0(sdtsldt0(xn,xr),xn),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_27,plain,
( ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,X2)
| X2 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
doDivides0(xp,sdtsldt0(xn,xr)),
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_30,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(fof_nnf,[status(thm)],[c_0_22]) ).
fof(c_0_31,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])])]) ).
cnf(c_0_32,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ sdtlseqdt0(X1,sdtsldt0(xn,xr))
| sdtlseqdt0(X1,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,hypothesis,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| sdtlseqdt0(xp,sdtsldt0(xn,xr))
| sdtsldt0(xn,xr) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,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]) ).
cnf(c_0_37,hypothesis,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| sdtsldt0(xn,xr) = sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29])]),c_0_34]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,hypothesis,
doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[m__2487]) ).
cnf(c_0_40,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
fof(c_0_41,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_36])])])])])]) ).
cnf(c_0_42,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2)
| X2 = sz00
| X1 = sdtasdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,hypothesis,
sdtsldt0(xn,xr) != xn,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,hypothesis,
( xr = sz00
| sdtsldt0(xn,xr) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_26])]) ).
cnf(c_0_45,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
fof(c_0_47,plain,
! [X21] :
( ( ~ aNaturalNumber0(X21)
| sz00 = sdtasdt0(sz00,X21) )
& ( ~ aNaturalNumber0(X21)
| sdtasdt0(X21,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_48,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_49,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_50,hypothesis,
( xn != sz00
| xr = sz00 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46])]) ).
cnf(c_0_52,plain,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sz00) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,hypothesis,
( xr = sz00
| sdtasdt0(xr,sz00) = xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_44]),c_0_39]),c_0_40]),c_0_26])]) ).
cnf(c_0_54,hypothesis,
xn != sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_55,hypothesis,
xr = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_40])]),c_0_54]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_55]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM518+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n020.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 02:37:32 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.49/0.71 % Version: 3.5.1
% 1.49/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.49/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.49/0.71 % Starting sh5l with 300s (1) cores
% 1.49/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1810963 completed with status 0
% 1.49/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.49/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.49/0.71 % No SInE strategy applied
% 1.49/0.71 % Search class: FGHSF-FFMM21-SFFFFFNN
% 1.49/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.49/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.49/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.49/0.71 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 1.49/0.71 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 1.49/0.71 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 1.49/0.71 % SubtermCWHack with pid 1810967 completed with status 0
% 1.49/0.71 % Result found by SubtermCWHack
% 1.49/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.49/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.49/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.49/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.49/0.71 % No SInE strategy applied
% 1.49/0.71 % Search class: FGHSF-FFMM21-SFFFFFNN
% 1.49/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.49/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.49/0.71 % Preprocessing time : 0.002 s
% 1.49/0.71
% 1.49/0.71 % Proof found!
% 1.49/0.71 % SZS status Theorem
% 1.49/0.71 % SZS output start CNFRefutation
% See solution above
% 1.49/0.71 % Parsed axioms : 56
% 1.49/0.71 % Removed by relevancy pruning/SinE : 0
% 1.49/0.71 % Initial clauses : 102
% 1.49/0.71 % Removed in clause preprocessing : 3
% 1.49/0.71 % Initial clauses in saturation : 99
% 1.49/0.71 % Processed clauses : 1877
% 1.49/0.71 % ...of these trivial : 9
% 1.49/0.71 % ...subsumed : 1167
% 1.49/0.71 % ...remaining for further processing : 701
% 1.49/0.71 % Other redundant clauses eliminated : 52
% 1.49/0.71 % Clauses deleted for lack of memory : 0
% 1.49/0.71 % Backward-subsumed : 83
% 1.49/0.71 % Backward-rewritten : 177
% 1.49/0.71 % Generated clauses : 7129
% 1.49/0.71 % ...of the previous two non-redundant : 6167
% 1.49/0.71 % ...aggressively subsumed : 0
% 1.49/0.71 % Contextual simplify-reflections : 34
% 1.49/0.71 % Paramodulations : 7064
% 1.49/0.71 % Factorizations : 0
% 1.49/0.71 % NegExts : 0
% 1.49/0.71 % Equation resolutions : 58
% 1.49/0.71 % Disequality decompositions : 0
% 1.49/0.71 % Total rewrite steps : 6083
% 1.49/0.71 % ...of those cached : 6043
% 1.49/0.71 % Propositional unsat checks : 0
% 1.49/0.71 % Propositional check models : 0
% 1.49/0.71 % Propositional check unsatisfiable : 0
% 1.49/0.71 % Propositional clauses : 0
% 1.49/0.71 % Propositional clauses after purity: 0
% 1.49/0.71 % Propositional unsat core size : 0
% 1.49/0.71 % Propositional preprocessing time : 0.000
% 1.49/0.71 % Propositional encoding time : 0.000
% 1.49/0.71 % Propositional solver time : 0.000
% 1.49/0.71 % Success case prop preproc time : 0.000
% 1.49/0.71 % Success case prop encoding time : 0.000
% 1.49/0.71 % Success case prop solver time : 0.000
% 1.49/0.71 % Current number of processed clauses : 423
% 1.49/0.71 % Positive orientable unit clauses : 36
% 1.49/0.71 % Positive unorientable unit clauses: 0
% 1.49/0.71 % Negative unit clauses : 16
% 1.49/0.71 % Non-unit-clauses : 371
% 1.49/0.71 % Current number of unprocessed clauses: 4248
% 1.49/0.71 % ...number of literals in the above : 21500
% 1.49/0.71 % Current number of archived formulas : 0
% 1.49/0.71 % Current number of archived clauses : 267
% 1.49/0.71 % Clause-clause subsumption calls (NU) : 48592
% 1.49/0.71 % Rec. Clause-clause subsumption calls : 20332
% 1.49/0.71 % Non-unit clause-clause subsumptions : 1240
% 1.49/0.71 % Unit Clause-clause subsumption calls : 1543
% 1.49/0.71 % Rewrite failures with RHS unbound : 0
% 1.49/0.71 % BW rewrite match attempts : 15
% 1.49/0.71 % BW rewrite match successes : 15
% 1.49/0.71 % Condensation attempts : 0
% 1.49/0.71 % Condensation successes : 0
% 1.49/0.71 % Termbank termtop insertions : 123981
% 1.49/0.71 % Search garbage collected termcells : 1365
% 1.49/0.71
% 1.49/0.71 % -------------------------------------------------
% 1.49/0.71 % User time : 0.150 s
% 1.49/0.71 % System time : 0.010 s
% 1.49/0.71 % Total time : 0.160 s
% 1.49/0.71 % Maximum resident set size: 3948 pages
% 1.49/0.71
% 1.49/0.71 % -------------------------------------------------
% 1.49/0.71 % User time : 0.708 s
% 1.49/0.71 % System time : 0.055 s
% 1.49/0.71 % Total time : 0.763 s
% 1.49/0.71 % Maximum resident set size: 4608 pages
% 1.49/0.71 % E exiting
%------------------------------------------------------------------------------