%------------------------------------------------------------------------------
% File     : CiME---2.01
% Problem  : GRP177-1 : TPTP v6.0.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_cime %s

% Computer : n158.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.11.2.el6.x86_64
% CPULimit : 300s
% DateTime : Tue Jun 10 00:22:32 EDT 2014

% Result   : Timeout 300.10s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : GRP177-1 : TPTP v6.0.0. Bugfixed v1.2.1.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n158.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.11.2.el6.x86_64
% % CPULimit : 300
% % DateTime : Fri Jun  6 06:20:58 CDT 2014
% % CPUTime  : 300.10 
% Processing problem /tmp/CiME_471_n158.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " least_upper_bound,greatest_lower_bound : AC; c,b,a,identity : constant;  inverse : 1;  multiply : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z));
% multiply(identity,X) = X;
% multiply(inverse(X),X) = identity;
% X least_upper_bound X = X;
% X greatest_lower_bound X = X;
% X least_upper_bound (X greatest_lower_bound Y) = X;
% X greatest_lower_bound (X least_upper_bound Y) = X;
% multiply(X,Y least_upper_bound Z) = multiply(X,Y) least_upper_bound multiply(X,Z);
% multiply(X,Y greatest_lower_bound Z) = multiply(X,Y) greatest_lower_bound multiply(X,Z);
% multiply(Y least_upper_bound Z,X) = multiply(Y,X) least_upper_bound multiply(Z,X);
% multiply(Y greatest_lower_bound Z,X) = multiply(Y,X) greatest_lower_bound multiply(Z,X);
% identity least_upper_bound a = a;
% identity least_upper_bound b = b;
% identity least_upper_bound c = c;
% ";
% 
% let s1 = status F "
% c lr_lex;
% b lr_lex;
% a lr_lex;
% inverse lr_lex;
% identity lr_lex;
% least_upper_bound mul;
% greatest_lower_bound mul;
% multiply mul;
% ";
% 
% let p1 = precedence F "
% inverse > multiply > greatest_lower_bound > least_upper_bound > identity > a > b > c";
% 
% let s2 = status F "
% c mul;
% b mul;
% a mul;
% least_upper_bound mul;
% greatest_lower_bound mul;
% inverse mul;
% multiply mul;
% identity mul;
% ";
% 
% let p2 = precedence F "
% inverse > multiply > greatest_lower_bound > least_upper_bound > identity = a = b = c";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X " (a greatest_lower_bound multiply(b,c)) least_upper_bound multiply(a greatest_lower_bound b,a greatest_lower_bound c) = multiply(a greatest_lower_bound b,a greatest_lower_bound c);"
% ;
% (*
% let Red_Axioms = normalize_equations Defining_rules Axioms;
% 
% let Red_Conjectures =  normalize_equations Defining_rules Conjectures;
% *)
% #time on;
% 
% let res = prove_conj_by_ordered_completion o Axioms Conjectures;
% 
% #time off;
% 
% 
% let status = if res then "unsatisfiable" else "satisfiable";
% #quit;
% Verbose level is now 1
% 
% F : signature = <signature>
% X : variable_set = <variable set>
% 
% Axioms : (F,X) equations = { multiply(multiply(X,Y),Z) =
% multiply(X,multiply(Y,Z)),
% multiply(identity,X) = X,
% multiply(inverse(X),X) = identity,
% X least_upper_bound X = X,
% X greatest_lower_bound X = X,
% (X greatest_lower_bound Y) least_upper_bound X =
% X,
% (X least_upper_bound Y) greatest_lower_bound X =
% X,
% multiply(X,Y least_upper_bound Z) =
% multiply(X,Y) least_upper_bound multiply(X,Z),
% multiply(X,Y greatest_lower_bound Z) =
% multiply(X,Y) greatest_lower_bound multiply(X,Z),
% multiply(Y least_upper_bound Z,X) =
% multiply(Y,X) least_upper_bound multiply(Z,X),
% multiply(Y greatest_lower_bound Z,X) =
% multiply(Y,X) greatest_lower_bound multiply(Z,X),
% a least_upper_bound identity = a,
% b least_upper_bound identity = b,
% c least_upper_bound identity = c }
% (14 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
% o_auto : F term_ordering = <term ordering>
% o : F term_ordering = <term ordering>
% Conjectures : (F,X) equations = { (a greatest_lower_bound multiply(b,c)) least_upper_bound 
% multiply(b greatest_lower_bound a,c greatest_lower_bound a)
% =
% multiply(b greatest_lower_bound a,c greatest_lower_bound a) }
% (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] X least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 13
% Current number of rules: 1
% New rule produced : [2] a least_upper_bound identity -> a
% Current number of equations to process: 0
% Current number of ordered equations: 12
% Current number of rules: 2
% New rule produced : [3] b least_upper_bound identity -> b
% Current number of equations to process: 0
% Current number of ordered equations: 11
% Current number of rules: 3
% New rule produced : [4] c least_upper_bound identity -> c
% Current number of equations to process: 0
% Current number of ordered equations: 10
% Current number of rules: 4
% New rule produced : [5] X greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 9
% Current number of rules: 5
% New rule produced : [6] multiply(identity,X) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 6
% New rule produced : [7] multiply(inverse(X),X) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 7
% New rule produced : [8] (X greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 8
% New rule produced : [9] (X least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 9
% New rule produced :
% [10] multiply(multiply(X,Y),Z) -> multiply(X,multiply(Y,Z))
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 10
% New rule produced :
% [11]
% multiply(X,Y least_upper_bound Z) ->
% multiply(X,Y) least_upper_bound multiply(X,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 11
% New rule produced :
% [12]
% multiply(X,Y greatest_lower_bound Z) ->
% multiply(X,Y) greatest_lower_bound multiply(X,Z)
% The conjecture has been reduced. 
% Conjecture is now:
% (a greatest_lower_bound multiply(b,c)) least_upper_bound (multiply(b greatest_lower_bound a,c) greatest_lower_bound 
% multiply(b greatest_lower_bound a,a)) = 
% multiply(b greatest_lower_bound a,c) greatest_lower_bound multiply(b greatest_lower_bound a,a)
% 
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 12
% New rule produced :
% [13]
% multiply(Y least_upper_bound Z,X) ->
% multiply(Y,X) least_upper_bound multiply(Z,X)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 13
% New rule produced :
% [14]
% multiply(Y greatest_lower_bound Z,X) ->
% multiply(Y,X) greatest_lower_bound multiply(Z,X)
% The conjecture has been reduced. 
% Conjecture is now:
% (a greatest_lower_bound multiply(b,c)) least_upper_bound (multiply(b,c) greatest_lower_bound 
% multiply(b,a) greatest_lower_bound 
% multiply(a,c) greatest_lower_bound 
% multiply(a,a)) = 
% multiply(b,c) greatest_lower_bound multiply(b,a) greatest_lower_bound 
% multiply(a,c) greatest_lower_bound multiply(a,a)
% 
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] a greatest_lower_bound identity -> identity
% Current number of equations to process: 41
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [16] b greatest_lower_bound identity -> identity
% Current number of equations to process: 48
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [17] c greatest_lower_bound identity -> identity
% Current number of equations to process: 55
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] (identity greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 78
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] (identity greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 77
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] (identity greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 76
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21] (a least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22] (b least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 74
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23] (c least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 73
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced : [24] multiply(inverse(Y),multiply(Y,X)) -> X
% Current number of equations to process: 70
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25]
% (a least_upper_bound X) greatest_lower_bound (identity least_upper_bound X)
% -> identity least_upper_bound X
% Current number of equations to process: 65
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26]
% (b least_upper_bound X) greatest_lower_bound (identity least_upper_bound X)
% -> identity least_upper_bound X
% Current number of equations to process: 63
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% (c least_upper_bound X) greatest_lower_bound (identity least_upper_bound X)
% -> identity least_upper_bound X
% Current number of equations to process: 61
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28] multiply(X,a) least_upper_bound multiply(X,identity) -> multiply(X,a)
% Current number of equations to process: 70
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29] multiply(X,b) least_upper_bound multiply(X,identity) -> multiply(X,b)
% Current number of equations to process: 69
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [30] multiply(X,c) least_upper_bound multiply(X,identity) -> multiply(X,c)
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [31] multiply(a,X) least_upper_bound X -> multiply(a,X)
% Current number of equations to process: 77
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced : [32] multiply(b,X) least_upper_bound X -> multiply(b,X)
% Current number of equations to process: 76
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced : [33] multiply(c,X) least_upper_bound X -> multiply(c,X)
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced : [34] multiply(a,X) greatest_lower_bound X -> X
% Current number of equations to process: 94
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [35] multiply(b,X) greatest_lower_bound X -> X
% Current number of equations to process: 105
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced : [36] multiply(c,X) greatest_lower_bound X -> X
% Current number of equations to process: 116
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced : [37] multiply(inverse(identity),X) -> X
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced : [38] multiply(inverse(inverse(X)),identity) -> X
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced : [39] multiply(inverse(inverse(X)),Y) -> multiply(X,Y)
% Rule [38] multiply(inverse(inverse(X)),identity) -> X collapsed.
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced : [40] multiply(X,identity) -> X
% Rule
% [28] multiply(X,a) least_upper_bound multiply(X,identity) -> multiply(X,a)
% collapsed.
% Rule
% [29] multiply(X,b) least_upper_bound multiply(X,identity) -> multiply(X,b)
% collapsed.
% Rule
% [30] multiply(X,c) least_upper_bound multiply(X,identity) -> multiply(X,c)
% collapsed.
% Current number of equations to process: 185
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced : [41] multiply(X,a) least_upper_bound X -> multiply(X,a)
% Current number of equations to process: 184
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced : [42] multiply(X,b) least_upper_bound X -> multiply(X,b)
% Current number of equations to process: 183
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced : [43] multiply(X,c) least_upper_bound X -> multiply(X,c)
% Current number of equations to process: 182
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [44]
% (a greatest_lower_bound X) least_upper_bound (identity greatest_lower_bound X)
% -> a greatest_lower_bound X
% Current number of equations to process: 208
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced : [45] multiply(X,a) greatest_lower_bound X -> X
% Current number of equations to process: 207
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [46]
% (b greatest_lower_bound X) least_upper_bound (identity greatest_lower_bound X)
% -> b greatest_lower_bound X
% Current number of equations to process: 206
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced : [47] multiply(X,b) greatest_lower_bound X -> X
% Current number of equations to process: 205
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [48]
% (c greatest_lower_bound X) least_upper_bound (identity greatest_lower_bound X)
% -> c greatest_lower_bound X
% Current number of equations to process: 204
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced : [49] multiply(X,c) greatest_lower_bound X -> X
% Current number of equations to process: 203
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [50] identity least_upper_bound multiply(a,a) -> multiply(a,a)
% Current number of equations to process: 284
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [51] identity least_upper_bound multiply(a,b) -> multiply(a,b)
% Current number of equations to process: 283
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [52] identity least_upper_bound multiply(a,c) -> multiply(a,c)
% Current number of equations to process: 282
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [53] (multiply(a,X) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 281
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [54] identity greatest_lower_bound multiply(a,a) -> identity
% Current number of equations to process: 295
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [55] identity greatest_lower_bound multiply(a,b) -> identity
% Current number of equations to process: 298
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [56] identity greatest_lower_bound multiply(a,c) -> identity
% Current number of equations to process: 301
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [57] identity least_upper_bound multiply(b,a) -> multiply(b,a)
% Current number of equations to process: 318
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [58] identity least_upper_bound multiply(b,b) -> multiply(b,b)
% Current number of equations to process: 317
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [59] identity least_upper_bound multiply(b,c) -> multiply(b,c)
% Current number of equations to process: 316
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [60]
% (multiply(a,a) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 315
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [61]
% (multiply(a,b) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 314
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [62]
% (multiply(a,c) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 313
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [63] (multiply(b,X) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 312
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [64] identity greatest_lower_bound multiply(b,a) -> identity
% Current number of equations to process: 326
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [65] identity greatest_lower_bound multiply(b,b) -> identity
% Current number of equations to process: 329
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced :
% [66] identity greatest_lower_bound multiply(b,c) -> identity
% Current number of equations to process: 332
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [67] identity least_upper_bound multiply(c,a) -> multiply(c,a)
% Current number of equations to process: 353
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced :
% [68] identity least_upper_bound multiply(c,b) -> multiply(c,b)
% Current number of equations to process: 352
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [69] identity least_upper_bound multiply(c,c) -> multiply(c,c)
% Current number of equations to process: 351
% Current number of ordered equations: 0
% Current number of rules: 65
% New rule produced :
% [70]
% (multiply(b,a) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 350
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [71]
% (multiply(b,b) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 349
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [72]
% (multiply(b,c) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 348
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [73] (multiply(c,X) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 347
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [74] identity greatest_lower_bound multiply(c,a) -> identity
% Current number of equations to process: 361
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [75] identity greatest_lower_bound multiply(c,b) -> identity
% Current number of equations to process: 364
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [76] identity greatest_lower_bound multiply(c,c) -> identity
% Current number of equations to process: 367
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced : [77] multiply(X,inverse(X)) -> identity
% Current number of equations to process: 434
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [78]
% (multiply(c,a) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 433
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [79]
% (multiply(c,b) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 432
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced :
% [80]
% (multiply(c,c) least_upper_bound X) greatest_lower_bound identity -> identity
% Current number of equations to process: 431
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [81] multiply(a,multiply(a,X)) greatest_lower_bound X -> X
% Current number of equations to process: 430
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [82] multiply(b,multiply(a,X)) greatest_lower_bound X -> X
% Current number of equations to process: 428
% Current number of ordered equations: 1
% Current number of rules: 78
% New rule produced :
% [83] multiply(a,multiply(b,X)) greatest_lower_bound X -> X
% Current number of equations to process: 428
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [84] multiply(b,multiply(b,X)) greatest_lower_bound X -> X
% Current number of equations to process: 427
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [85] multiply(c,multiply(a,X)) greatest_lower_bound X -> X
% Current number of equations to process: 425
% Current number of ordered equations: 1
% Current number of rules: 81
% New rule produced :
% [86] multiply(a,multiply(c,X)) greatest_lower_bound X -> X
% Current number of equations to process: 425
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [87] multiply(c,multiply(b,X)) greatest_lower_bound X -> X
% Current number of equations to process: 423
% Current number of ordered equations: 1
% Current number of rules: 83
% New rule produced :
% [88] multiply(b,multiply(c,X)) greatest_lower_bound X -> X
% Current number of equations to process: 423
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [89] multiply(c,multiply(c,X)) greatest_lower_bound X -> X
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 85
% New rule produced : [90] multiply(Y,multiply(inverse(Y),X)) -> X
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced : [91] inverse(identity) -> identity
% Rule [37] multiply(inverse(identity),X) -> X collapsed.
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced : [92] inverse(inverse(X)) -> X
% Rule [39] multiply(inverse(inverse(X)),Y) -> multiply(X,Y) collapsed.
% Current number of equations to process: 422
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced : [93] identity least_upper_bound inverse(a) -> identity
% Current number of equations to process: 423
% Current number of ordered equations: 0
% Current number of rules: 87
% New rule produced :
% [94] (multiply(X,a) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 433
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced : [95] identity least_upper_bound inverse(b) -> identity
% Current number of equations to process: 453
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced :
% [96] (multiply(X,b) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 463
% Current number of ordered equations: 0
% Current number of rules: 90
% New rule produced : [97] identity least_upper_bound inverse(c) -> identity
% Current number of equations to process: 483
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced :
% [98] (multiply(X,c) least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 493
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [99]
% (X greatest_lower_bound Y) least_upper_bound multiply(a,X) -> multiply(a,X)
% Current number of equations to process: 534
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [100]
% (identity greatest_lower_bound X) least_upper_bound multiply(a,a) ->
% multiply(a,a)
% Current number of equations to process: 533
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [101]
% (identity greatest_lower_bound X) least_upper_bound multiply(a,b) ->
% multiply(a,b)
% Current number of equations to process: 532
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [102]
% (identity greatest_lower_bound X) least_upper_bound multiply(a,c) ->
% multiply(a,c)
% Current number of equations to process: 531
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [103]
% (X greatest_lower_bound Y) least_upper_bound multiply(b,X) -> multiply(b,X)
% Current number of equations to process: 527
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [104]
% (identity greatest_lower_bound X) least_upper_bound multiply(b,a) ->
% multiply(b,a)
% Current number of equations to process: 526
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [105]
% (identity greatest_lower_bound X) least_upper_bound multiply(b,b) ->
% multiply(b,b)
% Current number of equations to process: 525
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [106]
% (identity greatest_lower_bound X) least_upper_bound multiply(b,c) ->
% multiply(b,c)
% Current number of equations to process: 524
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [107]
% (X greatest_lower_bound Y) least_upper_bound multiply(c,X) -> multiply(c,X)
% Current number of equations to process: 520
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [108]
% (identity greatest_lower_bound X) least_upper_bound multiply(c,a) ->
% multiply(c,a)
% Current number of equations to process: 519
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced :
% [109]
% (identity greatest_lower_bound X) least_upper_bound multiply(c,b) ->
% multiply(c,b)
% Current number of equations to process: 518
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [110]
% (identity greatest_lower_bound X) least_upper_bound multiply(c,c) ->
% multiply(c,c)
% Current number of equations to process: 517
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [111]
% (X greatest_lower_bound Y) least_upper_bound multiply(X,a) -> multiply(X,a)
% Current number of equations to process: 510
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [112]
% (X greatest_lower_bound Y) least_upper_bound multiply(X,b) -> multiply(X,b)
% Current number of equations to process: 506
% Current number of ordered equations: 0
% Current number of rules: 106
% New rule produced :
% [113]
% (X greatest_lower_bound Y) least_upper_bound multiply(X,c) -> multiply(X,c)
% Current number of equations to process: 502
% Current number of ordered equations: 0
% Current number of rules: 107
% New rule produced :
% [114]
% (b greatest_lower_bound a) least_upper_bound identity ->
% b greatest_lower_bound a
% Current number of equations to process: 512
% Current number of ordered equations: 0
% Current number of rules: 108
% New rule produced :
% [115]
% (c greatest_lower_bound a) least_upper_bound identity ->
% c greatest_lower_bound a
% Current number of equations to process: 511
% Current number of ordered equations: 0
% Current number of rules: 109
% New rule produced :
% [116] identity greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 520
% Current number of ordered equations: 0
% Current number of rules: 110
% New rule produced :
% [117] multiply(a,multiply(X,a)) greatest_lower_bound X -> X
% Current number of equations to process: 539
% Current number of ordered equations: 0
% Current number of rules: 111
% New rule produced :
% [118] multiply(b,multiply(X,a)) greatest_lower_bound X -> X
% Current number of equations to process: 538
% Current number of ordered equations: 0
% Current number of rules: 112
% New rule produced :
% [119] multiply(c,multiply(X,a)) greatest_lower_bound X -> X
% Current number of equations to process: 537
% Current number of ordered equations: 0
% Current number of rules: 113
% New rule produced :
% [120]
% (c greatest_lower_bound b) least_upper_bound identity ->
% c greatest_lower_bound b
% Current number of equations to process: 571
% Current number of ordered equations: 0
% Current number of rules: 114
% New rule produced :
% [121] identity greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 580
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [122] multiply(a,multiply(X,b)) greatest_lower_bound X -> X
% Current number of equations to process: 599
% Current number of ordered equations: 0
% Current number of rules: 116
% New rule produced :
% [123] multiply(b,multiply(X,b)) greatest_lower_bound X -> X
% Current number of equations to process: 598
% Current number of ordered equations: 0
% Current number of rules: 117
% New rule produced :
% [124] multiply(c,multiply(X,b)) greatest_lower_bound X -> X
% Current number of equations to process: 597
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [125] identity greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 639
% Current number of ordered equations: 0
% Current number of rules: 119
% New rule produced :
% [126] multiply(a,multiply(X,c)) greatest_lower_bound X -> X
% Current number of equations to process: 658
% Current number of ordered equations: 0
% Current number of rules: 120
% New rule produced :
% [127] multiply(b,multiply(X,c)) greatest_lower_bound X -> X
% Current number of equations to process: 657
% Current number of ordered equations: 0
% Current number of rules: 121
% New rule produced :
% [128] multiply(c,multiply(X,c)) greatest_lower_bound X -> X
% Current number of equations to process: 656
% Current number of ordered equations: 0
% Current number of rules: 122
% New rule produced :
% [129] multiply(X,multiply(a,a)) greatest_lower_bound X -> X
% Current number of equations to process: 813
% Current number of ordered equations: 0
% Current number of rules: 123
% New rule produced :
% [130] identity greatest_lower_bound multiply(a,multiply(a,a)) -> identity
% Current number of equations to process: 812
% Current number of ordered equations: 0
% Current number of rules: 124
% New rule produced :
% [131] identity greatest_lower_bound multiply(b,multiply(a,a)) -> identity
% Current number of equations to process: 811
% Current number of ordered equations: 0
% Current number of rules: 125
% New rule produced :
% [132] identity greatest_lower_bound multiply(c,multiply(a,a)) -> identity
% Current number of equations to process: 810
% Current number of ordered equations: 0
% Current number of rules: 126
% New rule produced :
% [133] multiply(X,multiply(a,b)) greatest_lower_bound X -> X
% Current number of equations to process: 809
% Current number of ordered equations: 0
% Current number of rules: 127
% New rule produced :
% [134] identity greatest_lower_bound multiply(a,multiply(a,b)) -> identity
% Current number of equations to process: 808
% Current number of ordered equations: 0
% Current number of rules: 128
% New rule produced :
% [135] identity greatest_lower_bound multiply(b,multiply(a,b)) -> identity
% Current number of equations to process: 807
% Current number of ordered equations: 0
% Current number of rules: 129
% New rule produced :
% [136] identity greatest_lower_bound multiply(c,multiply(a,b)) -> identity
% Current number of equations to process: 806
% Current number of ordered equations: 0
% Current number of rules: 130
% New rule produced :
% [137] multiply(X,multiply(a,c)) greatest_lower_bound X -> X
% Current number of equations to process: 805
% Current number of ordered equations: 0
% Current number of rules: 131
% New rule produced :
% [138] identity greatest_lower_bound multiply(a,multiply(a,c)) -> identity
% Current number of equations to process: 804
% Current number of ordered equations: 0
% Current number of rules: 132
% New rule produced :
% [139] identity greatest_lower_bound multiply(b,multiply(a,c)) -> identity
% Current number of equations to process: 803
% Current number of ordered equations: 0
% Current number of rules: 133
% New rule produced :
% [140] identity greatest_lower_bound multiply(c,multiply(a,c)) -> identity
% Current number of equations to process: 802
% Current number of ordered equations: 0
% Current number of rules: 134
% New rule produced :
% [141] multiply(X,multiply(b,a)) greatest_lower_bound X -> X
% Current number of equations to process: 1035
% Current number of ordered equations: 0
% Current number of rules: 135
% New rule produced :
% [142] identity greatest_lower_bound multiply(a,multiply(b,a)) -> identity
% Current number of equations to process: 1034
% Current number of ordered equations: 0
% Current number of rules: 136
% New rule produced :
% [143] identity greatest_lower_bound multiply(b,multiply(b,a)) -> identity
% Current number of equations to process: 1033
% Current number of ordered equations: 0
% Current number of rules: 137
% New rule produced :
% [144] identity greatest_lower_bound multiply(c,multiply(b,a)) -> identity
% Current number of equations to process: 1032
% Current number of ordered equations: 0
% Current number of rules: 138
% New rule produced :
% [145] multiply(X,multiply(b,b)) greatest_lower_bound X -> X
% Current number of equations to process: 1031
% Current number of ordered equations: 0
% Current number of rules: 139
% New rule produced :
% [146] identity greatest_lower_bound multiply(a,multiply(b,b)) -> identity
% Current number of equations to process: 1030
% Current number of ordered equations: 0
% Current number of rules: 140
% New rule produced :
% [147] identity greatest_lower_bound multiply(b,multiply(b,b)) -> identity
% Current number of equations to process: 1029
% Current number of ordered equations: 0
% Current number of rules: 141
% New rule produced :
% [148] identity greatest_lower_bound multiply(c,multiply(b,b)) -> identity
% Current number of equations to process: 1028
% Current number of ordered equations: 0
% Current number of rules: 142
% New rule produced :
% [149] multiply(X,multiply(b,c)) greatest_lower_bound X -> X
% Current number of equations to process: 1027
% Current number of ordered equations: 0
% Current number of rules: 143
% New rule produced :
% [150] identity greatest_lower_bound multiply(a,multiply(b,c)) -> identity
% Current number of equations to process: 1026
% Current number of ordered equations: 0
% Current number of rules: 144
% New rule produced :
% [151] identity greatest_lower_bound multiply(b,multiply(b,c)) -> identity
% Current number of equations to process: 1025
% Current number of ordered equations: 0
% Current number of rules: 145
% New rule produced :
% [152] identity greatest_lower_bound multiply(c,multiply(b,c)) -> identity
% Current number of equations to process: 1024
% Current number of ordered equations: 0
% Current number of rules: 146
% New rule produced :
% [153]
% (identity least_upper_bound X) greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 1272
% Current number of ordered equations: 0
% Current number of rules: 147
% New rule produced :
% [154]
% (identity least_upper_bound X) greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 1271
% Current number of ordered equations: 0
% Current number of rules: 148
% New rule produced :
% [155]
% (identity least_upper_bound X) greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 1270
% Current number of ordered equations: 0
% Current number of rules: 149
% New rule produced :
% [156] multiply(X,multiply(c,a)) greatest_lower_bound X -> X
% Current number of equations to process: 1269
% Current number of ordered equations: 0
% Current number of rules: 150
% New rule produced :
% [157] identity greatest_lower_bound multiply(a,multiply(c,a)) -> identity
% Current number of equations to process: 1268
% Current number of ordered equations: 0
% Current number of rules: 151
% New rule produced :
% [158] identity greatest_lower_bound multiply(b,multiply(c,a)) -> identity
% Current number of equations to process: 1267
% Current number of ordered equations: 0
% Current number of rules: 152
% New rule produced :
% [159] identity greatest_lower_bound multiply(c,multiply(c,a)) -> identity
% Current number of equations to process: 1266
% Current number of ordered equations: 0
% Current number of rules: 153
% New rule produced :
% [160] multiply(X,multiply(c,b)) greatest_lower_bound X -> X
% Current number of equations to process: 1265
% Current number of ordered equations: 0
% Current number of rules: 154
% New rule produced :
% [161] identity greatest_lower_bound multiply(a,multiply(c,b)) -> identity
% Current number of equations to process: 1264
% Current number of ordered equations: 0
% Current number of rules: 155
% New rule produced :
% [162] identity greatest_lower_bound multiply(b,multiply(c,b)) -> identity
% Current number of equations to process: 1263
% Current number of ordered equations: 0
% Current number of rules: 156
% New rule produced :
% [163] identity greatest_lower_bound multiply(c,multiply(c,b)) -> identity
% Current number of equations to process: 1262
% Current number of ordered equations: 0
% Current number of rules: 157
% New rule produced :
% [164] multiply(X,multiply(c,c)) greatest_lower_bound X -> X
% Current number of equations to process: 1261
% Current number of ordered equations: 0
% Current number of rules: 158
% New rule produced :
% [165] identity greatest_lower_bound multiply(a,multiply(c,c)) -> identity
% Current number of equations to process: 1260
% Current number of ordered equations: 0
% Current number of rules: 159
% New rule produced :
% [166] identity greatest_lower_bound multiply(b,multiply(c,c)) -> identity
% Current number of equations to process: 1259
% Current number of ordered equations: 0
% Current number of rules: 160
% New rule produced :
% [167] identity greatest_lower_bound multiply(c,multiply(c,c)) -> identity
% Current number of equations to process: 1258
% Current number of ordered equations: 0
% Current number of rules: 161
% New rule produced : [168] a greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 1386
% Current number of ordered equations: 0
% Current number of rules: 162
% New rule produced : [169] b greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 1447
% Current number of ordered equations: 0
% Current number of rules: 163
% New rule produced : [170] a greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 1512
% Current number of ordered equations: 0
% Current number of rules: 164
% New rule produced : [171] b greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 1579
% Current number of ordered equations: 0
% Current number of rules: 165
% New rule produced : [172] c greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 1652
% Current number of ordered equations: 0
% Current number of rules: 166
% New rule produced : [173] a greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 1729
% Current number of ordered equations: 0
% Current number of rules: 167
% New rule produced : [174] c greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 1810
% Current number of ordered equations: 0
% Current number of rules: 168
% New rule produced : [175] b greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 1895
% Current number of ordered equations: 0
% Current number of rules: 169
% New rule produced : [176] c greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 1982
% Current number of ordered equations: 0
% Current number of rules: 170
% New rule produced : [177] multiply(inverse(a),X) least_upper_bound X -> X
% Current number of equations to process: 2030
% Current number of ordered equations: 0
% Current number of rules: 171
% New rule produced : [178] multiply(inverse(b),X) least_upper_bound X -> X
% Current number of equations to process: 2029
% Current number of ordered equations: 0
% Current number of rules: 172
% New rule produced : [179] multiply(inverse(c),X) least_upper_bound X -> X
% Current number of equations to process: 2028
% Current number of ordered equations: 0
% Current number of rules: 173
% New rule produced : [180] a least_upper_bound inverse(a) -> a
% Current number of equations to process: 2059
% Current number of ordered equations: 0
% Current number of rules: 174
% New rule produced : [181] b least_upper_bound inverse(a) -> b
% Current number of equations to process: 2058
% Current number of ordered equations: 0
% Current number of rules: 175
% New rule produced : [182] c least_upper_bound inverse(a) -> c
% Current number of equations to process: 2057
% Current number of ordered equations: 0
% Current number of rules: 176
% New rule produced :
% [183]
% (inverse(a) greatest_lower_bound X) least_upper_bound identity -> identity
% Current number of equations to process: 2064
% Current number of ordered equations: 0
% Current number of rules: 177
% New rule produced : [184] multiply(X,inverse(a)) least_upper_bound X -> X
% Current number of equations to process: 2066
% Current number of ordered equations: 0
% Current number of rules: 178
% New rule produced :
% [185] inverse(a) least_upper_bound multiply(a,a) -> multiply(a,a)
% Current number of equations to process: 2080
% Current number of ordered equations: 0
% Current number of rules: 179
% New rule produced :
% [186] inverse(a) least_upper_bound multiply(a,b) -> multiply(a,b)
% Current number of equations to process: 2079
% Current number of ordered equations: 0
% Current number of rules: 180
% New rule produced :
% [187] inverse(a) least_upper_bound multiply(a,c) -> multiply(a,c)
% Current number of equations to process: 2078
% Current number of ordered equations: 0
% Current number of rules: 181
% New rule produced :
% [188] inverse(a) least_upper_bound multiply(b,a) -> multiply(b,a)
% Current number of equations to process: 2077
% Current number of ordered equations: 0
% Current number of rules: 182
% New rule produced :
% [189] inverse(a) least_upper_bound multiply(b,b) -> multiply(b,b)
% Current number of equations to process: 2076
% Current number of ordered equations: 0
% Current number of rules: 183
% New rule produced :
% [190] inverse(a) least_upper_bound multiply(b,c) -> multiply(b,c)
% Current number of equations to process: 2075
% Current number of ordered equations: 0
% Current number of rules: 184
% New rule produced :
% [191] inverse(a) least_upper_bound multiply(c,a) -> multiply(c,a)
% Current number of equations to process: 2074
% Current number of ordered equations: 0
% Current number of rules: 185
% New rule produced :
% [192] inverse(a) least_upper_bound multiply(c,b) -> multiply(c,b)
% Current number of equations to process: 2073
% Current number of ordered equations: 0
% Current number of rules: 186
% New rule produced :
% [193] inverse(a) least_upper_bound multiply(c,c) -> multiply(c,c)
% Current number of equations to process: 2072
% Current number of ordered equations: 0
% Current number of rules: 187
% New rule produced :
% [194] multiply(inverse(a),X) greatest_lower_bound X -> multiply(inverse(a),X)
% Current number of equations to process: 2078
% Current number of ordered equations: 0
% Current number of rules: 188
% New rule produced :
% [195] multiply(inverse(b),X) greatest_lower_bound X -> multiply(inverse(b),X)
% Current number of equations to process: 2077
% Current number of ordered equations: 0
% Current number of rules: 189
% New rule produced :
% [196] multiply(inverse(c),X) greatest_lower_bound X -> multiply(inverse(c),X)
% Current number of equations to process: 2076
% Current number of ordered equations: 0
% Current number of rules: 190
% New rule produced : [197] a least_upper_bound inverse(b) -> a
% Current number of equations to process: 2099
% Current number of ordered equations: 0
% Current number of rules: 191
% New rule produced : [198] b least_upper_bound inverse(b) -> b
% Current number of equations to process: 2098
% Current number of ordered equations: 0
% Current number of rules: 192
% New rule produced : [199] c least_upper_bound inverse(b) -> c
% Current number of equations to process: 2097
% Current number of ordered equations: 0
% Current number of rules: 193
% New rule produced :
% [200]
% (inverse(b) greatest_lower_bound X) least_upper_bound identity -> identity
% Current number of equations to process: 2104
% Current number of ordered equations: 0
% Current number of rules: 194
% New rule produced : [201] multiply(X,inverse(b)) least_upper_bound X -> X
% Current number of equations to process: 2106
% Current number of ordered equations: 0
% Current number of rules: 195
% New rule produced :
% [202] inverse(b) least_upper_bound multiply(a,a) -> multiply(a,a)
% Current number of equations to process: 2120
% Current number of ordered equations: 0
% Current number of rules: 196
% New rule produced :
% [203] inverse(b) least_upper_bound multiply(a,b) -> multiply(a,b)
% Current number of equations to process: 2119
% Current number of ordered equations: 0
% Current number of rules: 197
% New rule produced :
% [204] inverse(b) least_upper_bound multiply(a,c) -> multiply(a,c)
% Current number of equations to process: 2118
% Current number of ordered equations: 0
% Current number of rules: 198
% New rule produced :
% [205] inverse(b) least_upper_bound multiply(b,a) -> multiply(b,a)
% Current number of equations to process: 2117
% Current number of ordered equations: 0
% Current number of rules: 199
% New rule produced :
% [206] inverse(b) least_upper_bound multiply(b,b) -> multiply(b,b)
% Current number of equations to process: 2116
% Current number of ordered equations: 0
% Current number of rules: 200
% New rule produced :
% [207] inverse(b) least_upper_bound multiply(b,c) -> multiply(b,c)
% Current number of equations to process: 2115
% Current number of ordered equations: 0
% Current number of rules: 201
% New rule produced :
% [208] inverse(b) least_upper_bound multiply(c,a) -> multiply(c,a)
% Current number of equations to process: 2114
% Current number of ordered equations: 0
% Current number of rules: 202
% New rule produced :
% [209] inverse(b) least_upper_bound multiply(c,b) -> multiply(c,b)
% Current number of equations to process: 2113
% Current number of ordered equations: 0
% Current number of rules: 203
% New rule produced :
% [210] inverse(b) least_upper_bound multiply(c,c) -> multiply(c,c)
% Current number of equations to process: 2112
% Current number of ordered equations: 0
% Current number of rules: 204
% New rule produced : [211] a least_upper_bound inverse(c) -> a
% Current number of equations to process: 2143
% Current number of ordered equations: 0
% Current number of rules: 205
% New rule produced : [212] b least_upper_bound inverse(c) -> b
% Current number of equations to process: 2142
% Current number of ordered equations: 0
% Current number of rules: 206
% New rule produced : [213] c least_upper_bound inverse(c) -> c
% Current number of equations to process: 2141
% Current number of ordered equations: 0
% Current number of rules: 207
% New rule produced :
% [214]
% (inverse(c) greatest_lower_bound X) least_upper_bound identity -> identity
% Current number of equations to process: 2148
% Current number of ordered equations: 0
% Current number of rules: 208
% New rule produced : [215] multiply(X,inverse(c)) least_upper_bound X -> X
% Current number of equations to process: 2150
% Current number of ordered equations: 0
% Current number of rules: 209
% New rule produced :
% [216] inverse(c) least_upper_bound multiply(a,a) -> multiply(a,a)
% Current number of equations to process: 2164
% Current number of ordered equations: 0
% Current number of rules: 210
% New rule produced :
% [217] inverse(c) least_upper_bound multiply(a,b) -> multiply(a,b)
% Current number of equations to process: 2163
% Current number of ordered equations: 0
% Current number of rules: 211
% New rule produced :
% [218] inverse(c) least_upper_bound multiply(a,c) -> multiply(a,c)
% Current number of equations to process: 2162
% Current number of ordered equations: 0
% Current number of rules: 212
% New rule produced :
% [219] inverse(c) least_upper_bound multiply(b,a) -> multiply(b,a)
% Current number of equations to process: 2161
% Current number of ordered equations: 0
% Current number of rules: 213
% New rule produced :
% [220] inverse(c) least_upper_bound multiply(b,b) -> multiply(b,b)
% Current number of equations to process: 2160
% Current number of ordered equations: 0
% Current number of rules: 214
% New rule produced :
% [221] inverse(c) least_upper_bound multiply(b,c) -> multiply(b,c)
% Current number of equations to process: 2159
% Current number of ordered equations: 0
% Current number of rules: 215
% New rule produced :
% [222] inverse(c) least_upper_bound multiply(c,a) -> multiply(c,a)
% Current number of equations to process: 2158
% Current number of ordered equations: 0
% Current number of rules: 216
% New rule produced :
% [223] inverse(c) least_upper_bound multiply(c,b) -> multiply(c,b)
% Current number of equations to process: 2157
% Current number of ordered equations: 0
% Current number of rules: 217
% New rule produced :
% [224] inverse(c) least_upper_bound multiply(c,c) -> multiply(c,c)
% Current number of equations to process: 2156
% Current number of ordered equations: 0
% Current number of rules: 218
% New rule produced :
% [225] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% Current number of equations to process: 2223
% Current number of ordered equations: 0
% Current number of rules: 219
% New rule produced :
% [226]
% (multiply(inverse(a),X) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 2335
% Current number of ordered equations: 0
% Current number of rules: 220
% New rule produced :
% [227]
% (multiply(inverse(b),X) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 2539
% Current number of ordered equations: 0
% Current number of rules: 221
% New rule produced :
% [228]
% (multiply(inverse(c),X) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 2744
% Current number of ordered equations: 0
% Current number of rules: 222
% New rule produced :
% [229]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound identity
% -> identity
% Current number of equations to process: 2986
% Current number of ordered equations: 0
% Current number of rules: 223
% New rule produced :
% [230]
% (b greatest_lower_bound a) least_upper_bound inverse(a) ->
% b greatest_lower_bound a
% Current number of equations to process: 3013
% Current number of ordered equations: 0
% Current number of rules: 224
% New rule produced :
% [231]
% (b greatest_lower_bound a) least_upper_bound inverse(b) ->
% b greatest_lower_bound a
% Current number of equations to process: 3012
% Current number of ordered equations: 0
% Current number of rules: 225
% New rule produced :
% [232]
% (b greatest_lower_bound a) least_upper_bound inverse(c) ->
% b greatest_lower_bound a
% Current number of equations to process: 3011
% Current number of ordered equations: 0
% Current number of rules: 226
% New rule produced :
% [233]
% ((c greatest_lower_bound a) least_upper_bound X) greatest_lower_bound identity
% -> identity
% Current number of equations to process: 3010
% Current number of ordered equations: 0
% Current number of rules: 227
% New rule produced :
% [234] (inverse(a) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 3044
% Current number of ordered equations: 0
% Current number of rules: 228
% New rule produced :
% [235] (inverse(a) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 3043
% Current number of ordered equations: 0
% Current number of rules: 229
% New rule produced :
% [236] (inverse(a) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 3042
% Current number of ordered equations: 0
% Current number of rules: 230
% New rule produced :
% [237] (a least_upper_bound X) greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 3095
% Current number of ordered equations: 0
% Current number of rules: 231
% New rule produced :
% [238] (b least_upper_bound X) greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 3094
% Current number of ordered equations: 0
% Current number of rules: 232
% New rule produced :
% [239] (c least_upper_bound X) greatest_lower_bound inverse(a) -> inverse(a)
% Current number of equations to process: 3093
% Current number of ordered equations: 0
% Current number of rules: 233
% New rule produced :
% [240] inverse(a) greatest_lower_bound multiply(a,a) -> inverse(a)
% Current number of equations to process: 3092
% Current number of ordered equations: 0
% Current number of rules: 234
% New rule produced :
% [241] inverse(a) greatest_lower_bound multiply(a,b) -> inverse(a)
% Current number of equations to process: 3091
% Current number of ordered equations: 0
% Current number of rules: 235
% New rule produced :
% [242] inverse(a) greatest_lower_bound multiply(a,c) -> inverse(a)
% Current number of equations to process: 3090
% Current number of ordered equations: 0
% Current number of rules: 236
% New rule produced :
% [243] inverse(a) greatest_lower_bound multiply(b,a) -> inverse(a)
% Current number of equations to process: 3089
% Current number of ordered equations: 0
% Current number of rules: 237
% New rule produced :
% [244] inverse(a) greatest_lower_bound multiply(b,b) -> inverse(a)
% Current number of equations to process: 3088
% Current number of ordered equations: 0
% Current number of rules: 238
% New rule produced :
% [245] inverse(a) greatest_lower_bound multiply(b,c) -> inverse(a)
% Current number of equations to process: 3087
% Current number of ordered equations: 0
% Current number of rules: 239
% New rule produced :
% [246] inverse(a) greatest_lower_bound multiply(c,a) -> inverse(a)
% Current number of equations to process: 3086
% Current number of ordered equations: 0
% Current number of rules: 240
% New rule produced :
% [247] inverse(a) greatest_lower_bound multiply(c,b) -> inverse(a)
% Current number of equations to process: 3085
% Current number of ordered equations: 0
% Current number of rules: 241
% New rule produced :
% [248] inverse(a) greatest_lower_bound multiply(c,c) -> inverse(a)
% Current number of equations to process: 3084
% Current number of ordered equations: 0
% Current number of rules: 242
% New rule produced :
% [249]
% (c greatest_lower_bound a) least_upper_bound inverse(a) ->
% c greatest_lower_bound a
% Current number of equations to process: 3083
% Current number of ordered equations: 0
% Current number of rules: 243
% New rule produced :
% [250]
% (c greatest_lower_bound a) least_upper_bound inverse(b) ->
% c greatest_lower_bound a
% Current number of equations to process: 3082
% Current number of ordered equations: 0
% Current number of rules: 244
% New rule produced :
% [251]
% (c greatest_lower_bound a) least_upper_bound inverse(c) ->
% c greatest_lower_bound a
% Current number of equations to process: 3081
% Current number of ordered equations: 0
% Current number of rules: 245
% New rule produced :
% [252] multiply(X,inverse(a)) greatest_lower_bound X -> multiply(X,inverse(a))
% Current number of equations to process: 3096
% Current number of ordered equations: 0
% Current number of rules: 246
% New rule produced :
% [253]
% ((c greatest_lower_bound b) least_upper_bound X) greatest_lower_bound identity
% -> identity
% Current number of equations to process: 3283
% Current number of ordered equations: 0
% Current number of rules: 247
% New rule produced :
% [254] (inverse(b) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 3317
% Current number of ordered equations: 0
% Current number of rules: 248
% New rule produced :
% [255] (inverse(b) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 3316
% Current number of ordered equations: 0
% Current number of rules: 249
% New rule produced :
% [256] (inverse(b) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 3315
% Current number of ordered equations: 0
% Current number of rules: 250
% New rule produced :
% [257] (a least_upper_bound X) greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 3368
% Current number of ordered equations: 0
% Current number of rules: 251
% New rule produced :
% [258] (b least_upper_bound X) greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 3367
% Current number of ordered equations: 0
% Current number of rules: 252
% New rule produced :
% [259] (c least_upper_bound X) greatest_lower_bound inverse(b) -> inverse(b)
% Current number of equations to process: 3366
% Current number of ordered equations: 0
% Current number of rules: 253
% New rule produced :
% [260] inverse(b) greatest_lower_bound multiply(a,a) -> inverse(b)
% Current number of equations to process: 3365
% Current number of ordered equations: 0
% Current number of rules: 254
% New rule produced :
% [261] inverse(b) greatest_lower_bound multiply(a,b) -> inverse(b)
% Current number of equations to process: 3364
% Current number of ordered equations: 0
% Current number of rules: 255
% New rule produced :
% [262] inverse(b) greatest_lower_bound multiply(a,c) -> inverse(b)
% Current number of equations to process: 3363
% Current number of ordered equations: 0
% Current number of rules: 256
% New rule produced :
% [263] inverse(b) greatest_lower_bound multiply(b,a) -> inverse(b)
% Current number of equations to process: 3362
% Current number of ordered equations: 0
% Current number of rules: 257
% New rule produced :
% [264] inverse(b) greatest_lower_bound multiply(b,b) -> inverse(b)
% Current number of equations to process: 3361
% Current number of ordered equations: 0
% Current number of rules: 258
% New rule produced :
% [265] inverse(b) greatest_lower_bound multiply(b,c) -> inverse(b)
% Current number of equations to process: 3360
% Current number of ordered equations: 0
% Current number of rules: 259
% New rule produced :
% [266] inverse(b) greatest_lower_bound multiply(c,a) -> inverse(b)
% Current number of equations to process: 3359
% Current number of ordered equations: 0
% Current number of rules: 260
% New rule produced :
% [267] inverse(b) greatest_lower_bound multiply(c,b) -> inverse(b)
% Current number of equations to process: 3358
% Current number of ordered equations: 0
% Current number of rules: 261
% New rule produced :
% [268] inverse(b) greatest_lower_bound multiply(c,c) -> inverse(b)
% Current number of equations to process: 3357
% Current number of ordered equations: 0
% Current number of rules: 262
% New rule produced :
% [269]
% (c greatest_lower_bound b) least_upper_bound inverse(a) ->
% c greatest_lower_bound b
% Current number of equations to process: 3356
% Current number of ordered equations: 0
% Current number of rules: 263
% New rule produced :
% [270]
% (c greatest_lower_bound b) least_upper_bound inverse(b) ->
% c greatest_lower_bound b
% Current number of equations to process: 3355
% Current number of ordered equations: 0
% Current number of rules: 264
% New rule produced :
% [271]
% (c greatest_lower_bound b) least_upper_bound inverse(c) ->
% c greatest_lower_bound b
% Current number of equations to process: 3354
% Current number of ordered equations: 0
% Current number of rules: 265
% New rule produced :
% [272] multiply(X,inverse(b)) greatest_lower_bound X -> multiply(X,inverse(b))
% Current number of equations to process: 3369
% Current number of ordered equations: 0
% Current number of rules: 266
% New rule produced :
% [273] (inverse(c) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 3565
% Current number of ordered equations: 0
% Current number of rules: 267
% New rule produced :
% [274] (inverse(c) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 3564
% Current number of ordered equations: 0
% Current number of rules: 268
% New rule produced :
% [275] (inverse(c) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 3563
% Current number of ordered equations: 0
% Current number of rules: 269
% New rule produced :
% [276] (a least_upper_bound X) greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 3616
% Current number of ordered equations: 0
% Current number of rules: 270
% New rule produced :
% [277] (b least_upper_bound X) greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 3615
% Current number of ordered equations: 0
% Current number of rules: 271
% New rule produced :
% [278] (c least_upper_bound X) greatest_lower_bound inverse(c) -> inverse(c)
% Current number of equations to process: 3614
% Current number of ordered equations: 0
% Current number of rules: 272
% New rule produced :
% [279] inverse(c) greatest_lower_bound multiply(a,a) -> inverse(c)
% Current number of equations to process: 3613
% Current number of ordered equations: 0
% Current number of rules: 273
% New rule produced :
% [280] inverse(c) greatest_lower_bound multiply(a,b) -> inverse(c)
% Current number of equations to process: 3612
% Current number of ordered equations: 0
% Current number of rules: 274
% New rule produced :
% [281] inverse(c) greatest_lower_bound multiply(a,c) -> inverse(c)
% Current number of equations to process: 3611
% Current number of ordered equations: 0
% Current number of rules: 275
% New rule produced :
% [282] inverse(c) greatest_lower_bound multiply(b,a) -> inverse(c)
% Current number of equations to process: 3610
% Current number of ordered equations: 0
% Current number of rules: 276
% New rule produced :
% [283] inverse(c) greatest_lower_bound multiply(b,b) -> inverse(c)
% Current number of equations to process: 3609
% Current number of ordered equations: 0
% Current number of rules: 277
% New rule produced :
% [284] inverse(c) greatest_lower_bound multiply(b,c) -> inverse(c)
% Current number of equations to process: 3608
% Current number of ordered equations: 0
% Current number of rules: 278
% New rule produced :
% [285] inverse(c) greatest_lower_bound multiply(c,a) -> inverse(c)
% Current number of equations to process: 3607
% Current number of ordered equations: 0
% Current number of rules: 279
% New rule produced :
% [286] inverse(c) greatest_lower_bound multiply(c,b) -> inverse(c)
% Current number of equations to process: 3606
% Current number of ordered equations: 0
% Current number of rules: 280
% New rule produced :
% [287] inverse(c) greatest_lower_bound multiply(c,c) -> inverse(c)
% Current number of equations to process: 3605
% Current number of ordered equations: 0
% Current number of rules: 281
% New rule produced :
% [288] multiply(X,inverse(c)) greatest_lower_bound X -> multiply(X,inverse(c))
% Current number of equations to process: 3620
% Current number of ordered equations: 0
% Current number of rules: 282
% New rule produced :
% [289]
% identity greatest_lower_bound inverse(multiply(a,a)) ->
% inverse(multiply(a,a))
% Current number of equations to process: 3813
% Current number of ordered equations: 0
% Current number of rules: 283
% New rule produced :
% [290]
% identity greatest_lower_bound inverse(multiply(a,b)) ->
% inverse(multiply(a,b))
% Current number of equations to process: 4091
% Current number of ordered equations: 0
% Current number of rules: 284
% New rule produced :
% [291]
% identity greatest_lower_bound inverse(multiply(a,c)) ->
% inverse(multiply(a,c))
% Current number of equations to process: 4361
% Current number of ordered equations: 0
% Current number of rules: 285
% New rule produced :
% [292]
% identity greatest_lower_bound inverse(multiply(b,a)) ->
% inverse(multiply(b,a))
% Current number of equations to process: 4631
% Current number of ordered equations: 0
% Current number of rules: 286
% New rule produced :
% [293]
% identity greatest_lower_bound inverse(multiply(b,b)) ->
% inverse(multiply(b,b))
% Current number of equations to process: 4901
% Current number of ordered equations: 0
% Current number of rules: 287
% New rule produced :
% [294]
% identity greatest_lower_bound inverse(multiply(b,c)) ->
% inverse(multiply(b,c))
% Current number of equations to process: 1747
% Current number of ordered equations: 0
% Current number of rules: 288
% New rule produced :
% [295]
% identity greatest_lower_bound inverse(multiply(c,a)) ->
% inverse(multiply(c,a))
% Current number of equations to process: 2125
% Current number of ordered equations: 0
% Current number of rules: 289
% New rule produced :
% [296]
% identity greatest_lower_bound inverse(multiply(c,b)) ->
% inverse(multiply(c,b))
% Current number of equations to process: 2395
% Current number of ordered equations: 0
% Current number of rules: 290
% New rule produced :
% [297]
% identity greatest_lower_bound inverse(multiply(c,c)) ->
% inverse(multiply(c,c))
% Current number of equations to process: 2665
% Current number of ordered equations: 0
% Current number of rules: 291
% New rule produced :
% [298] identity least_upper_bound multiply(inverse(a),inverse(a)) -> identity
% Current number of equations to process: 3788
% Current number of ordered equations: 0
% Current number of rules: 292
% New rule produced :
% [299] identity least_upper_bound multiply(inverse(a),inverse(b)) -> identity
% Current number of equations to process: 3787
% Current number of ordered equations: 0
% Current number of rules: 293
% New rule produced :
% [300] identity least_upper_bound multiply(inverse(a),inverse(c)) -> identity
% Current number of equations to process: 3786
% Current number of ordered equations: 0
% Current number of rules: 294
% New rule produced :
% [301] identity least_upper_bound multiply(inverse(b),inverse(a)) -> identity
% Current number of equations to process: 3826
% Current number of ordered equations: 0
% Current number of rules: 295
% New rule produced :
% [302] identity least_upper_bound multiply(inverse(b),inverse(b)) -> identity
% Current number of equations to process: 3825
% Current number of ordered equations: 0
% Current number of rules: 296
% New rule produced :
% [303] identity least_upper_bound multiply(inverse(b),inverse(c)) -> identity
% Current number of equations to process: 3824
% Current number of ordered equations: 0
% Current number of rules: 297
% New rule produced :
% [304] identity least_upper_bound multiply(inverse(c),inverse(a)) -> identity
% Current number of equations to process: 3922
% Current number of ordered equations: 0
% Current number of rules: 298
% New rule produced :
% [305] identity least_upper_bound multiply(inverse(c),inverse(b)) -> identity
% Current number of equations to process: 3921
% Current number of ordered equations: 0
% Current number of rules: 299
% New rule produced :
% [306] identity least_upper_bound multiply(inverse(c),inverse(c)) -> identity
% Current number of equations to process: 3920
% Current number of ordered equations: 0
% Current number of rules: 300
% New rule produced :
% [307] a least_upper_bound multiply(inverse(a),inverse(a)) -> a
% Current number of equations to process: 3919
% Current number of ordered equations: 0
% Current number of rules: 301
% New rule produced :
% [308] a least_upper_bound multiply(inverse(b),inverse(a)) -> a
% Current number of equations to process: 3918
% Current number of ordered equations: 0
% Current number of rules: 302
% New rule produced :
% [309] a least_upper_bound multiply(inverse(c),inverse(a)) -> a
% Current number of equations to process: 3917
% Current number of ordered equations: 0
% Current number of rules: 303
% New rule produced :
% [310] b least_upper_bound multiply(inverse(a),inverse(a)) -> b
% Current number of equations to process: 3916
% Current number of ordered equations: 0
% Current number of rules: 304
% New rule produced :
% [311] b least_upper_bound multiply(inverse(b),inverse(a)) -> b
% Current number of equations to process: 3915
% Current number of ordered equations: 0
% Current number of rules: 305
% New rule produced :
% [312] b least_upper_bound multiply(inverse(c),inverse(a)) -> b
% Current number of equations to process: 3914
% Current number of ordered equations: 0
% Current number of rules: 306
% New rule produced :
% [313] c least_upper_bound multiply(inverse(a),inverse(a)) -> c
% Current number of equations to process: 3913
% Current number of ordered equations: 0
% Current number of rules: 307
% New rule produced :
% [314] c least_upper_bound multiply(inverse(b),inverse(a)) -> c
% Current number of equations to process: 3912
% Current number of ordered equations: 0
% Current number of rules: 308
% New rule produced :
% [315] c least_upper_bound multiply(inverse(c),inverse(a)) -> c
% Current number of equations to process: 3911
% Current number of ordered equations: 0
% Current number of rules: 309
% New rule produced :
% [316]
% (b greatest_lower_bound a) least_upper_bound (identity greatest_lower_bound X)
% -> b greatest_lower_bound a
% Current number of equations to process: 4263
% Current number of ordered equations: 0
% Current number of rules: 310
% New rule produced :
% [317]
% (c greatest_lower_bound a) least_upper_bound (identity greatest_lower_bound X)
% -> c greatest_lower_bound a
% Current number of equations to process: 4262
% Current number of ordered equations: 0
% Current number of rules: 311
% New rule produced :
% [318]
% (c greatest_lower_bound b) least_upper_bound (identity greatest_lower_bound X)
% -> c greatest_lower_bound b
% Current number of equations to process: 4261
% Current number of ordered equations: 0
% Current number of rules: 312
% New rule produced :
% [319]
% (multiply(X,inverse(a)) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 4260
% Current number of ordered equations: 0
% Current number of rules: 313
% New rule produced :
% [320] a least_upper_bound multiply(inverse(a),inverse(b)) -> a
% Current number of equations to process: 4766
% Current number of ordered equations: 0
% Current number of rules: 314
% New rule produced :
% [321] a least_upper_bound multiply(inverse(b),inverse(b)) -> a
% Current number of equations to process: 4765
% Current number of ordered equations: 0
% Current number of rules: 315
% New rule produced :
% [322] a least_upper_bound multiply(inverse(c),inverse(b)) -> a
% Current number of equations to process: 4764
% Current number of ordered equations: 0
% Current number of rules: 316
% New rule produced :
% [323] b least_upper_bound multiply(inverse(a),inverse(b)) -> b
% Current number of equations to process: 4763
% Current number of ordered equations: 0
% Current number of rules: 317
% New rule produced :
% [324] b least_upper_bound multiply(inverse(b),inverse(b)) -> b
% Current number of equations to process: 4762
% Current number of ordered equations: 0
% Current number of rules: 318
% New rule produced :
% [325] b least_upper_bound multiply(inverse(c),inverse(b)) -> b
% Current number of equations to process: 4761
% Current number of ordered equations: 0
% Current number of rules: 319
% New rule produced :
% [326] c least_upper_bound multiply(inverse(a),inverse(b)) -> c
% Current number of equations to process: 4760
% Current number of ordered equations: 0
% Current number of rules: 320
% New rule produced :
% [327] c least_upper_bound multiply(inverse(b),inverse(b)) -> c
% Current number of equations to process: 4759
% Current number of ordered equations: 0
% Current number of rules: 321
% New rule produced :
% [328] c least_upper_bound multiply(inverse(c),inverse(b)) -> c
% Current number of equations to process: 4758
% Current number of ordered equations: 0
% Current number of rules: 322
% New rule produced :
% [329] a least_upper_bound multiply(inverse(a),inverse(c)) -> a
% Current number of equations to process: 649
% Current number of ordered equations: 0
% Current number of rules: 323
% New rule produced :
% [330] a least_upper_bound multiply(inverse(b),inverse(c)) -> a
% Current number of equations to process: 648
% Current number of ordered equations: 0
% Current number of rules: 324
% New rule produced :
% [331] a least_upper_bound multiply(inverse(c),inverse(c)) -> a
% Current number of equations to process: 647
% Current number of ordered equations: 0
% Current number of rules: 325
% New rule produced :
% [332] b least_upper_bound multiply(inverse(a),inverse(c)) -> b
% Current number of equations to process: 646
% Current number of ordered equations: 0
% Current number of rules: 326
% New rule produced :
% [333] b least_upper_bound multiply(inverse(b),inverse(c)) -> b
% Current number of equations to process: 645
% Current number of ordered equations: 0
% Current number of rules: 327
% New rule produced :
% [334] b least_upper_bound multiply(inverse(c),inverse(c)) -> b
% Current number of equations to process: 644
% Current number of ordered equations: 0
% Current number of rules: 328
% New rule produced :
% [335] c least_upper_bound multiply(inverse(a),inverse(c)) -> c
% Current number of equations to process: 643
% Current number of ordered equations: 0
% Current number of rules: 329
% New rule produced :
% [336] c least_upper_bound multiply(inverse(b),inverse(c)) -> c
% Current number of equations to process: 642
% Current number of ordered equations: 0
% Current number of rules: 330
% New rule produced :
% [337] c least_upper_bound multiply(inverse(c),inverse(c)) -> c
% Current number of equations to process: 641
% Current number of ordered equations: 0
% Current number of rules: 331
% New rule produced :
% [338]
% (multiply(X,inverse(b)) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 1064
% Current number of ordered equations: 0
% Current number of rules: 332
% New rule produced :
% [339]
% (multiply(X,inverse(c)) greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 1063
% Current number of ordered equations: 0
% Current number of rules: 333
% New rule produced : [340] multiply(Y,inverse(multiply(X,Y))) -> inverse(X)
% Rule [225] multiply(X,multiply(Y,inverse(multiply(X,Y)))) -> identity
% collapsed.
% Current number of equations to process: 1067
% Current number of ordered equations: 0
% Current number of rules: 333
% New rule produced :
% [341] identity least_upper_bound inverse(multiply(a,a)) -> identity
% Current number of equations to process: 4934
% Current number of ordered equations: 0
% Current number of rules: 334
% New rule produced :
% [342]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 4937
% Current number of ordered equations: 0
% Current number of rules: 335
% New rule produced : [343] a least_upper_bound inverse(multiply(a,a)) -> a
% Current number of equations to process: 4952
% Current number of ordered equations: 0
% Current number of rules: 336
% New rule produced : [344] b least_upper_bound inverse(multiply(a,a)) -> b
% Current number of equations to process: 4955
% Current number of ordered equations: 0
% Current number of rules: 337
% New rule produced : [345] c least_upper_bound inverse(multiply(a,a)) -> c
% Current number of equations to process: 4958
% Current number of ordered equations: 0
% Current number of rules: 338
% New rule produced :
% [346] a greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% Current number of equations to process: 4963
% Current number of ordered equations: 0
% Current number of rules: 339
% New rule produced :
% [347] b greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% Current number of equations to process: 4962
% Current number of ordered equations: 0
% Current number of rules: 340
% New rule produced :
% [348] c greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% Current number of equations to process: 4961
% Current number of ordered equations: 0
% Current number of rules: 341
% New rule produced :
% [349] inverse(a) least_upper_bound inverse(multiply(a,a)) -> inverse(a)
% Current number of equations to process: 1000
% Current number of ordered equations: 0
% Current number of rules: 342
% New rule produced :
% [350] identity least_upper_bound inverse(multiply(a,b)) -> identity
% Current number of equations to process: 1115
% Current number of ordered equations: 0
% Current number of rules: 343
% New rule produced :
% [351]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 1118
% Current number of ordered equations: 0
% Current number of rules: 344
% New rule produced :
% [352]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 1117
% Current number of ordered equations: 0
% Current number of rules: 345
% New rule produced :
% [353]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 1116
% Current number of ordered equations: 0
% Current number of rules: 346
% New rule produced :
% [354]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 1115
% Current number of ordered equations: 0
% Current number of rules: 347
% New rule produced : [355] a least_upper_bound inverse(multiply(a,b)) -> a
% Current number of equations to process: 1130
% Current number of ordered equations: 0
% Current number of rules: 348
% New rule produced : [356] b least_upper_bound inverse(multiply(a,b)) -> b
% Current number of equations to process: 1133
% Current number of ordered equations: 0
% Current number of rules: 349
% New rule produced : [357] c least_upper_bound inverse(multiply(a,b)) -> c
% Current number of equations to process: 1136
% Current number of ordered equations: 0
% Current number of rules: 350
% New rule produced :
% [358] a greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% Current number of equations to process: 1141
% Current number of ordered equations: 0
% Current number of rules: 351
% New rule produced :
% [359] b greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% Current number of equations to process: 1140
% Current number of ordered equations: 0
% Current number of rules: 352
% New rule produced :
% [360] c greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% Current number of equations to process: 1139
% Current number of ordered equations: 0
% Current number of rules: 353
% New rule produced :
% [361] inverse(a) least_upper_bound inverse(multiply(a,b)) -> inverse(a)
% Current number of equations to process: 1190
% Current number of ordered equations: 0
% Current number of rules: 354
% New rule produced :
% [362] identity least_upper_bound inverse(multiply(a,c)) -> identity
% Current number of equations to process: 1293
% Current number of ordered equations: 0
% Current number of rules: 355
% New rule produced :
% [363]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 1296
% Current number of ordered equations: 0
% Current number of rules: 356
% New rule produced :
% [364]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 1295
% Current number of ordered equations: 0
% Current number of rules: 357
% New rule produced :
% [365]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 1294
% Current number of ordered equations: 0
% Current number of rules: 358
% New rule produced :
% [366]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 1293
% Current number of ordered equations: 0
% Current number of rules: 359
% New rule produced : [367] a least_upper_bound inverse(multiply(a,c)) -> a
% Current number of equations to process: 1308
% Current number of ordered equations: 0
% Current number of rules: 360
% New rule produced : [368] b least_upper_bound inverse(multiply(a,c)) -> b
% Current number of equations to process: 1311
% Current number of ordered equations: 0
% Current number of rules: 361
% New rule produced : [369] c least_upper_bound inverse(multiply(a,c)) -> c
% Current number of equations to process: 1314
% Current number of ordered equations: 0
% Current number of rules: 362
% New rule produced :
% [370] a greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% Current number of equations to process: 1319
% Current number of ordered equations: 0
% Current number of rules: 363
% New rule produced :
% [371] b greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% Current number of equations to process: 1318
% Current number of ordered equations: 0
% Current number of rules: 364
% New rule produced :
% [372] c greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% Current number of equations to process: 1317
% Current number of ordered equations: 0
% Current number of rules: 365
% New rule produced :
% [373] inverse(a) least_upper_bound inverse(multiply(a,c)) -> inverse(a)
% Current number of equations to process: 1380
% Current number of ordered equations: 0
% Current number of rules: 366
% New rule produced :
% [374] identity least_upper_bound inverse(multiply(b,a)) -> identity
% Current number of equations to process: 1471
% Current number of ordered equations: 0
% Current number of rules: 367
% New rule produced :
% [375]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 1474
% Current number of ordered equations: 0
% Current number of rules: 368
% New rule produced :
% [376]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 1473
% Current number of ordered equations: 0
% Current number of rules: 369
% New rule produced :
% [377]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 1472
% Current number of ordered equations: 0
% Current number of rules: 370
% New rule produced :
% [378]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 1471
% Current number of ordered equations: 0
% Current number of rules: 371
% New rule produced : [379] a least_upper_bound inverse(multiply(b,a)) -> a
% Current number of equations to process: 1486
% Current number of ordered equations: 0
% Current number of rules: 372
% New rule produced : [380] b least_upper_bound inverse(multiply(b,a)) -> b
% Current number of equations to process: 1489
% Current number of ordered equations: 0
% Current number of rules: 373
% New rule produced : [381] c least_upper_bound inverse(multiply(b,a)) -> c
% Current number of equations to process: 1492
% Current number of ordered equations: 0
% Current number of rules: 374
% New rule produced :
% [382] a greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% Current number of equations to process: 1497
% Current number of ordered equations: 0
% Current number of rules: 375
% New rule produced :
% [383] b greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% Current number of equations to process: 1496
% Current number of ordered equations: 0
% Current number of rules: 376
% New rule produced :
% [384] c greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% Current number of equations to process: 1495
% Current number of ordered equations: 0
% Current number of rules: 377
% New rule produced :
% [385] inverse(b) least_upper_bound inverse(multiply(b,a)) -> inverse(b)
% Current number of equations to process: 1534
% Current number of ordered equations: 0
% Current number of rules: 378
% New rule produced :
% [386] identity least_upper_bound inverse(multiply(b,b)) -> identity
% Current number of equations to process: 1649
% Current number of ordered equations: 0
% Current number of rules: 379
% New rule produced :
% [387]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 1652
% Current number of ordered equations: 0
% Current number of rules: 380
% New rule produced :
% [388]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 1651
% Current number of ordered equations: 0
% Current number of rules: 381
% New rule produced :
% [389]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 1650
% Current number of ordered equations: 0
% Current number of rules: 382
% New rule produced :
% [390]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 1649
% Current number of ordered equations: 0
% Current number of rules: 383
% New rule produced : [391] a least_upper_bound inverse(multiply(b,b)) -> a
% Current number of equations to process: 1664
% Current number of ordered equations: 0
% Current number of rules: 384
% New rule produced : [392] b least_upper_bound inverse(multiply(b,b)) -> b
% Current number of equations to process: 1667
% Current number of ordered equations: 0
% Current number of rules: 385
% New rule produced : [393] c least_upper_bound inverse(multiply(b,b)) -> c
% Current number of equations to process: 1670
% Current number of ordered equations: 0
% Current number of rules: 386
% New rule produced :
% [394] a greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% Current number of equations to process: 1675
% Current number of ordered equations: 0
% Current number of rules: 387
% New rule produced :
% [395] b greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% Current number of equations to process: 1674
% Current number of ordered equations: 0
% Current number of rules: 388
% New rule produced :
% [396] c greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% Current number of equations to process: 1673
% Current number of ordered equations: 0
% Current number of rules: 389
% New rule produced :
% [397] inverse(b) least_upper_bound inverse(multiply(b,b)) -> inverse(b)
% Current number of equations to process: 1724
% Current number of ordered equations: 0
% Current number of rules: 390
% New rule produced :
% [398] identity least_upper_bound inverse(multiply(b,c)) -> identity
% Current number of equations to process: 1827
% Current number of ordered equations: 0
% Current number of rules: 391
% New rule produced :
% [399]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 1830
% Current number of ordered equations: 0
% Current number of rules: 392
% New rule produced :
% [400]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 1829
% Current number of ordered equations: 0
% Current number of rules: 393
% New rule produced :
% [401]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 1828
% Current number of ordered equations: 0
% Current number of rules: 394
% New rule produced :
% [402]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 1827
% Current number of ordered equations: 0
% Current number of rules: 395
% New rule produced : [403] a least_upper_bound inverse(multiply(b,c)) -> a
% Current number of equations to process: 1842
% Current number of ordered equations: 0
% Current number of rules: 396
% New rule produced : [404] b least_upper_bound inverse(multiply(b,c)) -> b
% Current number of equations to process: 1845
% Current number of ordered equations: 0
% Current number of rules: 397
% New rule produced : [405] c least_upper_bound inverse(multiply(b,c)) -> c
% Current number of equations to process: 1848
% Current number of ordered equations: 0
% Current number of rules: 398
% New rule produced :
% [406] a greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% Current number of equations to process: 1853
% Current number of ordered equations: 0
% Current number of rules: 399
% New rule produced :
% [407] b greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% Current number of equations to process: 1852
% Current number of ordered equations: 0
% Current number of rules: 400
% New rule produced :
% [408] c greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% Current number of equations to process: 1851
% Current number of ordered equations: 0
% Current number of rules: 401
% New rule produced :
% [409] inverse(b) least_upper_bound inverse(multiply(b,c)) -> inverse(b)
% Current number of equations to process: 1914
% Current number of ordered equations: 0
% Current number of rules: 402
% New rule produced :
% [410] identity least_upper_bound inverse(multiply(c,a)) -> identity
% Current number of equations to process: 2005
% Current number of ordered equations: 0
% Current number of rules: 403
% New rule produced :
% [411]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 2008
% Current number of ordered equations: 0
% Current number of rules: 404
% New rule produced :
% [412]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 2007
% Current number of ordered equations: 0
% Current number of rules: 405
% New rule produced :
% [413]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 2006
% Current number of ordered equations: 0
% Current number of rules: 406
% New rule produced :
% [414]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 2005
% Current number of ordered equations: 0
% Current number of rules: 407
% New rule produced : [415] a least_upper_bound inverse(multiply(c,a)) -> a
% Current number of equations to process: 2020
% Current number of ordered equations: 0
% Current number of rules: 408
% New rule produced : [416] b least_upper_bound inverse(multiply(c,a)) -> b
% Current number of equations to process: 2023
% Current number of ordered equations: 0
% Current number of rules: 409
% New rule produced : [417] c least_upper_bound inverse(multiply(c,a)) -> c
% Current number of equations to process: 2026
% Current number of ordered equations: 0
% Current number of rules: 410
% New rule produced :
% [418] a greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% Current number of equations to process: 2031
% Current number of ordered equations: 0
% Current number of rules: 411
% New rule produced :
% [419] b greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% Current number of equations to process: 2030
% Current number of ordered equations: 0
% Current number of rules: 412
% New rule produced :
% [420] c greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% Current number of equations to process: 2029
% Current number of ordered equations: 0
% Current number of rules: 413
% New rule produced :
% [421] inverse(c) least_upper_bound inverse(multiply(c,a)) -> inverse(c)
% Current number of equations to process: 2068
% Current number of ordered equations: 0
% Current number of rules: 414
% New rule produced :
% [422] identity least_upper_bound inverse(multiply(c,b)) -> identity
% Current number of equations to process: 2183
% Current number of ordered equations: 0
% Current number of rules: 415
% New rule produced :
% [423]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 2186
% Current number of ordered equations: 0
% Current number of rules: 416
% New rule produced :
% [424]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 2185
% Current number of ordered equations: 0
% Current number of rules: 417
% New rule produced :
% [425]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 2184
% Current number of ordered equations: 0
% Current number of rules: 418
% New rule produced :
% [426]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 2183
% Current number of ordered equations: 0
% Current number of rules: 419
% New rule produced : [427] a least_upper_bound inverse(multiply(c,b)) -> a
% Current number of equations to process: 2198
% Current number of ordered equations: 0
% Current number of rules: 420
% New rule produced : [428] b least_upper_bound inverse(multiply(c,b)) -> b
% Current number of equations to process: 2201
% Current number of ordered equations: 0
% Current number of rules: 421
% New rule produced : [429] c least_upper_bound inverse(multiply(c,b)) -> c
% Current number of equations to process: 2204
% Current number of ordered equations: 0
% Current number of rules: 422
% New rule produced :
% [430] a greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% Current number of equations to process: 2209
% Current number of ordered equations: 0
% Current number of rules: 423
% New rule produced :
% [431] b greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% Current number of equations to process: 2208
% Current number of ordered equations: 0
% Current number of rules: 424
% New rule produced :
% [432] c greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% Current number of equations to process: 2207
% Current number of ordered equations: 0
% Current number of rules: 425
% New rule produced :
% [433] inverse(c) least_upper_bound inverse(multiply(c,b)) -> inverse(c)
% Current number of equations to process: 2258
% Current number of ordered equations: 0
% Current number of rules: 426
% New rule produced :
% [434] identity least_upper_bound inverse(multiply(c,c)) -> identity
% Current number of equations to process: 2361
% Current number of ordered equations: 0
% Current number of rules: 427
% New rule produced :
% [435]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 2364
% Current number of ordered equations: 0
% Current number of rules: 428
% New rule produced :
% [436]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 2363
% Current number of ordered equations: 0
% Current number of rules: 429
% New rule produced :
% [437]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 2362
% Current number of ordered equations: 0
% Current number of rules: 430
% New rule produced :
% [438]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity
% Current number of equations to process: 2361
% Current number of ordered equations: 0
% Current number of rules: 431
% New rule produced : [439] a least_upper_bound inverse(multiply(c,c)) -> a
% Current number of equations to process: 2376
% Current number of ordered equations: 0
% Current number of rules: 432
% New rule produced : [440] b least_upper_bound inverse(multiply(c,c)) -> b
% Current number of equations to process: 2379
% Current number of ordered equations: 0
% Current number of rules: 433
% New rule produced : [441] c least_upper_bound inverse(multiply(c,c)) -> c
% Current number of equations to process: 2382
% Current number of ordered equations: 0
% Current number of rules: 434
% New rule produced :
% [442] a greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% Current number of equations to process: 2387
% Current number of ordered equations: 0
% Current number of rules: 435
% New rule produced :
% [443] b greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% Current number of equations to process: 2386
% Current number of ordered equations: 0
% Current number of rules: 436
% New rule produced :
% [444] c greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% Current number of equations to process: 2385
% Current number of ordered equations: 0
% Current number of rules: 437
% New rule produced :
% [445] inverse(c) least_upper_bound inverse(multiply(c,c)) -> inverse(c)
% Current number of equations to process: 2448
% Current number of ordered equations: 0
% Current number of rules: 438
% New rule produced :
% [446]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 3401
% Current number of ordered equations: 0
% Current number of rules: 439
% New rule produced :
% [447]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound b -> b
% Current number of equations to process: 3400
% Current number of ordered equations: 0
% Current number of rules: 440
% New rule produced :
% [448]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound c -> c
% Current number of equations to process: 3399
% Current number of ordered equations: 0
% Current number of rules: 441
% New rule produced :
% [449]
% (multiply(a,a) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3568
% Current number of ordered equations: 0
% Current number of rules: 442
% New rule produced :
% [450]
% (multiply(a,b) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3567
% Current number of ordered equations: 0
% Current number of rules: 443
% New rule produced :
% [451]
% (multiply(a,c) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3566
% Current number of ordered equations: 0
% Current number of rules: 444
% New rule produced :
% [452]
% (multiply(b,a) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3565
% Current number of ordered equations: 0
% Current number of rules: 445
% New rule produced :
% [453]
% (multiply(b,b) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3564
% Current number of ordered equations: 0
% Current number of rules: 446
% New rule produced :
% [454]
% (multiply(b,c) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3563
% Current number of ordered equations: 0
% Current number of rules: 447
% New rule produced :
% [455]
% (multiply(c,a) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3562
% Current number of ordered equations: 0
% Current number of rules: 448
% New rule produced :
% [456]
% (multiply(c,b) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3561
% Current number of ordered equations: 0
% Current number of rules: 449
% New rule produced :
% [457]
% (multiply(c,c) least_upper_bound X) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 3560
% Current number of ordered equations: 0
% Current number of rules: 450
% New rule produced :
% [458]
% (multiply(a,a) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3559
% Current number of ordered equations: 0
% Current number of rules: 451
% New rule produced :
% [459]
% (multiply(a,b) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3558
% Current number of ordered equations: 0
% Current number of rules: 452
% New rule produced :
% [460]
% (multiply(a,c) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3557
% Current number of ordered equations: 0
% Current number of rules: 453
% New rule produced :
% [461]
% (multiply(b,a) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3556
% Current number of ordered equations: 0
% Current number of rules: 454
% New rule produced :
% [462]
% (multiply(b,b) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3555
% Current number of ordered equations: 0
% Current number of rules: 455
% New rule produced :
% [463]
% (multiply(b,c) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3554
% Current number of ordered equations: 0
% Current number of rules: 456
% New rule produced :
% [464]
% (multiply(c,a) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3553
% Current number of ordered equations: 0
% Current number of rules: 457
% New rule produced :
% [465]
% (multiply(c,b) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3552
% Current number of ordered equations: 0
% Current number of rules: 458
% New rule produced :
% [466]
% (multiply(c,c) least_upper_bound X) greatest_lower_bound inverse(b) ->
% inverse(b)
% Current number of equations to process: 3551
% Current number of ordered equations: 0
% Current number of rules: 459
% New rule produced :
% [467]
% (multiply(a,a) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3550
% Current number of ordered equations: 0
% Current number of rules: 460
% New rule produced :
% [468]
% (multiply(a,b) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3549
% Current number of ordered equations: 0
% Current number of rules: 461
% New rule produced :
% [469]
% (multiply(a,c) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3548
% Current number of ordered equations: 0
% Current number of rules: 462
% New rule produced :
% [470]
% (multiply(b,a) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3547
% Current number of ordered equations: 0
% Current number of rules: 463
% New rule produced :
% [471]
% (multiply(b,b) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3546
% Current number of ordered equations: 0
% Current number of rules: 464
% New rule produced :
% [472]
% (multiply(b,c) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3545
% Current number of ordered equations: 0
% Current number of rules: 465
% New rule produced :
% [473]
% (multiply(c,a) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3544
% Current number of ordered equations: 0
% Current number of rules: 466
% New rule produced :
% [474]
% (multiply(c,b) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3543
% Current number of ordered equations: 0
% Current number of rules: 467
% New rule produced :
% [475]
% (multiply(c,c) least_upper_bound X) greatest_lower_bound inverse(c) ->
% inverse(c)
% Current number of equations to process: 3542
% Current number of ordered equations: 0
% Current number of rules: 468
% New rule produced :
% [476] inverse(a) greatest_lower_bound multiply(a,multiply(a,a)) -> inverse(a)
% Current number of equations to process: 4443
% Current number of ordered equations: 0
% Current number of rules: 469
% New rule produced :
% [477] inverse(b) greatest_lower_bound multiply(a,multiply(a,a)) -> inverse(b)
% Current number of equations to process: 4442
% Current number of ordered equations: 0
% Current number of rules: 470
% New rule produced :
% [478] inverse(c) greatest_lower_bound multiply(a,multiply(a,a)) -> inverse(c)
% Current number of equations to process: 4441
% Current number of ordered equations: 0
% Current number of rules: 471
% New rule produced :
% [479] inverse(a) greatest_lower_bound multiply(b,multiply(a,a)) -> inverse(a)
% Current number of equations to process: 4440
% Current number of ordered equations: 0
% Current number of rules: 472
% New rule produced :
% [480] inverse(b) greatest_lower_bound multiply(b,multiply(a,a)) -> inverse(b)
% Current number of equations to process: 4439
% Current number of ordered equations: 0
% Current number of rules: 473
% New rule produced :
% [481] inverse(c) greatest_lower_bound multiply(b,multiply(a,a)) -> inverse(c)
% Current number of equations to process: 4438
% Current number of ordered equations: 0
% Current number of rules: 474
% New rule produced :
% [482] inverse(a) greatest_lower_bound multiply(c,multiply(a,a)) -> inverse(a)
% Current number of equations to process: 4437
% Current number of ordered equations: 0
% Current number of rules: 475
% New rule produced :
% [483] inverse(b) greatest_lower_bound multiply(c,multiply(a,a)) -> inverse(b)
% Current number of equations to process: 4436
% Current number of ordered equations: 0
% Current number of rules: 476
% New rule produced :
% [484] inverse(c) greatest_lower_bound multiply(c,multiply(a,a)) -> inverse(c)
% Current number of equations to process: 4435
% Current number of ordered equations: 0
% Current number of rules: 477
% New rule produced :
% [485] inverse(a) greatest_lower_bound multiply(a,multiply(a,b)) -> inverse(a)
% Current number of equations to process: 4434
% Current number of ordered equations: 0
% Current number of rules: 478
% New rule produced :
% [486] inverse(b) greatest_lower_bound multiply(a,multiply(a,b)) -> inverse(b)
% Current number of equations to process: 4433
% Current number of ordered equations: 0
% Current number of rules: 479
% New rule produced :
% [487] inverse(c) greatest_lower_bound multiply(a,multiply(a,b)) -> inverse(c)
% Current number of equations to process: 4432
% Current number of ordered equations: 0
% Current number of rules: 480
% New rule produced :
% [488] inverse(a) greatest_lower_bound multiply(b,multiply(a,b)) -> inverse(a)
% Current number of equations to process: 4431
% Current number of ordered equations: 0
% Current number of rules: 481
% New rule produced :
% [489] inverse(b) greatest_lower_bound multiply(b,multiply(a,b)) -> inverse(b)
% Current number of equations to process: 4430
% Current number of ordered equations: 0
% Current number of rules: 482
% New rule produced :
% [490] inverse(c) greatest_lower_bound multiply(b,multiply(a,b)) -> inverse(c)
% Current number of equations to process: 4429
% Current number of ordered equations: 0
% Current number of rules: 483
% New rule produced :
% [491] inverse(a) greatest_lower_bound multiply(c,multiply(a,b)) -> inverse(a)
% Current number of equations to process: 4428
% Current number of ordered equations: 0
% Current number of rules: 484
% New rule produced :
% [492] inverse(b) greatest_lower_bound multiply(c,multiply(a,b)) -> inverse(b)
% Current number of equations to process: 4427
% Current number of ordered equations: 0
% Current number of rules: 485
% New rule produced :
% [493] inverse(c) greatest_lower_bound multiply(c,multiply(a,b)) -> inverse(c)
% Current number of equations to process: 4426
% Current number of ordered equations: 0
% Current number of rules: 486
% New rule produced :
% [494] inverse(a) greatest_lower_bound multiply(a,multiply(a,c)) -> inverse(a)
% Current number of equations to process: 4425
% Current number of ordered equations: 0
% Current number of rules: 487
% New rule produced :
% [495] inverse(b) greatest_lower_bound multiply(a,multiply(a,c)) -> inverse(b)
% Current number of equations to process: 4424
% Current number of ordered equations: 0
% Current number of rules: 488
% New rule produced :
% [496] inverse(c) greatest_lower_bound multiply(a,multiply(a,c)) -> inverse(c)
% Current number of equations to process: 4423
% Current number of ordered equations: 0
% Current number of rules: 489
% New rule produced :
% [497] inverse(a) greatest_lower_bound multiply(b,multiply(a,c)) -> inverse(a)
% Current number of equations to process: 4422
% Current number of ordered equations: 0
% Current number of rules: 490
% New rule produced :
% [498] inverse(b) greatest_lower_bound multiply(b,multiply(a,c)) -> inverse(b)
% Current number of equations to process: 4421
% Current number of ordered equations: 0
% Current number of rules: 491
% New rule produced :
% [499] inverse(c) greatest_lower_bound multiply(b,multiply(a,c)) -> inverse(c)
% Current number of equations to process: 4420
% Current number of ordered equations: 0
% Current number of rules: 492
% New rule produced :
% [500] inverse(a) greatest_lower_bound multiply(c,multiply(a,c)) -> inverse(a)
% Current number of equations to process: 4419
% Current number of ordered equations: 0
% Current number of rules: 493
% New rule produced :
% [501] inverse(b) greatest_lower_bound multiply(c,multiply(a,c)) -> inverse(b)
% Current number of equations to process: 4418
% Current number of ordered equations: 0
% Current number of rules: 494
% New rule produced :
% [502] inverse(c) greatest_lower_bound multiply(c,multiply(a,c)) -> inverse(c)
% Current number of equations to process: 4417
% Current number of ordered equations: 0
% Current number of rules: 495
% New rule produced :
% [503] inverse(a) greatest_lower_bound multiply(a,multiply(b,a)) -> inverse(a)
% Current number of equations to process: 4560
% Current number of ordered equations: 0
% Current number of rules: 496
% New rule produced :
% [504] inverse(b) greatest_lower_bound multiply(a,multiply(b,a)) -> inverse(b)
% Current number of equations to process: 4559
% Current number of ordered equations: 0
% Current number of rules: 497
% New rule produced :
% [505] inverse(c) greatest_lower_bound multiply(a,multiply(b,a)) -> inverse(c)
% Current number of equations to process: 4558
% Current number of ordered equations: 0
% Current number of rules: 498
% New rule produced :
% [506] inverse(a) greatest_lower_bound multiply(b,multiply(b,a)) -> inverse(a)
% Current number of equations to process: 4557
% Current number of ordered equations: 0
% Current number of rules: 499
% New rule produced :
% [507] inverse(b) greatest_lower_bound multiply(b,multiply(b,a)) -> inverse(b)
% Current number of equations to process: 4556
% Current number of ordered equations: 0
% Current number of rules: 500
% New rule produced :
% [508] inverse(c) greatest_lower_bound multiply(b,multiply(b,a)) -> inverse(c)
% Current number of equations to process: 4555
% Current number of ordered equations: 0
% Current number of rules: 501
% New rule produced :
% [509] inverse(a) greatest_lower_bound multiply(c,multiply(b,a)) -> inverse(a)
% Current number of equations to process: 4554
% Current number of ordered equations: 0
% Current number of rules: 502
% New rule produced :
% [510] inverse(b) greatest_lower_bound multiply(c,multiply(b,a)) -> inverse(b)
% Current number of equations to process: 4553
% Current number of ordered equations: 0
% Current number of rules: 503
% New rule produced :
% [511] inverse(c) greatest_lower_bound multiply(c,multiply(b,a)) -> inverse(c)
% Current number of equations to process: 4552
% Current number of ordered equations: 0
% Current number of rules: 504
% New rule produced :
% [512] inverse(a) greatest_lower_bound multiply(a,multiply(b,b)) -> inverse(a)
% Current number of equations to process: 4551
% Current number of ordered equations: 0
% Current number of rules: 505
% New rule produced :
% [513] inverse(b) greatest_lower_bound multiply(a,multiply(b,b)) -> inverse(b)
% Current number of equations to process: 4550
% Current number of ordered equations: 0
% Current number of rules: 506
% New rule produced :
% [514] inverse(c) greatest_lower_bound multiply(a,multiply(b,b)) -> inverse(c)
% Current number of equations to process: 4549
% Current number of ordered equations: 0
% Current number of rules: 507
% New rule produced :
% [515] inverse(a) greatest_lower_bound multiply(b,multiply(b,b)) -> inverse(a)
% Current number of equations to process: 4548
% Current number of ordered equations: 0
% Current number of rules: 508
% New rule produced :
% [516] inverse(b) greatest_lower_bound multiply(b,multiply(b,b)) -> inverse(b)
% Current number of equations to process: 4547
% Current number of ordered equations: 0
% Current number of rules: 509
% New rule produced :
% [517] inverse(c) greatest_lower_bound multiply(b,multiply(b,b)) -> inverse(c)
% Current number of equations to process: 4546
% Current number of ordered equations: 0
% Current number of rules: 510
% New rule produced :
% [518] inverse(a) greatest_lower_bound multiply(c,multiply(b,b)) -> inverse(a)
% Current number of equations to process: 4545
% Current number of ordered equations: 0
% Current number of rules: 511
% New rule produced :
% [519] inverse(b) greatest_lower_bound multiply(c,multiply(b,b)) -> inverse(b)
% Current number of equations to process: 4544
% Current number of ordered equations: 0
% Current number of rules: 512
% New rule produced :
% [520] inverse(c) greatest_lower_bound multiply(c,multiply(b,b)) -> inverse(c)
% Current number of equations to process: 4543
% Current number of ordered equations: 0
% Current number of rules: 513
% New rule produced :
% [521] inverse(a) greatest_lower_bound multiply(a,multiply(b,c)) -> inverse(a)
% Current number of equations to process: 4542
% Current number of ordered equations: 0
% Current number of rules: 514
% New rule produced :
% [522] inverse(b) greatest_lower_bound multiply(a,multiply(b,c)) -> inverse(b)
% Current number of equations to process: 4541
% Current number of ordered equations: 0
% Current number of rules: 515
% New rule produced :
% [523] inverse(c) greatest_lower_bound multiply(a,multiply(b,c)) -> inverse(c)
% Current number of equations to process: 4540
% Current number of ordered equations: 0
% Current number of rules: 516
% New rule produced :
% [524] inverse(a) greatest_lower_bound multiply(b,multiply(b,c)) -> inverse(a)
% Current number of equations to process: 4539
% Current number of ordered equations: 0
% Current number of rules: 517
% New rule produced :
% [525] inverse(b) greatest_lower_bound multiply(b,multiply(b,c)) -> inverse(b)
% Current number of equations to process: 4538
% Current number of ordered equations: 0
% Current number of rules: 518
% New rule produced :
% [526] inverse(c) greatest_lower_bound multiply(b,multiply(b,c)) -> inverse(c)
% Current number of equations to process: 4537
% Current number of ordered equations: 0
% Current number of rules: 519
% New rule produced : [527] multiply(inverse(multiply(X,Y)),X) -> inverse(Y)
% Current number of equations to process: 4675
% Current number of ordered equations: 0
% Current number of rules: 520
% New rule produced :
% [528] inverse(multiply(Y,X)) -> multiply(inverse(X),inverse(Y))
% Rule
% [289]
% identity greatest_lower_bound inverse(multiply(a,a)) ->
% inverse(multiply(a,a)) collapsed.
% Rule
% [290]
% identity greatest_lower_bound inverse(multiply(a,b)) ->
% inverse(multiply(a,b)) collapsed.
% Rule
% [291]
% identity greatest_lower_bound inverse(multiply(a,c)) ->
% inverse(multiply(a,c)) collapsed.
% Rule
% [292]
% identity greatest_lower_bound inverse(multiply(b,a)) ->
% inverse(multiply(b,a)) collapsed.
% Rule
% [293]
% identity greatest_lower_bound inverse(multiply(b,b)) ->
% inverse(multiply(b,b)) collapsed.
% Rule
% [294]
% identity greatest_lower_bound inverse(multiply(b,c)) ->
% inverse(multiply(b,c)) collapsed.
% Rule
% [295]
% identity greatest_lower_bound inverse(multiply(c,a)) ->
% inverse(multiply(c,a)) collapsed.
% Rule
% [296]
% identity greatest_lower_bound inverse(multiply(c,b)) ->
% inverse(multiply(c,b)) collapsed.
% Rule
% [297]
% identity greatest_lower_bound inverse(multiply(c,c)) ->
% inverse(multiply(c,c)) collapsed.
% Rule [340] multiply(Y,inverse(multiply(X,Y))) -> inverse(X) collapsed.
% Rule [341] identity least_upper_bound inverse(multiply(a,a)) -> identity
% collapsed.
% Rule
% [342]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [343] a least_upper_bound inverse(multiply(a,a)) -> a collapsed.
% Rule [344] b least_upper_bound inverse(multiply(a,a)) -> b collapsed.
% Rule [345] c least_upper_bound inverse(multiply(a,a)) -> c collapsed.
% Rule
% [346] a greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% collapsed.
% Rule
% [347] b greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% collapsed.
% Rule
% [348] c greatest_lower_bound inverse(multiply(a,a)) -> inverse(multiply(a,a))
% collapsed.
% Rule [349] inverse(a) least_upper_bound inverse(multiply(a,a)) -> inverse(a)
% collapsed.
% Rule [350] identity least_upper_bound inverse(multiply(a,b)) -> identity
% collapsed.
% Rule
% [351]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [352]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [353]
% (inverse(multiply(a,a)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [354]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [355] a least_upper_bound inverse(multiply(a,b)) -> a collapsed.
% Rule [356] b least_upper_bound inverse(multiply(a,b)) -> b collapsed.
% Rule [357] c least_upper_bound inverse(multiply(a,b)) -> c collapsed.
% Rule
% [358] a greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% collapsed.
% Rule
% [359] b greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% collapsed.
% Rule
% [360] c greatest_lower_bound inverse(multiply(a,b)) -> inverse(multiply(a,b))
% collapsed.
% Rule [361] inverse(a) least_upper_bound inverse(multiply(a,b)) -> inverse(a)
% collapsed.
% Rule [362] identity least_upper_bound inverse(multiply(a,c)) -> identity
% collapsed.
% Rule
% [363]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [364]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [365]
% (inverse(multiply(a,b)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [366]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [367] a least_upper_bound inverse(multiply(a,c)) -> a collapsed.
% Rule [368] b least_upper_bound inverse(multiply(a,c)) -> b collapsed.
% Rule [369] c least_upper_bound inverse(multiply(a,c)) -> c collapsed.
% Rule
% [370] a greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% collapsed.
% Rule
% [371] b greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% collapsed.
% Rule
% [372] c greatest_lower_bound inverse(multiply(a,c)) -> inverse(multiply(a,c))
% collapsed.
% Rule [373] inverse(a) least_upper_bound inverse(multiply(a,c)) -> inverse(a)
% collapsed.
% Rule [374] identity least_upper_bound inverse(multiply(b,a)) -> identity
% collapsed.
% Rule
% [375]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [376]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [377]
% (inverse(multiply(a,c)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [378]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [379] a least_upper_bound inverse(multiply(b,a)) -> a collapsed.
% Rule [380] b least_upper_bound inverse(multiply(b,a)) -> b collapsed.
% Rule [381] c least_upper_bound inverse(multiply(b,a)) -> c collapsed.
% Rule
% [382] a greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% collapsed.
% Rule
% [383] b greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% collapsed.
% Rule
% [384] c greatest_lower_bound inverse(multiply(b,a)) -> inverse(multiply(b,a))
% collapsed.
% Rule [385] inverse(b) least_upper_bound inverse(multiply(b,a)) -> inverse(b)
% collapsed.
% Rule [386] identity least_upper_bound inverse(multiply(b,b)) -> identity
% collapsed.
% Rule
% [387]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [388]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [389]
% (inverse(multiply(b,a)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [390]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [391] a least_upper_bound inverse(multiply(b,b)) -> a collapsed.
% Rule [392] b least_upper_bound inverse(multiply(b,b)) -> b collapsed.
% Rule [393] c least_upper_bound inverse(multiply(b,b)) -> c collapsed.
% Rule
% [394] a greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% collapsed.
% Rule
% [395] b greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% collapsed.
% Rule
% [396] c greatest_lower_bound inverse(multiply(b,b)) -> inverse(multiply(b,b))
% collapsed.
% Rule [397] inverse(b) least_upper_bound inverse(multiply(b,b)) -> inverse(b)
% collapsed.
% Rule [398] identity least_upper_bound inverse(multiply(b,c)) -> identity
% collapsed.
% Rule
% [399]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [400]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [401]
% (inverse(multiply(b,b)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [402]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [403] a least_upper_bound inverse(multiply(b,c)) -> a collapsed.
% Rule [404] b least_upper_bound inverse(multiply(b,c)) -> b collapsed.
% Rule [405] c least_upper_bound inverse(multiply(b,c)) -> c collapsed.
% Rule
% [406] a greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% collapsed.
% Rule
% [407] b greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% collapsed.
% Rule
% [408] c greatest_lower_bound inverse(multiply(b,c)) -> inverse(multiply(b,c))
% collapsed.
% Rule [409] inverse(b) least_upper_bound inverse(multiply(b,c)) -> inverse(b)
% collapsed.
% Rule [410] identity least_upper_bound inverse(multiply(c,a)) -> identity
% collapsed.
% Rule
% [411]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [412]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [413]
% (inverse(multiply(b,c)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [414]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [415] a least_upper_bound inverse(multiply(c,a)) -> a collapsed.
% Rule [416] b least_upper_bound inverse(multiply(c,a)) -> b collapsed.
% Rule [417] c least_upper_bound inverse(multiply(c,a)) -> c collapsed.
% Rule
% [418] a greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% collapsed.
% Rule
% [419] b greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% collapsed.
% Rule
% [420] c greatest_lower_bound inverse(multiply(c,a)) -> inverse(multiply(c,a))
% collapsed.
% Rule [421] inverse(c) least_upper_bound inverse(multiply(c,a)) -> inverse(c)
% collapsed.
% Rule [422] identity least_upper_bound inverse(multiply(c,b)) -> identity
% collapsed.
% Rule
% [423]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [424]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [425]
% (inverse(multiply(c,a)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [426]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [427] a least_upper_bound inverse(multiply(c,b)) -> a collapsed.
% Rule [428] b least_upper_bound inverse(multiply(c,b)) -> b collapsed.
% Rule [429] c least_upper_bound inverse(multiply(c,b)) -> c collapsed.
% Rule
% [430] a greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% collapsed.
% Rule
% [431] b greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% collapsed.
% Rule
% [432] c greatest_lower_bound inverse(multiply(c,b)) -> inverse(multiply(c,b))
% collapsed.
% Rule [433] inverse(c) least_upper_bound inverse(multiply(c,b)) -> inverse(c)
% collapsed.
% Rule [434] identity least_upper_bound inverse(multiply(c,c)) -> identity
% collapsed.
% Rule
% [435]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [436]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [437]
% (inverse(multiply(c,b)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule
% [438]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound identity ->
% identity collapsed.
% Rule [439] a least_upper_bound inverse(multiply(c,c)) -> a collapsed.
% Rule [440] b least_upper_bound inverse(multiply(c,c)) -> b collapsed.
% Rule [441] c least_upper_bound inverse(multiply(c,c)) -> c collapsed.
% Rule
% [442] a greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% collapsed.
% Rule
% [443] b greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% collapsed.
% Rule
% [444] c greatest_lower_bound inverse(multiply(c,c)) -> inverse(multiply(c,c))
% collapsed.
% Rule [445] inverse(c) least_upper_bound inverse(multiply(c,c)) -> inverse(c)
% collapsed.
% Rule
% [446]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound a -> a
% collapsed.
% Rule
% [447]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound b -> b
% collapsed.
% Rule
% [448]
% (inverse(multiply(c,c)) greatest_lower_bound X) least_upper_bound c -> c
% collapsed.
% Rule [527] multiply(inverse(multiply(X,Y)),X) -> inverse(Y) collapsed.
% Current number of equations to process: 4754
% Current number of ordered equations: 0
% Current number of rules: 402
% New rule produced :
% [529] inverse(a) greatest_lower_bound multiply(c,multiply(b,c)) -> inverse(a)
% Current number of equations to process: 4761
% Current number of ordered equations: 0
% Current number of rules: 403
% New rule produced :
% [530] inverse(b) greatest_lower_bound multiply(c,multiply(b,c)) -> inverse(b)
% Current number of equations to process: 4760
% Current number of ordered equations: 0
% Current number of rules: 404
% New rule produced :
% [531] inverse(c) greatest_lower_bound multiply(c,multiply(b,c)) -> inverse(c)
% Current number of equations to process: 4759
% Current number of ordered equations: 0
% Current number of rules: 405
% New rule produced :
% [532]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(a) -> inverse(a)
% Current number of equations to process: 4749
% Current number of ordered equations: 0
% Current number of rules: 406
% New rule produced :
% [533]
% ((c greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(a) -> inverse(a)
% Current number of equations to process: 4748
% Current number of ordered equations: 0
% Current number of rules: 407
% New rule produced :
% [534]
% ((c greatest_lower_bound b) least_upper_bound X) greatest_lower_bound 
% inverse(a) -> inverse(a)
% Current number of equations to process: 4747
% Current number of ordered equations: 0
% Current number of rules: 408
% New rule produced :
% [535]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(b) -> inverse(b)
% Current number of equations to process: 4737
% Current number of ordered equations: 0
% Current number of rules: 409
% New rule produced :
% [536]
% ((c greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(b) -> inverse(b)
% Current number of equations to process: 4736
% Current number of ordered equations: 0
% Current number of rules: 410
% New rule produced :
% [537]
% ((c greatest_lower_bound b) least_upper_bound X) greatest_lower_bound 
% inverse(b) -> inverse(b)
% Current number of equations to process: 4735
% Current number of ordered equations: 0
% Current number of rules: 411
% New rule produced :
% [538]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(c) -> inverse(c)
% Current number of equations to process: 4725
% Current number of ordered equations: 0
% Current number of rules: 412
% New rule produced :
% [539]
% ((c greatest_lower_bound a) least_upper_bound X) greatest_lower_bound 
% inverse(c) -> inverse(c)
% Current number of equations to process: 4724
% Current number of ordered equations: 0
% Current number of rules: 413
% New rule produced :
% [540]
% ((c greatest_lower_bound b) least_upper_bound X) greatest_lower_bound 
% inverse(c) -> inverse(c)
% Current number of equations to process: 4723
% Current number of ordered equations: 0
% Current number of rules: 414
% New rule produced :
% [541] inverse(a) greatest_lower_bound multiply(a,multiply(c,a)) -> inverse(a)
% Current number of equations to process: 4722
% Current number of ordered equations: 0
% Current number of rules: 415
% New rule produced :
% [542] inverse(b) greatest_lower_bound multiply(a,multiply(c,a)) -> inverse(b)
% Current number of equations to process: 4721
% Current number of ordered equations: 0
% Current number of rules: 416
% New rule produced :
% [543] inverse(c) greatest_lower_bound multiply(a,multiply(c,a)) -> inverse(c)
% Current number of equations to process: 4720
% Current number of ordered equations: 0
% Current number of rules: 417
% New rule produced :
% [544] inverse(a) greatest_lower_bound multiply(b,multiply(c,a)) -> inverse(a)
% Current number of equations to process: 4719
% Current number of ordered equations: 0
% Current number of rules: 418
% New rule produced :
% [545] inverse(b) greatest_lower_bound multiply(b,multiply(c,a)) -> inverse(b)
% Current number of equations to process: 4718
% Current number of ordered equations: 0
% Current number of rules: 419
% New rule produced :
% [546] inverse(c) greatest_lower_bound multiply(b,multiply(c,a)) -> inverse(c)
% Current number of equations to process: 4717
% Current number of ordered equations: 0
% Current number of rules: 420
% New rule produced :
% [547] inverse(a) greatest_lower_bound multiply(c,multiply(c,a)) -> inverse(a)
% Current number of equations to process: 4716
% Current number of ordered equations: 0
% Current number of rules: 421
% New rule produced :
% [548] inverse(b) greatest_lower_bound multiply(c,multiply(c,a)) -> inverse(b)
% Current number of equations to process: 4715
% Current number of ordered equations: 0
% Current number of rules: 422
% New rule produced :
% [549] inverse(c) greatest_lower_bound multiply(c,multiply(c,a)) -> inverse(c)
% Current number of equations to process: 4714
% Current number of ordered equations: 0
% Current number of rules: 423
% New rule produced :
% [550] inverse(a) greatest_lower_bound multiply(a,multiply(c,b)) -> inverse(a)
% Current number of equations to process: 4713
% Current number of ordered equations: 0
% Current number of rules: 424
% New rule produced :
% [551] inverse(b) greatest_lower_bound multiply(a,multiply(c,b)) -> inverse(b)
% Current number of equations to process: 4712
% Current number of ordered equations: 0
% Current number of rules: 425
% New rule produced :
% [552] inverse(c) greatest_lower_bound multiply(a,multiply(c,b)) -> inverse(c)
% Current number of equations to process: 4711
% Current number of ordered equations: 0
% Current number of rules: 426
% New rule produced :
% [553] inverse(a) greatest_lower_bound multiply(b,multiply(c,b)) -> inverse(a)
% Current number of equations to process: 4710
% Current number of ordered equations: 0
% Current number of rules: 427
% New rule produced :
% [554] inverse(b) greatest_lower_bound multiply(b,multiply(c,b)) -> inverse(b)
% Current number of equations to process: 4709
% Current number of ordered equations: 0
% Current number of rules: 428
% New rule produced :
% [555] inverse(c) greatest_lower_bound multiply(b,multiply(c,b)) -> inverse(c)
% Current number of equations to process: 4708
% Current number of ordered equations: 0
% Current number of rules: 429
% New rule produced :
% [556] inverse(a) greatest_lower_bound multiply(c,multiply(c,b)) -> inverse(a)
% Current number of equations to process: 4707
% Current number of ordered equations: 0
% Current number of rules: 430
% New rule produced :
% [557] inverse(b) greatest_lower_bound multiply(c,multiply(c,b)) -> inverse(b)
% Current number of equations to process: 4706
% Current number of ordered equations: 0
% Current number of rules: 431
% New rule produced :
% [558] inverse(c) greatest_lower_bound multiply(c,multiply(c,b)) -> inverse(c)
% Current number of equations to process: 4705
% Current number of ordered equations: 0
% Current number of rules: 432
% New rule produced :
% [559] inverse(a) greatest_lower_bound multiply(a,multiply(c,c)) -> inverse(a)
% Current number of equations to process: 4704
% Current number of ordered equations: 0
% Current number of rules: 433
% New rule produced :
% [560] inverse(b) greatest_lower_bound multiply(a,multiply(c,c)) -> inverse(b)
% Current number of equations to process: 4703
% Current number of ordered equations: 0
% Current number of rules: 434
% New rule produced :
% [561] inverse(c) greatest_lower_bound multiply(a,multiply(c,c)) -> inverse(c)
% Current number of equations to process: 4702
% Current number of ordered equations: 0
% Current number of rules: 435
% New rule produced :
% [562] inverse(a) greatest_lower_bound multiply(b,multiply(c,c)) -> inverse(a)
% Current number of equations to process: 4701
% Current number of ordered equations: 0
% Current number of rules: 436
% New rule produced :
% [563] inverse(b) greatest_lower_bound multiply(b,multiply(c,c)) -> inverse(b)
% Cputime limit exceeded (core dumped)
% 
% EOF
%------------------------------------------------------------------------------