%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : BOO024-1 : TPTP v6.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n033.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:19:13 EDT 2014
% Result : Unsatisfiable 1.26s
% Output : Refutation 1.26s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : BOO024-1 : TPTP v6.0.0. Released v2.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n033.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 : Thu Jun 5 17:56:53 CDT 2014
% % CPUTime : 1.26
% Processing problem /tmp/CiME_54390_n033.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b,a,n1 : constant; pixley : 3; inverse : 1; multiply : 2; add : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% multiply(add(X,Y),Y) = Y;
% multiply(X,add(Y,Z)) = add(multiply(Y,X),multiply(Z,X));
% add(X,inverse(X)) = n1;
% pixley(X,Y,Z) = add(multiply(X,inverse(Y)),add(multiply(X,Z),multiply(inverse(Y),Z)));
% pixley(X,X,Y) = Y;
% pixley(X,Y,Y) = X;
% pixley(X,Y,X) = X;
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% pixley lr_lex;
% n1 lr_lex;
% inverse lr_lex;
% multiply mul;
% add mul;
% ";
%
% let p1 = precedence F "
% pixley > multiply > add > inverse > n1 > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% pixley mul;
% n1 mul;
% inverse mul;
% multiply mul;
% add mul;
% ";
%
% let p2 = precedence F "
% pixley > multiply > add > inverse > n1 = a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " add(multiply(a,b),b) = 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(add(X,Y),Y) = Y,
% multiply(X,add(Y,Z)) =
% add(multiply(Y,X),multiply(Z,X)),
% add(X,inverse(X)) = n1,
% pixley(X,Y,Z) =
% add(multiply(X,inverse(Y)),add(multiply(X,Z),
% multiply(inverse(Y),Z))),
% pixley(X,X,Y) = Y,
% pixley(X,Y,Y) = X,
% pixley(X,Y,X) = X } (7 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 = { add(multiply(a,b),b) = b } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] add(X,inverse(X)) -> n1
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 1
% New rule produced : [2] pixley(X,Y,Y) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 2
% New rule produced : [3] pixley(X,Y,X) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 3
% New rule produced : [4] pixley(X,X,Y) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 4
% New rule produced : [5] multiply(add(X,Y),Y) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 5
% New rule produced :
% [6] multiply(X,add(Y,Z)) -> add(multiply(Y,X),multiply(Z,X))
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 6
% New rule produced :
% [7]
% pixley(X,Y,Z) ->
% add(multiply(X,inverse(Y)),add(multiply(X,Z),multiply(inverse(Y),Z)))
% Rule [2] pixley(X,Y,Y) -> X collapsed.
% Rule [3] pixley(X,Y,X) -> X collapsed.
% Rule [4] pixley(X,X,Y) -> Y collapsed.
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [8]
% add(multiply(X,inverse(Y)),add(multiply(X,X),multiply(inverse(Y),X))) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 5
% New rule produced :
% [9]
% add(multiply(X,inverse(Y)),add(multiply(X,Y),multiply(inverse(Y),Y))) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 6
% New rule produced :
% [10]
% add(multiply(X,inverse(X)),add(multiply(X,Y),multiply(inverse(X),Y))) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [11] multiply(n1,inverse(X)) -> inverse(X)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [12] add(multiply(Y,X),multiply(inverse(Y),X)) -> multiply(X,n1)
% Rule
% [10]
% add(multiply(X,inverse(X)),add(multiply(X,Y),multiply(inverse(X),Y))) -> Y
% collapsed.
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [13] add(multiply(X,inverse(X)),multiply(Y,n1)) -> Y
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [14] add(X,multiply(inverse(add(Y,X)),X)) -> multiply(X,n1)
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [15]
% multiply(multiply(X,n1),multiply(inverse(Y),X)) -> multiply(inverse(Y),X)
% Current number of equations to process: 15
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [16] add(inverse(X),add(multiply(n1,n1),multiply(inverse(X),n1))) -> n1
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [17] add(inverse(X),add(multiply(n1,X),multiply(inverse(X),X))) -> n1
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [18]
% add(inverse(X),multiply(inverse(n1),inverse(X))) -> multiply(inverse(X),n1)
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [19] multiply(X,multiply(X,n1)) -> multiply(X,n1)
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [20] add(Y,n1) <-> add(multiply(X,inverse(X)),n1)
% Current number of equations to process: 13
% Current number of ordered equations: 1
% Current number of rules: 16
% Rule [20] add(Y,n1) <-> add(multiply(X,inverse(X)),n1) is composed into
% [20] add(Y,n1) <-> add(b,n1)
% New rule produced : [21] add(multiply(X,inverse(X)),n1) <-> add(Y,n1)
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [22] add(inverse(n1),multiply(X,n1)) -> X
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [23]
% add(multiply(X,n1),multiply(inverse(X),multiply(X,n1))) ->
% multiply(multiply(X,n1),n1)
% Current number of equations to process: 24
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [24] add(multiply(Y,X),multiply(n1,X)) <-> add(multiply(b,X),multiply(n1,X))
% Current number of equations to process: 35
% Current number of ordered equations: 1
% Current number of rules: 20
% New rule produced :
% [25] add(multiply(b,X),multiply(n1,X)) <-> add(multiply(Y,X),multiply(n1,X))
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [26] add(multiply(inverse(n1),X),multiply(multiply(Y,n1),X)) -> multiply(X,Y)
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [27]
% multiply(multiply(multiply(inverse(X),n1),n1),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1)
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [28]
% add(inverse(inverse(X)),add(inverse(X),multiply(inverse(inverse(X)),inverse(X))))
% -> n1
% Current number of equations to process: 34
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [29]
% add(multiply(multiply(Z,inverse(Z)),X),multiply(multiply(Y,n1),X)) ->
% multiply(X,Y)
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 25
% Rule [24]
% add(multiply(Y,X),multiply(n1,X)) <-> add(multiply(b,X),multiply(n1,X)) is composed into
% [24] add(multiply(Y,X),multiply(n1,X)) -> add(X,multiply(n1,X))
% New rule produced :
% [30] add(multiply(b,X),multiply(n1,X)) -> add(X,multiply(n1,X))
% Rule
% [25] add(multiply(b,X),multiply(n1,X)) <-> add(multiply(Y,X),multiply(n1,X))
% collapsed.
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [31] add(multiply(X,inverse(Y)),inverse(Y)) -> add(inverse(Y),inverse(Y))
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [32]
% add(multiply(X,multiply(n1,n1)),multiply(n1,n1)) -> add(n1,multiply(n1,n1))
% Current number of equations to process: 35
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [33]
% multiply(multiply(X,Y),multiply(multiply(Y,n1),X)) ->
% multiply(multiply(Y,n1),X)
% Current number of equations to process: 37
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [34]
% multiply(multiply(inverse(X),n1),n1) <->
% add(multiply(X,multiply(inverse(X),n1)),multiply(inverse(X),n1))
% Current number of equations to process: 45
% Current number of ordered equations: 1
% Current number of rules: 29
% New rule produced :
% [35]
% add(multiply(X,multiply(inverse(X),n1)),multiply(inverse(X),n1)) <->
% multiply(multiply(inverse(X),n1),n1)
% Current number of equations to process: 45
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [36]
% multiply(inverse(X),multiply(multiply(inverse(X),n1),n1)) ->
% multiply(multiply(inverse(X),n1),n1)
% Current number of equations to process: 66
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [37]
% multiply(multiply(multiply(inverse(X),Y),Y),multiply(inverse(X),Y)) ->
% multiply(inverse(X),Y)
% Rule
% [27]
% multiply(multiply(multiply(inverse(X),n1),n1),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1) collapsed.
% Current number of equations to process: 69
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [38]
% add(multiply(add(X,Y),inverse(Y)),add(Y,multiply(inverse(Y),Y))) -> add(X,Y)
% Current number of equations to process: 70
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [39]
% add(multiply(multiply(Z,Y),X),multiply(multiply(inverse(Z),Y),X)) ->
% multiply(X,multiply(Y,n1))
% Current number of equations to process: 69
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [40]
% add(multiply(Y,X),multiply(multiply(inverse(add(Z,Y)),Y),X)) ->
% multiply(X,multiply(Y,n1))
% Current number of equations to process: 102
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [41]
% add(multiply(multiply(X,inverse(Y)),n1),multiply(inverse(Y),n1)) ->
% add(inverse(Y),inverse(Y))
% Current number of equations to process: 101
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced :
% [42]
% multiply(multiply(X,n1),multiply(multiply(multiply(X,n1),n1),X)) ->
% multiply(multiply(multiply(X,n1),n1),X)
% Current number of equations to process: 100
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [43]
% add(multiply(inverse(X),n1),multiply(inverse(X),n1)) ->
% add(inverse(X),inverse(X))
% Current number of equations to process: 159
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [44]
% multiply(add(inverse(X),inverse(X)),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1)
% Current number of equations to process: 159
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [45]
% add(multiply(n1,n1),multiply(multiply(n1,n1),n1)) -> add(n1,multiply(n1,n1))
% Current number of equations to process: 164
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [46]
% add(multiply(inverse(n1),inverse(n1)),add(inverse(n1),inverse(n1))) ->
% inverse(n1)
% Current number of equations to process: 178
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [47]
% multiply(add(n1,multiply(n1,n1)),multiply(multiply(n1,n1),n1)) ->
% multiply(multiply(n1,n1),n1)
% Current number of equations to process: 185
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [48]
% add(multiply(inverse(n1),inverse(n1)),multiply(inverse(n1),inverse(n1))) ->
% add(inverse(n1),inverse(n1))
% Current number of equations to process: 184
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [49]
% multiply(add(inverse(n1),inverse(n1)),multiply(inverse(n1),inverse(n1))) ->
% multiply(inverse(n1),inverse(n1))
% Current number of equations to process: 185
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [50]
% add(multiply(inverse(Y),X),multiply(multiply(inverse(n1),inverse(Y)),X)) ->
% multiply(X,multiply(inverse(Y),n1))
% Current number of equations to process: 187
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [51]
% multiply(multiply(inverse(X),Y),Y) <->
% add(multiply(inverse(n1),multiply(inverse(X),Y)),multiply(inverse(X),Y))
% Current number of equations to process: 196
% Current number of ordered equations: 1
% Current number of rules: 45
% New rule produced :
% [52]
% add(multiply(inverse(n1),multiply(inverse(X),Y)),multiply(inverse(X),Y)) <->
% multiply(multiply(inverse(X),Y),Y)
% Current number of equations to process: 196
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [53]
% multiply(multiply(inverse(X),n1),multiply(inverse(X),n1)) ->
% multiply(multiply(inverse(X),n1),n1)
% Current number of equations to process: 202
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [54] multiply(multiply(inverse(n1),n1),n1) -> add(inverse(n1),inverse(n1))
% Current number of equations to process: 215
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [55]
% add(multiply(inverse(n1),n1),add(inverse(n1),inverse(n1))) -> inverse(n1)
% Current number of equations to process: 230
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [56]
% add(add(inverse(n1),inverse(n1)),multiply(n1,n1)) -> add(n1,multiply(n1,n1))
% Current number of equations to process: 229
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [57]
% multiply(inverse(n1),n1) -> add(inverse(n1),add(inverse(n1),inverse(n1)))
% Rule
% [54] multiply(multiply(inverse(n1),n1),n1) -> add(inverse(n1),inverse(n1))
% collapsed.
% Rule
% [55]
% add(multiply(inverse(n1),n1),add(inverse(n1),inverse(n1))) -> inverse(n1)
% collapsed.
% Current number of equations to process: 234
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [58]
% add(multiply(X,inverse(X)),add(inverse(n1),inverse(n1))) ->
% add(inverse(n1),add(inverse(n1),inverse(n1)))
% Current number of equations to process: 233
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [59]
% multiply(add(inverse(n1),add(inverse(n1),inverse(n1))),n1) ->
% add(inverse(n1),inverse(n1))
% Current number of equations to process: 233
% Current number of ordered equations: 0
% Current number of rules: 51
% Rule [58]
% add(multiply(X,inverse(X)),add(inverse(n1),inverse(n1))) ->
% add(inverse(n1),add(inverse(n1),inverse(n1))) is composed into [58]
% add(
% multiply(X,
% inverse(X)),
% add(
% inverse(n1),
% inverse(n1)))
% ->
% add(
% inverse(n1),
% inverse(n1))
% Rule [57]
% multiply(inverse(n1),n1) ->
% add(inverse(n1),add(inverse(n1),inverse(n1))) is composed into [57]
% multiply(
% inverse(n1),n1)
% ->
% add(
% inverse(n1),
% inverse(n1))
% New rule produced :
% [60]
% add(inverse(n1),add(inverse(n1),inverse(n1))) -> add(inverse(n1),inverse(n1))
% Rule
% [59]
% multiply(add(inverse(n1),add(inverse(n1),inverse(n1))),n1) ->
% add(inverse(n1),inverse(n1)) collapsed.
% Current number of equations to process: 245
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [61]
% multiply(add(inverse(n1),inverse(n1)),n1) -> add(inverse(n1),inverse(n1))
% Current number of equations to process: 244
% Current number of ordered equations: 0
% Current number of rules: 52
% Rule [57] multiply(inverse(n1),n1) -> add(inverse(n1),inverse(n1)) is composed into
% [57] multiply(inverse(n1),n1) -> inverse(n1)
% Rule [48]
% add(multiply(inverse(n1),inverse(n1)),multiply(inverse(n1),inverse(n1)))
% -> add(inverse(n1),inverse(n1)) is composed into [48]
% add(multiply(inverse(n1),
% inverse(n1)),
% multiply(inverse(n1),
% inverse(n1))) ->
% inverse(n1)
% New rule produced : [62] add(inverse(n1),inverse(n1)) -> inverse(n1)
% Rule
% [46]
% add(multiply(inverse(n1),inverse(n1)),add(inverse(n1),inverse(n1))) ->
% inverse(n1) collapsed.
% Rule
% [49]
% multiply(add(inverse(n1),inverse(n1)),multiply(inverse(n1),inverse(n1))) ->
% multiply(inverse(n1),inverse(n1)) collapsed.
% Rule
% [56]
% add(add(inverse(n1),inverse(n1)),multiply(n1,n1)) -> add(n1,multiply(n1,n1))
% collapsed.
% Rule
% [58]
% add(multiply(X,inverse(X)),add(inverse(n1),inverse(n1))) ->
% add(inverse(n1),inverse(n1)) collapsed.
% Rule
% [60]
% add(inverse(n1),add(inverse(n1),inverse(n1))) -> add(inverse(n1),inverse(n1))
% collapsed.
% Rule
% [61]
% multiply(add(inverse(n1),inverse(n1)),n1) -> add(inverse(n1),inverse(n1))
% collapsed.
% Current number of equations to process: 252
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced :
% [63] add(multiply(X,inverse(X)),inverse(n1)) -> inverse(n1)
% Current number of equations to process: 251
% Current number of ordered equations: 0
% Current number of rules: 48
% Rule [45]
% add(multiply(n1,n1),multiply(multiply(n1,n1),n1)) ->
% add(n1,multiply(n1,n1)) is composed into [45]
% add(multiply(n1,n1),multiply(
% multiply(n1,n1),n1))
% -> n1
% Rule [32]
% add(multiply(X,multiply(n1,n1)),multiply(n1,n1)) ->
% add(n1,multiply(n1,n1)) is composed into [32]
% add(multiply(X,multiply(n1,n1)),
% multiply(n1,n1)) -> n1
% New rule produced : [64] add(n1,multiply(n1,n1)) -> n1
% Rule
% [47]
% multiply(add(n1,multiply(n1,n1)),multiply(multiply(n1,n1),n1)) ->
% multiply(multiply(n1,n1),n1) collapsed.
% Current number of equations to process: 251
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced :
% [65]
% multiply(n1,multiply(multiply(n1,n1),n1)) -> multiply(multiply(n1,n1),n1)
% Current number of equations to process: 250
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [66]
% multiply(inverse(n1),multiply(inverse(n1),inverse(n1))) ->
% multiply(inverse(n1),inverse(n1))
% Current number of equations to process: 249
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [67] multiply(X,multiply(n1,n1)) -> multiply(X,inverse(inverse(n1)))
% Rule [32] add(multiply(X,multiply(n1,n1)),multiply(n1,n1)) -> n1 collapsed.
% Current number of equations to process: 251
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced :
% [68] add(multiply(X,inverse(inverse(n1))),multiply(n1,n1)) -> n1
% Current number of equations to process: 250
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [69] multiply(inverse(add(X,inverse(n1))),inverse(n1)) -> inverse(n1)
% Current number of equations to process: 250
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [70] add(multiply(multiply(X,inverse(n1)),n1),inverse(n1)) -> inverse(n1)
% Current number of equations to process: 250
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced : [71] multiply(inverse(n1),inverse(n1)) -> inverse(n1)
% Rule
% [48]
% add(multiply(inverse(n1),inverse(n1)),multiply(inverse(n1),inverse(n1))) ->
% inverse(n1) collapsed.
% Rule
% [66]
% multiply(inverse(n1),multiply(inverse(n1),inverse(n1))) ->
% multiply(inverse(n1),inverse(n1)) collapsed.
% Current number of equations to process: 250
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [72]
% add(multiply(multiply(n1,n1),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(inverse(n1)))
% Current number of equations to process: 249
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [73]
% add(multiply(inverse(n1),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(n1))
% Current number of equations to process: 249
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [74]
% add(inverse(n1),multiply(inverse(inverse(n1)),inverse(n1))) -> inverse(n1)
% Current number of equations to process: 249
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced : [75] multiply(n1,n1) -> inverse(inverse(n1))
% Rule [16] add(inverse(X),add(multiply(n1,n1),multiply(inverse(X),n1))) -> n1
% collapsed.
% Rule [45] add(multiply(n1,n1),multiply(multiply(n1,n1),n1)) -> n1 collapsed.
% Rule [64] add(n1,multiply(n1,n1)) -> n1 collapsed.
% Rule
% [65]
% multiply(n1,multiply(multiply(n1,n1),n1)) -> multiply(multiply(n1,n1),n1)
% collapsed.
% Rule [67] multiply(X,multiply(n1,n1)) -> multiply(X,inverse(inverse(n1)))
% collapsed.
% Rule [68] add(multiply(X,inverse(inverse(n1))),multiply(n1,n1)) -> n1
% collapsed.
% Rule
% [72]
% add(multiply(multiply(n1,n1),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(inverse(n1))) collapsed.
% Current number of equations to process: 257
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced : [76] add(n1,inverse(inverse(n1))) -> n1
% Current number of equations to process: 256
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced : [77] add(inverse(inverse(n1)),inverse(inverse(n1))) -> n1
% Current number of equations to process: 255
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [78] add(inverse(inverse(n1)),multiply(inverse(inverse(n1)),n1)) -> n1
% Current number of equations to process: 254
% Current number of ordered equations: 0
% Current number of rules: 52
% New rule produced :
% [79]
% multiply(n1,multiply(inverse(inverse(n1)),n1)) ->
% multiply(inverse(inverse(n1)),n1)
% Current number of equations to process: 253
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [80] multiply(inverse(inverse(n1)),inverse(n1)) -> inverse(n1)
% Rule
% [74]
% add(inverse(n1),multiply(inverse(inverse(n1)),inverse(n1))) -> inverse(n1)
% collapsed.
% Current number of equations to process: 254
% Current number of ordered equations: 0
% Current number of rules: 53
% New rule produced :
% [81] add(inverse(X),add(inverse(inverse(n1)),multiply(inverse(X),n1))) -> n1
% Current number of equations to process: 253
% Current number of ordered equations: 0
% Current number of rules: 54
% New rule produced :
% [82]
% add(multiply(inverse(n1),inverse(add(X,inverse(n1)))),inverse(n1)) ->
% inverse(n1)
% Current number of equations to process: 259
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced :
% [83]
% add(inverse(n1),multiply(multiply(X,n1),inverse(n1))) ->
% multiply(inverse(n1),X)
% Current number of equations to process: 260
% Current number of ordered equations: 0
% Current number of rules: 56
% New rule produced :
% [84]
% multiply(multiply(X,inverse(n1)),multiply(inverse(n1),X)) ->
% multiply(inverse(n1),X)
% Current number of equations to process: 262
% Current number of ordered equations: 0
% Current number of rules: 57
% New rule produced :
% [85]
% add(multiply(inverse(inverse(n1)),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(inverse(n1)))
% Current number of equations to process: 261
% Current number of ordered equations: 0
% Current number of rules: 58
% New rule produced : [86] add(multiply(X,n1),inverse(inverse(n1))) -> n1
% Current number of equations to process: 264
% Current number of ordered equations: 0
% Current number of rules: 59
% New rule produced :
% [87] add(multiply(X,inverse(X)),inverse(inverse(n1))) -> n1
% Current number of equations to process: 265
% Current number of ordered equations: 0
% Current number of rules: 60
% New rule produced :
% [88]
% multiply(inverse(inverse(n1)),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1)
% Current number of equations to process: 267
% Current number of ordered equations: 0
% Current number of rules: 61
% New rule produced :
% [89] add(multiply(n1,X),multiply(inverse(inverse(n1)),X)) -> multiply(X,n1)
% Current number of equations to process: 266
% Current number of ordered equations: 0
% Current number of rules: 62
% New rule produced :
% [90] add(multiply(X,inverse(inverse(n1))),inverse(n1)) -> X
% Current number of equations to process: 276
% Current number of ordered equations: 0
% Current number of rules: 63
% New rule produced : [91] add(inverse(inverse(n1)),inverse(n1)) -> n1
% Current number of equations to process: 278
% Current number of ordered equations: 0
% Current number of rules: 64
% New rule produced :
% [92]
% add(inverse(n1),multiply(inverse(inverse(inverse(n1))),inverse(n1))) ->
% inverse(n1)
% Current number of equations to process: 280
% Current number of ordered equations: 0
% Current number of rules: 65
% Rule [20] add(Y,n1) <-> add(b,n1) is composed into [20] add(Y,n1) -> n1
% New rule produced : [93] add(b,n1) -> n1
% Current number of equations to process: 280
% Current number of ordered equations: 0
% Current number of rules: 66
% New rule produced :
% [94]
% add(inverse(n1),multiply(inverse(inverse(n1)),inverse(inverse(n1)))) ->
% inverse(inverse(n1))
% Current number of equations to process: 278
% Current number of ordered equations: 0
% Current number of rules: 67
% New rule produced :
% [95]
% add(multiply(inverse(inverse(n1)),X),multiply(inverse(inverse(n1)),X)) ->
% multiply(X,n1)
% Current number of equations to process: 279
% Current number of ordered equations: 0
% Current number of rules: 68
% New rule produced :
% [96]
% add(multiply(multiply(Y,inverse(Y)),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(n1))
% Current number of equations to process: 278
% Current number of ordered equations: 0
% Current number of rules: 69
% New rule produced :
% [97]
% add(inverse(n1),multiply(inverse(inverse(add(X,inverse(n1)))),inverse(n1)))
% -> inverse(n1)
% Current number of equations to process: 277
% Current number of ordered equations: 0
% Current number of rules: 70
% New rule produced :
% [98]
% multiply(inverse(n1),multiply(inverse(n1),inverse(inverse(n1)))) ->
% multiply(inverse(n1),inverse(inverse(n1)))
% Current number of equations to process: 291
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [99] multiply(inverse(n1),inverse(inverse(n1))) -> inverse(n1)
% Rule
% [98]
% multiply(inverse(n1),multiply(inverse(n1),inverse(inverse(n1)))) ->
% multiply(inverse(n1),inverse(inverse(n1))) collapsed.
% Current number of equations to process: 291
% Current number of ordered equations: 0
% Current number of rules: 71
% New rule produced :
% [100]
% add(multiply(inverse(inverse(n1)),n1),inverse(n1)) -> inverse(inverse(n1))
% Current number of equations to process: 291
% Current number of ordered equations: 0
% Current number of rules: 72
% New rule produced :
% [101]
% multiply(multiply(X,inverse(inverse(n1))),multiply(inverse(n1),X)) ->
% multiply(inverse(n1),X)
% Current number of equations to process: 293
% Current number of ordered equations: 0
% Current number of rules: 73
% Rule [75] multiply(n1,n1) -> inverse(inverse(n1)) is composed into [75]
% multiply(n1,n1)
% -> n1
% New rule produced : [102] inverse(inverse(n1)) -> n1
% Rule [76] add(n1,inverse(inverse(n1))) -> n1 collapsed.
% Rule [77] add(inverse(inverse(n1)),inverse(inverse(n1))) -> n1 collapsed.
% Rule [78] add(inverse(inverse(n1)),multiply(inverse(inverse(n1)),n1)) -> n1
% collapsed.
% Rule
% [79]
% multiply(n1,multiply(inverse(inverse(n1)),n1)) ->
% multiply(inverse(inverse(n1)),n1) collapsed.
% Rule [80] multiply(inverse(inverse(n1)),inverse(n1)) -> inverse(n1)
% collapsed.
% Rule
% [81] add(inverse(X),add(inverse(inverse(n1)),multiply(inverse(X),n1))) -> n1
% collapsed.
% Rule
% [85]
% add(multiply(inverse(inverse(n1)),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(inverse(n1))) collapsed.
% Rule [86] add(multiply(X,n1),inverse(inverse(n1))) -> n1 collapsed.
% Rule [87] add(multiply(X,inverse(X)),inverse(inverse(n1))) -> n1 collapsed.
% Rule
% [88]
% multiply(inverse(inverse(n1)),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1) collapsed.
% Rule
% [89] add(multiply(n1,X),multiply(inverse(inverse(n1)),X)) -> multiply(X,n1)
% collapsed.
% Rule [90] add(multiply(X,inverse(inverse(n1))),inverse(n1)) -> X collapsed.
% Rule [91] add(inverse(inverse(n1)),inverse(n1)) -> n1 collapsed.
% Rule
% [92]
% add(inverse(n1),multiply(inverse(inverse(inverse(n1))),inverse(n1))) ->
% inverse(n1) collapsed.
% Rule
% [94]
% add(inverse(n1),multiply(inverse(inverse(n1)),inverse(inverse(n1)))) ->
% inverse(inverse(n1)) collapsed.
% Rule
% [95]
% add(multiply(inverse(inverse(n1)),X),multiply(inverse(inverse(n1)),X)) ->
% multiply(X,n1) collapsed.
% Rule [99] multiply(inverse(n1),inverse(inverse(n1))) -> inverse(n1)
% collapsed.
% Rule
% [100]
% add(multiply(inverse(inverse(n1)),n1),inverse(n1)) -> inverse(inverse(n1))
% collapsed.
% Rule
% [101]
% multiply(multiply(X,inverse(inverse(n1))),multiply(inverse(n1),X)) ->
% multiply(inverse(n1),X) collapsed.
% Current number of equations to process: 296
% Current number of ordered equations: 0
% Current number of rules: 55
% New rule produced : [103] add(multiply(X,n1),inverse(n1)) -> X
% Rule
% [70] add(multiply(multiply(X,inverse(n1)),n1),inverse(n1)) -> inverse(n1)
% collapsed.
% Current number of equations to process: 296
% Current number of ordered equations: 0
% Current number of rules: 55
% Rule [96]
% add(multiply(multiply(Y,inverse(Y)),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(n1)) is composed into [96]
% add(multiply(multiply(Y,
% inverse(Y)),X),
% multiply(inverse(n1),X)) ->
% inverse(n1)
% Rule [73]
% add(multiply(inverse(n1),X),multiply(inverse(n1),X)) ->
% multiply(X,inverse(n1)) is composed into [73]
% add(multiply(inverse(n1),X),
% multiply(inverse(n1),X)) ->
% inverse(n1)
% New rule produced : [104] multiply(X,inverse(n1)) -> inverse(n1)
% Rule [69] multiply(inverse(add(X,inverse(n1))),inverse(n1)) -> inverse(n1)
% collapsed.
% Rule [71] multiply(inverse(n1),inverse(n1)) -> inverse(n1) collapsed.
% Rule
% [83]
% add(inverse(n1),multiply(multiply(X,n1),inverse(n1))) ->
% multiply(inverse(n1),X) collapsed.
% Rule
% [84]
% multiply(multiply(X,inverse(n1)),multiply(inverse(n1),X)) ->
% multiply(inverse(n1),X) collapsed.
% Rule
% [97]
% add(inverse(n1),multiply(inverse(inverse(add(X,inverse(n1)))),inverse(n1)))
% -> inverse(n1) collapsed.
% Current number of equations to process: 297
% Current number of ordered equations: 0
% Current number of rules: 51
% Rule [51]
% multiply(multiply(inverse(X),Y),Y) <->
% add(multiply(inverse(n1),multiply(inverse(X),Y)),multiply(inverse(X),Y)) is composed into
% [51]
% multiply(multiply(inverse(X),Y),Y) -> add(inverse(n1),multiply(inverse(X),Y))
% New rule produced : [105] multiply(inverse(n1),X) -> inverse(n1)
% Rule
% [18]
% add(inverse(X),multiply(inverse(n1),inverse(X))) -> multiply(inverse(X),n1)
% collapsed.
% Rule
% [26] add(multiply(inverse(n1),X),multiply(multiply(Y,n1),X)) -> multiply(X,Y)
% collapsed.
% Rule
% [50]
% add(multiply(inverse(Y),X),multiply(multiply(inverse(n1),inverse(Y)),X)) ->
% multiply(X,multiply(inverse(Y),n1)) collapsed.
% Rule
% [52]
% add(multiply(inverse(n1),multiply(inverse(X),Y)),multiply(inverse(X),Y)) <->
% multiply(multiply(inverse(X),Y),Y) collapsed.
% Rule [57] multiply(inverse(n1),n1) -> inverse(n1) collapsed.
% Rule [73] add(multiply(inverse(n1),X),multiply(inverse(n1),X)) -> inverse(n1)
% collapsed.
% Rule
% [82]
% add(multiply(inverse(n1),inverse(add(X,inverse(n1)))),inverse(n1)) ->
% inverse(n1) collapsed.
% Rule
% [96]
% add(multiply(multiply(Y,inverse(Y)),X),multiply(inverse(n1),X)) ->
% inverse(n1) collapsed.
% Current number of equations to process: 300
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [106] multiply(inverse(X),n1) -> add(inverse(X),inverse(n1))
% Rule
% [34]
% multiply(multiply(inverse(X),n1),n1) <->
% add(multiply(X,multiply(inverse(X),n1)),multiply(inverse(X),n1)) collapsed.
% Rule
% [35]
% add(multiply(X,multiply(inverse(X),n1)),multiply(inverse(X),n1)) <->
% multiply(multiply(inverse(X),n1),n1) collapsed.
% Rule
% [36]
% multiply(inverse(X),multiply(multiply(inverse(X),n1),n1)) ->
% multiply(multiply(inverse(X),n1),n1) collapsed.
% Rule
% [41]
% add(multiply(multiply(X,inverse(Y)),n1),multiply(inverse(Y),n1)) ->
% add(inverse(Y),inverse(Y)) collapsed.
% Rule
% [43]
% add(multiply(inverse(X),n1),multiply(inverse(X),n1)) ->
% add(inverse(X),inverse(X)) collapsed.
% Rule
% [44]
% multiply(add(inverse(X),inverse(X)),multiply(inverse(X),n1)) ->
% multiply(inverse(X),n1) collapsed.
% Rule
% [53]
% multiply(multiply(inverse(X),n1),multiply(inverse(X),n1)) ->
% multiply(multiply(inverse(X),n1),n1) collapsed.
% Current number of equations to process: 305
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [107]
% add(add(inverse(X),inverse(n1)),inverse(n1)) -> add(inverse(X),inverse(n1))
% Current number of equations to process: 304
% Current number of ordered equations: 0
% Current number of rules: 39
% Rule [30] add(multiply(b,X),multiply(n1,X)) -> add(X,multiply(n1,X)) is composed into
% [30] add(multiply(b,X),multiply(n1,X)) -> multiply(X,n1)
% Rule [24] add(multiply(Y,X),multiply(n1,X)) -> add(X,multiply(n1,X)) is composed into
% [24] add(multiply(Y,X),multiply(n1,X)) -> multiply(X,n1)
% New rule produced : [108] add(X,multiply(n1,X)) -> multiply(X,n1)
% Current number of equations to process: 303
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [109] add(inverse(X),add(n1,add(inverse(X),inverse(n1)))) -> n1
% Current number of equations to process: 301
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [110] add(inverse(n1),multiply(multiply(Y,n1),X)) -> multiply(X,Y)
% Current number of equations to process: 300
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [111] add(multiply(multiply(Y,inverse(Y)),X),inverse(n1)) -> inverse(n1)
% Current number of equations to process: 298
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced :
% [112]
% multiply(inverse(X),multiply(add(inverse(X),inverse(n1)),n1)) ->
% multiply(add(inverse(X),inverse(n1)),n1)
% Current number of equations to process: 297
% Current number of ordered equations: 0
% Current number of rules: 44
% New rule produced :
% [113]
% add(add(inverse(X),inverse(n1)),add(inverse(X),inverse(n1))) ->
% add(inverse(X),inverse(X))
% Current number of equations to process: 295
% Current number of ordered equations: 1
% Current number of rules: 45
% New rule produced :
% [114]
% add(add(multiply(inverse(X),inverse(X)),multiply(inverse(X),inverse(X))),
% inverse(n1)) -> add(inverse(X),inverse(n1))
% Current number of equations to process: 295
% Current number of ordered equations: 0
% Current number of rules: 46
% New rule produced :
% [115] multiply(multiply(X,n1),multiply(n1,X)) -> multiply(n1,X)
% Current number of equations to process: 295
% Current number of ordered equations: 0
% Current number of rules: 47
% New rule produced : [116] add(multiply(X,n1),multiply(X,n1)) -> X
% Current number of equations to process: 289
% Current number of ordered equations: 0
% Current number of rules: 48
% New rule produced : [117] add(inverse(n1),multiply(n1,X)) -> multiply(X,n1)
% Current number of equations to process: 289
% Current number of ordered equations: 0
% Current number of rules: 49
% New rule produced :
% [118]
% add(inverse(n1),multiply(multiply(n1,X),Y)) -> multiply(Y,multiply(X,n1))
% Current number of equations to process: 289
% Current number of ordered equations: 0
% Current number of rules: 50
% New rule produced : [119] multiply(multiply(n1,X),X) -> multiply(X,n1)
% Current number of equations to process: 289
% Current number of ordered equations: 0
% Current number of rules: 51
% New rule produced :
% [120] add(multiply(multiply(Y,n1),X),inverse(n1)) -> multiply(X,Y)
% Current number of equations to process: 289
% Current number of ordered equations: 0
% Current number of rules: 52
% Rule [51]
% multiply(multiply(inverse(X),Y),Y) ->
% add(inverse(n1),multiply(inverse(X),Y)) is composed into [51]
% multiply(
% multiply(
% inverse(X),Y),Y)
% ->
% multiply(
% inverse(X),Y)
% New rule produced : [121] add(inverse(n1),X) -> X
% Rule [22] add(inverse(n1),multiply(X,n1)) -> X collapsed.
% Rule [62] add(inverse(n1),inverse(n1)) -> inverse(n1) collapsed.
% Rule [110] add(inverse(n1),multiply(multiply(Y,n1),X)) -> multiply(X,Y)
% collapsed.
% Rule [117] add(inverse(n1),multiply(n1,X)) -> multiply(X,n1) collapsed.
% Rule
% [118]
% add(inverse(n1),multiply(multiply(n1,X),Y)) -> multiply(Y,multiply(X,n1))
% collapsed.
% Current number of equations to process: 293
% Current number of ordered equations: 0
% Current number of rules: 48
% Rule [119] multiply(multiply(n1,X),X) -> multiply(X,n1) is composed into
% [119] multiply(multiply(n1,X),X) -> X
% Rule [108] add(X,multiply(n1,X)) -> multiply(X,n1) is composed into [108]
% add(X,
% multiply(n1,X))
% -> X
% Rule [40]
% add(multiply(Y,X),multiply(multiply(inverse(add(Z,Y)),Y),X)) ->
% multiply(X,multiply(Y,n1)) is composed into [40]
% add(multiply(Y,X),multiply(
% multiply(
% inverse(
% add(Z,Y)),Y),X))
% -> multiply(X,Y)
% Rule [39]
% add(multiply(multiply(Z,Y),X),multiply(multiply(inverse(Z),Y),X)) ->
% multiply(X,multiply(Y,n1)) is composed into [39]
% add(multiply(multiply(Z,Y),X),
% multiply(multiply(inverse(Z),Y),X))
% -> multiply(X,Y)
% Rule [30] add(multiply(b,X),multiply(n1,X)) -> multiply(X,n1) is composed into
% [30] add(multiply(b,X),multiply(n1,X)) -> X
% Rule [24] add(multiply(Y,X),multiply(n1,X)) -> multiply(X,n1) is composed into
% [24] add(multiply(Y,X),multiply(n1,X)) -> X
% Rule [14] add(X,multiply(inverse(add(Y,X)),X)) -> multiply(X,n1) is composed into
% [14] add(X,multiply(inverse(add(Y,X)),X)) -> X
% Rule [12] add(multiply(Y,X),multiply(inverse(Y),X)) -> multiply(X,n1) is composed into
% [12] add(multiply(Y,X),multiply(inverse(Y),X)) -> X
% New rule produced : [122] multiply(X,n1) -> X
% Rule [13] add(multiply(X,inverse(X)),multiply(Y,n1)) -> Y collapsed.
% Rule
% [15]
% multiply(multiply(X,n1),multiply(inverse(Y),X)) -> multiply(inverse(Y),X)
% collapsed.
% Rule [19] multiply(X,multiply(X,n1)) -> multiply(X,n1) collapsed.
% Rule
% [23]
% add(multiply(X,n1),multiply(inverse(X),multiply(X,n1))) ->
% multiply(multiply(X,n1),n1) collapsed.
% Rule
% [29]
% add(multiply(multiply(Z,inverse(Z)),X),multiply(multiply(Y,n1),X)) ->
% multiply(X,Y) collapsed.
% Rule
% [33]
% multiply(multiply(X,Y),multiply(multiply(Y,n1),X)) ->
% multiply(multiply(Y,n1),X) collapsed.
% Rule
% [42]
% multiply(multiply(X,n1),multiply(multiply(multiply(X,n1),n1),X)) ->
% multiply(multiply(multiply(X,n1),n1),X) collapsed.
% Rule [75] multiply(n1,n1) -> n1 collapsed.
% Rule [103] add(multiply(X,n1),inverse(n1)) -> X collapsed.
% Rule [106] multiply(inverse(X),n1) -> add(inverse(X),inverse(n1)) collapsed.
% Rule
% [112]
% multiply(inverse(X),multiply(add(inverse(X),inverse(n1)),n1)) ->
% multiply(add(inverse(X),inverse(n1)),n1) collapsed.
% Rule [115] multiply(multiply(X,n1),multiply(n1,X)) -> multiply(n1,X)
% collapsed.
% Rule [116] add(multiply(X,n1),multiply(X,n1)) -> X collapsed.
% Rule [120] add(multiply(multiply(Y,n1),X),inverse(n1)) -> multiply(X,Y)
% collapsed.
% Current number of equations to process: 305
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced : [123] add(multiply(X,inverse(X)),Y) -> Y
% Rule [21] add(multiply(X,inverse(X)),n1) <-> add(Y,n1) collapsed.
% Rule [63] add(multiply(X,inverse(X)),inverse(n1)) -> inverse(n1) collapsed.
% Current number of equations to process: 304
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [124] multiply(X,X) -> X
% Rule
% [8]
% add(multiply(X,inverse(Y)),add(multiply(X,X),multiply(inverse(Y),X))) -> X
% collapsed.
% Rule
% [114]
% add(add(multiply(inverse(X),inverse(X)),multiply(inverse(X),inverse(X))),
% inverse(n1)) -> add(inverse(X),inverse(n1)) collapsed.
% Current number of equations to process: 305
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [125] add(multiply(X,inverse(Y)),add(X,multiply(inverse(Y),X))) -> X
% Current number of equations to process: 304
% Current number of ordered equations: 0
% Current number of rules: 34
% Rule [31]
% add(multiply(X,inverse(Y)),inverse(Y)) -> add(inverse(Y),inverse(Y)) is composed into
% [31] add(multiply(X,inverse(Y)),inverse(Y)) -> inverse(Y)
% New rule produced : [126] add(X,X) -> X
% Rule
% [113]
% add(add(inverse(X),inverse(n1)),add(inverse(X),inverse(n1))) ->
% add(inverse(X),inverse(X)) collapsed.
% Current number of equations to process: 303
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [127] add(X,inverse(n1)) -> X
% Rule
% [107]
% add(add(inverse(X),inverse(n1)),inverse(n1)) -> add(inverse(X),inverse(n1))
% collapsed.
% Rule [109] add(inverse(X),add(n1,add(inverse(X),inverse(n1)))) -> n1
% collapsed.
% Rule [111] add(multiply(multiply(Y,inverse(Y)),X),inverse(n1)) -> inverse(n1)
% collapsed.
% Current number of equations to process: 304
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced : [128] multiply(n1,X) -> X
% Rule [11] multiply(n1,inverse(X)) -> inverse(X) collapsed.
% Rule [17] add(inverse(X),add(multiply(n1,X),multiply(inverse(X),X))) -> n1
% collapsed.
% Rule [24] add(multiply(Y,X),multiply(n1,X)) -> X collapsed.
% Rule [30] add(multiply(b,X),multiply(n1,X)) -> X collapsed.
% Rule [108] add(X,multiply(n1,X)) -> X collapsed.
% Rule [119] multiply(multiply(n1,X),X) -> X collapsed.
% Current number of equations to process: 306
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced : [129] add(multiply(Y,X),X) -> X
% Rule [31] add(multiply(X,inverse(Y)),inverse(Y)) -> inverse(Y) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 305
% Current number of ordered equations: 0
% Current number of rules: 27
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 5 rules have been used:
% [5]
% multiply(add(X,Y),Y) -> Y; trace = in the starting set
% [6] multiply(X,add(Y,Z)) -> add(multiply(Y,X),multiply(Z,X)); trace = in the starting set
% [13] add(multiply(X,inverse(X)),multiply(Y,n1)) -> Y; trace = in the starting set
% [20] add(Y,n1) <-> add(b,n1); trace = Cp of 13 and 5
% [129] add(multiply(Y,X),X) -> X; trace = Cp of 20 and 6
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.150000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------