TSTP Solution File: LAT052-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LAT052-1 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n122.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:11 EDT 2014
% Result : Timeout 300.09s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LAT052-1 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n122.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 18:00:38 CDT 2014
% % CPUTime : 300.09
% Processing problem /tmp/CiME_46257_n122.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " join,meet : AC; b,a,n0,n1 : constant; complement : 1;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% X meet X = X;
% X join X = X;
% X meet (X join Y) = X;
% X join (X meet Y) = X;
% complement(X) join X = n1;
% complement(X) meet X = n0;
% complement(complement(X)) = X;
% X join (Y meet (X join Z)) = (X join Y) meet (X join Z);
% ";
%
% let s1 = status F "
% b lr_lex;
% a lr_lex;
% n0 lr_lex;
% n1 lr_lex;
% complement lr_lex;
% join mul;
% meet mul;
% ";
%
% let p1 = precedence F "
% complement > meet > join > n1 > n0 > a > b";
%
% let s2 = status F "
% b mul;
% a mul;
% n0 mul;
% n1 mul;
% complement mul;
% join mul;
% meet mul;
% ";
%
% let p2 = precedence F "
% complement > meet > join > n1 = n0 = a = b";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " complement(a join b) = complement(a) meet complement(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 = { X meet X = X,
% X join X = X,
% (X join Y) meet X = X,
% (X meet Y) join X = X,
% complement(X) join X = n1,
% complement(X) meet X = n0,
% complement(complement(X)) = X,
% ((X join Z) meet Y) join X =
% (X join Y) meet (X join Z) } (8 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 = { complement(b join a) =
% complement(b) meet complement(a) }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] complement(complement(X)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 1
% New rule produced : [2] X join X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 2
% New rule produced : [3] X meet X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 3
% New rule produced : [4] complement(X) join X -> n1
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 4
% New rule produced : [5] complement(X) meet X -> n0
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 5
% New rule produced : [6] (X meet Y) join X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 6
% New rule produced : [7] (X join Y) meet X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 7
% New rule produced :
% [8] (X join Y) meet (X join Z) -> ((X join Z) meet Y) join X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced : [9] n1 join X -> n1
% Current number of equations to process: 20
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced : [10] n0 meet X -> n0
% Current number of equations to process: 40
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [11] n0 join X -> X
% Current number of equations to process: 68
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [12] n1 meet X -> X
% Current number of equations to process: 89
% Current number of ordered equations: 0
% Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------