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

% Computer : n134.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:32:02 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  : ROB030-1 : TPTP v6.0.0. Released v3.1.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n134.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 17:03:53 CDT 2014
% % CPUTime  : 1.12 
% Processing problem /tmp/CiME_5748_n134.star.cs.uiowa.edu
% #verbose 1;
% let F = signature "  add : AC; d,c : constant;  negate : 1;";
% let X = vars "X Y Z A B";
% let Axioms = equations F X "
% negate(negate(X add Y) add negate(X add negate(Y))) = X;
% c add d = d;
% ";
% 
% let s1 = status F "
% d lr_lex;
% c lr_lex;
% negate lr_lex;
% add mul;
% ";
% 
% let p1 = precedence F "
% negate > add > c > d";
% 
% let s2 = status F "
% d mul;
% c mul;
% negate mul;
% add mul;
% ";
% 
% let p2 = precedence F "
% negate > add > c = d";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X " negate(A add B) = negate(B);"
% ;
% (*
% 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 = { negate(negate(negate(Y) add X) add negate(
% X add Y)) = X,
% d add c = d } (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 = { negate(A add B) = negate(B) }
% (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] (eq)(X,X) -> (true)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] d add c -> d
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 2
% New rule produced : [3] (eq)(negate(A add B),negate(B)) -> (false)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced :
% [4] negate(negate(negate(Y) add X) add negate(X add Y)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% Rule [3] (eq)(negate(A add B),negate(B)) -> (false) is composed into 
% [3] (eq)(negate(A add B),negate(B)) -> (true)
% New rule produced : [5] (false) -> (true)
% The conjecture has been reduced. 
% Conjecture is now:
% Trivial
% 
% Current number of equations to process: 4
% 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:
% [2] 
% d add c -> d; trace = in the starting set
% [3] (eq)(negate(A add B),negate(B)) -> (false); trace = in the starting set
% [5] (false) -> (true); trace = Cp of 3 and 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
%------------------------------------------------------------------------------