TSTP Solution File: GRP495-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP495-1 : TPTP v6.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n095.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:23:18 EDT 2014
% Result : Unsatisfiable 1.27s
% Output : Refutation 1.27s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP495-1 : TPTP v6.0.0. Released v2.6.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n095.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 14:26:48 CDT 2014
% % CPUTime : 1.27
% Processing problem /tmp/CiME_65140_n095.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " c3,b3,a3,identity : constant; inverse : 1; multiply : 2; double_divide : 2;";
% let X = vars "A B C";
% let Axioms = equations F X "
% double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B;
% multiply(A,B) = double_divide(double_divide(B,A),identity);
% inverse(A) = double_divide(A,identity);
% identity = double_divide(A,inverse(A));
% ";
%
% let s1 = status F "
% c3 lr_lex;
% b3 lr_lex;
% a3 lr_lex;
% inverse lr_lex;
% multiply lr_lex;
% double_divide lr_lex;
% identity lr_lex;
% ";
%
% let p1 = precedence F "
% multiply > double_divide > inverse > identity > a3 > b3 > c3";
%
% let s2 = status F "
% c3 mul;
% b3 mul;
% a3 mul;
% inverse mul;
% multiply mul;
% double_divide mul;
% identity mul;
% ";
%
% let p2 = precedence F "
% multiply > double_divide > inverse > identity = a3 = b3 = c3";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3));"
% ;
% (*
% 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 = { double_divide(double_divide(identity,A),
% double_divide(double_divide(double_divide(B,C),
% double_divide(identity,identity)),
% double_divide(A,C))) = B,
% multiply(A,B) =
% double_divide(double_divide(B,A),identity),
% inverse(A) = double_divide(A,identity),
% identity = double_divide(A,inverse(A)) }
% (4 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 = { multiply(multiply(a3,b3),c3) =
% multiply(a3,multiply(b3,c3)) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] double_divide(A,identity) -> inverse(A)
% Current number of equations to process: 2
% Current number of ordered equations: 1
% Current number of rules: 1
% New rule produced : [2] double_divide(A,inverse(A)) -> identity
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 2
% New rule produced : [3] multiply(A,B) -> inverse(double_divide(B,A))
% The conjecture has been reduced.
% Conjecture is now:
% inverse(double_divide(c3,inverse(double_divide(b3,a3)))) = inverse(double_divide(
% inverse(
% double_divide(c3,b3)),a3))
%
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced :
% [4]
% double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),
% inverse(identity)),
% double_divide(A,C))) -> B
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5]
% double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,
% inverse(B))))
% -> B
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] double_divide(double_divide(identity,A),inverse(identity)) -> A
% Current number of equations to process: 8
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7]
% double_divide(inverse(identity),double_divide(identity,double_divide(identity,
% inverse(A)))) -> A
% Current number of equations to process: 7
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8]
% double_divide(identity,double_divide(identity,double_divide(inverse(identity),
% inverse(A)))) -> A
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9]
% double_divide(double_divide(identity,A),double_divide(double_divide(inverse(B),
% inverse(identity)),
% inverse(A))) -> B
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% double_divide(double_divide(identity,A),inverse(double_divide(double_divide(B,
% inverse(A)),
% inverse(identity)))) -> B
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [11] inverse(identity) -> identity
% Rule
% [4]
% double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),
% inverse(identity)),
% double_divide(A,C))) -> B collapsed.
% Rule [6] double_divide(double_divide(identity,A),inverse(identity)) -> A
% collapsed.
% Rule
% [7]
% double_divide(inverse(identity),double_divide(identity,double_divide(identity,
% inverse(A)))) -> A
% collapsed.
% Rule
% [8]
% double_divide(identity,double_divide(identity,double_divide(inverse(identity),
% inverse(A)))) -> A collapsed.
% Rule
% [9]
% double_divide(double_divide(identity,A),double_divide(double_divide(inverse(B),
% inverse(identity)),
% inverse(A))) -> B collapsed.
% Rule
% [10]
% double_divide(double_divide(identity,A),inverse(double_divide(double_divide(B,
% inverse(A)),
% inverse(identity)))) -> B
% collapsed.
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [12]
% double_divide(double_divide(identity,A),double_divide(inverse(double_divide(B,C)),
% double_divide(A,C))) -> B
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [13] inverse(double_divide(identity,A)) -> A
% Current number of equations to process: 10
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [14]
% double_divide(identity,double_divide(identity,double_divide(identity,
% inverse(A)))) -> A
% Current number of equations to process: 9
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [15]
% double_divide(double_divide(identity,A),double_divide(identity,inverse(A)))
% -> identity
% Current number of equations to process: 8
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [16]
% double_divide(double_divide(identity,A),double_divide(inverse(inverse(B)),
% inverse(A))) -> B
% Current number of equations to process: 7
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [17]
% double_divide(double_divide(identity,A),inverse(inverse(double_divide(B,
% inverse(A))))) -> B
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [18] double_divide(double_divide(identity,A),A) -> identity
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [19]
% double_divide(double_divide(identity,A),double_divide(B,double_divide(A,B)))
% -> identity
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [20]
% double_divide(identity,double_divide(inverse(double_divide(A,B)),double_divide(identity,B)))
% -> A
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [21]
% double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,B)))
% -> double_divide(identity,B)
% Rule
% [5]
% double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,
% inverse(B))))
% -> B collapsed.
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [22] double_divide(identity,inverse(B)) -> B
% Rule
% [14]
% double_divide(identity,double_divide(identity,double_divide(identity,
% inverse(A)))) -> A collapsed.
% Rule
% [15]
% double_divide(double_divide(identity,A),double_divide(identity,inverse(A)))
% -> identity collapsed.
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [23] double_divide(identity,double_divide(identity,A)) -> A
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [24] inverse(inverse(A)) -> A
% Rule
% [16]
% double_divide(double_divide(identity,A),double_divide(inverse(inverse(B)),
% inverse(A))) -> B collapsed.
% Rule
% [17]
% double_divide(double_divide(identity,A),inverse(inverse(double_divide(B,
% inverse(A))))) -> B
% collapsed.
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [25]
% double_divide(double_divide(identity,A),double_divide(B,inverse(A))) -> B
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [26] double_divide(A,double_divide(B,A)) -> B
% Rule
% [19]
% double_divide(double_divide(identity,A),double_divide(B,double_divide(A,B)))
% -> identity collapsed.
% Current number of equations to process: 11
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [27]
% double_divide(inverse(double_divide(A,B)),double_divide(identity,B)) ->
% inverse(A)
% Rule
% [20]
% double_divide(identity,double_divide(inverse(double_divide(A,B)),double_divide(identity,B)))
% -> A collapsed.
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [28] double_divide(identity,A) -> inverse(A)
% Rule
% [12]
% double_divide(double_divide(identity,A),double_divide(inverse(double_divide(B,C)),
% double_divide(A,C))) -> B collapsed.
% Rule [13] inverse(double_divide(identity,A)) -> A collapsed.
% Rule [18] double_divide(double_divide(identity,A),A) -> identity collapsed.
% Rule
% [21]
% double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,B)))
% -> double_divide(identity,B) collapsed.
% Rule [22] double_divide(identity,inverse(B)) -> B collapsed.
% Rule [23] double_divide(identity,double_divide(identity,A)) -> A collapsed.
% Rule
% [25]
% double_divide(double_divide(identity,A),double_divide(B,inverse(A))) -> B
% collapsed.
% Rule
% [27]
% double_divide(inverse(double_divide(A,B)),double_divide(identity,B)) ->
% inverse(A) collapsed.
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [29]
% double_divide(inverse(A),double_divide(inverse(double_divide(B,C)),double_divide(A,C)))
% -> B
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [30] double_divide(inverse(A),A) -> identity
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [31] double_divide(double_divide(A,B),A) -> B
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [32] double_divide(inverse(A),inverse(double_divide(A,B))) -> inverse(B)
% Current number of equations to process: 17
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [33] double_divide(inverse(double_divide(A,B)),inverse(B)) -> inverse(A)
% Current number of equations to process: 16
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [34] inverse(double_divide(B,A)) <-> double_divide(inverse(A),inverse(B))
% The conjecture has been reduced.
% Conjecture is now:
% inverse(double_divide(c3,inverse(double_divide(b3,a3)))) = double_divide(
% inverse(a3),
% double_divide(c3,b3))
%
% Current number of equations to process: 26
% Current number of ordered equations: 1
% Current number of rules: 13
% New rule produced :
% [35] double_divide(inverse(A),inverse(B)) <-> inverse(double_divide(B,A))
% Rule [33] double_divide(inverse(double_divide(A,B)),inverse(B)) -> inverse(A)
% collapsed.
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [36] double_divide(A,inverse(double_divide(inverse(A),B))) -> inverse(B)
% Current number of equations to process: 25
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [37] inverse(double_divide(inverse(A),inverse(B))) <-> double_divide(B,A)
% Current number of equations to process: 27
% Current number of ordered equations: 1
% Current number of rules: 15
% New rule produced :
% [38] double_divide(B,A) <-> inverse(double_divide(inverse(A),inverse(B)))
% Rule [31] double_divide(double_divide(A,B),A) -> B collapsed.
% Current number of equations to process: 27
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [39] inverse(double_divide(B,inverse(A))) <-> double_divide(A,inverse(B))
% Current number of equations to process: 31
% Current number of ordered equations: 3
% Current number of rules: 16
% New rule produced :
% [40] inverse(double_divide(inverse(B),A)) <-> double_divide(inverse(A),B)
% Current number of equations to process: 31
% Current number of ordered equations: 2
% Current number of rules: 17
% New rule produced :
% [41] double_divide(A,inverse(B)) <-> inverse(double_divide(B,inverse(A)))
% Current number of equations to process: 31
% Current number of ordered equations: 1
% Current number of rules: 18
% New rule produced :
% [42] double_divide(inverse(A),B) <-> inverse(double_divide(inverse(B),A))
% Current number of equations to process: 31
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [43]
% double_divide(double_divide(A,B),double_divide(inverse(B),inverse(A))) ->
% identity
% Current number of equations to process: 33
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [44]
% double_divide(double_divide(inverse(A),inverse(B)),double_divide(B,A)) ->
% identity
% Current number of equations to process: 32
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [45]
% double_divide(double_divide(A,inverse(B)),double_divide(B,inverse(A))) ->
% identity
% Current number of equations to process: 83
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [46]
% double_divide(double_divide(inverse(A),B),double_divide(inverse(B),A)) ->
% identity
% Current number of equations to process: 82
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [47]
% double_divide(inverse(double_divide(A,C)),double_divide(B,C)) ->
% double_divide(A,inverse(B))
% Rule
% [29]
% double_divide(inverse(A),double_divide(inverse(double_divide(B,C)),double_divide(A,C)))
% -> B collapsed.
% Current number of equations to process: 79
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [48]
% inverse(double_divide(C,B)) <->
% double_divide(double_divide(A,B),double_divide(C,inverse(A)))
% Current number of equations to process: 141
% Current number of ordered equations: 3
% Current number of rules: 24
% New rule produced :
% [49]
% double_divide(C,inverse(B)) <->
% double_divide(inverse(A),double_divide(B,double_divide(A,C)))
% Current number of equations to process: 141
% Current number of ordered equations: 2
% Current number of rules: 25
% New rule produced :
% [50]
% double_divide(inverse(A),double_divide(B,double_divide(A,C))) <->
% double_divide(C,inverse(B))
% Current number of equations to process: 141
% Current number of ordered equations: 1
% Current number of rules: 26
% New rule produced :
% [51]
% double_divide(double_divide(A,B),double_divide(C,inverse(A))) <->
% inverse(double_divide(C,B))
% Rule
% [43]
% double_divide(double_divide(A,B),double_divide(inverse(B),inverse(A))) ->
% identity collapsed.
% Rule
% [45]
% double_divide(double_divide(A,inverse(B)),double_divide(B,inverse(A))) ->
% identity collapsed.
% Current number of equations to process: 141
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [52]
% double_divide(inverse(A),double_divide(B,C)) <->
% double_divide(double_divide(C,A),inverse(B))
% Current number of equations to process: 198
% Current number of ordered equations: 1
% Current number of rules: 26
% New rule produced :
% [53]
% double_divide(double_divide(C,A),inverse(B)) <->
% double_divide(inverse(A),double_divide(B,C))
% Current number of equations to process: 198
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [54]
% inverse(double_divide(B,double_divide(A,C))) <->
% double_divide(A,double_divide(B,inverse(C)))
% Current number of equations to process: 218
% Current number of ordered equations: 1
% Current number of rules: 28
% New rule produced :
% [55]
% double_divide(A,double_divide(B,inverse(C))) <->
% inverse(double_divide(B,double_divide(A,C)))
% Current number of equations to process: 218
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [56]
% double_divide(A,double_divide(B,C)) <->
% double_divide(double_divide(C,inverse(A)),inverse(B))
% Current number of equations to process: 369
% Current number of ordered equations: 1
% Current number of rules: 30
% New rule produced :
% [57]
% double_divide(double_divide(C,inverse(A)),inverse(B)) <->
% double_divide(A,double_divide(B,C))
% Current number of equations to process: 369
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [58]
% double_divide(inverse(B),double_divide(inverse(C),A)) <->
% double_divide(double_divide(A,B),C)
% Current number of equations to process: 387
% Current number of ordered equations: 1
% Current number of rules: 32
% New rule produced :
% [59]
% double_divide(double_divide(A,B),C) <->
% double_divide(inverse(B),double_divide(inverse(C),A))
% Current number of equations to process: 387
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced :
% [60]
% inverse(double_divide(A,double_divide(B,inverse(C)))) <->
% double_divide(B,double_divide(A,C))
% Current number of equations to process: 386
% Current number of ordered equations: 1
% Current number of rules: 34
% New rule produced :
% [61]
% double_divide(B,double_divide(A,C)) <->
% inverse(double_divide(A,double_divide(B,inverse(C))))
% Rule
% [44]
% double_divide(double_divide(inverse(A),inverse(B)),double_divide(B,A)) ->
% identity collapsed.
% Rule
% [46]
% double_divide(double_divide(inverse(A),B),double_divide(inverse(B),A)) ->
% identity collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 386
% Current number of ordered equations: 0
% Current number of rules: 33
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 19 rules have been used:
% [1]
% double_divide(A,identity) -> inverse(A); trace = in the starting set
% [2] double_divide(A,inverse(A)) -> identity; trace = in the starting set
% [3] multiply(A,B) -> inverse(double_divide(B,A)); trace = in the starting set
% [4] double_divide(double_divide(identity,A),double_divide(double_divide(
% double_divide(B,C),
% inverse(identity)),
% double_divide(A,C))) -> B; trace = in the starting set
% [5] double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,
% inverse(B))))
% -> B; trace = Cp of 4 and 2
% [12] double_divide(double_divide(identity,A),double_divide(inverse(double_divide(B,C)),
% double_divide(A,C))) -> B; trace = in the starting set
% [13] inverse(double_divide(identity,A)) -> A; trace = Cp of 5 and 2
% [16] double_divide(double_divide(identity,A),double_divide(inverse(inverse(B)),
% inverse(A))) -> B; trace = Cp of 4 and 1
% [18] double_divide(double_divide(identity,A),A) -> identity; trace = Cp of 13 and 2
% [24] inverse(inverse(A)) -> A; trace = Cp of 16 and 1
% [26] double_divide(A,double_divide(B,A)) -> B; trace = Cp of 18 and 12
% [29] double_divide(inverse(A),double_divide(inverse(double_divide(B,C)),
% double_divide(A,C))) -> B; trace = in the starting set
% [31] double_divide(double_divide(A,B),A) -> B; trace = Self cp of 26
% [32] double_divide(inverse(A),inverse(double_divide(A,B))) -> inverse(B); trace = Cp of 13 and 5
% [34] inverse(double_divide(B,A)) <-> double_divide(inverse(A),inverse(B)); trace = Cp of 32 and 26
% [47] double_divide(inverse(double_divide(A,C)),double_divide(B,C)) ->
% double_divide(A,inverse(B)); trace = Cp of 31 and 29
% [51] double_divide(double_divide(A,B),double_divide(C,inverse(A))) <->
% inverse(double_divide(C,B)); trace = Cp of 47 and 26
% [54] inverse(double_divide(B,double_divide(A,C))) <->
% double_divide(A,double_divide(B,inverse(C))); trace = Cp of 51 and 26
% [61] double_divide(B,double_divide(A,C)) <->
% inverse(double_divide(A,double_divide(B,inverse(C)))); trace = Cp of 54 and 24
% % 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
%------------------------------------------------------------------------------