%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT006+1 : TPTP v9.3.1. Released v2.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 01:25:59 PM UTC 2026
% Result : Theorem 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 211 ( 0 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 299 ( 129 ~; 125 |; 39 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 139 ( 18 sgn 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_FOL,conjecture,
! [X1,X7,X8,X9,X10,X5,X6] :
( ( greater(X6,X5)
& accountability(X1,X10,X6)
& accountability(X1,X9,X5)
& reliability(X1,X8,X6)
& reliability(X1,X7,X5)
& reorganization_free(X1,X5,X6)
& organization(X1,X6)
& organization(X1,X5) )
=> ( greater(X10,X9)
& greater(X8,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_FOL) ).
fof(a2_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
( ( reproducibility(X4,X12,X6)
& reproducibility(X1,X11,X5)
& accountability(X4,X10,X6)
& accountability(X1,X9,X5)
& reliability(X4,X8,X6)
& reliability(X1,X7,X5)
& organization(X4,X6)
& organization(X1,X5) )
=> ( greater(X12,X11)
<=> ( greater(X10,X9)
& greater(X8,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2_FOL) ).
fof(a4_FOL,hypothesis,
! [X1,X11,X12,X5,X6] :
( ( greater(X6,X5)
& reproducibility(X1,X12,X6)
& reproducibility(X1,X11,X5)
& reorganization_free(X1,X5,X6)
& organization(X1,X6)
& organization(X1,X5) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a4_FOL) ).
fof(mp3,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : reproducibility(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X7,X8,X9,X10,X5,X6] :
( ( greater(X6,X5)
& accountability(X1,X10,X6)
& accountability(X1,X9,X5)
& reliability(X1,X8,X6)
& reliability(X1,X7,X5)
& reorganization_free(X1,X5,X6)
& organization(X1,X6)
& organization(X1,X5) )
=> ( greater(X10,X9)
& greater(X8,X7) ) ),
inference(assume_negation,[status(cth)],[t6_FOL]) ).
fof(c_0_5,hypothesis,
! [X20,X21,X22,X23,X24,X25,X26,X27,X28,X29] :
( ( ~ reproducibility(X21,X29,X23)
| ~ reproducibility(X20,X28,X22)
| ~ accountability(X21,X27,X23)
| ~ accountability(X20,X26,X22)
| ~ reliability(X21,X25,X23)
| ~ reliability(X20,X24,X22)
| ~ organization(X21,X23)
| ~ organization(X20,X22)
| greater(X29,X28)
| ~ greater(X27,X26)
| ~ greater(X25,X24) )
& ( ~ reproducibility(X21,X29,X23)
| ~ reproducibility(X20,X28,X22)
| ~ accountability(X21,X27,X23)
| ~ accountability(X20,X26,X22)
| ~ reliability(X21,X25,X23)
| ~ reliability(X20,X24,X22)
| ~ organization(X21,X23)
| ~ organization(X20,X22)
| ~ greater(X29,X28)
| greater(X27,X26) )
& ( ~ reproducibility(X21,X29,X23)
| ~ reproducibility(X20,X28,X22)
| ~ accountability(X21,X27,X23)
| ~ accountability(X20,X26,X22)
| ~ reliability(X21,X25,X23)
| ~ reliability(X20,X24,X22)
| ~ organization(X21,X23)
| ~ organization(X20,X22)
| ~ greater(X29,X28)
| greater(X25,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_FOL])])])]) ).
fof(c_0_6,negated_conjecture,
( ( ~ greater(esk5_0,esk4_0)
| ~ greater(esk3_0,esk2_0) )
& greater(esk7_0,esk6_0)
& accountability(esk1_0,esk5_0,esk7_0)
& accountability(esk1_0,esk4_0,esk6_0)
& reliability(esk1_0,esk3_0,esk7_0)
& reliability(esk1_0,esk2_0,esk6_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& organization(esk1_0,esk7_0)
& organization(esk1_0,esk6_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,hypothesis,
( ~ reproducibility(X7,X3,X8)
| ~ reproducibility(X5,X4,X6)
| ~ accountability(X7,X1,X8)
| ~ accountability(X5,X2,X6)
| ~ reliability(X7,X10,X8)
| ~ reliability(X5,X9,X6)
| ~ organization(X7,X8)
| ~ organization(X5,X6)
| ~ greater(X3,X4)
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
accountability(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X30,X31,X32,X33,X34] :
( greater(X32,X31)
| ~ greater(X34,X33)
| ~ reproducibility(X30,X32,X34)
| ~ reproducibility(X30,X31,X33)
| ~ reorganization_free(X30,X33,X34)
| ~ organization(X30,X34)
| ~ organization(X30,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a4_FOL])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ organization(X4,X5)
| ~ reproducibility(X4,X3,X5)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reliability(X4,X7,X5)
| ~ reliability(esk1_0,X6,esk7_0)
| ~ accountability(X4,X1,X5)
| ~ greater(X2,X3)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
reliability(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X35,X36] :
( reproducibility(X35,esk8_2(X35,X36),X36)
| ~ organization(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3])])])]) ).
cnf(c_0_14,hypothesis,
( ~ greater(X3,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,hypothesis,
( ~ reproducibility(X7,X3,X8)
| ~ reproducibility(X5,X4,X6)
| ~ accountability(X7,X10,X8)
| ~ accountability(X5,X9,X6)
| ~ reliability(X7,X1,X8)
| ~ reliability(X5,X2,X6)
| ~ organization(X7,X8)
| ~ organization(X5,X6)
| ~ greater(X3,X4)
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ organization(X4,X5)
| ~ reproducibility(X4,X3,X5)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reliability(X4,X6,X5)
| ~ accountability(X4,X1,X5)
| ~ greater(X2,X3)
| greater(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,plain,
( ~ organization(X1,X2)
| reproducibility(X1,esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ reproducibility(esk1_0,X2,esk6_0)
| ~ reproducibility(esk1_0,X1,esk7_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( ~ organization(X5,X7)
| ~ reproducibility(X5,X4,X7)
| ~ reproducibility(esk1_0,X3,esk7_0)
| ~ reliability(X5,X2,X7)
| ~ reliability(esk1_0,X1,esk7_0)
| ~ accountability(X5,X6,X7)
| ~ greater(X3,X4)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_9])]) ).
cnf(c_0_23,negated_conjecture,
( ~ organization(X3,X4)
| ~ reproducibility(X3,X2,X4)
| ~ reliability(X3,X5,X4)
| ~ accountability(X3,X1,X4)
| ~ greater(esk8_2(esk1_0,esk7_0),X2)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9])]) ).
cnf(c_0_24,negated_conjecture,
( ~ reproducibility(esk1_0,X1,esk6_0)
| greater(esk8_2(esk1_0,esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_9])]) ).
cnf(c_0_25,negated_conjecture,
( ~ organization(X4,X6)
| ~ reproducibility(X4,X3,X6)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reliability(X4,X1,X6)
| ~ accountability(X4,X5,X6)
| ~ greater(X2,X3)
| greater(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,X5,X3)
| ~ reproducibility(esk1_0,X5,esk6_0)
| ~ reliability(X2,X4,X3)
| ~ accountability(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ organization(X3,X5)
| ~ reproducibility(X3,X2,X5)
| ~ reliability(X3,X1,X5)
| ~ accountability(X3,X4,X5)
| ~ greater(esk8_2(esk1_0,esk7_0),X2)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_9])]) ).
cnf(c_0_28,negated_conjecture,
( ~ organization(X2,X3)
| ~ reproducibility(X2,esk8_2(esk1_0,esk6_0),X3)
| ~ reliability(X2,X4,X3)
| ~ accountability(X2,X1,X3)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( ~ organization(X2,X4)
| ~ reproducibility(X2,X5,X4)
| ~ reproducibility(esk1_0,X5,esk6_0)
| ~ reliability(X2,X1,X4)
| ~ accountability(X2,X3,X4)
| greater(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ reliability(esk1_0,X2,esk6_0)
| ~ accountability(esk1_0,X1,esk6_0)
| greater(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_17])]) ).
cnf(c_0_31,negated_conjecture,
accountability(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( ~ organization(X2,X4)
| ~ reproducibility(X2,esk8_2(esk1_0,esk6_0),X4)
| ~ reliability(X2,X1,X4)
| ~ accountability(X2,X3,X4)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_17])]) ).
cnf(c_0_33,negated_conjecture,
( ~ reliability(esk1_0,X1,esk6_0)
| greater(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
reliability(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( ~ reliability(esk1_0,X1,esk6_0)
| ~ accountability(esk1_0,X2,esk6_0)
| greater(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_17])]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(esk5_0,esk4_0)
| ~ greater(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
greater(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ reliability(esk1_0,X1,esk6_0)
| greater(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ greater(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT006+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n008.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 21 01:21:45 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/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 % sh5l with pid 4040516 completed with status 0
% 0.15/5.45 % Result found by sh5l
% 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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.45 % Search class: FHHNF-FFSM22-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 4040517 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 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.45 % Search class: FHHNF-FFSM22-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 : 4
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 14
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 14
% 0.15/5.45 % Processed clauses : 35
% 0.15/5.45 % ...of these trivial : 0
% 0.15/5.45 % ...subsumed : 0
% 0.15/5.45 % ...remaining for further processing : 35
% 0.15/5.45 % Other redundant clauses eliminated : 0
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 3
% 0.15/5.45 % Backward-rewritten : 2
% 0.15/5.45 % Generated clauses : 24
% 0.15/5.45 % ...of the previous two non-redundant : 24
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 0
% 0.15/5.45 % Paramodulations : 24
% 0.15/5.45 % Factorizations : 0
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 0
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 19
% 0.15/5.45 % ...of those cached : 15
% 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 : 30
% 0.15/5.45 % Positive orientable unit clauses : 9
% 0.15/5.45 % Positive unorientable unit clauses: 0
% 0.15/5.45 % Negative unit clauses : 1
% 0.15/5.45 % Non-unit-clauses : 20
% 0.15/5.45 % Current number of unprocessed clauses: 3
% 0.15/5.45 % ...number of literals in the above : 26
% 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) : 484
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 15
% 0.15/5.45 % Non-unit clause-clause subsumptions : 3
% 0.15/5.45 % Unit Clause-clause subsumption calls : 15
% 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 : 2140
% 0.15/5.45 % Search garbage collected termcells : 334
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.005 s
% 0.15/5.45 % System time : 0.003 s
% 0.15/5.45 % Total time : 0.008 s
% 0.15/5.45 % Maximum resident set size: 3896 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.007 s
% 0.15/5.45 % System time : 0.007 s
% 0.15/5.45 % Total time : 0.014 s
% 0.15/5.45 % Maximum resident set size: 4864 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------