TSTP Solution File: MGT028+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT028+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:37:00 EDT 2024
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 169 ( 0 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 222 ( 90 ~; 96 |; 27 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 15 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_first_movers_negative_growth,axiom,
! [X1] :
( ( environment(X1)
& stable(X1)
& ? [X2] :
( in_environment(X1,X2)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) )
=> ? [X4] :
( greater(X4,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X4) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bAA0Pbj2kc/E---3.1_29256.p',mp_first_movers_negative_growth) ).
fof(l11,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( in_environment(X1,X5)
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> ( greater(growth_rate(efficient_producers,X3),zero)
& greater(zero,growth_rate(first_movers,X3)) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bAA0Pbj2kc/E---3.1_29256.p',l11) ).
fof(prove_l10,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( greater(X5,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bAA0Pbj2kc/E---3.1_29256.p',prove_l10) ).
fof(c_0_3,plain,
! [X12,X13,X16] :
( ( greater(esk5_1(X12),appear(efficient_producers,X12))
| subpopulations(first_movers,efficient_producers,X12,esk4_2(X12,X13))
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) )
& ( ~ subpopulations(first_movers,efficient_producers,X12,X16)
| ~ greater_or_equal(X16,esk5_1(X12))
| greater(zero,growth_rate(first_movers,X16))
| subpopulations(first_movers,efficient_producers,X12,esk4_2(X12,X13))
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) )
& ( greater(esk5_1(X12),appear(efficient_producers,X12))
| greater_or_equal(esk4_2(X12,X13),X13)
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) )
& ( ~ subpopulations(first_movers,efficient_producers,X12,X16)
| ~ greater_or_equal(X16,esk5_1(X12))
| greater(zero,growth_rate(first_movers,X16))
| greater_or_equal(esk4_2(X12,X13),X13)
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) )
& ( greater(esk5_1(X12),appear(efficient_producers,X12))
| ~ greater(zero,growth_rate(first_movers,esk4_2(X12,X13)))
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) )
& ( ~ subpopulations(first_movers,efficient_producers,X12,X16)
| ~ greater_or_equal(X16,esk5_1(X12))
| greater(zero,growth_rate(first_movers,X16))
| ~ greater(zero,growth_rate(first_movers,esk4_2(X12,X13)))
| ~ in_environment(X12,X13)
| ~ environment(X12)
| ~ stable(X12) ) ),
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)],[mp_first_movers_negative_growth])])])])])]) ).
fof(c_0_4,hypothesis,
! [X6,X8] :
( ( in_environment(X6,esk1_1(X6))
| ~ environment(X6)
| ~ stable(X6) )
& ( greater(growth_rate(efficient_producers,X8),zero)
| ~ subpopulations(first_movers,efficient_producers,X6,X8)
| ~ greater_or_equal(X8,esk1_1(X6))
| ~ environment(X6)
| ~ stable(X6) )
& ( greater(zero,growth_rate(first_movers,X8))
| ~ subpopulations(first_movers,efficient_producers,X6,X8)
| ~ greater_or_equal(X8,esk1_1(X6))
| ~ environment(X6)
| ~ stable(X6) ) ),
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)],[l11])])])])])]) ).
cnf(c_0_5,plain,
( greater(esk5_1(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
( in_environment(X1,esk1_1(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( greater(esk5_1(X1),appear(efficient_producers,X1))
| greater_or_equal(esk4_2(X1,X2),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X5] :
( greater(X5,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X5) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
inference(assume_negation,[status(cth)],[prove_l10]) ).
cnf(c_0_9,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ greater_or_equal(X1,esk1_1(X2))
| ~ environment(X2)
| ~ stable(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,hypothesis,
( greater(esk5_1(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,esk1_1(X1)))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,hypothesis,
( greater(esk5_1(X1),appear(efficient_producers,X1))
| greater_or_equal(esk4_2(X1,esk1_1(X1)),esk1_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
fof(c_0_12,negated_conjecture,
! [X10] :
( environment(esk2_0)
& stable(esk2_0)
& ( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X10))
| ~ greater(X10,appear(efficient_producers,esk2_0)) )
& ( greater_or_equal(esk3_1(X10),X10)
| ~ greater(X10,appear(efficient_producers,esk2_0)) )
& ( ~ greater(zero,growth_rate(first_movers,esk3_1(X10)))
| ~ greater(X10,appear(efficient_producers,esk2_0)) ) ),
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_8])])])])])]) ).
cnf(c_0_13,hypothesis,
( greater(zero,growth_rate(first_movers,esk4_2(X1,esk1_1(X1))))
| greater(esk5_1(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
stable(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
environment(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( greater(esk5_1(X1),appear(efficient_producers,X1))
| ~ greater(zero,growth_rate(first_movers,esk4_2(X1,X2)))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( greater(zero,growth_rate(first_movers,esk4_2(esk2_0,esk1_1(esk2_0))))
| greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
( greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0))
| ~ in_environment(esk2_0,esk1_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(X1))
| ~ greater(X1,appear(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
greater(esk5_1(esk2_0),appear(efficient_producers,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_6]),c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,esk3_1(X1)))
| ~ greater(X1,appear(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( greater_or_equal(esk3_1(X1),X1)
| ~ greater(X1,appear(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( greater(zero,growth_rate(first_movers,X2))
| subpopulations(first_movers,efficient_producers,X1,esk4_2(X1,X3))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk2_0,esk3_1(esk5_1(esk2_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ greater(zero,growth_rate(first_movers,esk3_1(esk5_1(esk2_0)))),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
greater_or_equal(esk3_1(esk5_1(esk2_0)),esk5_1(esk2_0)),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_27,plain,
( greater(zero,growth_rate(first_movers,X2))
| greater_or_equal(esk4_2(X1,X3),X3)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_28,negated_conjecture,
( subpopulations(first_movers,efficient_producers,esk2_0,esk4_2(esk2_0,X1))
| ~ in_environment(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]),c_0_15])]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
( greater_or_equal(esk4_2(esk2_0,X1),X1)
| ~ in_environment(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_14]),c_0_15])]),c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
( greater(zero,growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,esk5_1(X1))
| ~ greater(zero,growth_rate(first_movers,esk4_2(X1,X3)))
| ~ in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_31,hypothesis,
subpopulations(first_movers,efficient_producers,esk2_0,esk4_2(esk2_0,esk1_1(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_6]),c_0_14]),c_0_15])]) ).
cnf(c_0_32,hypothesis,
greater_or_equal(esk4_2(esk2_0,esk1_1(esk2_0)),esk1_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_6]),c_0_14]),c_0_15])]) ).
cnf(c_0_33,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,esk4_2(esk2_0,X1)))
| ~ in_environment(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_14]),c_0_15])]),c_0_25]),c_0_26])]) ).
cnf(c_0_34,hypothesis,
greater(zero,growth_rate(first_movers,esk4_2(esk2_0,esk1_1(esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_31]),c_0_32]),c_0_14]),c_0_15])]) ).
cnf(c_0_35,negated_conjecture,
~ in_environment(esk2_0,esk1_1(esk2_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_6]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT028+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 14:23:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.bAA0Pbj2kc/E---3.1_29256.p
% 0.18/0.48 # Version: 3.1.0
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # new_bool_1 with pid 29338 completed with status 0
% 0.18/0.48 # Result found by new_bool_1
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.18/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 29342 completed with status 0
% 0.18/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 3
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 14
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 14
% 0.18/0.48 # Processed clauses : 47
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 1
% 0.18/0.48 # ...remaining for further processing : 46
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 2
% 0.18/0.48 # Generated clauses : 29
% 0.18/0.48 # ...of the previous two non-redundant : 26
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 2
% 0.18/0.48 # Paramodulations : 29
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 43
% 0.18/0.48 # ...of those cached : 38
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 30
% 0.18/0.48 # Positive orientable unit clauses : 8
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 3
% 0.18/0.48 # Non-unit-clauses : 19
% 0.18/0.48 # Current number of unprocessed clauses: 7
% 0.18/0.48 # ...number of literals in the above : 34
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 16
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 167
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 9
% 0.18/0.48 # Non-unit clause-clause subsumptions : 2
% 0.18/0.48 # Unit Clause-clause subsumption calls : 66
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 17
% 0.18/0.48 # BW rewrite match successes : 1
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 2365
% 0.18/0.48 # Search garbage collected termcells : 284
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.007 s
% 0.18/0.48 # System time : 0.000 s
% 0.18/0.48 # Total time : 0.007 s
% 0.18/0.48 # Maximum resident set size: 1744 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.008 s
% 0.18/0.48 # System time : 0.003 s
% 0.18/0.48 # Total time : 0.010 s
% 0.18/0.48 # Maximum resident set size: 1692 pages
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------