%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ129+2 : 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 : n008.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:02:40 PM UTC 2026
% Result : Theorem 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 284 ( 59 equ)
% Maximal formula atoms : 58 ( 7 avg)
% Number of connectives : 361 ( 114 ~; 91 |; 112 &)
% ( 1 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 114 ( 0 sgn 51 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
( ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) ) ),
introduced(definition) ).
fof(c_0_2,negated_conjecture,
~ ( ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
fof(c_0_3,plain,
( epred1_0
=> ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_4,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
inference(apply_def,[status(thm)],[c_0_2,c_0_1]) ).
fof(c_0_5,plain,
! [X23,X25,X26,X27,X29,X31,X33,X34,X35,X36,X37,X39] :
( ( ~ epred1_0
| ~ cyclist(X39)
| X39 = esk8_1(X39) )
& ( ~ epred1_0
| ~ cyclist(X39)
| person(esk8_1(X39)) )
& ( ~ epred1_0
| ~ grocer(X37)
| X37 = esk7_1(X37) )
& ( ~ epred1_0
| ~ grocer(X37)
| person(esk7_1(X37)) )
& ( ~ epred1_0
| X35 != X36
| ~ property1(X36,dishonest,pos)
| ~ property1(X35,honest,pos)
| ~ person(X35) )
& ( ~ epred1_0
| X33 != X34
| ~ property1(X34,unhealthy,pos)
| ~ property1(X33,healthy,pos)
| ~ person(X33) )
& ( ~ epred1_0
| ~ property1(X31,unhealthy,pos)
| ~ cyclist(X31)
| X31 = esk6_1(X31) )
& ( ~ epred1_0
| ~ property1(X31,unhealthy,pos)
| ~ cyclist(X31)
| property1(esk6_1(X31),dishonest,pos) )
& ( ~ epred1_0
| ~ cyclist(X29)
| X29 = esk5_1(X29) )
& ( ~ epred1_0
| ~ cyclist(X29)
| property1(esk5_1(X29),industrious,pos) )
& ( ~ epred1_0
| ~ property1(X27,industrious,pos)
| ~ grocer(X27)
| X27 = esk4_1(X27) )
& ( ~ epred1_0
| ~ property1(X27,industrious,pos)
| ~ grocer(X27)
| property1(esk4_1(X27),honest,pos) )
& ( ~ epred1_0
| X25 != X26
| ~ property1(X26,healthy,pos)
| ~ grocer(X25) )
& ( ~ epred1_0
| ~ property1(X23,industrious,pos)
| ~ property1(X23,honest,pos)
| ~ person(X23)
| X23 = esk3_1(X23) )
& ( ~ epred1_0
| ~ property1(X23,industrious,pos)
| ~ property1(X23,honest,pos)
| ~ person(X23)
| property1(esk3_1(X23),healthy,pos) ) ),
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_3])])])])])]) ).
fof(c_0_6,negated_conjecture,
( esk1_0 = esk2_0
& cyclist(esk2_0)
& grocer(esk1_0)
& epred1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1)
| property1(esk3_1(X1),healthy,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1)
| X1 = esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ epred1_0
| ~ grocer(X1)
| person(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ epred1_0
| ~ grocer(X1)
| X1 = esk7_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| property1(esk4_1(X1),honest,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| X1 = esk4_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ epred1_0
| ~ cyclist(X1)
| property1(esk5_1(X1),industrious,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ epred1_0
| ~ cyclist(X1)
| X1 = esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ person(X1)
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| property1(esk3_1(X1),healthy,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_17,plain,
( ~ person(X1)
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| esk3_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]) ).
cnf(c_0_18,plain,
( ~ grocer(X1)
| person(esk7_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8])]) ).
cnf(c_0_19,plain,
( ~ grocer(X1)
| esk7_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8])]) ).
cnf(c_0_20,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| property1(esk4_1(X1),honest,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
cnf(c_0_21,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| esk4_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8])]) ).
cnf(c_0_22,plain,
( ~ epred1_0
| X1 != X2
| ~ property1(X2,healthy,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( ~ cyclist(X1)
| property1(esk5_1(X1),industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8])]) ).
cnf(c_0_24,plain,
( ~ cyclist(X1)
| esk5_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_8])]) ).
cnf(c_0_25,negated_conjecture,
cyclist(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,plain,
( ~ person(X1)
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| property1(X1,healthy,pos) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_28,plain,
( ~ grocer(X1)
| person(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| property1(X1,honest,pos) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ property1(X1,healthy,pos)
| ~ grocer(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_8])])]) ).
cnf(c_0_31,plain,
( ~ cyclist(X1)
| property1(X1,industrious,pos) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
cyclist(esk1_0),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
grocer(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ129+2 : 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/5.38 % Computer : n008.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 03:53:29 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % new_bool_3 with pid 88784 completed with status 0
% 0.15/5.45 % Result found by new_bool_3
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.45 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.15/5.45 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.15/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.45 % SubtermCWHack with pid 88789 completed with status 0
% 0.15/5.45 % Result found by SubtermCWHack
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.45 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.15/5.45 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.15/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Theorem
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 1
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 19
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 19
% 0.15/5.45 % Processed clauses : 50
% 0.15/5.45 % ...of these trivial : 0
% 0.15/5.45 % ...subsumed : 7
% 0.15/5.45 % ...remaining for further processing : 43
% 0.15/5.45 % Other redundant clauses eliminated : 3
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 4
% 0.15/5.45 % Backward-rewritten : 1
% 0.15/5.45 % Generated clauses : 34
% 0.15/5.45 % ...of the previous two non-redundant : 34
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 2
% 0.15/5.45 % Paramodulations : 31
% 0.15/5.45 % Factorizations : 0
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 3
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 20
% 0.15/5.45 % ...of those cached : 16
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 35
% 0.15/5.45 % Positive orientable unit clauses : 6
% 0.15/5.45 % Positive unorientable unit clauses: 0
% 0.15/5.45 % Negative unit clauses : 3
% 0.15/5.45 % Non-unit-clauses : 26
% 0.15/5.45 % Current number of unprocessed clauses: 3
% 0.15/5.45 % ...number of literals in the above : 12
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 5
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 133
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 107
% 0.15/5.45 % Non-unit clause-clause subsumptions : 10
% 0.15/5.45 % Unit Clause-clause subsumption calls : 26
% 0.15/5.45 % Rewrite failures with RHS unbound : 0
% 0.15/5.45 % BW rewrite match attempts : 1
% 0.15/5.45 % BW rewrite match successes : 1
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 2106
% 0.15/5.45 % Search garbage collected termcells : 381
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.004 s
% 0.15/5.45 % System time : 0.004 s
% 0.15/5.45 % Total time : 0.007 s
% 0.15/5.45 % Maximum resident set size: 3648 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.005 s
% 0.15/5.45 % System time : 0.009 s
% 0.15/5.45 % Total time : 0.014 s
% 0.15/5.45 % Maximum resident set size: 4608 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------