TSTP Solution File: MGT028-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT028-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 00:38:32 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 13 unt; 16 nHn; 54 RR)
% Number of literals : 185 ( 0 equ; 121 neg)
% Maximal clause size : 7 ( 3 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 : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_first_movers_negative_growth_1,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_1) ).
cnf(l11_7,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_7) ).
cnf(mp_first_movers_negative_growth_2,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_2) ).
cnf(l11_9,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l11_9) ).
cnf(mp_first_movers_negative_growth_5,axiom,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_5) ).
cnf(prove_l10_11,negated_conjecture,
stable(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_11) ).
cnf(prove_l10_10,negated_conjecture,
environment(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_10) ).
cnf(prove_l10_12,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_12) ).
cnf(prove_l10_14,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_14) ).
cnf(prove_l10_13,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l10_13) ).
cnf(mp_first_movers_negative_growth_3,axiom,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_3) ).
cnf(mp_first_movers_negative_growth_4,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_4) ).
cnf(mp_first_movers_negative_growth_6,axiom,
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_first_movers_negative_growth_6) ).
cnf(c_0_13,plain,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_1]) ).
cnf(c_0_14,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(fof_simplification,[status(thm)],[l11_7]) ).
cnf(c_0_15,plain,
( greater_or_equal(sk1(X2,X1),X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_2]) ).
cnf(c_0_16,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
inference(fof_simplification,[status(thm)],[l11_9]) ).
cnf(c_0_17,plain,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
c_0_13 ).
cnf(c_0_18,hypothesis,
( in_environment(X1,sk3(X1))
| ~ environment(X1)
| ~ stable(X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( greater_or_equal(sk1(X2,X1),X2)
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
c_0_15 ).
cnf(c_0_20,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk3(X1)) ),
c_0_16 ).
cnf(c_0_21,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| subpopulations(first_movers,efficient_producers,X1,sk1(sk3(X1),X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
( greater_or_equal(sk1(sk3(X1),X1),sk3(X1))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_5]) ).
cnf(c_0_24,hypothesis,
( greater(zero,growth_rate(first_movers,sk1(sk3(X1),X1)))
| greater(sk2(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
stable(sk4),
prove_l10_11 ).
cnf(c_0_26,negated_conjecture,
environment(sk4),
prove_l10_10 ).
cnf(c_0_27,plain,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4)))
| greater(sk2(sk4),appear(efficient_producers,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
inference(fof_simplification,[status(thm)],[prove_l10_12]) ).
cnf(c_0_30,negated_conjecture,
( greater(sk2(sk4),appear(efficient_producers,sk4))
| ~ in_environment(sk4,sk3(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X1))) ),
inference(fof_simplification,[status(thm)],[prove_l10_14]) ).
cnf(c_0_32,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
inference(fof_simplification,[status(thm)],[prove_l10_13]) ).
cnf(c_0_33,plain,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_3]) ).
cnf(c_0_34,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk5(X1))
| ~ greater(X1,appear(efficient_producers,sk4)) ),
c_0_29 ).
cnf(c_0_35,hypothesis,
greater(sk2(sk4),appear(efficient_producers,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_25]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk4))
| ~ greater(zero,growth_rate(first_movers,sk5(X1))) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( greater_or_equal(sk5(X1),X1)
| ~ greater(X1,appear(efficient_producers,sk4)) ),
c_0_32 ).
cnf(c_0_38,plain,
( greater_or_equal(sk1(X2,X1),X2)
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_4]) ).
cnf(c_0_39,plain,
( subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
greater_or_equal(sk5(sk2(sk4)),sk2(sk4)),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_43,plain,
( greater_or_equal(sk1(X2,X1),X2)
| greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
c_0_38 ).
cnf(c_0_44,plain,
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
inference(fof_simplification,[status(thm)],[mp_first_movers_negative_growth_6]) ).
cnf(c_0_45,negated_conjecture,
( subpopulations(first_movers,efficient_producers,sk4,sk1(X1,sk4))
| ~ in_environment(sk4,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_39,c_0_40]),c_0_25]),c_0_26])]),c_0_41]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
( greater_or_equal(sk1(X1,sk4),X1)
| ~ in_environment(sk4,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_43,c_0_40]),c_0_25]),c_0_26])]),c_0_41]),c_0_42])]) ).
cnf(c_0_47,plain,
( greater(zero,growth_rate(first_movers,X3))
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,X3)
| ~ greater_or_equal(X3,sk2(X1)) ),
c_0_44 ).
cnf(c_0_48,hypothesis,
subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_18]),c_0_25]),c_0_26])]) ).
cnf(c_0_49,hypothesis,
greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_18]),c_0_25]),c_0_26])]) ).
cnf(c_0_50,negated_conjecture,
( ~ greater(zero,growth_rate(first_movers,sk1(X1,sk4)))
| ~ in_environment(sk4,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_47,c_0_40]),c_0_25]),c_0_26])]),c_0_41]),c_0_42])]) ).
cnf(c_0_51,hypothesis,
greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_48]),c_0_49]),c_0_25]),c_0_26])]) ).
cnf(c_0_52,negated_conjecture,
~ in_environment(sk4,sk3(sk4)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_18]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : MGT028-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n012.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 : Sun May 19 00:07:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 19346 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 19349 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 14
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 14
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 14
% 0.19/0.48 # Processed clauses : 47
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 46
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 2
% 0.19/0.48 # Generated clauses : 29
% 0.19/0.48 # ...of the previous two non-redundant : 26
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 2
% 0.19/0.48 # Paramodulations : 29
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 43
% 0.19/0.48 # ...of those cached : 38
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 30
% 0.19/0.48 # Positive orientable unit clauses : 8
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 3
% 0.19/0.48 # Non-unit-clauses : 19
% 0.19/0.48 # Current number of unprocessed clauses: 7
% 0.19/0.48 # ...number of literals in the above : 34
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 16
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 144
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 9
% 0.19/0.48 # Non-unit clause-clause subsumptions : 2
% 0.19/0.48 # Unit Clause-clause subsumption calls : 53
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 19
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1959
% 0.19/0.48 # Search garbage collected termcells : 59
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.007 s
% 0.19/0.48 # Maximum resident set size: 1748 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.005 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------