TSTP Solution File: GRP181-4 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP181-4 : TPTP v6.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n056.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:33 EDT 2014
% Result : Timeout 300.01s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP181-4 : TPTP v6.0.0. Bugfixed v1.2.1.
% % Command : tptp2X_and_run_cime %s
% % Computer : n056.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:36:18 CDT 2014
% % CPUTime : 300.01
% Processing problem /tmp/CiME_51443_n056.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " least_upper_bound,greatest_lower_bound : AC; b,c,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);
% inverse(identity) = identity;
% inverse(inverse(X)) = X;
% inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X));
% a greatest_lower_bound c = b greatest_lower_bound c;
% a least_upper_bound c = b least_upper_bound c;
% inverse(X greatest_lower_bound Y) = inverse(X) least_upper_bound inverse(Y);
% inverse(X least_upper_bound Y) = inverse(X) greatest_lower_bound inverse(Y);
% ";
%
% let s1 = status F "
% b lr_lex;
% c 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 "
% multiply > inverse > greatest_lower_bound > least_upper_bound > identity > a > c > b";
%
% let s2 = status F "
% b mul;
% c mul;
% a mul;
% least_upper_bound mul;
% greatest_lower_bound mul;
% inverse mul;
% multiply mul;
% identity mul;
% ";
%
% let p2 = precedence F "
% multiply > inverse > greatest_lower_bound > least_upper_bound > identity = a = c = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " a = b;"
% ;
% (*
% 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),
% inverse(identity) = identity,
% inverse(inverse(X)) = X,
% inverse(multiply(X,Y)) =
% multiply(inverse(Y),inverse(X)),
% c greatest_lower_bound a =
% b greatest_lower_bound c,
% c least_upper_bound a = b least_upper_bound c,
% inverse(X greatest_lower_bound Y) =
% inverse(X) least_upper_bound inverse(Y),
% inverse(X least_upper_bound Y) =
% inverse(X) greatest_lower_bound inverse(Y) }
% (18 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 = b } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] inverse(identity) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 17
% Current number of rules: 1
% New rule produced : [2] inverse(inverse(X)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 16
% Current number of rules: 2
% New rule produced : [3] X least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 15
% Current number of rules: 3
% New rule produced : [4] X greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 14
% Current number of rules: 4
% New rule produced : [5] multiply(identity,X) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 13
% Current number of rules: 5
% New rule produced : [6] c least_upper_bound a -> b least_upper_bound c
% Current number of equations to process: 0
% Current number of ordered equations: 12
% Current number of rules: 6
% New rule produced : [7] c greatest_lower_bound a -> b greatest_lower_bound c
% Current number of equations to process: 0
% Current number of ordered equations: 11
% Current number of rules: 7
% New rule produced : [8] multiply(inverse(X),X) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 10
% Current number of rules: 8
% New rule produced : [9] (X greatest_lower_bound Y) least_upper_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 9
% Current number of rules: 9
% New rule produced : [10] (X least_upper_bound Y) greatest_lower_bound X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 10
% New rule produced :
% [11] inverse(multiply(X,Y)) -> multiply(inverse(Y),inverse(X))
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 11
% New rule produced :
% [12]
% inverse(X greatest_lower_bound Y) -> inverse(X) least_upper_bound inverse(Y)
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 12
% New rule produced :
% [13]
% inverse(X least_upper_bound Y) -> inverse(X) greatest_lower_bound inverse(Y)
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 13
% New rule produced :
% [14] 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: 14
% New rule produced :
% [15]
% 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: 15
% New rule produced :
% [16]
% multiply(X,Y greatest_lower_bound Z) ->
% multiply(X,Y) greatest_lower_bound multiply(X,Z)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 16
% New rule produced :
% [17]
% 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: 17
% New rule produced :
% [18]
% multiply(Y greatest_lower_bound Z,X) ->
% multiply(Y,X) greatest_lower_bound multiply(Z,X)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced : [19] multiply(X,inverse(X)) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced : [20] (b greatest_lower_bound c) least_upper_bound a -> a
% Current number of equations to process: 69
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [21] (b least_upper_bound c) greatest_lower_bound a -> a
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced : [22] multiply(inverse(X),identity) -> inverse(X)
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [23] multiply(inverse(Y),multiply(Y,X)) -> X
% Current number of equations to process: 76
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound a -> a
% Current number of equations to process: 75
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25] (b least_upper_bound c least_upper_bound X) greatest_lower_bound a -> a
% Current number of equations to process: 74
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26]
% inverse(c) least_upper_bound inverse(a) ->
% inverse(b) least_upper_bound inverse(c)
% Current number of equations to process: 73
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% inverse(c) greatest_lower_bound inverse(a) ->
% inverse(b) greatest_lower_bound inverse(c)
% Current number of equations to process: 72
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28]
% (a greatest_lower_bound X) least_upper_bound b least_upper_bound c ->
% b least_upper_bound c
% Current number of equations to process: 71
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29]
% (a least_upper_bound X) greatest_lower_bound b greatest_lower_bound c ->
% b greatest_lower_bound c
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced : [30] multiply(Y,multiply(inverse(Y),X)) -> X
% Current number of equations to process: 84
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [31] multiply(X,identity) -> X
% Rule [22] multiply(inverse(X),identity) -> inverse(X) collapsed.
% Current number of equations to process: 114
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [32]
% (inverse(b) least_upper_bound inverse(c)) greatest_lower_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 259
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [33]
% (inverse(b) greatest_lower_bound inverse(c)) least_upper_bound inverse(a) ->
% inverse(a)
% Current number of equations to process: 268
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [34]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound (a greatest_lower_bound X)
% -> a greatest_lower_bound X
% Current number of equations to process: 284
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [35]
% (b greatest_lower_bound c) least_upper_bound (b greatest_lower_bound a) ->
% b greatest_lower_bound a
% Current number of equations to process: 327
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [36]
% (b least_upper_bound c least_upper_bound X) greatest_lower_bound (a least_upper_bound X)
% -> a least_upper_bound X
% Current number of equations to process: 353
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [37]
% (b least_upper_bound c) greatest_lower_bound (b least_upper_bound a) ->
% b least_upper_bound a
% Current number of equations to process: 396
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [38]
% multiply(X,c) least_upper_bound multiply(X,a) ->
% multiply(X,b) least_upper_bound multiply(X,c)
% Current number of equations to process: 423
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [39]
% identity least_upper_bound multiply(inverse(c),a) ->
% identity least_upper_bound multiply(inverse(c),b)
% Current number of equations to process: 443
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [40]
% identity greatest_lower_bound multiply(inverse(a),c) ->
% identity greatest_lower_bound multiply(inverse(b),c)
% Current number of equations to process: 464
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [41]
% multiply(X,c) greatest_lower_bound multiply(X,a) ->
% multiply(X,b) greatest_lower_bound multiply(X,c)
% Current number of equations to process: 487
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [42]
% identity greatest_lower_bound multiply(inverse(c),a) ->
% identity greatest_lower_bound multiply(inverse(c),b)
% Current number of equations to process: 507
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [43]
% identity least_upper_bound multiply(inverse(a),c) ->
% identity least_upper_bound multiply(inverse(b),c)
% Current number of equations to process: 528
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [44]
% multiply(c,X) least_upper_bound multiply(a,X) ->
% multiply(b,X) least_upper_bound multiply(c,X)
% Current number of equations to process: 551
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [45]
% identity least_upper_bound multiply(a,inverse(c)) ->
% identity least_upper_bound multiply(b,inverse(c))
% Current number of equations to process: 574
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [46]
% identity greatest_lower_bound multiply(c,inverse(a)) ->
% identity greatest_lower_bound multiply(c,inverse(b))
% Current number of equations to process: 598
% Current number of ordered equations: 0
% Current number of rules: 45
% New rule produced :
% [47]
% multiply(c,X) greatest_lower_bound multiply(a,X) ->
% multiply(b,X) greatest_lower_bound multiply(c,X)
% Current number of equations to process: 621
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [48]
% identity greatest_lower_bound multiply(a,inverse(c)) ->
% identity greatest_lower_bound multiply(b,inverse(c))
% Current number of equations to process: 644
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [49]
% identity least_upper_bound multiply(c,inverse(a)) ->
% identity least_upper_bound multiply(c,inverse(b))
% Current number of equations to process: 668
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [50]
% (b greatest_lower_bound c greatest_lower_bound X) least_upper_bound (b greatest_lower_bound a)
% -> b greatest_lower_bound a
% Current number of equations to process: 691
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [51]
% ((b greatest_lower_bound a) least_upper_bound X) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 707
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [52]
% ((b least_upper_bound a) greatest_lower_bound X) least_upper_bound b least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 749
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [53]
% (b least_upper_bound c least_upper_bound X) greatest_lower_bound (b least_upper_bound a)
% -> b least_upper_bound a
% Current number of equations to process: 793
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [54]
% (inverse(b) least_upper_bound inverse(c) least_upper_bound X) greatest_lower_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 807
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [55]
% (inverse(b) greatest_lower_bound inverse(c) greatest_lower_bound X) least_upper_bound
% inverse(a) -> inverse(a)
% Current number of equations to process: 820
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [56]
% ((X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound (X greatest_lower_bound Z)
% -> (X least_upper_bound Y) greatest_lower_bound Z
% Current number of equations to process: 828
% Current number of ordered equations: 1
% Current number of rules: 55
% New rule produced :
% [57]
% ((X greatest_lower_bound Y) least_upper_bound Z) greatest_lower_bound
% (X least_upper_bound Z) -> (X greatest_lower_bound Y) least_upper_bound Z
% Current number of equations to process: 840
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [58]
% ((b greatest_lower_bound c) least_upper_bound X) greatest_lower_bound
% (a least_upper_bound X) -> (b greatest_lower_bound c) least_upper_bound X
% Current number of equations to process: 1970
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [59]
% ((b least_upper_bound c) greatest_lower_bound X) least_upper_bound (a greatest_lower_bound X)
% -> (b least_upper_bound c) greatest_lower_bound X
% Current number of equations to process: 2033
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced :
% [60]
% ((a greatest_lower_bound X) least_upper_bound b) greatest_lower_bound
% (b least_upper_bound c) -> (a greatest_lower_bound X) least_upper_bound b
% Current number of equations to process: 2095
% Current number of ordered equations: 1
% Current number of rules: 59
% New rule produced :
% [61]
% ((a greatest_lower_bound X) least_upper_bound c) greatest_lower_bound
% (b least_upper_bound c) -> (a greatest_lower_bound X) least_upper_bound c
% Current number of equations to process: 2095
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [62]
% ((a least_upper_bound X) greatest_lower_bound c) least_upper_bound (b greatest_lower_bound c)
% -> (a least_upper_bound X) greatest_lower_bound c
% Current number of equations to process: 2179
% Current number of ordered equations: 1
% Current number of rules: 61
% New rule produced :
% [63]
% ((a least_upper_bound X) greatest_lower_bound b) least_upper_bound (b greatest_lower_bound c)
% -> (a least_upper_bound X) greatest_lower_bound b
% Current number of equations to process: 2179
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [64]
% ((b least_upper_bound X) greatest_lower_bound a) least_upper_bound (b greatest_lower_bound c)
% -> (b least_upper_bound X) greatest_lower_bound a
% Current number of equations to process: 2264
% Current number of ordered equations: 1
% Current number of rules: 63
% New rule produced :
% [65]
% ((c least_upper_bound X) greatest_lower_bound a) least_upper_bound (b greatest_lower_bound c)
% -> (c least_upper_bound X) greatest_lower_bound a
% Current number of equations to process: 2264
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [66]
% ((b greatest_lower_bound X) least_upper_bound a) greatest_lower_bound
% (b least_upper_bound c) -> (b greatest_lower_bound X) least_upper_bound a
% Current number of equations to process: 2352
% Current number of ordered equations: 1
% Current number of rules: 65
% New rule produced :
% [67]
% ((c greatest_lower_bound X) least_upper_bound a) greatest_lower_bound
% (b least_upper_bound c) -> (c greatest_lower_bound X) least_upper_bound a
% Current number of equations to process: 2352
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [68]
% multiply(inverse(a),b) least_upper_bound multiply(inverse(a),c) ->
% identity least_upper_bound multiply(inverse(b),c)
% Current number of equations to process: 2424
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [69]
% multiply(X,multiply(inverse(c),a)) least_upper_bound X ->
% multiply(X,multiply(inverse(c),b)) least_upper_bound X
% Current number of equations to process: 2491
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [70]
% multiply(inverse(c),multiply(a,X)) least_upper_bound X ->
% multiply(inverse(c),multiply(b,X)) least_upper_bound X
% Current number of equations to process: 2552
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [71]
% multiply(X,multiply(inverse(a),c)) greatest_lower_bound X ->
% multiply(X,multiply(inverse(b),c)) greatest_lower_bound X
% Current number of equations to process: 2629
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [72]
% a greatest_lower_bound multiply(a,multiply(inverse(b),c)) ->
% b greatest_lower_bound c
% Current number of equations to process: 2653
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [73]
% b greatest_lower_bound c greatest_lower_bound multiply(a,multiply(inverse(b),c))
% -> b greatest_lower_bound c
% Current number of equations to process: 2743
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced :
% [74]
% multiply(inverse(a),multiply(c,X)) greatest_lower_bound X ->
% multiply(inverse(b),multiply(c,X)) greatest_lower_bound X
% Current number of equations to process: 2848
% Current number of ordered equations: 0
% Current number of rules: 73
% New rule produced :
% [75]
% multiply(inverse(a),b) greatest_lower_bound multiply(inverse(a),c) ->
% identity greatest_lower_bound multiply(inverse(b),c)
% Current number of equations to process: 2924
% Current number of ordered equations: 0
% Current number of rules: 74
% New rule produced :
% [76]
% multiply(X,multiply(inverse(c),a)) greatest_lower_bound X ->
% multiply(X,multiply(inverse(c),b)) greatest_lower_bound X
% Current number of equations to process: 2995
% Current number of ordered equations: 0
% Current number of rules: 75
% New rule produced :
% [77]
% multiply(inverse(c),multiply(a,X)) greatest_lower_bound X ->
% multiply(inverse(c),multiply(b,X)) greatest_lower_bound X
% Current number of equations to process: 3060
% Current number of ordered equations: 0
% Current number of rules: 76
% New rule produced :
% [78]
% multiply(X,multiply(inverse(a),c)) least_upper_bound X ->
% multiply(X,multiply(inverse(b),c)) least_upper_bound X
% Current number of equations to process: 3143
% Current number of ordered equations: 0
% Current number of rules: 77
% New rule produced :
% [79]
% a least_upper_bound multiply(a,multiply(inverse(b),c)) ->
% b least_upper_bound c
% Current number of equations to process: 3167
% Current number of ordered equations: 0
% Current number of rules: 78
% New rule produced :
% [80]
% b least_upper_bound c least_upper_bound multiply(a,multiply(inverse(b),c)) ->
% b least_upper_bound c
% Current number of equations to process: 3265
% Current number of ordered equations: 0
% Current number of rules: 79
% New rule produced :
% [81]
% multiply(inverse(a),multiply(c,X)) least_upper_bound X ->
% multiply(inverse(b),multiply(c,X)) least_upper_bound X
% Current number of equations to process: 3379
% Current number of ordered equations: 0
% Current number of rules: 80
% New rule produced :
% [82]
% multiply(b,inverse(a)) least_upper_bound multiply(c,inverse(a)) ->
% identity least_upper_bound multiply(c,inverse(b))
% Current number of equations to process: 3461
% Current number of ordered equations: 0
% Current number of rules: 81
% New rule produced :
% [83]
% multiply(a,multiply(inverse(c),X)) least_upper_bound X ->
% multiply(b,multiply(inverse(c),X)) least_upper_bound X
% Current number of equations to process: 3536
% Current number of ordered equations: 0
% Current number of rules: 82
% New rule produced :
% [84]
% multiply(X,multiply(a,inverse(c))) least_upper_bound X ->
% multiply(X,multiply(b,inverse(c))) least_upper_bound X
% Current number of equations to process: 3629
% Current number of ordered equations: 0
% Current number of rules: 83
% New rule produced :
% [85]
% multiply(X,multiply(c,inverse(a))) greatest_lower_bound X ->
% multiply(X,multiply(c,inverse(b))) greatest_lower_bound X
% Current number of equations to process: 3705
% Current number of ordered equations: 0
% Current number of rules: 84
% New rule produced :
% [86]
% multiply(c,multiply(inverse(a),X)) greatest_lower_bound X ->
% multiply(c,multiply(inverse(b),X)) greatest_lower_bound X
% Current number of equations to process: 3781
% Current number of ordered equations: 0
% Current number of rules: 85
% New rule produced :
% [87]
% a greatest_lower_bound multiply(c,multiply(inverse(b),a)) ->
% b greatest_lower_bound c
% Current number of equations to process: 3796
% Current number of ordered equations: 0
% Current number of rules: 86
% New rule produced :
% [88]
% b greatest_lower_bound c greatest_lower_bound multiply(c,multiply(inverse(b),a))
% -> b greatest_lower_bound c
% Current number of equations to process: 3936
% Current number of ordered equations: 0
% Current number of rules: 87
% New rule produced :
% [89]
% b greatest_lower_bound c greatest_lower_bound multiply(a,multiply(inverse(b),a))
% -> b greatest_lower_bound c
% Current number of equations to process: 4042
% Current number of ordered equations: 0
% Current number of rules: 88
% New rule produced :
% [90]
% multiply(b,inverse(a)) greatest_lower_bound multiply(c,inverse(a)) ->
% identity greatest_lower_bound multiply(c,inverse(b))
% Current number of equations to process: 4167
% Current number of ordered equations: 0
% Current number of rules: 89
% New rule produced :
% [91]
% multiply(a,multiply(inverse(c),X)) greatest_lower_bound X ->
% multiply(b,multiply(inverse(c),X)) greatest_lower_bound X
% Current number of equations to process: 4246
% Current number of ordered equations: 0
% Current number of rules: 90
% New rule produced :
% [92]
% multiply(X,multiply(a,inverse(c))) greatest_lower_bound X ->
% multiply(X,multiply(b,inverse(c))) greatest_lower_bound X
% Current number of equations to process: 4346
% Current number of ordered equations: 0
% Current number of rules: 91
% New rule produced :
% [93]
% multiply(X,multiply(c,inverse(a))) least_upper_bound X ->
% multiply(X,multiply(c,inverse(b))) least_upper_bound X
% Current number of equations to process: 4424
% Current number of ordered equations: 0
% Current number of rules: 92
% New rule produced :
% [94]
% multiply(c,multiply(inverse(a),X)) least_upper_bound X ->
% multiply(c,multiply(inverse(b),X)) least_upper_bound X
% Current number of equations to process: 4502
% Current number of ordered equations: 0
% Current number of rules: 93
% New rule produced :
% [95]
% a least_upper_bound multiply(c,multiply(inverse(b),a)) ->
% b least_upper_bound c
% Current number of equations to process: 4517
% Current number of ordered equations: 0
% Current number of rules: 94
% New rule produced :
% [96]
% b least_upper_bound c least_upper_bound multiply(c,multiply(inverse(b),a)) ->
% b least_upper_bound c
% Current number of equations to process: 4668
% Current number of ordered equations: 0
% Current number of rules: 95
% New rule produced :
% [97]
% b least_upper_bound c least_upper_bound multiply(a,multiply(inverse(b),a)) ->
% b least_upper_bound c
% Current number of equations to process: 4779
% Current number of ordered equations: 0
% Current number of rules: 96
% New rule produced :
% [98]
% multiply(inverse(b),a) greatest_lower_bound multiply(inverse(c),a) ->
% identity greatest_lower_bound multiply(inverse(c),b)
% Current number of equations to process: 4908
% Current number of ordered equations: 0
% Current number of rules: 97
% New rule produced :
% [99]
% multiply(inverse(b),a) least_upper_bound multiply(inverse(c),a) ->
% identity least_upper_bound multiply(inverse(c),b)
% Current number of equations to process: 4986
% Current number of ordered equations: 0
% Current number of rules: 98
% New rule produced :
% [100]
% multiply(a,inverse(b)) greatest_lower_bound multiply(a,inverse(c)) ->
% identity greatest_lower_bound multiply(b,inverse(c))
% Current number of equations to process: 2524
% Current number of ordered equations: 0
% Current number of rules: 99
% New rule produced :
% [101]
% a least_upper_bound multiply(b,multiply(inverse(c),a)) ->
% a least_upper_bound multiply(a,multiply(inverse(c),b))
% Current number of equations to process: 2600
% Current number of ordered equations: 0
% Current number of rules: 100
% New rule produced :
% [102]
% multiply(a,inverse(b)) least_upper_bound multiply(a,inverse(c)) ->
% identity least_upper_bound multiply(b,inverse(c))
% Current number of equations to process: 2658
% Current number of ordered equations: 0
% Current number of rules: 101
% New rule produced :
% [103]
% a greatest_lower_bound multiply(b,multiply(inverse(c),a)) ->
% a greatest_lower_bound multiply(a,multiply(inverse(c),b))
% Current number of equations to process: 2734
% Current number of ordered equations: 0
% Current number of rules: 102
% New rule produced :
% [104]
% (((X greatest_lower_bound Y) least_upper_bound Z) greatest_lower_bound V_3) least_upper_bound X least_upper_bound Z
% -> X least_upper_bound Z
% Current number of equations to process: 2791
% Current number of ordered equations: 0
% Current number of rules: 103
% New rule produced :
% [105]
% (((X greatest_lower_bound Y) least_upper_bound (X greatest_lower_bound Z)) greatest_lower_bound V_3) least_upper_bound X
% -> X
% Current number of equations to process: 2422
% Current number of ordered equations: 0
% Current number of rules: 104
% New rule produced :
% [106]
% (((b greatest_lower_bound c) least_upper_bound (a greatest_lower_bound X)) greatest_lower_bound Y) least_upper_bound a
% -> a
% Current number of equations to process: 2421
% Current number of ordered equations: 0
% Current number of rules: 105
% New rule produced :
% [107]
% (b greatest_lower_bound c greatest_lower_bound X greatest_lower_bound Y) least_upper_bound
% (a greatest_lower_bound Y) -> a greatest_lower_bound Y
% Current number of equations to process: 4878
% Current number of ordered equations: 0
% Current number of rules: 106
% New rule produced :
% [108]
% (((X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound V_3) greatest_lower_bound X greatest_lower_bound Z
% -> X greatest_lower_bound Z
% Current number of equations to process: 2799
% Current number of ordered equations: 0
% Current number of rules: 107
% New rule produced :
% [109]
% (((b least_upper_bound c) greatest_lower_bound (a least_upper_bound X)) least_upper_bound Y) greatest_lower_bound a
% -> a
% Current number of equations to process: 2818
% Current number of ordered equations: 0
% Current number of rules: 108
% New rule produced :
% [110]
% (((X least_upper_bound Y) greatest_lower_bound (X least_upper_bound Z)) least_upper_bound V_3) greatest_lower_bound X
% -> X
% Current number of equations to process: 2187
% Current number of ordered equations: 0
% Current number of rules: 109
% New rule produced :
% [111]
% (b least_upper_bound c least_upper_bound X least_upper_bound Y) greatest_lower_bound
% (a least_upper_bound Y) -> a least_upper_bound Y
% Current number of equations to process: 3933
% Current number of ordered equations: 0
% Current number of rules: 110
% New rule produced :
% [112]
% (((b greatest_lower_bound c) least_upper_bound X) greatest_lower_bound Y) least_upper_bound a least_upper_bound X
% -> a least_upper_bound X
% Current number of equations to process: 2496
% Current number of ordered equations: 0
% Current number of rules: 111
% New rule produced :
% [113]
% (multiply(X,b) greatest_lower_bound multiply(X,c)) least_upper_bound
% multiply(X,a) -> multiply(X,a)
% Current number of equations to process: 3465
% Current number of ordered equations: 0
% Current number of rules: 112
% New rule produced :
% [114]
% (multiply(b,X) greatest_lower_bound multiply(c,X)) least_upper_bound
% multiply(a,X) -> multiply(a,X)
% Current number of equations to process: 3580
% Current number of ordered equations: 0
% Current number of rules: 113
% New rule produced :
% [115]
% (((b least_upper_bound c) greatest_lower_bound X) least_upper_bound Y) greatest_lower_bound a greatest_lower_bound X
% -> a greatest_lower_bound X
% Current number of equations to process: 3702
% Current number of ordered equations: 0
% Current number of rules: 114
% New rule produced :
% [116]
% (multiply(X,b) least_upper_bound multiply(X,c)) greatest_lower_bound
% multiply(X,a) -> multiply(X,a)
% Current number of equations to process: 4670
% Current number of ordered equations: 0
% Current number of rules: 115
% New rule produced :
% [117]
% (multiply(b,X) least_upper_bound multiply(c,X)) greatest_lower_bound
% multiply(a,X) -> multiply(a,X)
% Current number of equations to process: 4781
% Current number of ordered equations: 0
% Current number of rules: 116
% New rule produced :
% [118]
% (inverse(a) greatest_lower_bound X) least_upper_bound inverse(b) least_upper_bound
% inverse(c) -> inverse(b) least_upper_bound inverse(c)
% Current number of equations to process: 4898
% Current number of ordered equations: 0
% Current number of rules: 117
% New rule produced :
% [119]
% (inverse(a) least_upper_bound X) greatest_lower_bound inverse(b) greatest_lower_bound
% inverse(c) -> inverse(b) greatest_lower_bound inverse(c)
% Current number of equations to process: 3179
% Current number of ordered equations: 0
% Current number of rules: 118
% New rule produced :
% [120]
% (((a greatest_lower_bound X) least_upper_bound b) greatest_lower_bound Y) least_upper_bound b least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 3483
% Current number of ordered equations: 1
% Current number of rules: 119
% New rule produced :
% [121]
% (((a greatest_lower_bound X) least_upper_bound c) greatest_lower_bound Y) least_upper_bound b least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 3483
% Current number of ordered equations: 0
% Current number of rules: 120
% New rule produced :
% [122]
% (((a least_upper_bound X) greatest_lower_bound b) least_upper_bound Y) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 4050
% Current number of ordered equations: 1
% Current number of rules: 121
% New rule produced :
% [123]
% (((a least_upper_bound X) greatest_lower_bound c) least_upper_bound Y) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 4050
% Current number of ordered equations: 0
% Current number of rules: 122
% New rule produced :
% [124]
% ((b least_upper_bound c) greatest_lower_bound (a least_upper_bound X)) least_upper_bound a
% -> (b least_upper_bound c) greatest_lower_bound (a least_upper_bound X)
% Current number of equations to process: 4611
% Current number of ordered equations: 0
% Current number of rules: 123
% New rule produced :
% [125]
% ((b least_upper_bound c) greatest_lower_bound (a least_upper_bound X)) least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 4627
% Current number of ordered equations: 0
% Current number of rules: 124
% New rule produced :
% [126]
% ((b least_upper_bound c) greatest_lower_bound (a least_upper_bound X)) least_upper_bound X
% -> a least_upper_bound X
% Current number of equations to process: 4626
% Current number of ordered equations: 0
% Current number of rules: 125
% New rule produced :
% [127]
% ((X least_upper_bound Y) greatest_lower_bound (X least_upper_bound Z)) least_upper_bound X
% -> (X least_upper_bound Y) greatest_lower_bound (X least_upper_bound Z)
% Current number of equations to process: 4133
% Current number of ordered equations: 0
% Current number of rules: 126
% New rule produced :
% [128]
% ((X least_upper_bound Y) greatest_lower_bound (X least_upper_bound Z)) least_upper_bound Y
% -> X least_upper_bound Y
% Current number of equations to process: 4190
% Current number of ordered equations: 0
% Current number of rules: 127
% New rule produced :
% [129]
% ((b least_upper_bound a) greatest_lower_bound (b least_upper_bound X)) least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 4421
% Current number of ordered equations: 0
% Current number of rules: 128
% New rule produced :
% [130]
% (((c least_upper_bound X) greatest_lower_bound (c least_upper_bound Y)) least_upper_bound b) greatest_lower_bound a
% -> a
% Current number of equations to process: 4429
% Current number of ordered equations: 1
% Current number of rules: 129
% New rule produced :
% [131]
% (((b least_upper_bound X) greatest_lower_bound (b least_upper_bound Y)) least_upper_bound c) greatest_lower_bound a
% -> a
% Current number of equations to process: 4429
% Current number of ordered equations: 0
% Current number of rules: 130
% New rule produced :
% [132]
% ((b least_upper_bound c) greatest_lower_bound (c least_upper_bound X)) least_upper_bound a
% -> b least_upper_bound c
% Current number of equations to process: 4203
% Current number of ordered equations: 0
% Current number of rules: 131
% New rule produced :
% [133]
% (((X greatest_lower_bound Y) least_upper_bound Z) greatest_lower_bound X) least_upper_bound Z
% -> (X greatest_lower_bound Y) least_upper_bound Z
% Current number of equations to process: 3075
% Current number of ordered equations: 0
% Current number of rules: 132
% New rule produced :
% [134]
% (((b greatest_lower_bound c) least_upper_bound X) greatest_lower_bound a) least_upper_bound X
% -> (b greatest_lower_bound c) least_upper_bound X
% Current number of equations to process: 3074
% Current number of ordered equations: 0
% Current number of rules: 133
% New rule produced :
% [135]
% (((b least_upper_bound X) greatest_lower_bound a) least_upper_bound Y) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 1859
% Current number of ordered equations: 0
% Current number of rules: 134
% New rule produced :
% [136]
% ((X greatest_lower_bound Y) least_upper_bound (X greatest_lower_bound Z)) greatest_lower_bound X
% -> (X greatest_lower_bound Y) least_upper_bound (X greatest_lower_bound Z)
% Current number of equations to process: 2178
% Current number of ordered equations: 0
% Current number of rules: 135
% New rule produced :
% [137]
% ((X greatest_lower_bound Y) least_upper_bound (X greatest_lower_bound Z)) greatest_lower_bound Y
% -> X greatest_lower_bound Y
% Current number of equations to process: 2243
% Current number of ordered equations: 0
% Current number of rules: 136
% New rule produced :
% [138]
% ((b greatest_lower_bound a) least_upper_bound (b greatest_lower_bound X)) greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 2462
% Current number of ordered equations: 0
% Current number of rules: 137
% New rule produced :
% [139]
% (((c greatest_lower_bound X) least_upper_bound (c greatest_lower_bound Y)) greatest_lower_bound b) least_upper_bound a
% -> a
% Current number of equations to process: 2472
% Current number of ordered equations: 1
% Current number of rules: 138
% New rule produced :
% [140]
% (((b greatest_lower_bound X) least_upper_bound (b greatest_lower_bound Y)) greatest_lower_bound c) least_upper_bound a
% -> a
% Current number of equations to process: 2472
% Current number of ordered equations: 0
% Current number of rules: 139
% New rule produced :
% [141]
% ((b greatest_lower_bound c) least_upper_bound (a greatest_lower_bound X)) greatest_lower_bound X
% -> a greatest_lower_bound X
% Current number of equations to process: 3975
% Current number of ordered equations: 2
% Current number of rules: 140
% New rule produced :
% [142]
% ((b greatest_lower_bound c) least_upper_bound (a greatest_lower_bound X)) greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 3975
% Current number of ordered equations: 1
% Current number of rules: 141
% New rule produced :
% [143]
% ((b greatest_lower_bound c) least_upper_bound (c greatest_lower_bound X)) greatest_lower_bound a
% -> b greatest_lower_bound c
% Current number of equations to process: 3975
% Current number of ordered equations: 0
% Current number of rules: 142
% New rule produced :
% [144]
% (((b least_upper_bound c) greatest_lower_bound X) least_upper_bound a) greatest_lower_bound X
% -> (b least_upper_bound c) greatest_lower_bound X
% Current number of equations to process: 2203
% Current number of ordered equations: 0
% Current number of rules: 143
% New rule produced :
% [145]
% (((X least_upper_bound Y) greatest_lower_bound Z) least_upper_bound X) greatest_lower_bound Z
% -> (X least_upper_bound Y) greatest_lower_bound Z
% Current number of equations to process: 2202
% Current number of ordered equations: 0
% Current number of rules: 144
% New rule produced :
% [146]
% ((b greatest_lower_bound c) least_upper_bound (a greatest_lower_bound X)) greatest_lower_bound a
% -> (b greatest_lower_bound c) least_upper_bound (a greatest_lower_bound X)
% Current number of equations to process: 3554
% Current number of ordered equations: 0
% Current number of rules: 145
% New rule produced :
% [147]
% (((b greatest_lower_bound X) least_upper_bound a) greatest_lower_bound Y) least_upper_bound b least_upper_bound c
% -> b least_upper_bound c
% Current number of equations to process: 3744
% Current number of ordered equations: 0
% Current number of rules: 146
% New rule produced :
% [148]
% (((c least_upper_bound X) greatest_lower_bound a) least_upper_bound Y) greatest_lower_bound b greatest_lower_bound c
% -> b greatest_lower_bound c
% Current number of equations to process: 4133
% Current number of ordered equations: 0
% Current number of rules: 147
% New rule produced :
% [149]
% (((c greatest_lower_bound X) least_upper_bound a) greatest_lower_bound Y) least_upper_bound b least_upCputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------