%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP167-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:43 PM UTC 2026
% Result : Unsatisfiable 16.38s 12.60s
% Output : CNFRefutation 16.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 70 ( 70 unt; 0 nHn; 7 RR)
% Number of literals : 70 ( 69 equ; 5 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 : 124 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(prove_p19,negated_conjecture,
a != multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p19) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_21,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_22,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_23,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,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_20,c_0_16]),c_0_21]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_27,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_28,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_29,plain,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,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_26,c_0_16]),c_0_27]) ).
cnf(c_0_31,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,plain,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_33,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_34,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_35,plain,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)) = multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).
cnf(c_0_37,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
least_upper_bound(greatest_lower_bound(X1,identity),multiply(X1,greatest_lower_bound(identity,X1))) = multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_35]),c_0_36]) ).
cnf(c_0_39,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_40,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_41,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_42,plain,
multiply(least_upper_bound(inverse(X1),X2),X1) = least_upper_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_43,plain,
least_upper_bound(X1,multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_25]),c_0_34]),c_0_23]) ).
cnf(c_0_44,plain,
multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_45,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_39,c_0_40]) ).
cnf(c_0_46,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_41]) ).
cnf(c_0_47,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_48,plain,
least_upper_bound(identity,multiply(least_upper_bound(identity,inverse(X1)),greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_15]),c_0_14]),c_0_44]),c_0_16]) ).
cnf(c_0_49,plain,
greatest_lower_bound(X1,multiply(least_upper_bound(X1,X2),greatest_lower_bound(identity,X3))) = greatest_lower_bound(X1,multiply(least_upper_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_45,c_0_31]) ).
cnf(c_0_50,plain,
multiply(least_upper_bound(X1,inverse(X2)),X2) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]) ).
cnf(c_0_51,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_52,negated_conjecture,
a != multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity)),
inference(fof_simplification,[status(thm)],[prove_p19]) ).
cnf(c_0_53,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_46]),c_0_23]) ).
cnf(c_0_54,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_23]) ).
cnf(c_0_55,plain,
multiply(least_upper_bound(identity,inverse(X1)),greatest_lower_bound(identity,X1)) = identity,
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_47,c_0_48]),c_0_27]),c_0_49]),c_0_50]),c_0_16]),c_0_40]) ).
cnf(c_0_56,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
a != multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity)),
c_0_52 ).
cnf(c_0_58,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_53]),c_0_54]) ).
cnf(c_0_59,plain,
multiply(least_upper_bound(identity,inverse(X1)),greatest_lower_bound(X1,identity)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_30]),c_0_23]),c_0_23]) ).
cnf(c_0_60,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_56]) ).
cnf(c_0_61,plain,
least_upper_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(least_upper_bound(X2,inverse(X3)),multiply(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_21]) ).
cnf(c_0_62,plain,
least_upper_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(least_upper_bound(identity,multiply(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_21]) ).
cnf(c_0_63,negated_conjecture,
multiply(least_upper_bound(a,identity),greatest_lower_bound(identity,a)) != a,
inference(rw,[status(thm)],[c_0_57,c_0_27]) ).
cnf(c_0_64,plain,
multiply(inverse(greatest_lower_bound(X1,identity)),multiply(X1,greatest_lower_bound(identity,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_65,plain,
inverse(greatest_lower_bound(X1,identity)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_16]) ).
cnf(c_0_66,plain,
multiply(least_upper_bound(X1,inverse(X2)),multiply(X2,X3)) = multiply(least_upper_bound(identity,multiply(X1,X2)),X3),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a)) != a,
inference(rw,[status(thm)],[c_0_63,c_0_21]) ).
cnf(c_0_68,plain,
multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_16]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP167-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/10.41 % Computer : n016.cluster.edu
% 0.14/10.41 % Model : x86_64 x86_64
% 0.14/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.41 % Memory : 8046.5625MB
% 0.14/10.41 % OS : Linux 6.8.0-71-generic
% 0.14/10.41 % CPULimit : 300
% 0.14/10.41 % WCLimit : 300
% 0.14/10.41 % DateTime : Sun Sep 20 20:08:02 UTC 2026
% 0.14/10.41 % CPUTime :
% 0.14/10.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/10.48 Running first-order theorem proving
% 0.14/10.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 16.38/12.60 % Version: 3.5.1
% 16.38/12.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 16.38/12.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.38/12.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.38/12.60 % Starting new_bool_3 with 300s (1) cores
% 16.38/12.60 % Starting new_bool_1 with 300s (1) cores
% 16.38/12.60 % Starting sh5l with 300s (1) cores
% 16.38/12.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 680862 completed with status 0
% 16.38/12.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 16.38/12.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 16.38/12.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.38/12.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.38/12.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.38/12.60 % No SInE strategy applied
% 16.38/12.60 % Search class: FUUPM-FFSF21-SFFFFFNN
% 16.38/12.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.38/12.60 % Starting SubtermCWHack with 136s (1) cores
% 16.38/12.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 16.38/12.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 16.38/12.60 % Starting new_bool_3 with 136s (1) cores
% 16.38/12.60 % Starting new_bool_1 with 136s (1) cores
% 16.38/12.60 % new_bool_3 with pid 680871 completed with status 0
% 16.38/12.60 % Result found by new_bool_3
% 16.38/12.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 16.38/12.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.38/12.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 16.38/12.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.38/12.60 % No SInE strategy applied
% 16.38/12.60 % Search class: FUUPM-FFSF21-SFFFFFNN
% 16.38/12.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.38/12.60 % Starting SubtermCWHack with 136s (1) cores
% 16.38/12.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 16.38/12.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 16.38/12.60 % Starting new_bool_3 with 136s (1) cores
% 16.38/12.60 % Preprocessing time : 0.002 s
% 16.38/12.60 % Presaturation interreduction done
% 16.38/12.60
% 16.38/12.60 % Proof found!
% 16.38/12.60 % SZS status Unsatisfiable
% 16.38/12.60 % SZS output start CNFRefutation
% See solution above
% 16.38/12.60 % Parsed axioms : 16
% 16.38/12.60 % Removed by relevancy pruning/SinE : 0
% 16.38/12.60 % Initial clauses : 16
% 16.38/12.60 % Removed in clause preprocessing : 0
% 16.38/12.60 % Initial clauses in saturation : 16
% 16.38/12.60 % Processed clauses : 4325
% 16.38/12.60 % ...of these trivial : 1510
% 16.38/12.60 % ...subsumed : 2265
% 16.38/12.60 % ...remaining for further processing : 550
% 16.38/12.60 % Other redundant clauses eliminated : 0
% 16.38/12.60 % Clauses deleted for lack of memory : 0
% 16.38/12.60 % Backward-subsumed : 0
% 16.38/12.60 % Backward-rewritten : 81
% 16.38/12.60 % Generated clauses : 115508
% 16.38/12.60 % ...of the previous two non-redundant : 61258
% 16.38/12.60 % ...aggressively subsumed : 0
% 16.38/12.60 % Contextual simplify-reflections : 0
% 16.38/12.60 % Paramodulations : 115508
% 16.38/12.60 % Factorizations : 0
% 16.38/12.60 % NegExts : 0
% 16.38/12.60 % Equation resolutions : 0
% 16.38/12.60 % Disequality decompositions : 0
% 16.38/12.60 % Total rewrite steps : 168778
% 16.38/12.60 % ...of those cached : 140828
% 16.38/12.60 % Propositional unsat checks : 0
% 16.38/12.60 % Propositional check models : 0
% 16.38/12.60 % Propositional check unsatisfiable : 0
% 16.38/12.60 % Propositional clauses : 0
% 16.38/12.60 % Propositional clauses after purity: 0
% 16.38/12.60 % Propositional unsat core size : 0
% 16.38/12.60 % Propositional preprocessing time : 0.000
% 16.38/12.60 % Propositional encoding time : 0.000
% 16.38/12.60 % Propositional solver time : 0.000
% 16.38/12.60 % Success case prop preproc time : 0.000
% 16.38/12.60 % Success case prop encoding time : 0.000
% 16.38/12.60 % Success case prop solver time : 0.000
% 16.38/12.60 % Current number of processed clauses : 453
% 16.38/12.60 % Positive orientable unit clauses : 425
% 16.38/12.60 % Positive unorientable unit clauses: 28
% 16.38/12.60 % Negative unit clauses : 0
% 16.38/12.60 % Non-unit-clauses : 0
% 16.38/12.60 % Current number of unprocessed clauses: 56732
% 16.38/12.60 % ...number of literals in the above : 56732
% 16.38/12.60 % Current number of archived formulas : 0
% 16.38/12.60 % Current number of archived clauses : 97
% 16.38/12.60 % Clause-clause subsumption calls (NU) : 0
% 16.38/12.60 % Rec. Clause-clause subsumption calls : 0
% 16.38/12.60 % Non-unit clause-clause subsumptions : 0
% 16.38/12.60 % Unit Clause-clause subsumption calls : 150
% 16.38/12.60 % Rewrite failures with RHS unbound : 0
% 16.38/12.60 % BW rewrite match attempts : 2205
% 16.38/12.60 % BW rewrite match successes : 380
% 16.38/12.60 % Condensation attempts : 0
% 16.38/12.60 % Condensation successes : 0
% 16.38/12.60 % Termbank termtop insertions : 1391944
% 16.38/12.60 % Search garbage collected termcells : 2
% 16.38/12.60
% 16.38/12.60 % -------------------------------------------------
% 16.38/12.60 % User time : 1.914 s
% 16.38/12.60 % System time : 0.081 s
% 16.38/12.60 % Total time : 1.995 s
% 16.38/12.60 % Maximum resident set size: 3640 pages
% 16.38/12.60
% 16.38/12.60 % -------------------------------------------------
% 16.38/12.60 % User time : 9.475 s
% 16.38/12.60 % System time : 0.470 s
% 16.38/12.60 % Total time : 9.945 s
% 16.38/12.60 % Maximum resident set size: 4864 pages
% 16.38/12.60 % E exiting
%------------------------------------------------------------------------------