%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT005-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:04:00 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.88s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of clauses : 86 ( 49 unt; 0 nHn; 82 RR)
% Number of literals : 159 ( 0 equ; 76 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 139 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_of_meet,axiom,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_meet) ).
cnf(absorbtion1,axiom,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorbtion1) ).
cnf(meet_r2_and_b,negated_conjecture,
meet(r2,b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_b) ).
cnf(commutativity_of_join,axiom,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_join) ).
cnf(absorbtion2,axiom,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorbtion2) ).
cnf(associativity_of_meet1,axiom,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_meet1) ).
cnf(associativity_of_meet2,axiom,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_meet2) ).
cnf(meet_a_and_b,negated_conjecture,
meet(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a_and_b) ).
cnf(meet_c_and_r2,negated_conjecture,
meet(c,r2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c_and_r2) ).
cnf(associativity_of_join2,axiom,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_join2) ).
cnf(meet_r2_and_a,negated_conjecture,
meet(r2,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_a) ).
cnf(join_a_and_b,negated_conjecture,
join(a,b,c2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_a_and_b) ).
cnf(meet_0_and_x,axiom,
meet(n0,X1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_0_and_x) ).
cnf(modularity2,axiom,
( ~ join(X1,X5,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| meet(X2,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modularity2) ).
cnf(join_x_and_0,axiom,
join(X1,n0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_x_and_0) ).
cnf(join_r1_and_e,negated_conjecture,
join(r1,e,a2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_e) ).
cnf(meet_c2_and_r1,negated_conjecture,
meet(c2,r1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c2_and_r1) ).
cnf(join_r1_and_d,negated_conjecture,
join(r1,d,b2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_d) ).
cnf(meet_a2_and_b2,negated_conjecture,
~ meet(a2,b2,r1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a2_and_b2) ).
cnf(c_0_19,plain,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_meet]) ).
cnf(c_0_20,plain,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
inference(fof_simplification,[status(thm)],[absorbtion1]) ).
cnf(c_0_21,plain,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
c_0_19 ).
cnf(c_0_22,negated_conjecture,
meet(r2,b,e),
meet_r2_and_b ).
cnf(c_0_23,plain,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_join]) ).
cnf(c_0_24,plain,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
meet(b,r2,e),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
inference(fof_simplification,[status(thm)],[absorbtion2]) ).
cnf(c_0_27,plain,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
join(b,e,b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_meet1]) ).
cnf(c_0_30,plain,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_meet2]) ).
cnf(c_0_31,plain,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
join(e,b,b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
meet(a,b,c),
meet_a_and_b ).
cnf(c_0_35,negated_conjecture,
meet(c,r2,n0),
meet_c_and_r2 ).
cnf(c_0_36,plain,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_join2]) ).
cnf(c_0_37,negated_conjecture,
meet(r2,a,d),
meet_r2_and_a ).
cnf(c_0_38,negated_conjecture,
join(a,b,c2),
join_a_and_b ).
cnf(c_0_39,plain,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
c_0_30 ).
cnf(c_0_40,axiom,
meet(n0,X1,n0),
meet_0_and_x ).
cnf(c_0_41,negated_conjecture,
meet(e,b,e),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( ~ meet(X3,a,X1)
| ~ meet(X3,c,X2)
| meet(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
meet(r2,c,n0),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_44,plain,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
meet(a,r2,d),
inference(spm,[status(thm)],[c_0_21,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
join(b,a,c2),
inference(spm,[status(thm)],[c_0_27,c_0_38]) ).
cnf(c_0_47,plain,
( ~ meet(X3,X4,X2)
| ~ meet(X1,X3,n0)
| meet(X1,X2,n0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
meet(b,e,e),
inference(spm,[status(thm)],[c_0_21,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( ~ meet(r2,a,X1)
| meet(X1,b,n0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( ~ join(X1,X3,a)
| ~ join(X3,b,X2)
| join(X1,X2,c2) ),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_51,negated_conjecture,
join(a,d,a),
inference(spm,[status(thm)],[c_0_24,c_0_45]) ).
cnf(c_0_52,plain,
( ~ join(X1,X5,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| meet(X2,X4,X6) ),
inference(fof_simplification,[status(thm)],[modularity2]) ).
cnf(c_0_53,negated_conjecture,
( ~ join(X1,X3,b)
| ~ join(X3,a,X2)
| join(X1,X2,c2) ),
inference(spm,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( ~ meet(X1,b,n0)
| meet(X1,e,n0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
meet(d,b,n0),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( ~ join(X1,a,a)
| join(X1,c2,c2) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_57,negated_conjecture,
join(d,a,a),
inference(spm,[status(thm)],[c_0_27,c_0_51]) ).
cnf(c_0_58,plain,
( ~ join(X1,X5,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| meet(X2,X4,X6) ),
c_0_52 ).
cnf(c_0_59,axiom,
join(X1,n0,X1),
join_x_and_0 ).
cnf(c_0_60,negated_conjecture,
join(r1,e,a2),
join_r1_and_e ).
cnf(c_0_61,negated_conjecture,
( ~ join(X1,b,b)
| join(X1,c2,c2) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_62,negated_conjecture,
meet(d,e,n0),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,negated_conjecture,
join(d,c2,c2),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
( ~ join(X3,X4,X2)
| ~ meet(X3,X1,X3)
| ~ meet(X4,X1,n0)
| meet(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
join(e,r1,a2),
inference(spm,[status(thm)],[c_0_27,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
meet(c2,r1,n0),
meet_c2_and_r1 ).
cnf(c_0_67,negated_conjecture,
join(e,c2,c2),
inference(spm,[status(thm)],[c_0_61,c_0_32]) ).
cnf(c_0_68,negated_conjecture,
meet(e,d,n0),
inference(spm,[status(thm)],[c_0_21,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
meet(d,c2,d),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( ~ meet(e,X1,e)
| ~ meet(r1,X1,n0)
| meet(X1,a2,e) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
meet(r1,c2,n0),
inference(spm,[status(thm)],[c_0_21,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
meet(e,c2,e),
inference(spm,[status(thm)],[c_0_31,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
( ~ meet(X1,X3,e)
| ~ meet(X3,d,X2)
| meet(X1,X2,n0) ),
inference(spm,[status(thm)],[c_0_39,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
meet(c2,d,d),
inference(spm,[status(thm)],[c_0_21,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
meet(c2,a2,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]) ).
cnf(c_0_76,negated_conjecture,
( ~ meet(X1,c2,e)
| meet(X1,d,n0) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
meet(a2,c2,e),
inference(spm,[status(thm)],[c_0_21,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
join(r1,d,b2),
join_r1_and_d ).
cnf(c_0_79,negated_conjecture,
meet(a2,d,n0),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
~ meet(a2,b2,r1),
inference(fof_simplification,[status(thm)],[meet_a2_and_b2]) ).
cnf(c_0_81,negated_conjecture,
( ~ meet(r1,X1,r1)
| ~ meet(d,X1,n0)
| meet(X1,b2,r1) ),
inference(spm,[status(thm)],[c_0_64,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
meet(d,a2,n0),
inference(spm,[status(thm)],[c_0_21,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
meet(r1,a2,r1),
inference(spm,[status(thm)],[c_0_31,c_0_60]) ).
cnf(c_0_84,negated_conjecture,
~ meet(a2,b2,r1),
c_0_80 ).
cnf(c_0_85,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT005-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n005.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sun Sep 20 23:05:08 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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.14/5.88 % Version: 3.5.1
% 0.14/5.88 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.88 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.88 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.88 % Starting sh5l with 300s (1) cores
% 0.14/5.88 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1954579 completed with status 0
% 0.14/5.88 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/5.88 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.88 % No SInE strategy applied
% 0.14/5.88 % Search class: FHUNM-FFMM00-SFFFFFNN
% 0.14/5.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.88 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.14/5.88 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.88 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.88 % new_bool_1 with pid 1954590 completed with status 0
% 0.14/5.88 % Result found by new_bool_1
% 0.14/5.88 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/5.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/5.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.88 % No SInE strategy applied
% 0.14/5.88 % Search class: FHUNM-FFMM00-SFFFFFNN
% 0.14/5.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.88 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/5.88 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.14/5.88 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.88 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.88 % Preprocessing time : 0.001 s
% 0.14/5.88 % Presaturation interreduction done
% 0.14/5.88
% 0.14/5.88 % Proof found!
% 0.14/5.88 % SZS status Unsatisfiable
% 0.14/5.88 % SZS output start CNFRefutation
% See solution above
% 0.14/5.88 % Parsed axioms : 31
% 0.14/5.88 % Removed by relevancy pruning/SinE : 0
% 0.14/5.88 % Initial clauses : 31
% 0.14/5.88 % Removed in clause preprocessing : 0
% 0.14/5.88 % Initial clauses in saturation : 31
% 0.14/5.88 % Processed clauses : 5055
% 0.14/5.88 % ...of these trivial : 9
% 0.14/5.88 % ...subsumed : 708
% 0.14/5.88 % ...remaining for further processing : 4338
% 0.14/5.88 % Other redundant clauses eliminated : 0
% 0.14/5.88 % Clauses deleted for lack of memory : 0
% 0.14/5.88 % Backward-subsumed : 43
% 0.14/5.88 % Backward-rewritten : 0
% 0.14/5.88 % Generated clauses : 9615
% 0.14/5.88 % ...of the previous two non-redundant : 5981
% 0.14/5.88 % ...aggressively subsumed : 0
% 0.14/5.88 % Contextual simplify-reflections : 0
% 0.14/5.88 % Paramodulations : 9615
% 0.14/5.88 % Factorizations : 0
% 0.14/5.88 % NegExts : 0
% 0.14/5.88 % Equation resolutions : 0
% 0.14/5.88 % Disequality decompositions : 0
% 0.14/5.88 % Total rewrite steps : 3608
% 0.14/5.88 % ...of those cached : 3350
% 0.14/5.88 % Propositional unsat checks : 0
% 0.14/5.88 % Propositional check models : 0
% 0.14/5.88 % Propositional check unsatisfiable : 0
% 0.14/5.88 % Propositional clauses : 0
% 0.14/5.88 % Propositional clauses after purity: 0
% 0.14/5.88 % Propositional unsat core size : 0
% 0.14/5.88 % Propositional preprocessing time : 0.000
% 0.14/5.88 % Propositional encoding time : 0.000
% 0.14/5.88 % Propositional solver time : 0.000
% 0.14/5.88 % Success case prop preproc time : 0.000
% 0.14/5.88 % Success case prop encoding time : 0.000
% 0.14/5.88 % Success case prop solver time : 0.000
% 0.14/5.88 % Current number of processed clauses : 4264
% 0.14/5.88 % Positive orientable unit clauses : 152
% 0.14/5.88 % Positive unorientable unit clauses: 0
% 0.14/5.88 % Negative unit clauses : 1
% 0.14/5.88 % Non-unit-clauses : 4111
% 0.14/5.88 % Current number of unprocessed clauses: 984
% 0.14/5.88 % ...number of literals in the above : 2878
% 0.14/5.88 % Current number of archived formulas : 0
% 0.14/5.88 % Current number of archived clauses : 74
% 0.14/5.88 % Clause-clause subsumption calls (NU) : 647256
% 0.14/5.88 % Rec. Clause-clause subsumption calls : 607690
% 0.14/5.88 % Non-unit clause-clause subsumptions : 751
% 0.14/5.88 % Unit Clause-clause subsumption calls : 1328
% 0.14/5.88 % Rewrite failures with RHS unbound : 0
% 0.14/5.88 % BW rewrite match attempts : 66
% 0.14/5.88 % BW rewrite match successes : 0
% 0.14/5.88 % Condensation attempts : 0
% 0.14/5.88 % Condensation successes : 0
% 0.14/5.88 % Termbank termtop insertions : 135463
% 0.14/5.88 % Search garbage collected termcells : 45
% 0.14/5.88
% 0.14/5.88 % -------------------------------------------------
% 0.14/5.88 % User time : 0.416 s
% 0.14/5.88 % System time : 0.017 s
% 0.14/5.88 % Total time : 0.433 s
% 0.14/5.88 % Maximum resident set size: 3648 pages
% 0.14/5.88
% 0.14/5.88 % -------------------------------------------------
% 0.14/5.88 % User time : 1.907 s
% 0.14/5.88 % System time : 0.073 s
% 0.14/5.88 % Total time : 1.980 s
% 0.14/5.88 % Maximum resident set size: 4864 pages
% 0.14/5.88 % E exiting
%------------------------------------------------------------------------------