%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT038-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:26:51 PM UTC 2026
% Result : Satisfiable 0.15s 0.47s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_38ERROR: Could not build tree for root c_0_47ERROR: MakeTreeStats fails)
% 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_29,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_30,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_31,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_32,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_33,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),in_environment(sk3,X1),greater(X1,appear(first_movers,sk3))) != tuple(zero,true,true),
c_0_28,
[final] ).
cnf(c_0_34,negated_conjecture,
greater(sk1(sk2(sk3),first_movers),appear(efficient_producers,sk3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17]),
[final] ).
cnf(c_0_35,negated_conjecture,
in_environment(sk3,appear(efficient_producers,e)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17]),
[final] ).
cnf(c_0_36,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_37,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom,
[final] ).
cnf(c_0_39,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_34]),c_0_17]),
[final] ).
cnf(c_0_40,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_41,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_34]),c_0_17]),
[final] ).
cnf(c_0_42,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_30]),c_0_17]),
[final] ).
cnf(c_0_43,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_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_35]),c_0_16]),c_0_15]),c_0_17]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_45,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_36,c_0_23]),c_0_24]),c_0_37]),c_0_37]),
[final] ).
cnf(c_0_47,negated_conjecture,
tuple(cardinality_at_time(first_movers,to),true,true) != tuple(zero,true,true),
inference(rw,[status(thm)],[c_0_38,c_0_35]),
[final] ).
cnf(c_0_48,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_33,c_0_26]),
[final] ).
cnf(c_0_49,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_34]),c_0_17]),
[final] ).
cnf(c_0_50,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_30]),c_0_17]),
[final] ).
cnf(c_0_51,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_32]),c_0_17]),
[final] ).
cnf(c_0_52,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_34]),
[final] ).
cnf(c_0_53,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_30]),
[final] ).
cnf(c_0_54,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_32]),
[final] ).
cnf(c_0_55,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_56,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_35]),c_0_16]),c_0_15]),c_0_17]),c_0_17]),
[final] ).
cnf(c_0_57,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_58,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_59,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),sk2(sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_39,c_0_30]),
[final] ).
cnf(c_0_60,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_40,c_0_34]),c_0_17]),
[final] ).
cnf(c_0_61,negated_conjecture,
ifeq(greater(sk2(sk3),sk1(sk2(sk3),first_movers)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_41,c_0_21]),
[final] ).
cnf(c_0_62,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_40,c_0_30]),c_0_17]),
[final] ).
cnf(c_0_63,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_30]),c_0_17]),
[final] ).
cnf(c_0_64,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_40,c_0_21]),c_0_17]),
[final] ).
cnf(c_0_65,negated_conjecture,
ifeq(greater(sk1(sk2(sk3),first_movers),sk1(sk2(sk3),first_movers)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_42,c_0_30]),
[final] ).
cnf(c_0_66,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_32]),c_0_17]),
[final] ).
cnf(c_0_67,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_32]),c_0_17]),
[final] ).
cnf(c_0_68,negated_conjecture,
ifeq(greater(appear(efficient_producers,sk3),appear(efficient_producers,sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_43,c_0_21]),
[final] ).
cnf(c_0_69,negated_conjecture,
ifeq(greater(sk2(sk3),sk2(sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_29,c_0_21]),
[final] ).
cnf(c_0_70,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_35]),
[final] ).
cnf(c_0_71,negated_conjecture,
ifeq2(finite_set(X1),true,ifeq2(contracts_from(X2,X1),true,zero,zero),zero) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_45]),
[final] ).
cnf(c_0_72,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_46,c_0_35]),c_0_17]),
[final] ).
cnf(c_0_73,negated_conjecture,
ifeq(greater(appear(first_movers,sk3),appear(first_movers,sk3)),true,true,true) = true,
inference(spm,[status(thm)],[c_0_31,c_0_26]),
[final] ).
cnf(c_0_74,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_75,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_36,c_0_24]),c_0_37]),c_0_45]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT038-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 01:23:11 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 667229 completed with status 1
% 0.15/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPM-FFSS32-MFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.47 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 667237 completed with status 1
% 0.15/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FUUPM-FFSS32-MFFFFFNN
% 0.15/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.47 % Preprocessing time : 0.002 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % No proof found!
% 0.15/0.47 % SZS status Satisfiable
% 0.15/0.47 % SZS output start Saturation
% See solution above
% 0.15/0.47 % Parsed axioms : 14
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 14
% 0.15/0.47 % Removed in clause preprocessing : 0
% 0.15/0.47 % Initial clauses in saturation : 14
% 0.15/0.47 % Processed clauses : 81
% 0.15/0.47 % ...of these trivial : 5
% 0.15/0.47 % ...subsumed : 1
% 0.15/0.47 % ...remaining for further processing : 75
% 0.15/0.47 % Other redundant clauses eliminated : 0
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 0
% 0.15/0.47 % Backward-rewritten : 2
% 0.15/0.47 % Generated clauses : 122
% 0.15/0.47 % ...of the previous two non-redundant : 53
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 0
% 0.15/0.47 % Paramodulations : 122
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 0
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 253
% 0.15/0.47 % ...of those cached : 195
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 59
% 0.15/0.47 % Positive orientable unit clauses : 56
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 3
% 0.15/0.47 % Non-unit-clauses : 0
% 0.15/0.47 % Current number of unprocessed clauses: 0
% 0.15/0.47 % ...number of literals in the above : 0
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 16
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.47 % Non-unit clause-clause subsumptions : 0
% 0.15/0.47 % Unit Clause-clause subsumption calls : 1
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 127
% 0.15/0.47 % BW rewrite match successes : 2
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 3133
% 0.15/0.47 % Search garbage collected termcells : 2
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.013 s
% 0.15/0.47 % System time : 0.004 s
% 0.15/0.47 % Total time : 0.017 s
% 0.15/0.47 % Maximum resident set size: 3644 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.047 s
% 0.15/0.47 % System time : 0.023 s
% 0.15/0.47 % Total time : 0.070 s
% 0.15/0.47 % Maximum resident set size: 4608 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------