TSTP Solution File: LAT019-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LAT019-1 : TPTP v6.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n095.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:26:08 EDT 2014
% Result : Unsatisfiable 1.18s
% Output : Refutation 1.18s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LAT019-1 : TPTP v6.0.0. Released v2.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n095.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 16:22:38 CDT 2014
% % CPUTime : 1.18
% Processing problem /tmp/CiME_64822_n095.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " join,meet : AC; c,b,a : constant;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% X meet X = X;
% X join X = X;
% (X meet (Y join Z)) join (X meet Y) = X meet (Y join Z);
% (X join (Y meet Z)) meet (X join Y) = X join (Y meet Z);
% X meet (Y join Z) = (X meet Y) join (X meet Z);
% ";
%
% let s1 = status F "
% c lr_lex;
% b lr_lex;
% a lr_lex;
% join mul;
% meet mul;
% ";
%
% let p1 = precedence F "
% meet > join > a > b > c";
%
% let s2 = status F "
% c mul;
% b mul;
% a mul;
% join mul;
% meet mul;
% ";
%
% let p2 = precedence F "
% meet > join > a = b = c";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " a join (b meet c) = (a join b) meet (a join c);"
% ;
% (*
% 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 = { X meet X = X,
% X join X = X,
% ((Y join Z) meet X) join (X meet Y) =
% (Y join Z) meet X,
% ((Y meet Z) join X) meet (X join Y) =
% (Y meet Z) join X,
% (Y join Z) meet X = (X meet Y) join (X meet Z) }
% (5 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 = { (c meet b) join a =
% (c join a) meet (b join a) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] X join X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 1
% New rule produced : [2] X meet X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 2
% New rule produced : [3] (Y join Z) meet X -> (X meet Y) join (X meet Z)
% The conjecture has been reduced.
% Conjecture is now:
% (c meet b) join a = (c meet b) join (c meet a) join (b meet a) join a
%
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4]
% (X meet Y meet Z) join (X meet Y) join (Y meet Z) join X -> (Y meet Z) join X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] (X meet Y) join X join Y -> X join Y
% Rule
% [4]
% (X meet Y meet Z) join (X meet Y) join (Y meet Z) join X -> (Y meet Z) join X
% collapsed.
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [6] (X meet Y) join (Y meet Z) join X -> (Y meet Z) join X
% 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 2 rules have been used:
% [3]
% (Y join Z) meet X -> (X meet Y) join (X meet Z); trace = in the starting set
% [6] (X meet Y) join (Y meet Z) join X -> (Y meet Z) join X; trace = in the starting set
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.070000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------