TSTP Solution File: LAT014-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LAT014-1 : TPTP v6.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n104.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.10s
% Output : Refutation 1.10s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LAT014-1 : TPTP v6.0.0. Released v2.2.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n104.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:07:28 CDT 2014
% % CPUTime : 1.10
% Processing problem /tmp/CiME_24363_n104.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " b,a : constant; join : 2; meet : 2;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% join(X,meet(Y,meet(X,Z))) = X;
% meet(X,join(Y,join(X,Z))) = X;
% join(join(meet(X,Y),meet(Y,Z)),Y) = Y;
% meet(meet(join(X,Y),join(Y,Z)),Y) = Y;
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% join lr_lex;
% meet lr_lex;
% ";
%
% let p1 = precedence F "
% meet > join > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% join mul;
% meet mul;
% ";
%
% let p2 = precedence F "
% meet > join > a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " meet(a,join(a,b)) = a;"
% ;
% (*
% 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 = { join(X,meet(Y,meet(X,Z))) = X,
% meet(X,join(Y,join(X,Z))) = X,
% join(join(meet(X,Y),meet(Y,Z)),Y) = Y,
% meet(meet(join(X,Y),join(Y,Z)),Y) = Y }
% (4 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 = { meet(a,join(a,b)) = a } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] join(X,meet(Y,meet(X,Z))) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] meet(X,join(Y,join(X,Z))) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 2
% New rule produced : [3] join(join(meet(X,Y),meet(Y,Z)),Y) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced : [4] meet(meet(join(X,Y),join(Y,Z)),Y) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced : [5] join(X,meet(Y,X)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 5
% New rule produced : [6] meet(X,join(Y,X)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced : [7] join(meet(X,Y),Y) -> Y
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced : [8] join(X,X) -> X
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] meet(X,join(X,Y)) -> X
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 9
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 3 rules have been used:
% [2]
% meet(X,join(Y,join(X,Z))) -> X; trace = in the starting set
% [3] join(join(meet(X,Y),meet(Y,Z)),Y) -> Y; trace = in the starting set
% [9] meet(X,join(X,Y)) -> X; 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
%------------------------------------------------------------------------------