%------------------------------------------------------------------------------
% File     : CiME---2.01
% Problem  : GRP466-1 : TPTP v6.0.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_cime %s

% Computer : n034.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 16127.75MB
% OS       : Linux 2.6.32-431.11.2.el6.x86_64
% CPULimit : 300s
% DateTime : Tue Jun 10 00:23:13 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : GRP466-1 : TPTP v6.0.0. Released v2.6.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n034.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 16127.75MB
% % OS       : Linux 2.6.32-431.11.2.el6.x86_64
% % CPULimit : 300
% % DateTime : Fri Jun  6 14:00:28 CDT 2014
% % CPUTime  : 1.11 
% Processing problem /tmp/CiME_38254_n034.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b1,a1 : constant;  multiply : 2;  inverse : 1;  divide : 2;";
% let X = vars "A B C D";
% let Axioms = equations F X "
% divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C;
% multiply(A,B) = divide(A,inverse(B));
% ";
% 
% let s1 = status F "
% b1 lr_lex;
% a1 lr_lex;
% multiply lr_lex;
% inverse lr_lex;
% divide lr_lex;
% ";
% 
% let p1 = precedence F "
% multiply > divide > inverse > a1 > b1";
% 
% let s2 = status F "
% b1 mul;
% a1 mul;
% multiply mul;
% inverse mul;
% divide mul;
% ";
% 
% let p2 = precedence F "
% multiply > divide > inverse > a1 = b1";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X " multiply(inverse(a1),a1) = multiply(inverse(b1),b1);"
% ;
% (*
% 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,A),divide(B,divide(divide(C,
% divide(D,B)),
% inverse(D)))) = C,
% multiply(A,B) = divide(A,inverse(B)) }
% (2 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(inverse(a1),a1) =
% multiply(inverse(b1),b1) } (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] multiply(A,B) -> divide(A,inverse(B))
% The conjecture has been reduced. 
% Conjecture is now:
% divide(inverse(a1),inverse(a1)) = divide(inverse(b1),inverse(b1))
% 
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 1
% New rule produced :
% [2]
% divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) -> C
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 2
% New rule produced :
% [3]
% divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,
% inverse(D))))
% <-> divide(V_4,V_4)
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced : [4] divide(b1,b1) <-> divide(V_4,V_4)
% Current number of equations to process: 1
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced : [5] divide(V_4,V_4) <-> divide(b1,b1)
% The conjecture has been reduced. 
% Conjecture is now:
% Trivial
% 
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 5
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
% 
% The following 3 rules have been used:
% [1] 
% multiply(A,B) -> divide(A,inverse(B)); trace = in the starting set
% [2] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) ->
% C; trace = in the starting set
% [5] divide(V_4,V_4) <-> divide(b1,b1); trace = Self cp of 2
% % SZS output end Refutation
% All conjectures have been proven
% 
% Execution time: 0.000000 sec
% res : bool = true
% time is now off
% 
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
% 
% EOF
%------------------------------------------------------------------------------