TSTP Solution File: BOO017-2 by CiME---2.01

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CiME---2.01
% Problem  : BOO017-2 : TPTP v6.0.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_cime %s

% Computer : n137.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:11 EDT 2014

% Result   : Unsatisfiable 1.18s
% Output   : Refutation 1.18s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : BOO017-2 : TPTP v6.0.0. Released v1.0.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n137.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:36:28 CDT 2014
% % CPUTime  : 1.18 
% Processing problem /tmp/CiME_20594_n137.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " multiply,add : infix commutative; z,y,x,additive_identity,multiplicative_identity : constant;  inverse : 1;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% (X multiply Y) add Z = (X add Z) multiply (Y add Z);
% X add (Y multiply Z) = (X add Y) multiply (X add Z);
% (X add Y) multiply Z = (X multiply Z) add (Y multiply Z);
% X multiply (Y add Z) = (X multiply Y) add (X multiply Z);
% X add inverse(X) = multiplicative_identity;
% inverse(X) add X = multiplicative_identity;
% X multiply inverse(X) = additive_identity;
% inverse(X) multiply X = additive_identity;
% X multiply multiplicative_identity = X;
% multiplicative_identity multiply X = X;
% X add additive_identity = X;
% additive_identity add X = X;
% x add y = z;
% ";
% 
% let s1 = status F "
% z lr_lex;
% y lr_lex;
% x lr_lex;
% additive_identity lr_lex;
% multiplicative_identity lr_lex;
% inverse lr_lex;
% multiply mul;
% add mul;
% ";
% 
% let p1 = precedence F "
% add > multiply > inverse > multiplicative_identity > additive_identity > x > y > z";
% 
% let s2 = status F "
% z mul;
% y mul;
% x mul;
% additive_identity mul;
% multiplicative_identity mul;
% inverse mul;
% multiply mul;
% add mul;
% ";
% 
% let p2 = precedence F "
% add > multiply > inverse > multiplicative_identity = additive_identity = x = y = z";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X " x multiply z = x;"
% ;
% (*
% 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 = { (X multiply Y) add Z =
% (X add Z) multiply (Y add Z),
% (Y multiply Z) add X =
% (X add Y) multiply (X add Z),
% (X add Y) multiply Z =
% (X multiply Z) add (Y multiply Z),
% (Y add Z) multiply X =
% (X multiply Y) add (X multiply Z),
% inverse(X) add X = multiplicative_identity,
% inverse(X) add X = multiplicative_identity,
% inverse(X) multiply X = additive_identity,
% inverse(X) multiply X = additive_identity,
% multiplicative_identity multiply X = X,
% multiplicative_identity multiply X = X,
% additive_identity add X = X,
% additive_identity add X = X,
% y add x = z } (13 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 = { z multiply x = x } (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] multiplicative_identity multiply X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 1
% New rule produced : [2] additive_identity add X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 2
% New rule produced : [3] y add x -> z
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 3
% New rule produced : [4] inverse(X) multiply X -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 4
% New rule produced : [5] inverse(X) add X -> multiplicative_identity
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 5
% New rule produced : [6] (X add Z) multiply (Y add Z) -> (X multiply Y) add Z
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 6
% New rule produced :
% [7] (Y add Z) multiply X -> (X multiply Y) add (X multiply Z)
% Rule [6] (X add Z) multiply (Y add Z) -> (X multiply Y) add Z collapsed.
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [8]
% ((X multiply Y) add (X multiply Z)) add ((Y multiply Z) add (Z multiply Z))
% -> (X multiply Y) add Z
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [9] inverse(multiplicative_identity) -> additive_identity
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [10] inverse(additive_identity) -> multiplicative_identity
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [11] (inverse(Y) multiply X) add (X multiply Y) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [12] (additive_identity multiply Y) add (X multiply Y) -> X multiply Y
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [13] (y multiply X) add (x multiply X) -> z multiply X
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [14]
% (inverse(X add Y) multiply X) add (inverse(X add Y) multiply Y) ->
% additive_identity
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced : [15] (X multiply X) add Y <-> (Y multiply Y) add X
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [16] (inverse(X) multiply Y) add X -> (X multiply X) add Y
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [17] (X multiply Y) add inverse(X) <-> (inverse(X) multiply inverse(X)) add Y
% Current number of equations to process: 11
% Current number of ordered equations: 1
% Current number of rules: 16
% New rule produced :
% [18] (inverse(X) multiply inverse(X)) add Y <-> (X multiply Y) add inverse(X)
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [19]
% ((X multiply Y) add Y) add (multiplicative_identity add X) ->
% (X multiply Y) add multiplicative_identity
% Current number of equations to process: 9
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [20] ((X multiply X) add X) add ((X multiply Y) add Y) -> X add Y
% Current number of equations to process: 5
% Current number of ordered equations: 2
% Current number of rules: 19
% New rule produced :
% [21] ((X multiply X) add (X multiply Y)) add (X add Y) -> X add Y
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [22] (X multiply Y) add ((inverse(X) multiply Y) add (Y multiply Y)) -> Y
% Current number of equations to process: 3
% Current number of ordered equations: 1
% Current number of rules: 21
% New rule produced :
% [23] (inverse(X) multiply Y) add ((X multiply Y) add (Y multiply Y)) -> Y
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [24] (additive_identity multiply X) add X -> X
% Current number of equations to process: 10
% Current number of ordered equations: 0
% Current number of rules: 23
% Rule [17]
% (X multiply Y) add inverse(X) <-> (inverse(X) multiply inverse(X)) add Y is composed into 
% [17] (X multiply Y) add inverse(X) -> inverse(X) add Y
% Rule [16] (inverse(X) multiply Y) add X -> (X multiply X) add Y is composed into 
% [16] (inverse(X) multiply Y) add X -> X add Y
% New rule produced : [25] X multiply X -> X
% Rule
% [8]
% ((X multiply Y) add (X multiply Z)) add ((Y multiply Z) add (Z multiply Z))
% -> (X multiply Y) add Z collapsed.
% Rule [15] (X multiply X) add Y <-> (Y multiply Y) add X collapsed.
% Rule
% [18] (inverse(X) multiply inverse(X)) add Y <-> (X multiply Y) add inverse(X)
% collapsed.
% Rule [20] ((X multiply X) add X) add ((X multiply Y) add Y) -> X add Y
% collapsed.
% Rule [21] ((X multiply X) add (X multiply Y)) add (X add Y) -> X add Y
% collapsed.
% Rule
% [22] (X multiply Y) add ((inverse(X) multiply Y) add (Y multiply Y)) -> Y
% collapsed.
% Rule
% [23] (inverse(X) multiply Y) add ((X multiply Y) add (Y multiply Y)) -> Y
% collapsed.
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [26]
% ((X multiply Y) add (X multiply Z)) add ((Y multiply Z) add Z) ->
% (X multiply Y) add Z
% Current number of equations to process: 17
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced : [27] inverse(inverse(X)) multiply X -> X
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced : [28] inverse(inverse(X)) -> X
% Rule [27] inverse(inverse(X)) multiply X -> X collapsed.
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced : [29] additive_identity multiply X -> additive_identity
% Rule [12] (additive_identity multiply Y) add (X multiply Y) -> X multiply Y
% collapsed.
% Rule [24] (additive_identity multiply X) add X -> X collapsed.
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced : [30] x multiply inverse(y) -> z multiply inverse(y)
% Current number of equations to process: 17
% Current number of ordered equations: 1
% Current number of rules: 19
% New rule produced : [31] y multiply inverse(x) -> z multiply inverse(x)
% Current number of equations to process: 17
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [32] ((X multiply Y) add Y) add (X add X) -> X add Y
% Current number of equations to process: 18
% Current number of ordered equations: 1
% Current number of rules: 21
% New rule produced : [33] ((X multiply Y) add X) add (X add Y) -> X add Y
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [34] (X multiply Y) add ((inverse(X) multiply Y) add Y) -> Y
% Current number of equations to process: 16
% Current number of ordered equations: 1
% Current number of rules: 23
% New rule produced :
% [35] (inverse(X) multiply Y) add ((X multiply Y) add Y) -> Y
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [36]
% (inverse(multiplicative_identity add X) multiply X) add inverse(multiplicative_identity add X)
% -> additive_identity
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [37] multiplicative_identity add X -> multiplicative_identity
% Rule
% [19]
% ((X multiply Y) add Y) add (multiplicative_identity add X) ->
% (X multiply Y) add multiplicative_identity collapsed.
% Rule
% [36]
% (inverse(multiplicative_identity add X) multiply X) add inverse(multiplicative_identity add X)
% -> additive_identity collapsed.
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [38] X add X -> X
% Rule [32] ((X multiply Y) add Y) add (X add X) -> X add Y collapsed.
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [39] ((X multiply Y) add Y) add X -> X add Y
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced : [40] (y multiply x) add x -> z multiply x
% Current number of equations to process: 27
% Current number of ordered equations: 1
% Current number of rules: 26
% New rule produced : [41] (y multiply x) add y -> z multiply y
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [42] ((X multiply Y) add X) add ((X multiply Y) add Y) -> X add Y
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [43] (inverse(X) multiply Y) add ((X multiply Y) add X) -> X add Y
% Current number of equations to process: 34
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [44] (z multiply x) add (z multiply X) <-> (y multiply X) add x
% Current number of equations to process: 34
% Current number of ordered equations: 2
% Current number of rules: 30
% New rule produced :
% [45] (y multiply X) add x <-> (z multiply x) add (z multiply X)
% Rule [40] (y multiply x) add x -> z multiply x collapsed.
% Current number of equations to process: 34
% Current number of ordered equations: 1
% Current number of rules: 30
% New rule produced :
% [46] (x multiply X) add y -> (z multiply y) add (z multiply X)
% Rule [41] (y multiply x) add y -> z multiply y collapsed.
% Current number of equations to process: 34
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [47]
% ((X multiply Y) add (X multiply Z)) add inverse(X) ->
% (Y add Z) add inverse(X)
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [48]
% (X multiply Y) add ((inverse(X) multiply Y) add inverse(X)) ->
% inverse(X) add Y
% Current number of equations to process: 32
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced :
% [49]
% ((inverse(Z) multiply Y) multiply X) add ((Y multiply Z) multiply X) ->
% X multiply Y
% Current number of equations to process: 31
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [50]
% ((y multiply X) multiply Y) add ((x multiply X) multiply Y) ->
% (z multiply X) multiply Y
% Current number of equations to process: 30
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced :
% [51]
% ((inverse(X) multiply Y) add (inverse(X) multiply Z)) add X ->
% (Y add Z) add X
% Current number of equations to process: 28
% Current number of ordered equations: 1
% Current number of rules: 35
% New rule produced :
% [52]
% ((inverse(X) multiply Z) multiply Y) add (X multiply Y) ->
% (X multiply Y) add (Y multiply Z)
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced :
% [53]
% ((X multiply Z) multiply Y) add (inverse(X) multiply Y) ->
% (inverse(X) multiply Y) add (Y multiply Z)
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [54] (inverse(X add Y) multiply X) add Y -> (X multiply Y) add Y
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced :
% [55]
% (inverse(X add Y) multiply Z) add ((X multiply Z) add (Y multiply Z)) -> Z
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced :
% [56]
% ((X multiply Y) add (X multiply Z)) add inverse(Y add Z) ->
% inverse(Y add Z) add X
% Current number of equations to process: 25
% Current number of ordered equations: 0
% Current number of rules: 40
% Rule [54] (inverse(X add Y) multiply X) add Y -> (X multiply Y) add Y is composed into 
% [54] (inverse(X add Y) multiply X) add Y -> Y
% New rule produced : [57] (X multiply Y) add X -> X
% Rule
% [26]
% ((X multiply Y) add (X multiply Z)) add ((Y multiply Z) add Z) ->
% (X multiply Y) add Z collapsed.
% Rule [33] ((X multiply Y) add X) add (X add Y) -> X add Y collapsed.
% Rule [34] (X multiply Y) add ((inverse(X) multiply Y) add Y) -> Y collapsed.
% Rule [35] (inverse(X) multiply Y) add ((X multiply Y) add Y) -> Y collapsed.
% Rule [39] ((X multiply Y) add Y) add X -> X add Y collapsed.
% Rule [42] ((X multiply Y) add X) add ((X multiply Y) add Y) -> X add Y
% collapsed.
% Rule [43] (inverse(X) multiply Y) add ((X multiply Y) add X) -> X add Y
% collapsed.
% Rule
% [48]
% (X multiply Y) add ((inverse(X) multiply Y) add inverse(X)) ->
% inverse(X) add Y collapsed.
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [58] ((X multiply Y) add (X multiply Z)) add Z -> (X multiply Y) add Z
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 34
% New rule produced : [59] (X add Y) add X -> X add Y
% Current number of equations to process: 25
% Current number of ordered equations: 0
% Current number of rules: 35
% New rule produced : [60] z add y -> z
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 36
% New rule produced : [61] (z multiply inverse(y)) add (y multiply x) -> x
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 37
% New rule produced :
% [62] (z multiply inverse(y)) add inverse(x) -> inverse(y) add inverse(x)
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 38
% New rule produced : [63] z add x -> z
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 39
% New rule produced : [64] (z multiply inverse(x)) add (y multiply x) -> y
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 40
% New rule produced :
% [65] (z multiply inverse(x)) add inverse(y) -> inverse(y) add inverse(x)
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 41
% New rule produced :
% [66]
% (z multiply inverse(y)) add (inverse(y) multiply inverse(x)) -> inverse(y)
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 42
% New rule produced :
% [67]
% (z multiply inverse(x)) add (inverse(y) multiply inverse(x)) -> inverse(x)
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 43
% New rule produced : [68] (z multiply y) add x -> z
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 44
% Rule [45] (y multiply X) add x <-> (z multiply x) add (z multiply X) is composed into 
% [45] (y multiply X) add x -> (z multiply X) add x
% New rule produced : [69] z multiply x -> x
% Rule [44] (z multiply x) add (z multiply X) <-> (y multiply X) add x
% collapsed.
% The conjecture has been reduced. 
% Conjecture is now:
% Trivial
% 
% Current number of equations to process: 29
% Current number of ordered equations: 0
% Current number of rules: 44
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
% 
% The following 10 rules have been used:
% [2] 
% additive_identity add X -> X; trace = in the starting set
% [3] y add x -> z; trace = in the starting set
% [4] inverse(X) multiply X -> additive_identity; trace = in the starting set
% [7] (Y add Z) multiply X -> (X multiply Y) add (X multiply Z); trace = in the starting set
% [12] (additive_identity multiply Y) add (X multiply Y) -> X multiply Y; trace = Cp of 7 and 2
% [13] (y multiply X) add (x multiply X) -> z multiply X; trace = Cp of 7 and 3
% [26] ((X multiply Y) add (X multiply Z)) add ((Y multiply Z) add Z) ->
% (X multiply Y) add Z; trace = in the starting set
% [29] additive_identity multiply X -> additive_identity; trace = Cp of 12 and 4
% [44] (z multiply x) add (z multiply X) <-> (y multiply X) add x; trace = Cp of 26 and 13
% [69] z multiply x -> x; trace = Cp of 44 and 29
% % SZS output end Refutation
% All conjectures have been proven
% 
% Execution time: 0.080000 sec
% res : bool = true
% time is now off
% 
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
% 
% EOF
%------------------------------------------------------------------------------