TSTP Solution File: LAT046-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LAT046-1 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n102.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.04s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LAT046-1 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n102.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:43:28 CDT 2014
% % CPUTime : 300.04
% Processing problem /tmp/CiME_62103_n102.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " join,meet : AC; c,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 Y) = complement(X) meet complement(Y);
% complement(X meet Y) = complement(X) join complement(Y);
% 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 "
% c lr_lex;
% 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 > c";
%
% let s2 = status F "
% c mul;
% 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 = c";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " a meet (b join c) = (a meet b) join (a meet 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,
% (X join Y) meet X = X,
% (X meet Y) join X = X,
% complement(X join Y) =
% complement(X) meet complement(Y),
% complement(X meet Y) =
% complement(X) join complement(Y),
% 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) } (10 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 join b) meet a =
% (c meet a) join (b meet 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: 9
% 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: 8
% 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: 7
% 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: 6
% 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: 5
% 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: 4
% 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: 3
% Current number of rules: 7
% New rule produced :
% [8] complement(X join Y) -> complement(X) meet complement(Y)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 8
% New rule produced :
% [9] complement(X meet Y) -> complement(X) join complement(Y)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 9
% New rule produced :
% [10] (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: 10
% New rule produced : [11] n1 join X -> n1
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced : [12] n0 meet X -> n0
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced : [13] n0 join X -> X
% Current number of equations to process: 22
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced : [14] n1 meet X -> X
% Current number of equations to process: 39
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] complement(n1) -> n0
% Current number of equations to process: 46
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [16] complement(n0) -> n1
% Current number of equations to process: 52
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17] (complement(X) meet complement(Y)) join X join Y -> n1
% Current number of equations to process: 43
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] (X join Y) meet complement(X) meet complement(Y) -> n0
% Current number of equations to process: 42
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] (X meet Y) join complement(X) join complement(Y) -> n1
% Current number of equations to process: 41
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] (complement(X) join complement(Y)) meet X meet Y -> n0
% Current number of equations to process: 40
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [21] ((X join Y) meet complement(X)) join X -> X join Y
% Current number of equations to process: 209
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22] (complement(X) meet Y) join complement(Y) join X -> n1
% Current number of equations to process: 208
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23] (complement(X) join Y) meet complement(Y) meet X -> n0
% Current number of equations to process: 255
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24] ((X join Z) meet Y) join X <-> ((X join Y) meet Z) join X
% Current number of equations to process: 452
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25] ((X meet Y) join Z) meet X -> (X meet Y) join (X meet Z)
% Current number of equations to process: 942
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26] ((X meet Y) join (X meet Z)) meet complement(X) -> n0
% Current number of equations to process: 1136
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% ((complement(X) join Y) meet X) join complement(X) -> complement(X) join Y
% Current number of equations to process: 1167
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28] ((X join Y) meet Z) join (X meet Z) -> (X join Y) meet Z
% Current number of equations to process: 1216
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29] ((complement(X) join Z) meet (X join Y)) join X -> X join Y
% Current number of equations to process: 1458
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [30] (((X join Z) meet Y) join X) meet Z -> (X join Y) meet Z
% Current number of equations to process: 1537
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [31] ((complement(X) meet complement(Y)) join X) meet Y -> X meet Y
% Current number of equations to process: 1712
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [32]
% ((complement(Y) meet X) join complement(X)) meet Y -> complement(X) meet Y
% Current number Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------