TSTP Solution File: HWC004-2 by CiME---2.01

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CiME---2.01
% Problem  : HWC004-2 : TPTP v6.0.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_cime %s

% Computer : n153.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:25:10 EDT 2014

% Result   : Satisfiable 1.10s
% Output   : Assurance 1.10s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : HWC004-2 : TPTP v6.0.0. Released v2.5.0.
% % Command  : tptp2X_and_run_cime %s
% % Computer : n153.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 15:26:28 CDT 2014
% % CPUTime  : 1.10 
% Processing problem /tmp/CiME_31392_n153.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " n1,n0 : constant;  not : 1;  or : 2;  and : 2;n0_and_n1_or_not__1, n0_and_n1_or_not__2 : 0;";
% let X = vars "X";
% let Axioms = equations F X "
% and(X,n0) = n0;
% and(X,n1) = X;
% or(X,n0) = X;
% or(X,n1) = n1;
% not(n0) = n1;
% not(n1) = n0;
% ";
% 
% let s1 = status F "
% not lr_lex;
% or lr_lex;
% n1 lr_lex;
% and lr_lex;
% n0 lr_lex;
% ";
% 
% let p1 = precedence F "
% and > or > not > n0 > n1 > n0_and_n1_or_not__1 > n0_and_n1_or_not__2";
% 
% let s2 = status F "
% not mul;
% or mul;
% n1 mul;
% and mul;
% n0 mul;
% ";
% 
% let p2 = precedence F "
% and > or > not > n0 = n1 > n0_and_n1_or_not__1 > n0_and_n1_or_not__2";
% 
% let o_auto = AUTO Axioms;
% 
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
% 
% let Conjectures = equations F X "n0_and_n1_or_not__1 = n0_and_n1_or_not__2"
% ;
% (*
% 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 = { and(X,n0) = n0,
% and(X,n1) = X,
% or(X,n0) = X,
% or(X,n1) = n1,
% not(n0) = n1,
% not(n1) = n0 } (6 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 = { n0_and_n1_or_not__1 = n0_and_n1_or_not__2 }
% (1 equation(s))
% time is now on
% 
% Initializing completion ...
% New rule produced : [1] not(n0) -> n1
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 1
% New rule produced : [2] not(n1) -> n0
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 2
% New rule produced : [3] or(X,n0) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 3
% New rule produced : [4] or(X,n1) -> n1
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 4
% New rule produced : [5] and(X,n0) -> n0
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 5
% New rule produced : [6] and(X,n1) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 6
% Warning: some conjectures remain
% 
% Execution time: 0.000000 sec
% res : bool = false
% time is now off
% 
% status : string = "satisfiable"
% % SZS status Satisfiable
% CiME interrupted
% 
% EOF
%------------------------------------------------------------------------------