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

% Computer : n135.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:38:53 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SYN083-1 : TPTP v6.0.0. Released v1.0.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n135.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 01:41:08 CDT 2014
% % CPUTime: 1.12 
% Processing problem /tmp/CiME_41488_n135.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " d,c,b,a : constant;  f : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% f(f(X,Y),Z) = f(X,f(Y,Z));
% ";
% 
% let s1 = status F "
% d lr_lex;
% c lr_lex;
% b lr_lex;
% a lr_lex;
% f lr_lex;
% ";
% 
% let p1 = precedence F "
% f > a > b > c > d";
% 
% let s2 = status F "
% d mul;
% c mul;
% b mul;
% a mul;
% f mul;
% ";
% 
% let p2 = precedence F "
% f > a = b = c = d";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X " f(a,f(b,f(c,d))) = f(f(f(a,b),c),d);"
% ;
% (*
% 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 = { f(f(X,Y),Z) = f(X,f(Y,Z)) } (1 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 = { f(a,f(b,f(c,d))) = f(f(f(a,b),c),d) }
% (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] f(f(X,Y),Z) -> f(X,f(Y,Z))
% The conjecture has been reduced. 
% Conjecture is now:
% Trivial
% 
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 1
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
% 
% The following 1 rules have been used:
% [1] 
% f(f(X,Y),Z) -> f(X,f(Y,Z)); trace = in the starting set
% % 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
%------------------------------------------------------------------------------