%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP181-1 : 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 : n012.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 153.18s 22.69s
% Output : CNFRefutation 153.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of clauses : 74 ( 74 unt; 0 nHn; 14 RR)
% Number of literals : 74 ( 73 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 123 ( 8 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(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(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(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(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(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(p12_2,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_2) ).
cnf(p12_1,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_1) ).
cnf(prove_p12,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p12) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_20]) ).
cnf(c_0_23,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
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,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_27,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_23,c_0_18]),c_0_24]) ).
cnf(c_0_28,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_30,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_31,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_32,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_33,plain,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_35,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_36,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_37,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_38,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_30,c_0_31]) ).
cnf(c_0_39,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_40,plain,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_41,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_34,c_0_18]),c_0_35]) ).
cnf(c_0_42,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_43,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,greatest_lower_bound(X1,X2)))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(X1,X2),least_upper_bound(identity,X3))) = least_upper_bound(X1,multiply(greatest_lower_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_45,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_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,plain,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_47,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_48,plain,
greatest_lower_bound(X1,greatest_lower_bound(multiply(X1,X2),least_upper_bound(X3,multiply(X1,greatest_lower_bound(identity,X2))))) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_49,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_28]),c_0_31]),c_0_26]) ).
cnf(c_0_50,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35]) ).
cnf(c_0_51,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_52,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_26]) ).
cnf(c_0_53,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_40]),c_0_35]),c_0_39]),c_0_29]),c_0_26]),c_0_35]),c_0_37]) ).
cnf(c_0_54,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_55,plain,
greatest_lower_bound(multiply(X1,X2),multiply(X3,multiply(X4,X2))) = multiply(greatest_lower_bound(X1,multiply(X3,X4)),X2),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_56,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
multiply(least_upper_bound(inverse(X1),X2),X1) = least_upper_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_58,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_59,plain,
multiply(greatest_lower_bound(X1,multiply(X2,X3)),inverse(X3)) = greatest_lower_bound(multiply(X1,inverse(X3)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_42]),c_0_26]) ).
cnf(c_0_60,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(X1,inverse(least_upper_bound(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_22]),c_0_58]),c_0_56]) ).
cnf(c_0_61,plain,
multiply(X1,multiply(inverse(least_upper_bound(X1,X2)),X2)) = greatest_lower_bound(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_22]),c_0_16]),c_0_22]),c_0_18]) ).
cnf(c_0_62,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
p12_2 ).
cnf(c_0_63,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
p12_1 ).
cnf(c_0_64,plain,
multiply(X1,multiply(inverse(least_upper_bound(X2,X1)),X2)) = greatest_lower_bound(X2,X1),
inference(spm,[status(thm)],[c_0_61,c_0_24]) ).
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_24]),c_0_24]) ).
cnf(c_0_66,hypothesis,
greatest_lower_bound(c,a) = greatest_lower_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_35]),c_0_35]) ).
cnf(c_0_67,hypothesis,
multiply(a,multiply(inverse(least_upper_bound(c,b)),c)) = greatest_lower_bound(c,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_68,hypothesis,
multiply(inverse(least_upper_bound(c,b)),c) = multiply(inverse(a),greatest_lower_bound(c,b)),
inference(spm,[status(thm)],[c_0_19,c_0_67]) ).
cnf(c_0_69,hypothesis,
multiply(b,multiply(inverse(a),greatest_lower_bound(c,b))) = greatest_lower_bound(c,b),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_p12]) ).
cnf(c_0_71,hypothesis,
inverse(a) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_69]),c_0_16]),c_0_42]),c_0_26]) ).
cnf(c_0_72,negated_conjecture,
a != b,
c_0_70 ).
cnf(c_0_73,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_71]),c_0_22]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP181-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Sun Sep 20 20:04:24 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 153.18/22.69 % Version: 3.5.1
% 153.18/22.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 153.18/22.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.18/22.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 153.18/22.69 % Starting new_bool_3 with 300s (1) cores
% 153.18/22.69 % Starting new_bool_1 with 300s (1) cores
% 153.18/22.69 % Starting sh5l with 300s (1) cores
% 153.18/22.69 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 753780 completed with status 0
% 153.18/22.69 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 153.18/22.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 153.18/22.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.18/22.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 153.18/22.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 153.18/22.69 % No SInE strategy applied
% 153.18/22.69 % Search class: FUUPM-FFSF21-SFFFFFNN
% 153.18/22.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 153.18/22.69 % Starting SubtermCWHack with 136s (1) cores
% 153.18/22.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 153.18/22.69 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 153.18/22.69 % Starting new_bool_3 with 136s (1) cores
% 153.18/22.69 % Starting new_bool_1 with 136s (1) cores
% 153.18/22.69 % new_bool_1 with pid 753791 completed with status 0
% 153.18/22.69 % Result found by new_bool_1
% 153.18/22.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 153.18/22.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.18/22.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 153.18/22.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 153.18/22.69 % No SInE strategy applied
% 153.18/22.69 % Search class: FUUPM-FFSF21-SFFFFFNN
% 153.18/22.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 153.18/22.69 % Starting SubtermCWHack with 136s (1) cores
% 153.18/22.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 153.18/22.69 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 153.18/22.69 % Starting new_bool_3 with 136s (1) cores
% 153.18/22.69 % Starting new_bool_1 with 136s (1) cores
% 153.18/22.69 % Preprocessing time : 0.001 s
% 153.18/22.69 % Presaturation interreduction done
% 153.18/22.69
% 153.18/22.69 % Proof found!
% 153.18/22.69 % SZS status Unsatisfiable
% 153.18/22.69 % SZS output start CNFRefutation
% See solution above
% 153.18/22.69 % Parsed axioms : 18
% 153.18/22.69 % Removed by relevancy pruning/SinE : 0
% 153.18/22.69 % Initial clauses : 18
% 153.18/22.69 % Removed in clause preprocessing : 0
% 153.18/22.69 % Initial clauses in saturation : 18
% 153.18/22.69 % Processed clauses : 25061
% 153.18/22.69 % ...of these trivial : 10555
% 153.18/22.69 % ...subsumed : 12411
% 153.18/22.69 % ...remaining for further processing : 2095
% 153.18/22.69 % Other redundant clauses eliminated : 0
% 153.18/22.69 % Clauses deleted for lack of memory : 0
% 153.18/22.69 % Backward-subsumed : 3
% 153.18/22.69 % Backward-rewritten : 348
% 153.18/22.69 % Generated clauses : 1239220
% 153.18/22.69 % ...of the previous two non-redundant : 903984
% 153.18/22.69 % ...aggressively subsumed : 0
% 153.18/22.69 % Contextual simplify-reflections : 0
% 153.18/22.69 % Paramodulations : 1239220
% 153.18/22.69 % Factorizations : 0
% 153.18/22.69 % NegExts : 0
% 153.18/22.69 % Equation resolutions : 0
% 153.18/22.69 % Disequality decompositions : 0
% 153.18/22.69 % Total rewrite steps : 1823547
% 153.18/22.69 % ...of those cached : 1484486
% 153.18/22.69 % Propositional unsat checks : 0
% 153.18/22.69 % Propositional check models : 0
% 153.18/22.69 % Propositional check unsatisfiable : 0
% 153.18/22.69 % Propositional clauses : 0
% 153.18/22.69 % Propositional clauses after purity: 0
% 153.18/22.69 % Propositional unsat core size : 0
% 153.18/22.69 % Propositional preprocessing time : 0.000
% 153.18/22.69 % Propositional encoding time : 0.000
% 153.18/22.69 % Propositional solver time : 0.000
% 153.18/22.69 % Success case prop preproc time : 0.000
% 153.18/22.69 % Success case prop encoding time : 0.000
% 153.18/22.69 % Success case prop solver time : 0.000
% 153.18/22.69 % Current number of processed clauses : 1726
% 153.18/22.69 % Positive orientable unit clauses : 1595
% 153.18/22.69 % Positive unorientable unit clauses: 130
% 153.18/22.69 % Negative unit clauses : 1
% 153.18/22.69 % Non-unit-clauses : 0
% 153.18/22.69 % Current number of unprocessed clauses: 878166
% 153.18/22.69 % ...number of literals in the above : 878166
% 153.18/22.69 % Current number of archived formulas : 0
% 153.18/22.69 % Current number of archived clauses : 369
% 153.18/22.69 % Clause-clause subsumption calls (NU) : 0
% 153.18/22.69 % Rec. Clause-clause subsumption calls : 0
% 153.18/22.69 % Non-unit clause-clause subsumptions : 0
% 153.18/22.69 % Unit Clause-clause subsumption calls : 2835
% 153.18/22.69 % Rewrite failures with RHS unbound : 0
% 153.18/22.69 % BW rewrite match attempts : 15450
% 153.18/22.69 % BW rewrite match successes : 1855
% 153.18/22.69 % Condensation attempts : 0
% 153.18/22.69 % Condensation successes : 0
% 153.18/22.69 % Termbank termtop insertions : 21450901
% 153.18/22.69 % Search garbage collected termcells : 2
% 153.18/22.69
% 153.18/22.69 % -------------------------------------------------
% 153.18/22.69 % User time : 21.065 s
% 153.18/22.69 % System time : 0.801 s
% 153.18/22.69 % Total time : 21.866 s
% 153.18/22.69 % Maximum resident set size: 3640 pages
% 153.18/22.69
% 153.18/22.69 % -------------------------------------------------
% 153.18/22.69 % User time : 105.086 s
% 153.18/22.69 % System time : 4.094 s
% 153.18/22.69 % Total time : 109.180 s
% 153.18/22.69 % Maximum resident set size: 4864 pages
% 153.18/22.69 % E exiting
%------------------------------------------------------------------------------