%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP181-2 : 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 : n010.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:38:52 PM UTC 2026
% Result : Unsatisfiable 93.70s 34.38s
% Output : CNFRefutation 93.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of clauses : 75 ( 75 unt; 0 nHn; 16 RR)
% Number of literals : 75 ( 74 equ; 3 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 120 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p12_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_3) ).
cnf(p12_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_1) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p12_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_2) ).
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(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(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(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(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_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(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(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(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(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(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(p12_4,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_4) ).
cnf(p12_5,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_5) ).
cnf(prove_p12,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p12) ).
cnf(c_0_19,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p12_3 ).
cnf(c_0_20,hypothesis,
inverse(identity) = identity,
p12_1 ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
inverse(inverse(X1)) = X1,
p12_2 ).
cnf(c_0_24,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_25,hypothesis,
multiply(X1,identity) = X1,
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,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_29,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_30,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_31,hypothesis,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,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_21]),c_0_27]) ).
cnf(c_0_33,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_28,c_0_25]),c_0_29]) ).
cnf(c_0_34,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_30,c_0_21]),c_0_29]) ).
cnf(c_0_35,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_36,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_37,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_38,hypothesis,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,hypothesis,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,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_41,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_42,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_43,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_44,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_36,c_0_37]) ).
cnf(c_0_45,hypothesis,
least_upper_bound(greatest_lower_bound(X1,identity),multiply(X1,greatest_lower_bound(identity,X1))) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_46,hypothesis,
multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity)) = multiply(least_upper_bound(X1,identity),greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_32]) ).
cnf(c_0_47,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_40,c_0_35]) ).
cnf(c_0_48,hypothesis,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21]) ).
cnf(c_0_50,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(greatest_lower_bound(X1,X3),X2)) = least_upper_bound(greatest_lower_bound(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_27]) ).
cnf(c_0_51,hypothesis,
least_upper_bound(greatest_lower_bound(X1,identity),multiply(X1,greatest_lower_bound(identity,X1))) = multiply(least_upper_bound(X1,identity),greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,hypothesis,
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_47,c_0_31]) ).
cnf(c_0_53,hypothesis,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,hypothesis,
multiply(least_upper_bound(X1,identity),greatest_lower_bound(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_50,c_0_51]),c_0_33]),c_0_29]),c_0_37]),c_0_25]),c_0_52]),c_0_39]),c_0_31]),c_0_43]),c_0_25]) ).
cnf(c_0_55,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_33,c_0_42]),c_0_29]) ).
cnf(c_0_56,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_42]),c_0_27]) ).
cnf(c_0_57,hypothesis,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_59,hypothesis,
least_upper_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(greatest_lower_bound(X1,X2)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_56]),c_0_57]),c_0_48]) ).
cnf(c_0_60,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_23]),c_0_23]),c_0_25]) ).
cnf(c_0_61,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
p12_4 ).
cnf(c_0_62,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
p12_5 ).
cnf(c_0_63,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X2,X1)),X2)) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_64,hypothesis,
greatest_lower_bound(c,a) = greatest_lower_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_27]),c_0_27]) ).
cnf(c_0_65,hypothesis,
least_upper_bound(c,a) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_29]),c_0_29]) ).
cnf(c_0_66,hypothesis,
multiply(a,multiply(inverse(greatest_lower_bound(c,b)),c)) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_29]),c_0_65]) ).
cnf(c_0_67,hypothesis,
multiply(inverse(greatest_lower_bound(c,b)),c) = multiply(inverse(a),least_upper_bound(c,b)),
inference(spm,[status(thm)],[c_0_49,c_0_66]) ).
cnf(c_0_68,hypothesis,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_19]),c_0_23]) ).
cnf(c_0_69,hypothesis,
multiply(b,multiply(inverse(a),least_upper_bound(c,b))) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_67]),c_0_29]) ).
cnf(c_0_70,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_71,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_p12]) ).
cnf(c_0_72,hypothesis,
inverse(a) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_41]),c_0_70]),c_0_25]) ).
cnf(c_0_73,negated_conjecture,
a != b,
c_0_71 ).
cnf(c_0_74,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_72]),c_0_23]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP181-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/20.42 % Computer : n010.cluster.edu
% 0.15/20.42 % Model : x86_64 x86_64
% 0.15/20.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/20.42 % Memory : 8046.5625MB
% 0.15/20.42 % OS : Linux 6.8.0-71-generic
% 0.15/20.42 % CPULimit : 300
% 0.15/20.42 % WCLimit : 300
% 0.15/20.42 % DateTime : Sun Sep 20 20:05:17 UTC 2026
% 0.15/20.43 % CPUTime :
% 0.15/20.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/20.48 Running first-order theorem proving
% 0.15/20.48 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
% 93.70/34.38 % Version: 3.5.1
% 93.70/34.38 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.70/34.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.70/34.38 % Starting new_bool_3 with 300s (1) cores
% 93.70/34.38 % Starting new_bool_1 with 300s (1) cores
% 93.70/34.38 % Starting sh5l with 300s (1) cores
% 93.70/34.38 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3397945 completed with status 0
% 93.70/34.38 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.70/34.38 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.70/34.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.70/34.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.70/34.38 % No SInE strategy applied
% 93.70/34.38 % Search class: FUUPM-FFSS21-SFFFFFNN
% 93.70/34.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 93.70/34.38 % Starting SubtermCWHack with 136s (1) cores
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 93.70/34.38 % Starting new_bool_3 with 136s (1) cores
% 93.70/34.38 % Starting new_bool_1 with 136s (1) cores
% 93.70/34.38 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3397950 completed with status 0
% 93.70/34.38 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.70/34.38 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.70/34.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.70/34.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.70/34.38 % No SInE strategy applied
% 93.70/34.38 % Search class: FUUPM-FFSS21-SFFFFFNN
% 93.70/34.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 93.70/34.38 % Starting SubtermCWHack with 136s (1) cores
% 93.70/34.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.70/34.38 % Preprocessing time : 0.002 s
% 93.70/34.38 % Presaturation interreduction done
% 93.70/34.38
% 93.70/34.38 % Proof found!
% 93.70/34.38 % SZS status Unsatisfiable
% 93.70/34.38 % SZS output start CNFRefutation
% See solution above
% 93.70/34.38 % Parsed axioms : 21
% 93.70/34.38 % Removed by relevancy pruning/SinE : 0
% 93.70/34.38 % Initial clauses : 21
% 93.70/34.38 % Removed in clause preprocessing : 0
% 93.70/34.38 % Initial clauses in saturation : 21
% 93.70/34.38 % Processed clauses : 16778
% 93.70/34.38 % ...of these trivial : 7338
% 93.70/34.38 % ...subsumed : 7989
% 93.70/34.38 % ...remaining for further processing : 1451
% 93.70/34.38 % Other redundant clauses eliminated : 0
% 93.70/34.38 % Clauses deleted for lack of memory : 0
% 93.70/34.38 % Backward-subsumed : 0
% 93.70/34.38 % Backward-rewritten : 238
% 93.70/34.38 % Generated clauses : 555329
% 93.70/34.38 % ...of the previous two non-redundant : 368901
% 93.70/34.38 % ...aggressively subsumed : 0
% 93.70/34.38 % Contextual simplify-reflections : 0
% 93.70/34.38 % Paramodulations : 555329
% 93.70/34.38 % Factorizations : 0
% 93.70/34.38 % NegExts : 0
% 93.70/34.38 % Equation resolutions : 0
% 93.70/34.38 % Disequality decompositions : 0
% 93.70/34.38 % Total rewrite steps : 812064
% 93.70/34.38 % ...of those cached : 649711
% 93.70/34.38 % Propositional unsat checks : 0
% 93.70/34.38 % Propositional check models : 0
% 93.70/34.38 % Propositional check unsatisfiable : 0
% 93.70/34.38 % Propositional clauses : 0
% 93.70/34.38 % Propositional clauses after purity: 0
% 93.70/34.38 % Propositional unsat core size : 0
% 93.70/34.38 % Propositional preprocessing time : 0.000
% 93.70/34.38 % Propositional encoding time : 0.000
% 93.70/34.38 % Propositional solver time : 0.000
% 93.70/34.38 % Success case prop preproc time : 0.000
% 93.70/34.38 % Success case prop encoding time : 0.000
% 93.70/34.38 % Success case prop solver time : 0.000
% 93.70/34.38 % Current number of processed clauses : 1192
% 93.70/34.38 % Positive orientable unit clauses : 1128
% 93.70/34.38 % Positive unorientable unit clauses: 63
% 93.70/34.38 % Negative unit clauses : 1
% 93.70/34.38 % Non-unit-clauses : 0
% 93.70/34.38 % Current number of unprocessed clauses: 351650
% 93.70/34.38 % ...number of literals in the above : 351650
% 93.70/34.38 % Current number of archived formulas : 0
% 93.70/34.38 % Current number of archived clauses : 259
% 93.70/34.38 % Clause-clause subsumption calls (NU) : 0
% 93.70/34.38 % Rec. Clause-clause subsumption calls : 0
% 93.70/34.38 % Non-unit clause-clause subsumptions : 0
% 93.70/34.38 % Unit Clause-clause subsumption calls : 601
% 93.70/34.38 % Rewrite failures with RHS unbound : 0
% 93.70/34.38 % BW rewrite match attempts : 8875
% 93.70/34.38 % BW rewrite match successes : 1175
% 93.70/34.38 % Condensation attempts : 0
% 93.70/34.38 % Condensation successes : 0
% 93.70/34.38 % Termbank termtop insertions : 8468562
% 93.70/34.38 % Search garbage collected termcells : 2
% 93.70/34.38
% 93.70/34.38 % -------------------------------------------------
% 93.70/34.38 % User time : 12.929 s
% 93.70/34.38 % System time : 0.526 s
% 93.70/34.38 % Total time : 13.456 s
% 93.70/34.38 % Maximum resident set size: 3604 pages
% 93.70/34.38
% 93.70/34.38 % -------------------------------------------------
% 93.70/34.38 % User time : 64.543 s
% 93.70/34.38 % System time : 2.698 s
% 93.70/34.38 % Total time : 67.241 s
% 93.70/34.38 % Maximum resident set size: 4864 pages
% 93.70/34.38 % E exiting
%------------------------------------------------------------------------------