TSTP Solution File: LAT157-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LAT157-1 : TPTP v6.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n066.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:28 EDT 2014
% Result : Timeout 300.10s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LAT157-1 : TPTP v6.0.0. Released v3.1.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n066.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 : Fri Jun 6 01:55:03 CDT 2014
% % CPUTime : 300.10
% Processing problem /tmp/CiME_28236_n066.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " join,meet : AC; c,b,a : constant;";
% let X = vars "X Y Z U";
% 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;
% X meet (Y join (Z meet (X join U))) = X meet (Y join (Z meet (X join (Z meet (Y join U)))));
% ";
%
% 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 meet (b join (a meet c)) = a meet (b join (c meet ((a meet (b join c)) join (b 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,
% (((X join U) meet Z) join Y) meet X =
% (((((Y join U) meet Z) join X) meet Z) join Y) meet X }
% (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 a) join b) meet a =
% (((((c join b) meet a) join (c meet b)) meet c) join b) meet 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] (X meet Y) join X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 3
% New rule produced : [4] (X join Y) meet X -> X
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 4
% New rule produced :
% [5]
% (((((Y join U) meet Z) join X) meet Z) join Y) meet X ->
% (((X join U) meet Z) join Y) meet X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6] ((X join Y) meet Z) join (X meet Z) -> (X join Y) meet Z
% Current number of equations to process: 44
% Current number of ordered equations: 1
% Current number of rules: 6
% New rule produced :
% [7] ((X meet Y) join Z) meet (X join Z) -> (X meet Y) join Z
% Current number of equations to process: 44
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8] (((X meet Y) join Z) meet U) join X join Z -> X join Z
% Current number of equations to process: 42
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9] (((X join Z) meet Y) join U) meet X meet Y -> X meet Y
% Current number of equations to process: 40
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10] ((X join Y) meet Z) join (X meet Z meet U) -> (X join Y) meet Z
% Current number of equations to process: 38
% Current number of ordered equations: 1
% Current number of rules: 10
% New rule produced :
% [11] ((X meet Y) join Z) meet (X join Z join U) -> (X meet Y) join Z
% Current number of equations to process: 38
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12] ((((X join Y) meet Z) join Y) meet U) join X join Y -> X join Y
% Current number of equations to process: 37
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13] ((((X meet Y) join Z) meet Y) join U) meet X meet Y -> X meet Y
% Current number of equations to process: 36
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14]
% (((X join Y) meet Z) join Y) meet (X join Y) -> ((X join Y) meet Z) join Y
% Current number of equations to process: 32
% Current number of ordered equations: 1
% Current number of rules: 14
% New rule produced :
% [15]
% (((X meet Y) join Z) meet Y) join (X meet Y) -> ((X meet Y) join Z) meet Y
% Current number of equations to process: 32
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [16]
% (((X join Y) meet Z) join Y) meet (X join Y join U) ->
% ((X join Y) meet Z) join Y
% Current number of equations to process: 24
% Current number of ordered equations: 1
% Current number of rules: 16
% New rule produced :
% [17]
% (((X meet Y) join Z) meet Y) join (X meet Y meet U) ->
% ((X meet Y) join Z) meet Y
% Current number of equations to process: 24
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18] ((X join Y) meet (X join Z)) join X -> (X join Y) meet (X join Z)
% Current number of equations to process: 237
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] (((X join Y) meet (Y join Z)) join X) meet Z -> (X join Y) meet Z
% Current number of equations to process: 236
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] ((X meet Y) join (X meet Z)) meet X -> (X meet Y) join (X meet Z)
% Current number of equations to process: 387
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [21] (((X meet Y) join (X meet Z)) meet U) join X -> X
% Current number of equations to process: 2015
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22]
% ((X join Y) meet (Z join U)) join (X meet Z) -> (X join Y) meet (Z join U)
% Current number of equations to process: 2014
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23]
% ((X meet Y) join (Z meet U)) meet (X join Z) -> (X meet Y) join (Z meet U)
% Current number of equations to process: 2013
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24] (((X meet Y) join (Z meet U)) meet V_4) join X join Z -> X join Z
% Current number of equations to process: 2011
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced : [25] (((X join Y) meet (X join Z)) join U) meet X -> X
% Current number of equations to process: 3918
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26] (((X join Y) meet (Z join U)) join V_4) meet X meet Z -> X meet Z
% Current number of equations to process: 3916
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% ((X join Y) meet (X join Z)) join (X meet U) -> (X join Y) meet (X join Z)
% Current number of equations to process: 4552
% Current number of ordered equations: 0
% Current number of rules: 27
% New rule produced :
% [28]
% ((X meet Y) join (X meet Z)) meet (X join U) -> (X meet Y) join (X meet Z)
% Current number of equations to process: 2937
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [29]
% ((((X meet Y) join Z) meet Y) join X) meet Z ->
% (((X join Z) meet Y) join X) meet Z
% Current number of equations to process: 4051
% Current number of ordered equations: 1
% Current number of rules: 29
% New rule produced :
% [30]
% (((X join Y join U) meet Z) join U) meet Y ->
% (((X join Y) meet Z) join U) meet Y
% Current number of equations to process: 4051
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced :
% [31] (((X join Y) meet (Y join Z join U)) join X) meet Z -> (X join Y) meet Z
% Current number of equations to process: 4050
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced :
% [32]
% Cputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------