%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC272+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:43:44 PM UTC 2026
% Result : Theorem 187.98s 32.54s
% Output : CNFRefutation 187.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 236 ( 42 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 306 ( 106 ~; 119 |; 50 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 49 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| totalorderedP(X1)
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| totalorderedP(X1)
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| totalorderedP(X1)
| ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4
| ~ ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X15,X16,X17,X18] :
( ( nil != esk3_0
| nil = esk4_0 )
& ~ totalorderedP(esk1_0)
& ( ~ lt(X17,X15)
| app(X18,cons(X17,nil)) != esk3_0
| ~ ssList(X18)
| ~ ssItem(X17)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& strictorderedP(esk3_0)
& app(esk3_0,esk5_0) = esk4_0
& ssList(esk5_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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_5])])])])]) ).
fof(c_0_7,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_8,plain,
! [X81,X82,X83,X84,X85,X86] :
( ( ~ ssList(X81)
| strictorderedP(X81)
| ~ lt(esk15_1(X81),esk16_1(X81)) )
& ( ~ ssList(X81)
| strictorderedP(X81)
| app(app(esk17_1(X81),cons(esk15_1(X81),esk18_1(X81))),cons(esk16_1(X81),esk19_1(X81))) = X81 )
& ( ~ ssList(X81)
| strictorderedP(X81)
| ssList(esk19_1(X81)) )
& ( ~ ssList(X81)
| strictorderedP(X81)
| ssList(esk18_1(X81)) )
& ( ~ ssList(X81)
| strictorderedP(X81)
| ssList(esk17_1(X81)) )
& ( ~ ssList(X81)
| strictorderedP(X81)
| ssItem(esk16_1(X81)) )
& ( ~ ssList(X81)
| strictorderedP(X81)
| ssItem(esk15_1(X81)) )
& ( ~ ssList(X81)
| lt(X82,X83)
| app(app(X84,cons(X82,X85)),cons(X83,X86)) != X81
| ~ ssList(X86)
| ~ ssList(X85)
| ~ ssList(X84)
| ~ ssItem(X83)
| ~ ssItem(X82)
| ~ strictorderedP(X81) ) ),
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)],[ax12])])])])])]) ).
fof(c_0_9,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( ~ ssList(X24)
| totalorderedP(X24)
| ~ leq(esk8_1(X24),esk9_1(X24)) )
& ( ~ ssList(X24)
| totalorderedP(X24)
| app(app(esk10_1(X24),cons(esk8_1(X24),esk11_1(X24))),cons(esk9_1(X24),esk12_1(X24))) = X24 )
& ( ~ ssList(X24)
| totalorderedP(X24)
| ssList(esk12_1(X24)) )
& ( ~ ssList(X24)
| totalorderedP(X24)
| ssList(esk11_1(X24)) )
& ( ~ ssList(X24)
| totalorderedP(X24)
| ssList(esk10_1(X24)) )
& ( ~ ssList(X24)
| totalorderedP(X24)
| ssItem(esk9_1(X24)) )
& ( ~ ssList(X24)
| totalorderedP(X24)
| ssItem(esk8_1(X24)) )
& ( ~ ssList(X24)
| leq(X25,X26)
| app(app(X27,cons(X25,X28)),cons(X26,X29)) != X24
| ~ ssList(X29)
| ~ ssList(X28)
| ~ ssList(X27)
| ~ ssItem(X26)
| ~ ssItem(X25)
| ~ totalorderedP(X24) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_10,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X49,X50] :
( ( ~ ssItem(X49)
| ~ ssItem(X50)
| lt(X49,X50)
| ~ leq(X49,X50)
| X49 = X50 )
& ( ~ ssItem(X49)
| ~ ssItem(X50)
| ~ lt(X49,X50)
| leq(X49,X50) )
& ( ~ ssItem(X49)
| ~ ssItem(X50)
| ~ lt(X49,X50)
| X49 != X50 ) ),
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_7])])])])]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| app(app(esk10_1(X1),cons(esk8_1(X1),esk11_1(X1))),cons(esk9_1(X1),esk12_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ totalorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssList(esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| totalorderedP(X1)
| ssItem(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ leq(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
app(app(esk10_1(esk3_0),cons(esk8_1(esk3_0),esk11_1(esk3_0))),cons(esk9_1(esk3_0),esk12_1(esk3_0))) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk12_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk11_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk10_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk9_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
ssItem(esk8_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_17]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ lt(esk8_1(X1),esk9_1(X1))
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_21]) ).
cnf(c_0_34,negated_conjecture,
lt(esk8_1(esk3_0),esk9_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_16]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC272+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.68 % Computer : n005.cluster.edu
% 0.19/0.68 % Model : x86_64 x86_64
% 0.19/0.68 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.68 % Memory : 8046.5625MB
% 0.19/0.68 % OS : Linux 6.8.0-71-generic
% 0.19/0.68 % CPULimit : 300
% 0.19/0.68 % WCLimit : 300
% 0.19/0.68 % DateTime : Mon Sep 21 08:10:33 UTC 2026
% 0.19/0.68 % CPUTime :
% 0.19/0.68 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.73 Running first-order theorem proving
% 0.23/0.74 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
% 187.98/32.54 % Version: 3.5.1
% 187.98/32.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 187.98/32.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 187.98/32.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 187.98/32.54 % Starting new_bool_3 with 300s (1) cores
% 187.98/32.54 % Starting new_bool_1 with 300s (1) cores
% 187.98/32.54 % Starting sh5l with 300s (1) cores
% 187.98/32.54 % new_bool_3 with pid 2982943 completed with status 0
% 187.98/32.54 % Result found by new_bool_3
% 187.98/32.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 187.98/32.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 187.98/32.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 187.98/32.54 % Starting new_bool_3 with 300s (1) cores
% 187.98/32.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 187.98/32.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 187.98/32.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 187.98/32.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 187.98/32.54 % Starting SubtermCWHack with 31s (1) cores
% 187.98/32.54 % SubtermCWHack with pid 2982946 completed with status 8
% 187.98/32.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 187.98/32.54 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2983418 completed with status 0
% 187.98/32.54 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 187.98/32.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 187.98/32.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 187.98/32.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 187.98/32.54 % Starting new_bool_3 with 300s (1) cores
% 187.98/32.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 187.98/32.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 187.98/32.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 187.98/32.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 187.98/32.54 % Starting SubtermCWHack with 31s (1) cores
% 187.98/32.54 % SubtermCWHack with pid 2982946 completed with status 8
% 187.98/32.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 187.98/32.54 % Preprocessing time : 0.001 s
% 187.98/32.54 % Presaturation interreduction done
% 187.98/32.54
% 187.98/32.54 % Proof found!
% 187.98/32.54 % SZS status Theorem
% 187.98/32.54 % SZS output start CNFRefutation
% See solution above
% 187.98/32.54 % Parsed axioms : 96
% 187.98/32.54 % Removed by relevancy pruning/SinE : 52
% 187.98/32.54 % Initial clauses : 88
% 187.98/32.54 % Removed in clause preprocessing : 2
% 187.98/32.54 % Initial clauses in saturation : 86
% 187.98/32.54 % Processed clauses : 4209
% 187.98/32.54 % ...of these trivial : 440
% 187.98/32.54 % ...subsumed : 2694
% 187.98/32.54 % ...remaining for further processing : 1075
% 187.98/32.54 % Other redundant clauses eliminated : 61
% 187.98/32.54 % Clauses deleted for lack of memory : 0
% 187.98/32.54 % Backward-subsumed : 22
% 187.98/32.54 % Backward-rewritten : 2
% 187.98/32.54 % Generated clauses : 30142
% 187.98/32.54 % ...of the previous two non-redundant : 27660
% 187.98/32.54 % ...aggressively subsumed : 0
% 187.98/32.54 % Contextual simplify-reflections : 84
% 187.98/32.54 % Paramodulations : 30058
% 187.98/32.54 % Factorizations : 0
% 187.98/32.54 % NegExts : 0
% 187.98/32.54 % Equation resolutions : 85
% 187.98/32.54 % Disequality decompositions : 0
% 187.98/32.54 % Total rewrite steps : 8120
% 187.98/32.54 % ...of those cached : 8102
% 187.98/32.54 % Propositional unsat checks : 0
% 187.98/32.54 % Propositional check models : 0
% 187.98/32.54 % Propositional check unsatisfiable : 0
% 187.98/32.54 % Propositional clauses : 0
% 187.98/32.54 % Propositional clauses after purity: 0
% 187.98/32.54 % Propositional unsat core size : 0
% 187.98/32.54 % Propositional preprocessing time : 0.000
% 187.98/32.54 % Propositional encoding time : 0.000
% 187.98/32.54 % Propositional solver time : 0.000
% 187.98/32.54 % Success case prop preproc time : 0.000
% 187.98/32.54 % Success case prop encoding time : 0.000
% 187.98/32.54 % Success case prop solver time : 0.000
% 187.98/32.54 % Current number of processed clauses : 965
% 187.98/32.54 % Positive orientable unit clauses : 22
% 187.98/32.54 % Positive unorientable unit clauses: 0
% 187.98/32.54 % Negative unit clauses : 2
% 187.98/32.54 % Non-unit-clauses : 941
% 187.98/32.54 % Current number of unprocessed clauses: 23597
% 187.98/32.54 % ...number of literals in the above : 111089
% 187.98/32.54 % Current number of archived formulas : 0
% 187.98/32.54 % Current number of archived clauses : 104
% 187.98/32.54 % Clause-clause subsumption calls (NU) : 146587
% 187.98/32.54 % Rec. Clause-clause subsumption calls : 69827
% 187.98/32.54 % Non-unit clause-clause subsumptions : 2799
% 187.98/32.54 % Unit Clause-clause subsumption calls : 698
% 187.98/32.54 % Rewrite failures with RHS unbound : 0
% 187.98/32.54 % BW rewrite match attempts : 17
% 187.98/32.54 % BW rewrite match successes : 2
% 187.98/32.54 % Condensation attempts : 0
% 187.98/32.54 % Condensation successes : 0
% 187.98/32.54 % Termbank termtop insertions : 523181
% 187.98/32.54 % Search garbage collected termcells : 2242
% 187.98/32.54
% 187.98/32.54 % -------------------------------------------------
% 187.98/32.54 % User time : 30.188 s
% 187.98/32.54 % System time : 1.219 s
% 187.98/32.54 % Total time : 31.407 s
% 187.98/32.54 % Maximum resident set size: 3760 pages
% 187.98/32.54
% 187.98/32.54 % -------------------------------------------------
% 187.98/32.54 % User time : 30.195 s
% 187.98/32.54 % System time : 1.221 s
% 187.98/32.54 % Total time : 31.416 s
% 187.98/32.54 % Maximum resident set size: 4608 pages
% 187.98/32.54 % E exiting
%------------------------------------------------------------------------------