%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : GRP532-1 : TPTP v6.0.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n035.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:25 EDT 2014
% Result : Unsatisfiable 1.16s
% Output : Refutation 1.16s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : GRP532-1 : TPTP v6.0.0. Bugfixed v2.7.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n035.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 17:15:43 CDT 2014
% % CPUTime : 1.16
% Processing problem /tmp/CiME_38288_n035.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b,a : constant; inverse : 1; multiply : 2; divide : 2;";
% let X = vars "A B C";
% let Axioms = equations F X "
% divide(divide(A,divide(B,C)),divide(A,B)) = C;
% multiply(A,B) = divide(A,divide(divide(C,C),B));
% inverse(A) = divide(divide(B,B),A);
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% inverse lr_lex;
% multiply lr_lex;
% divide lr_lex;
% ";
%
% let p1 = precedence F "
% multiply > inverse > divide > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% inverse mul;
% multiply mul;
% divide mul;
% ";
%
% let p2 = precedence F "
% multiply > inverse > divide > a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " multiply(a,b) = multiply(b,a);"
% ;
% (*
% 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 = { divide(divide(A,divide(B,C)),divide(A,B)) = C,
% multiply(A,B) = divide(A,divide(divide(C,C),B)),
% inverse(A) = divide(divide(B,B),A) }
% (3 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(a,b) = multiply(b,a) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] inverse(A) <-> divide(divide(B,B),A)
% Current number of equations to process: 1
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] divide(divide(B,B),A) <-> divide(divide(b,b),A)
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 2
% New rule produced : [3] divide(divide(b,b),A) <-> divide(divide(B,B),A)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 3
% New rule produced : [4] multiply(A,B) <-> divide(A,divide(divide(C,C),B))
% The conjecture has been reduced.
% Conjecture is now:
% divide(a,divide(divide(b,b),b)) = divide(b,divide(divide(b,b),a))
%
% Current number of equations to process: 2
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced : [5] divide(divide(A,divide(B,C)),divide(A,B)) -> C
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced : [6] divide(A,divide(divide(B,divide(C,A)),B)) -> C
% Current number of equations to process: 9
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [7] divide(A,A) <-> divide(b,b)
% Rule [2] divide(divide(B,B),A) <-> divide(divide(b,b),A) collapsed.
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [8] divide(divide(A,A),divide(b,b)) -> divide(b,b)
% Current number of equations to process: 24
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [9] divide(divide(b,b),divide(divide(A,B),A)) -> B
% Current number of equations to process: 28
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [10] divide(A,divide(b,b)) -> A
% Rule [8] divide(divide(A,A),divide(b,b)) -> divide(b,b) collapsed.
% Current number of equations to process: 39
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [11] divide(A,divide(A,b)) -> b
% Current number of equations to process: 41
% Current number of ordered equations: 1
% Current number of rules: 9
% New rule produced : [12] divide(b,divide(b,A)) -> A
% Current number of equations to process: 41
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [13] divide(b,divide(A,A)) -> b
% Current number of equations to process: 42
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [14] divide(divide(b,b),divide(A,A)) -> divide(b,b)
% Current number of equations to process: 55
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced : [15] divide(B,b) <-> divide(divide(A,b),divide(A,B))
% Current number of equations to process: 55
% Current number of ordered equations: 1
% Current number of rules: 13
% New rule produced : [16] divide(divide(A,b),divide(A,B)) <-> divide(B,b)
% Current number of equations to process: 55
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [17] divide(divide(A,B),divide(A,b)) -> divide(b,B)
% Current number of equations to process: 53
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [18] divide(divide(B,divide(A,b)),B) -> divide(b,A)
% Current number of equations to process: 52
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [19] divide(divide(b,b),divide(A,b)) -> divide(b,A)
% Current number of equations to process: 51
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [20] divide(divide(A,A),divide(B,B)) -> divide(b,b)
% Rule [14] divide(divide(b,b),divide(A,A)) -> divide(b,b) collapsed.
% Current number of equations to process: 50
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [21] divide(divide(A,A),b) <-> divide(divide(B,b),B)
% Current number of equations to process: 50
% Current number of ordered equations: 1
% Current number of rules: 18
% New rule produced : [22] divide(divide(B,b),B) <-> divide(divide(A,A),b)
% Current number of equations to process: 50
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced : [23] divide(B,b) <-> divide(divide(A,A),divide(b,B))
% Current number of equations to process: 59
% Current number of ordered equations: 1
% Current number of rules: 20
% New rule produced : [24] divide(divide(A,A),divide(b,B)) <-> divide(B,b)
% Current number of equations to process: 59
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced : [25] divide(divide(A,B),divide(b,B)) -> divide(A,b)
% Current number of equations to process: 65
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced : [26] divide(divide(b,b),A) <-> divide(divide(b,A),b)
% Current number of equations to process: 67
% Current number of ordered equations: 1
% Current number of rules: 23
% New rule produced : [27] divide(divide(b,A),b) <-> divide(divide(b,b),A)
% Current number of equations to process: 67
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [28] divide(divide(A,A),divide(B,b)) -> divide(b,B)
% Rule [19] divide(divide(b,b),divide(A,b)) -> divide(b,A) collapsed.
% Current number of equations to process: 86
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [29] divide(A,divide(B,divide(b,A))) <-> divide(b,B)
% Current number of equations to process: 89
% Current number of ordered equations: 1
% Current number of rules: 25
% New rule produced : [30] divide(b,B) <-> divide(A,divide(B,divide(b,A)))
% Current number of equations to process: 89
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced : [31] divide(divide(b,A),divide(B,A)) -> divide(b,B)
% Current number of equations to process: 97
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced : [32] divide(C,C) <-> divide(A,divide(A,divide(B,B)))
% Current number of equations to process: 99
% Current number of ordered equations: 1
% Current number of rules: 28
% New rule produced : [33] divide(A,divide(A,divide(B,B))) <-> divide(C,C)
% Current number of equations to process: 99
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced : [34] divide(divide(B,B),b) <-> divide(divide(A,A),b)
% Current number of equations to process: 99
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [35] divide(divide(A,A),B) <-> divide(divide(b,B),b)
% Rule [26] divide(divide(b,b),A) <-> divide(divide(b,A),b) collapsed.
% Current number of equations to process: 136
% Current number of ordered equations: 1
% Current number of rules: 30
% New rule produced : [36] divide(divide(b,B),b) <-> divide(divide(A,A),B)
% Rule [27] divide(divide(b,A),b) <-> divide(divide(b,b),A) collapsed.
% Current number of equations to process: 136
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [37] divide(B,A) <-> divide(divide(b,A),divide(b,B))
% Current number of equations to process: 146
% Current number of ordered equations: 1
% Current number of rules: 31
% New rule produced : [38] divide(divide(b,A),divide(b,B)) <-> divide(B,A)
% Current number of equations to process: 146
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced : [39] divide(divide(b,A),divide(B,B)) -> divide(b,A)
% Current number of equations to process: 155
% Current number of ordered equations: 0
% Current number of rules: 33
% New rule produced : [40] divide(A,divide(B,b)) <-> divide(b,divide(B,A))
% Rule [17] divide(divide(A,B),divide(A,b)) -> divide(b,B) collapsed.
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 173
% Current number of ordered equations: 1
% Current number of rules: 33
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 13 rules have been used:
% [2]
% divide(divide(B,B),A) <-> divide(divide(b,b),A); trace = in the starting set
% [4] multiply(A,B) <-> divide(A,divide(divide(C,C),B)); trace = in the starting set
% [5] divide(divide(A,divide(B,C)),divide(A,B)) -> C; trace = in the starting set
% [6] divide(A,divide(divide(B,divide(C,A)),B)) -> C; trace = Self cp of 5
% [9] divide(divide(b,b),divide(divide(A,B),A)) -> B; trace = Cp of 5 and 2
% [10] divide(A,divide(b,b)) -> A; trace = Cp of 9 and 6
% [11] divide(A,divide(A,b)) -> b; trace = Cp of 10 and 5
% [12] divide(b,divide(b,A)) -> A; trace = Cp of 10 and 5
% [16] divide(divide(A,b),divide(A,B)) <-> divide(B,b); trace = Cp of 11 and 5
% [18] divide(divide(B,divide(A,b)),B) -> divide(b,A); trace = Cp of 12 and 6
% [25] divide(divide(A,B),divide(b,B)) -> divide(A,b); trace = Cp of 16 and 6
% [29] divide(A,divide(B,divide(b,A))) <-> divide(b,B); trace = Cp of 18 and 5
% [40] divide(A,divide(B,b)) <-> divide(b,divide(B,A)); trace = Cp of 29 and 25
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.050000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------