%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 12:42:47 PM UTC 2026
% Result : Unsatisfiable 4.46s 11.13s
% Output : CNFRefutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 68 ( 68 unt; 0 nHn; 7 RR)
% Number of literals : 68 ( 67 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 115 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p18_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_3) ).
cnf(p18_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_1) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p18_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18_2) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(prove_p18,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p18) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_0_18,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p18_3 ).
cnf(c_0_19,hypothesis,
inverse(identity) = identity,
p18_1 ).
cnf(c_0_20,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_21,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,hypothesis,
inverse(inverse(X1)) = X1,
p18_2 ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_24,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_25,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_26,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_28,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_29,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_30,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_31,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_33,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_34,hypothesis,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_35,hypothesis,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_28]) ).
cnf(c_0_36,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_37,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_38,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_39,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).
cnf(c_0_40,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_28]) ).
cnf(c_0_41,hypothesis,
multiply(inverse(X1),least_upper_bound(X1,identity)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_24]) ).
cnf(c_0_42,hypothesis,
multiply(X1,greatest_lower_bound(identity,inverse(X1))) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28]) ).
cnf(c_0_43,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_44,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_20]) ).
cnf(c_0_45,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))) = greatest_lower_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_38]) ).
cnf(c_0_46,hypothesis,
greatest_lower_bound(least_upper_bound(X1,identity),least_upper_bound(identity,inverse(X1))) = multiply(greatest_lower_bound(identity,inverse(X1)),least_upper_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28]) ).
cnf(c_0_47,hypothesis,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_22]),c_0_28]) ).
cnf(c_0_48,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_43]) ).
cnf(c_0_49,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_50,hypothesis,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_18]),c_0_22]) ).
cnf(c_0_51,hypothesis,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_28]) ).
cnf(c_0_52,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_27,c_0_44]) ).
cnf(c_0_53,hypothesis,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,inverse(X1)),least_upper_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31]) ).
cnf(c_0_54,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_55,hypothesis,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29]) ).
cnf(c_0_56,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_24]) ).
cnf(c_0_57,hypothesis,
multiply(greatest_lower_bound(X1,identity),inverse(greatest_lower_bound(identity,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_22]) ).
cnf(c_0_58,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
inference(fof_simplification,[status(thm)],[prove_p18]) ).
cnf(c_0_59,hypothesis,
greatest_lower_bound(least_upper_bound(X1,identity),inverse(greatest_lower_bound(identity,inverse(X1)))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_26]),c_0_26]),c_0_28]) ).
cnf(c_0_60,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_61,hypothesis,
least_upper_bound(identity,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_24]) ).
cnf(c_0_62,hypothesis,
least_upper_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_24]),c_0_54]),c_0_20]),c_0_24]) ).
cnf(c_0_63,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
c_0_58 ).
cnf(c_0_64,hypothesis,
inverse(greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_59]),c_0_60]),c_0_61]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
inverse(greatest_lower_bound(identity,a)) != least_upper_bound(identity,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_28]),c_0_24]) ).
cnf(c_0_66,hypothesis,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_22]),c_0_24]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.39 % Computer : n004.cluster.edu
% 0.14/10.39 % Model : x86_64 x86_64
% 0.14/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.39 % Memory : 8046.5625MB
% 0.14/10.39 % OS : Linux 6.8.0-71-generic
% 0.14/10.39 % CPULimit : 300
% 0.14/10.39 % WCLimit : 300
% 0.14/10.39 % DateTime : Sun Sep 20 20:04:47 UTC 2026
% 0.17/10.40 % CPUTime :
% 0.17/10.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/10.44 Running first-order theorem proving
% 0.17/10.44 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
% 4.46/11.13 % Version: 3.5.1
% 4.46/11.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/11.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/11.13 % Starting new_bool_3 with 300s (1) cores
% 4.46/11.13 % Starting new_bool_1 with 300s (1) cores
% 4.46/11.13 % Starting sh5l with 300s (1) cores
% 4.46/11.13 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1370637 completed with status 0
% 4.46/11.13 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.46/11.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/11.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/11.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.46/11.13 % No SInE strategy applied
% 4.46/11.13 % Search class: FUUPM-FFSF21-SFFFFFNN
% 4.46/11.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.46/11.13 % Starting SubtermCWHack with 136s (1) cores
% 4.46/11.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.46/11.13 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 4.46/11.13 % Starting new_bool_3 with 136s (1) cores
% 4.46/11.13 % Starting new_bool_1 with 136s (1) cores
% 4.46/11.13 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1370643 completed with status 0
% 4.46/11.13 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.46/11.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/11.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/11.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.46/11.13 % No SInE strategy applied
% 4.46/11.13 % Search class: FUUPM-FFSF21-SFFFFFNN
% 4.46/11.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.46/11.13 % Starting SubtermCWHack with 136s (1) cores
% 4.46/11.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.46/11.13 % Preprocessing time : 0.001 s
% 4.46/11.13 % Presaturation interreduction done
% 4.46/11.13
% 4.46/11.13 % Proof found!
% 4.46/11.13 % SZS status Unsatisfiable
% 4.46/11.13 % SZS output start CNFRefutation
% See solution above
% 4.46/11.13 % Parsed axioms : 19
% 4.46/11.13 % Removed by relevancy pruning/SinE : 0
% 4.46/11.13 % Initial clauses : 19
% 4.46/11.13 % Removed in clause preprocessing : 0
% 4.46/11.13 % Initial clauses in saturation : 19
% 4.46/11.13 % Processed clauses : 3689
% 4.46/11.13 % ...of these trivial : 1813
% 4.46/11.13 % ...subsumed : 1340
% 4.46/11.13 % ...remaining for further processing : 536
% 4.46/11.13 % Other redundant clauses eliminated : 0
% 4.46/11.13 % Clauses deleted for lack of memory : 0
% 4.46/11.13 % Backward-subsumed : 0
% 4.46/11.13 % Backward-rewritten : 94
% 4.46/11.13 % Generated clauses : 106811
% 4.46/11.13 % ...of the previous two non-redundant : 66101
% 4.46/11.13 % ...aggressively subsumed : 0
% 4.46/11.13 % Contextual simplify-reflections : 0
% 4.46/11.13 % Paramodulations : 106811
% 4.46/11.13 % Factorizations : 0
% 4.46/11.13 % NegExts : 0
% 4.46/11.13 % Equation resolutions : 0
% 4.46/11.13 % Disequality decompositions : 0
% 4.46/11.13 % Total rewrite steps : 156156
% 4.46/11.13 % ...of those cached : 126604
% 4.46/11.13 % Propositional unsat checks : 0
% 4.46/11.13 % Propositional check models : 0
% 4.46/11.13 % Propositional check unsatisfiable : 0
% 4.46/11.13 % Propositional clauses : 0
% 4.46/11.13 % Propositional clauses after purity: 0
% 4.46/11.13 % Propositional unsat core size : 0
% 4.46/11.13 % Propositional preprocessing time : 0.000
% 4.46/11.13 % Propositional encoding time : 0.000
% 4.46/11.13 % Propositional solver time : 0.000
% 4.46/11.13 % Success case prop preproc time : 0.000
% 4.46/11.13 % Success case prop encoding time : 0.000
% 4.46/11.13 % Success case prop solver time : 0.000
% 4.46/11.13 % Current number of processed clauses : 423
% 4.46/11.13 % Positive orientable unit clauses : 377
% 4.46/11.13 % Positive unorientable unit clauses: 46
% 4.46/11.13 % Negative unit clauses : 0
% 4.46/11.13 % Non-unit-clauses : 0
% 4.46/11.13 % Current number of unprocessed clauses: 62288
% 4.46/11.13 % ...number of literals in the above : 62288
% 4.46/11.13 % Current number of archived formulas : 0
% 4.46/11.13 % Current number of archived clauses : 113
% 4.46/11.13 % Clause-clause subsumption calls (NU) : 0
% 4.46/11.13 % Rec. Clause-clause subsumption calls : 0
% 4.46/11.13 % Non-unit clause-clause subsumptions : 0
% 4.46/11.13 % Unit Clause-clause subsumption calls : 234
% 4.46/11.13 % Rewrite failures with RHS unbound : 0
% 4.46/11.13 % BW rewrite match attempts : 1775
% 4.46/11.13 % BW rewrite match successes : 473
% 4.46/11.13 % Condensation attempts : 0
% 4.46/11.13 % Condensation successes : 0
% 4.46/11.13 % Termbank termtop insertions : 1296544
% 4.46/11.13 % Search garbage collected termcells : 2
% 4.46/11.13
% 4.46/11.13 % -------------------------------------------------
% 4.46/11.13 % User time : 0.609 s
% 4.46/11.13 % System time : 0.039 s
% 4.46/11.13 % Total time : 0.648 s
% 4.46/11.13 % Maximum resident set size: 3640 pages
% 4.46/11.13
% 4.46/11.13 % -------------------------------------------------
% 4.46/11.13 % User time : 2.699 s
% 4.46/11.13 % System time : 0.172 s
% 4.46/11.13 % Total time : 2.871 s
% 4.46/11.13 % Maximum resident set size: 4864 pages
% 4.46/11.13 % E exiting
%------------------------------------------------------------------------------