TSTP Solution File: MGT037-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT037-2 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:37:10 EDT 2023
% Result : Satisfiable 0.19s 0.50s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named a13_50)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_27,axiom,
( cardinality_at_time(efficient_producers,X2) = zero
| greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
mp_efficient_producers_exist_40,
[final] ).
cnf(c_0_28,negated_conjecture,
in_environment(sk3,sk4),
prove_t6_52,
[final] ).
cnf(c_0_29,negated_conjecture,
environment(sk3),
prove_t6_51,
[final] ).
cnf(c_0_31,axiom,
( greater(zero,growth_rate(efficient_producers,sk1(X2,X1)))
| ~ environment(X1)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| cardinality_at_time(efficient_producers,X2) != zero ),
mp_previous_negative_growth_31,
[final] ).
cnf(c_0_32,negated_conjecture,
greater_or_equal(sk4,appear(efficient_producers,sk3)),
prove_t6_53,
[final] ).
cnf(c_0_33,negated_conjecture,
cardinality_at_time(efficient_producers,sk4) = zero,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),
[final] ).
cnf(c_0_34,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
a13_50,
[final] ).
cnf(c_0_35,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk1(sk4,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_33])]),
[final] ).
cnf(c_0_36,axiom,
( in_environment(X1,sk1(X2,X1))
| ~ environment(X1)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| cardinality_at_time(efficient_producers,X2) != zero ),
mp_previous_negative_growth_29,
[final] ).
cnf(c_0_38,negated_conjecture,
in_environment(sk3,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_29])]),c_0_33])]),
[final] ).
cnf(c_0_39,negated_conjecture,
( greater(zero,growth_rate(X1,sk1(sk4,sk3)))
| ~ greater(resilience(efficient_producers),resilience(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_40,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_44,
[final] ).
cnf(c_0_41,hypothesis,
( X2 = efficient_producers
| X2 = first_movers
| ~ environment(X1)
| ~ subpopulation(X2,X1,X3)
| ~ greater(cardinality_at_time(X2,X3),zero) ),
a11_49,
[final] ).
cnf(c_0_42,axiom,
( decreases(number_of_organizations(X1,X2))
| greater(cardinality_at_time(sk2(X2,X1),X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
mp_non_decreasing_34,
[final] ).
cnf(c_0_43,axiom,
( decreases(number_of_organizations(X1,X2))
| subpopulation(sk2(X2,X1),X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
mp_non_decreasing_33,
[final] ).
cnf(c_0_44,hypothesis,
greater(zero,growth_rate(first_movers,sk1(sk4,sk3))),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_45,axiom,
( decreases(number_of_organizations(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(sk2(X2,X1),X2)) ),
mp_non_decreasing_35,
[final] ).
cnf(c_0_46,hypothesis,
( sk2(X1,X2) = first_movers
| sk2(X1,X2) = efficient_producers
| decreases(number_of_organizations(X2,X1))
| ~ subpopulation(sk2(X1,X2),X3,X1)
| ~ in_environment(X2,X1)
| ~ environment(X3)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_49,negated_conjecture,
( subpopulation(sk2(sk4,sk3),sk3,sk4)
| decreases(number_of_organizations(sk3,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_50,axiom,
( subpopulation(first_movers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
mp_subpopulations_37,
[final] ).
cnf(c_0_53,axiom,
( subpopulation(efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
mp_subpopulations_38,
[final] ).
cnf(c_0_54,negated_conjecture,
( greater(zero,growth_rate(X1,sk1(sk4,sk3)))
| ~ greater(resilience(first_movers),resilience(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_56,negated_conjecture,
~ greater(zero,zero),
inference(rw,[status(thm)],[c_0_30,c_0_33]),
[final] ).
cnf(c_0_57,axiom,
( cardinality_at_time(X3,X2) = zero
| ~ environment(X1)
| ~ in_environment(X1,X2)
| number_of_organizations(X1,X2) != zero
| ~ subpopulation(X3,X1,X2) ),
mp_no_members_36,
[final] ).
cnf(c_0_58,negated_conjecture,
subpopulation(first_movers,sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_59,hypothesis,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ decreases(resources(X1,X2))
| ~ decreases(number_of_organizations(X1,X2)) ),
a7_47,
[final] ).
cnf(c_0_61,negated_conjecture,
subpopulation(efficient_producers,sk3,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_63,hypothesis,
( decreases(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ greater(equilibrium(X1),X2) ),
a4_45,
[final] ).
cnf(c_0_64,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
a4_46,
[final] ).
cnf(c_0_65,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| ~ greater(zero,growth_rate(sk2(sk4,sk3),sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_66,negated_conjecture,
( sk2(sk4,sk3) = first_movers
| decreases(number_of_organizations(sk3,sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_55]),c_0_33]),c_0_28]),c_0_29])]),c_0_56]),
[final] ).
cnf(c_0_68,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ constant(resources(X1,X2)) ),
a7_48,
[final] ).
cnf(c_0_69,axiom,
( cardinality_at_time(X1,X2) != zero
| ~ greater(zero,growth_rate(X1,X2)) ),
mp_empty_not_decreasing_39,
[final] ).
cnf(c_0_70,negated_conjecture,
( cardinality_at_time(first_movers,sk4) = zero
| number_of_organizations(sk3,sk4) != zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_72,negated_conjecture,
decreases(number_of_organizations(sk3,sk1(sk4,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_60]),c_0_44])]),
[final] ).
cnf(c_0_74,axiom,
( greater(sk1(X2,X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| cardinality_at_time(efficient_producers,X2) != zero ),
mp_previous_negative_growth_28,
[final] ).
cnf(c_0_75,axiom,
( greater(X2,sk1(X2,X1))
| ~ environment(X1)
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| cardinality_at_time(efficient_producers,X2) != zero ),
mp_previous_negative_growth_30,
[final] ).
cnf(c_0_76,negated_conjecture,
( greater(zero,growth_rate(X1,sk1(sk4,sk3)))
| ~ greater(resilience(first_movers),resilience(X2))
| ~ greater(resilience(X2),resilience(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_77,hypothesis,
( decreases(resources(sk3,sk1(sk4,sk3)))
| ~ greater(number_of_organizations(sk3,sk1(sk4,sk3)),zero)
| ~ greater(equilibrium(sk3),sk1(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_78,hypothesis,
( constant(resources(sk3,sk1(sk4,sk3)))
| greater(equilibrium(sk3),sk1(sk4,sk3))
| ~ greater(number_of_organizations(sk3,sk1(sk4,sk3)),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_79,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| ~ greater(zero,growth_rate(first_movers,sk4)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]),
[final] ).
cnf(c_0_80,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| greater(cardinality_at_time(first_movers,sk4),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_66]),c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_81,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| number_of_organizations(sk3,sk4) != zero ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_67]),c_0_28]),c_0_29])]),c_0_56]),
[final] ).
cnf(c_0_82,negated_conjecture,
( decreases(resources(sk3,sk4))
| ~ greater(number_of_organizations(sk3,sk4),zero)
| ~ greater(equilibrium(sk3),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_83,negated_conjecture,
( constant(resources(sk3,sk4))
| greater(equilibrium(sk3),sk4)
| ~ greater(number_of_organizations(sk3,sk4),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_84,hypothesis,
( constant(number_of_organizations(sk3,sk1(sk4,sk3)))
| ~ constant(resources(sk3,sk1(sk4,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_85,negated_conjecture,
( number_of_organizations(sk3,sk4) != zero
| ~ greater(zero,growth_rate(first_movers,sk4)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_86,negated_conjecture,
( cardinality_at_time(efficient_producers,sk1(sk4,sk3)) = zero
| greater(cardinality_at_time(efficient_producers,sk1(sk4,sk3)),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_87,negated_conjecture,
( constant(number_of_organizations(sk3,sk4))
| ~ constant(resources(sk3,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ~ decreases(number_of_organizations(sk3,sk4))
| ~ decreases(resources(sk3,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_28]),c_0_29])]),
[final] ).
cnf(c_0_89,axiom,
( number_of_organizations(X1,X2) = zero
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(appear(an_organisation,X1),X2) ),
mp_start_of_organizations_32,
[final] ).
cnf(c_0_90,hypothesis,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(an_organisation,X1)) ),
a1_43,
[final] ).
cnf(c_0_91,axiom,
( greater(appear(an_organisation,X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(an_organisation,X1)) ),
mp_environment_inequality_42,
[final] ).
cnf(c_0_92,axiom,
( ~ constant(X1)
| ~ decreases(X1) ),
mp_constant_not_decrease_41,
[final] ).
cnf(c_0_93,hypothesis,
~ decreases(resources(sk3,sk1(sk4,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[final] ).
cnf(c_0_94,negated_conjecture,
number_of_organizations(sk3,sk1(sk4,sk3)) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_73]),c_0_35])]),
[final] ).
cnf(c_0_95,negated_conjecture,
~ greater(zero,growth_rate(efficient_producers,sk4)),
inference(spm,[status(thm)],[c_0_69,c_0_33]),
[final] ).
cnf(c_0_96,negated_conjecture,
greater(sk1(sk4,sk3),appear(efficient_producers,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_32]),c_0_29])]),c_0_33])]),
[final] ).
cnf(c_0_97,negated_conjecture,
subpopulation(first_movers,sk3,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_38]),c_0_29])]),
[final] ).
cnf(c_0_98,negated_conjecture,
greater(sk4,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_32]),c_0_29])]),c_0_33])]),
[final] ).
cnf(c_0_99,negated_conjecture,
subpopulation(efficient_producers,sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_28]),c_0_29])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT037-2 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 00:26:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.a9SGFrw3rC/E---3.1_21102.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_3 with pid 21205 completed with status 1
% 0.19/0.50 # Result found by new_bool_3
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.19/0.50 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 21210 completed with status 1
% 0.19/0.50 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # No proof found!
% 0.19/0.50 # SZS status Satisfiable
% 0.19/0.50 # SZS output start Saturation
% See solution above
% 0.19/0.50 # Parsed axioms : 27
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 27
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 27
% 0.19/0.50 # Processed clauses : 103
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 1
% 0.19/0.50 # ...remaining for further processing : 102
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 8
% 0.19/0.50 # Backward-rewritten : 6
% 0.19/0.50 # Generated clauses : 62
% 0.19/0.50 # ...of the previous two non-redundant : 59
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 60
% 0.19/0.50 # Factorizations : 2
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 70
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 61
% 0.19/0.50 # Positive orientable unit clauses : 15
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 4
% 0.19/0.50 # Non-unit-clauses : 42
% 0.19/0.50 # Current number of unprocessed clauses: 0
% 0.19/0.50 # ...number of literals in the above : 0
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 41
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 434
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 172
% 0.19/0.50 # Non-unit clause-clause subsumptions : 7
% 0.19/0.50 # Unit Clause-clause subsumption calls : 26
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 5
% 0.19/0.50 # BW rewrite match successes : 2
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2842
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1760 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.009 s
% 0.19/0.50 # Total time : 0.016 s
% 0.19/0.50 # Maximum resident set size: 1732 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------