TSTP Solution File: MGT038-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT038-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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.20s 0.49s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_37)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_14,hypothesis,
ifeq(environment(X1),true,ifeq(stable(X1),true,greater(sk2(X1),appear(efficient_producers,X1)),true),true) = true,
l9_23,
[final] ).
cnf(c_0_15,negated_conjecture,
stable(sk3) = true,
prove_t7_27,
[final] ).
cnf(c_0_16,negated_conjecture,
environment(sk3) = true,
prove_t7_26,
[final] ).
cnf(c_0_17,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001,
[final] ).
cnf(c_0_18,hypothesis,
ifeq(environment(X1),true,ifeq(stable(X1),true,contracts_from(sk2(X1),first_movers),true),true) = true,
l9_24,
[final] ).
cnf(c_0_19,axiom,
ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,appear(first_movers,X1)),true),true) = true,
mp_stable_first_movers_18,
[final] ).
cnf(c_0_20,axiom,
ifeq(greater(X1,X2),true,ifeq(greater(X3,X1),true,greater(X3,X2),true),true) = true,
mp_greater_transitivity_22,
[final] ).
cnf(c_0_21,negated_conjecture,
greater(sk2(sk3),appear(efficient_producers,sk3)) = true,
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_17]),c_0_17]),
[final] ).
cnf(c_0_22,axiom,
ifeq(finite_set(X1),true,ifeq(contracts_from(X2,X1),true,greater(sk1(X2,X1),X2),true),true) = true,
mp_contracting_time_19,
[final] ).
cnf(c_0_23,negated_conjecture,
contracts_from(sk2(sk3),first_movers) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_24,axiom,
finite_set(first_movers) = true,
mp7_first_movers_exist_17,
[final] ).
cnf(c_0_25,axiom,
ifeq(greater(X1,X2),true,ifeq(in_environment(X3,X2),true,ifeq(environment(X3),true,ifeq(stable(X3),true,in_environment(X3,X1),true),true),true),true) = true,
mp_long_stable_environments_21,
[final] ).
cnf(c_0_26,negated_conjecture,
in_environment(sk3,appear(first_movers,sk3)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_16]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_27,hypothesis,
ifeq(environment(X1),true,greater(appear(efficient_producers,e),appear(first_movers,X1)),true) = true,
a13_25,
[final] ).
cnf(c_0_28,negated_conjecture,
ifeq(greater(X1,sk2(sk3)),true,greater(X1,appear(efficient_producers,sk3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[final] ).
cnf(c_0_29,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),sk2(sk3)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_30,negated_conjecture,
ifeq(greater(X1,appear(first_movers,sk3)),true,in_environment(sk3,X1),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]),c_0_15]),c_0_17]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_31,negated_conjecture,
greater(appear(efficient_producers,e),appear(first_movers,sk3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_16]),c_0_17]),
[final] ).
cnf(c_0_32,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),in_environment(sk3,X1),greater(X1,appear(first_movers,sk3))) != tuple(zero,true,true),
prove_t7_28,
[final] ).
cnf(c_0_33,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]),
[final] ).
cnf(c_0_34,axiom,
ifeq2(finite_set(X1),true,ifeq2(contracts_from(X2,X1),true,cardinality_at_time(s,t2),zero),zero) = zero,
mp_contracting_time_20,
[final] ).
cnf(c_0_35,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom,
[final] ).
cnf(c_0_36,negated_conjecture,
in_environment(sk3,appear(efficient_producers,e)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]),
[final] ).
cnf(c_0_38,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),X1),true,greater(sk1(sk2(sk3),first_movers),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_17]),
[final] ).
cnf(c_0_39,negated_conjecture,
ifeq(greater(X1,sk1(sk2(sk3),first_movers)),true,greater(X1,appear(efficient_producers,sk3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_17]),
[final] ).
cnf(c_0_40,negated_conjecture,
ifeq(greater(X1,sk1(sk2(sk3),first_movers)),true,greater(X1,sk2(sk3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_17]),
[final] ).
cnf(c_0_41,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),X1),true,greater(sk2(sk3),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[final] ).
cnf(c_0_42,negated_conjecture,
ifeq(greater(X1,X2),true,ifeq(in_environment(sk3,X2),true,in_environment(sk3,X1),true),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_43,negated_conjecture,
cardinality_at_time(s,t2) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_24]),c_0_35]),c_0_35]),
[final] ).
cnf(c_0_44,negated_conjecture,
ifeq(greater(X1,appear(efficient_producers,e)),true,in_environment(sk3,X1),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_16]),c_0_15]),c_0_17]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_46,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),true,true) != tuple(zero,true,true),
inference(rw,[status(thm)],[c_0_37,c_0_36]),
[final] ).
cnf(c_0_47,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),true,greater(appear(first_movers,sk3),appear(first_movers,sk3))) != tuple(zero,true,true),
inference(spm,[status(thm)],[c_0_32,c_0_26]),
[final] ).
cnf(c_0_48,negated_conjecture,
ifeq(in_environment(X1,appear(efficient_producers,sk3)),true,ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,sk1(sk2(sk3),first_movers)),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_33]),c_0_17]),
[final] ).
cnf(c_0_49,negated_conjecture,
ifeq(in_environment(X1,sk2(sk3)),true,ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,sk1(sk2(sk3),first_movers)),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_17]),
[final] ).
cnf(c_0_50,negated_conjecture,
ifeq(in_environment(X1,appear(first_movers,sk3)),true,ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,appear(efficient_producers,e)),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_17]),
[final] ).
cnf(c_0_51,negated_conjecture,
ifeq(greater(X1,appear(efficient_producers,sk3)),true,ifeq(greater(sk1(sk2(sk3),first_movers),X1),true,true,true),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_33]),
[final] ).
cnf(c_0_52,negated_conjecture,
ifeq(greater(X1,sk2(sk3)),true,ifeq(greater(sk1(sk2(sk3),first_movers),X1),true,true,true),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_29]),
[final] ).
cnf(c_0_53,negated_conjecture,
ifeq(greater(X1,appear(first_movers,sk3)),true,ifeq(greater(appear(efficient_producers,e),X1),true,true,true),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_31]),
[final] ).
cnf(c_0_54,negated_conjecture,
ifeq(greater(X1,appear(efficient_producers,sk3)),true,ifeq(greater(sk2(sk3),X1),true,true,true),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
cnf(c_0_55,negated_conjecture,
ifeq(greater(appear(efficient_producers,e),X1),true,ifeq(in_environment(sk3,X1),true,true,true),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_16]),c_0_15]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_56,negated_conjecture,
ifeq(in_environment(X1,appear(efficient_producers,sk3)),true,ifeq(environment(X1),true,ifeq(stable(X1),true,in_environment(X1,sk2(sk3)),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_17]),
[final] ).
cnf(c_0_57,plain,
ifeq(greater(appear(first_movers,X1),X2),true,ifeq(in_environment(X1,X2),true,true,true),true) = true,
inference(spm,[status(thm)],[c_0_25,c_0_19]),
[final] ).
cnf(c_0_58,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),sk2(sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_38,c_0_29]),
[final] ).
cnf(c_0_59,negated_conjecture,
ifeq(greater(sk2(sk3),sk1(sk2(sk3),first_movers)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_39,c_0_21]),
[final] ).
cnf(c_0_60,negated_conjecture,
ifeq(greater(sk1(sk2(sk3),first_movers),sk1(sk2(sk3),first_movers)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_40,c_0_29]),
[final] ).
cnf(c_0_61,negated_conjecture,
ifeq(greater(sk2(sk3),X1),true,greater(sk1(sk2(sk3),first_movers),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_17]),
[final] ).
cnf(c_0_62,negated_conjecture,
ifeq(greater(appear(first_movers,sk3),X1),true,greater(appear(efficient_producers,e),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_17]),
[final] ).
cnf(c_0_63,negated_conjecture,
ifeq(greater(X1,appear(efficient_producers,e)),true,greater(X1,appear(first_movers,sk3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_17]),
[final] ).
cnf(c_0_64,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),appear(efficient_producers,sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_41,c_0_21]),
[final] ).
cnf(c_0_65,negated_conjecture,
ifeq(in_environment(sk3,appear(efficient_producers,sk3)),true,in_environment(sk3,sk1(sk2(sk3),first_movers)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_17]),
[final] ).
cnf(c_0_66,negated_conjecture,
ifeq(in_environment(sk3,sk2(sk3)),true,in_environment(sk3,sk1(sk2(sk3),first_movers)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_17]),
[final] ).
cnf(c_0_67,negated_conjecture,
ifeq(greater(sk2(sk3),sk2(sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_28,c_0_21]),
[final] ).
cnf(c_0_68,negated_conjecture,
ifeq2(finite_set(X1),true,ifeq2(contracts_from(X2,X1),true,zero,zero),zero) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_43]),
[final] ).
cnf(c_0_69,negated_conjecture,
ifeq(greater(appear(efficient_producers,e),appear(efficient_producers,e)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_44,c_0_36]),
[final] ).
cnf(c_0_70,negated_conjecture,
ifeq(in_environment(sk3,appear(efficient_producers,sk3)),true,in_environment(sk3,sk2(sk3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_21]),c_0_17]),
[final] ).
cnf(c_0_71,negated_conjecture,
ifeq(greater(appear(first_movers,sk3),appear(efficient_producers,e)),true,true,true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_17]),
[final] ).
cnf(c_0_72,negated_conjecture,
ifeq(greater(appear(first_movers,sk3),appear(first_movers,sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_30,c_0_26]),
[final] ).
cnf(c_0_73,plain,
ifeq(contracts_from(X1,first_movers),true,greater(sk1(X1,first_movers),X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_17]),
[final] ).
cnf(c_0_74,plain,
ifeq2(contracts_from(X1,first_movers),true,zero,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_35]),c_0_43]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT038-10 : TPTP v8.1.2. Released v7.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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:41:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/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.euorwLSO3s/E---3.1_18282.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 18362 completed with status 1
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSS32-MFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 18367 completed with status 1
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSS32-MFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # No proof found!
% 0.20/0.49 # SZS status Satisfiable
% 0.20/0.49 # SZS output start Saturation
% See solution above
% 0.20/0.49 # Parsed axioms : 14
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 14
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 81
% 0.20/0.49 # ...of these trivial : 5
% 0.20/0.49 # ...subsumed : 1
% 0.20/0.49 # ...remaining for further processing : 75
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 2
% 0.20/0.49 # Generated clauses : 122
% 0.20/0.49 # ...of the previous two non-redundant : 53
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 122
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 253
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 59
% 0.20/0.49 # Positive orientable unit clauses : 56
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 16
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 118
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3116
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1568 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.030 s
% 0.20/0.49 # System time : 0.007 s
% 0.20/0.49 # Total time : 0.037 s
% 0.20/0.49 # Maximum resident set size: 1684 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------