%------------------------------------------------------------------------------
% File     : CiME---2.01
% Problem  : COL060-3 : TPTP v6.0.0. Bugfixed v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_cime %s

% Computer : n151.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:56 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  : COL060-3 : TPTP v6.0.0. Bugfixed v1.2.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n151.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 23:30:43 CDT 2014
% % CPUTime  : 1.11 
% Processing problem /tmp/CiME_35254_n151.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " z,y,x,t,b : constant;  apply : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z));
% apply(apply(t,X),Y) = apply(Y,X);
% ";
% 
% let s1 = status F "
% z lr_lex;
% y lr_lex;
% x lr_lex;
% t lr_lex;
% apply lr_lex;
% b lr_lex;
% ";
% 
% let p1 = precedence F "
% apply > b > t > x > y > z";
% 
% let s2 = status F "
% z mul;
% y mul;
% x mul;
% t mul;
% apply mul;
% b mul;
% ";
% 
% let p2 = precedence F "
% apply > b = t = 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 " apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,b)),b)),t),x),y),z) = apply(y,apply(x,z));"
% ;
% (*
% 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 = { apply(apply(apply(b,X),Y),Z) =
% apply(X,apply(Y,Z)),
% apply(apply(t,X),Y) = apply(Y,X) }
% (2 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
% 
% [z] = 1;
% [y] = 2;
% [x] = 3;
% [t] = 4;
% [b] = 5;
% [apply](x1,x2) = 1 + x1 + x2;
% Chosen ordering : KBO
% o_auto : F term_ordering = <term ordering>
% o : F term_ordering = <term ordering>
% Conjectures : (F,X) equations = { apply(apply(apply(apply(apply(b,apply(
% apply(b,
% apply(t,b)),b)),t),x),y),z)
% = apply(y,apply(x,z)) } (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] apply(apply(t,X),Y) -> apply(Y,X)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 1
% New rule produced : [2] apply(apply(apply(b,X),Y),Z) -> apply(X,apply(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: 2
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
% 
% The following 1 rules have been used:
% [2] 
% apply(apply(apply(b,X),Y),Z) -> apply(X,apply(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
%------------------------------------------------------------------------------