TSTP Solution File: COL059-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : COL059-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n141.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:19:55 EDT 2014
% Result : Unsatisfiable 1.13s
% Output : Refutation 1.13s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : COL059-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n141.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 23:08:33 CDT 2014
% % CPUTime : 1.13
% Processing problem /tmp/CiME_21721_n141.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " l3,l2,x2,lark,kestrel : constant; response : 2;";
% let X = vars "X1 X2";
% let Axioms = equations F X "
% response(response(kestrel,X1),X2) = X1;
% response(response(lark,X1),X2) = response(X1,response(X2,X2));
% response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2));
% response(response(response(response(lark,lark),lark),X1),X2) = response(response(response(X1,X1),response(X1,X1)),response(x2,x2));
% response(lark,lark) = l2;
% response(l2,lark) = l3;
% response(l3,l3) = l3;
% ";
%
% let s1 = status F "
% l3 lr_lex;
% l2 lr_lex;
% x2 lr_lex;
% lark lr_lex;
% response lr_lex;
% kestrel lr_lex;
% ";
%
% let p1 = precedence F "
% response > kestrel > lark > x2 > l2 > l3";
%
% let s2 = status F "
% l3 mul;
% l2 mul;
% x2 mul;
% lark mul;
% response mul;
% kestrel mul;
% ";
%
% let p2 = precedence F "
% response > kestrel = lark = x2 = l2 = l3";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " response(l2,l2) = l2;"
% ;
% (*
% 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 = { response(response(kestrel,X1),X2) = X1,
% response(response(lark,X1),X2) =
% response(X1,response(X2,X2)),
% response(response(response(lark,lark),X1),X2) =
% response(response(X1,X1),response(X2,X2)),
% response(response(response(response(lark,lark),lark),X1),X2)
% =
% response(response(response(X1,X1),response(X1,X1)),
% response(x2,x2)),
% response(lark,lark) = l2,
% response(l2,lark) = l3,
% response(l3,l3) = l3 } (7 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
%
% [l3] = 1;
% [l2] = 2;
% [x2] = 3;
% [lark] = 4;
% [kestrel] = 5;
% [response](x1,x2) = 1 + x1 + x2;
% Chosen ordering : KBO
% o_auto : F term_ordering = <term ordering>
% o : F term_ordering = <term ordering>
% Conjectures : (F,X) equations = { response(l2,l2) = l2 } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] response(lark,lark) -> l2
% Current number of equations to process: 4
% Current number of ordered equations: 5
% Current number of rules: 1
% New rule produced : [2] response(l2,lark) -> l3
% Current number of equations to process: 2
% Current number of ordered equations: 6
% Current number of rules: 2
% New rule produced : [3] response(l3,l3) -> l3
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 3
% New rule produced : [4] response(response(kestrel,X1),X2) -> X1
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 4
% New rule produced :
% [5] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2)
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 5
% New rule produced :
% [6] response(response(lark,X1),X2) <-> response(X1,response(X2,X2))
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 6
% New rule produced :
% [7]
% response(response(X1,X1),response(X2,X2)) <-> response(response(l2,X1),X2)
% Current number of equations to process: 4
% Current number of ordered equations: 7
% Current number of rules: 7
% New rule produced :
% [8]
% response(response(l2,X1),X2) <-> response(response(X1,X1),response(X2,X2))
% Current number of equations to process: 2
% Current number of ordered equations: 7
% Current number of rules: 8
% New rule produced :
% [9]
% response(response(l3,X1),X2) <-> response(response(l2,response(X1,X1)),x2)
% Current number of equations to process: 2
% Current number of ordered equations: 30
% Current number of rules: 9
% Rule [9]
% response(response(l3,X1),X2) <->
% response(response(l2,response(X1,X1)),x2) is composed into [9]
% response(
% response(l3,X1),X2)
% <->
% response(
% response(l3,X1),l3)
% New rule produced :
% [10]
% response(response(l2,response(X1,X1)),x2) <-> response(response(l3,X1),X2)
% Current number of equations to process: 2
% Current number of ordered equations: 29
% Current number of rules: 10
% New rule produced : [11] response(response(l2,kestrel),X1) -> kestrel
% Current number of equations to process: 2
% Current number of ordered equations: 28
% Current number of rules: 11
% New rule produced : [12] response(lark,response(X1,X1)) -> response(l2,X1)
% Current number of equations to process: 5
% Current number of ordered equations: 21
% Current number of rules: 12
% New rule produced : [13] response(l2,response(X1,X1)) -> response(l3,X1)
% Rule
% [10]
% response(response(l2,response(X1,X1)),x2) <-> response(response(l3,X1),X2)
% collapsed.
% Current number of equations to process: 7
% Current number of ordered equations: 18
% Current number of rules: 12
% New rule produced :
% [14] response(response(l3,X1),X2) <-> response(response(l3,X1),x2)
% Current number of equations to process: 6
% Current number of ordered equations: 19
% Current number of rules: 13
% New rule produced :
% [15] response(response(l3,X1),x2) <-> response(response(l3,X1),X2)
% Current number of equations to process: 6
% Current number of ordered equations: 18
% Current number of rules: 14
% New rule produced :
% [16] response(response(lark,response(kestrel,X1)),X2) -> X1
% Current number of equations to process: 6
% Current number of ordered equations: 17
% Current number of rules: 15
% New rule produced :
% [17] response(response(X1,X1),l2) <-> response(response(l2,X1),lark)
% Current number of equations to process: 6
% Current number of ordered equations: 16
% Current number of rules: 16
% New rule produced :
% [18] response(response(l2,X1),lark) <-> response(response(X1,X1),l2)
% Current number of equations to process: 6
% Current number of ordered equations: 15
% Current number of rules: 17
% New rule produced :
% [19] response(response(X1,X1),l3) <-> response(response(l2,X1),l3)
% Current number of equations to process: 6
% Current number of ordered equations: 14
% Current number of rules: 18
% New rule produced :
% [20] response(l3,response(X1,X1)) <-> response(response(l2,l3),X1)
% Current number of equations to process: 6
% Current number of ordered equations: 13
% Current number of rules: 19
% New rule produced :
% [21] response(response(l2,X1),l3) <-> response(response(X1,X1),l3)
% Current number of equations to process: 6
% Current number of ordered equations: 12
% Current number of rules: 20
% New rule produced :
% [22] response(response(l2,l3),X1) <-> response(l3,response(X1,X1))
% Current number of equations to process: 6
% Current number of ordered equations: 11
% Current number of rules: 21
% New rule produced :
% [23] response(X1,X1) <-> response(response(response(lark,kestrel),X1),X2)
% Current number of equations to process: 6
% Current number of ordered equations: 10
% Current number of rules: 22
% New rule produced :
% [24] response(response(lark,X1),response(kestrel,X2)) -> response(X1,X2)
% Current number of equations to process: 6
% Current number of ordered equations: 9
% Current number of rules: 23
% New rule produced :
% [25] response(response(response(lark,kestrel),X1),X2) <-> response(X1,X1)
% Current number of equations to process: 6
% Current number of ordered equations: 8
% Current number of rules: 24
% New rule produced :
% [26]
% response(X1,response(X2,X2)) <->
% response(response(l2,response(kestrel,X1)),X2)
% Current number of equations to process: 6
% Current number of ordered equations: 7
% Current number of rules: 25
% New rule produced :
% [27]
% response(response(X1,X1),X2) <->
% response(response(l2,X1),response(kestrel,X2))
% Current number of equations to process: 6
% Current number of ordered equations: 6
% Current number of rules: 26
% New rule produced :
% [28]
% response(response(l2,X1),response(kestrel,X2)) <->
% response(response(X1,X1),X2)
% Current number of equations to process: 6
% Current number of ordered equations: 5
% Current number of rules: 27
% New rule produced :
% [29]
% response(response(l2,response(kestrel,X1)),X2) <->
% response(X1,response(X2,X2))
% Current number of equations to process: 6
% Current number of ordered equations: 4
% Current number of rules: 28
% New rule produced :
% [30]
% response(response(lark,X1),response(X2,X2)) ->
% response(X1,response(response(l2,X2),X2))
% Current number of equations to process: 6
% Current number of ordered equations: 3
% Current number of rules: 29
% New rule produced :
% [31]
% response(X1,response(response(X2,X2),response(X2,X2))) <->
% response(response(lark,response(lark,X1)),X2)
% Current number of equations to process: 5
% Current number of ordered equations: 2
% Current number of rules: 30
% New rule produced :
% [32]
% response(response(lark,response(lark,X1)),X2) <->
% response(X1,response(response(X2,X2),response(X2,X2)))
% Current number of equations to process: 5
% Current number of ordered equations: 1
% Current number of rules: 31
% New rule produced :
% [33]
% response(response(X1,X1),response(response(l2,X2),X2)) ->
% response(response(l2,X1),response(X2,X2))
% Current number of equations to process: 4
% Current number of ordered equations: 1
% Current number of rules: 32
% New rule produced :
% [34]
% response(response(response(l2,X1),X1),response(X2,X2)) ->
% response(response(l3,X1),X2)
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 33
% Rule [34]
% response(response(response(l2,X1),X1),response(X2,X2)) ->
% response(response(l3,X1),X2) is composed into [34]
% response(response(
% response(l2,X1),X1),
% response(X2,X2)) -> l3
% Rule [22] response(response(l2,l3),X1) <-> response(l3,response(X1,X1)) is composed into
% [22] response(response(l2,l3),X1) -> l3
% Rule [13] response(l2,response(X1,X1)) -> response(l3,X1) is composed into
% [13] response(l2,response(X1,X1)) -> l3
% New rule produced : [35] response(l3,X1) -> l3
% Rule [3] response(l3,l3) -> l3 collapsed.
% Rule [9] response(response(l3,X1),X2) <-> response(response(l3,X1),l3)
% collapsed.
% Rule [14] response(response(l3,X1),X2) <-> response(response(l3,X1),x2)
% collapsed.
% Rule [15] response(response(l3,X1),x2) <-> response(response(l3,X1),X2)
% collapsed.
% Rule [20] response(l3,response(X1,X1)) <-> response(response(l2,l3),X1)
% collapsed.
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [36] response(response(lark,response(l2,kestrel)),X1) -> kestrel
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 30
% New rule produced : [37] response(lark,l2) -> l3
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 31
% Rule [26]
% response(X1,response(X2,X2)) <->
% response(response(l2,response(kestrel,X1)),X2) is composed into
% [26] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2)
% New rule produced :
% [38] response(l2,response(kestrel,X1)) -> response(lark,X1)
% Rule
% [29]
% response(response(l2,response(kestrel,X1)),X2) <->
% response(X1,response(X2,X2)) collapsed.
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 31
% New rule produced : [39] response(lark,response(response(l2,X1),X1)) -> l3
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 32
% New rule produced : [40] response(l2,l2) -> l3
% The conjecture has been reduced.
% Conjecture is now:
% l3 = l2
%
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 33
% Rule [30]
% response(response(lark,X1),response(X2,X2)) ->
% response(X1,response(response(l2,X2),X2)) is composed into [30]
% response(
% response(lark,X1),
% response(X2,X2))
% ->
% response(X1,
% response(l3,X2))
% Rule [27]
% response(response(X1,X1),X2) <->
% response(response(l2,X1),response(kestrel,X2)) is composed into
% [27] response(response(X1,X1),X2) <-> response(l3,response(kestrel,X2))
% Rule [19] response(response(X1,X1),l3) <-> response(response(l2,X1),l3) is composed into
% [19] response(response(X1,X1),l3) <-> response(l3,l3)
% Rule [17] response(response(X1,X1),l2) <-> response(response(l2,X1),lark) is composed into
% [17] response(response(X1,X1),l2) <-> response(l3,lark)
% Rule [12] response(lark,response(X1,X1)) -> response(l2,X1) is composed into
% [12] response(lark,response(X1,X1)) -> l3
% Rule [7]
% response(response(X1,X1),response(X2,X2)) <->
% response(response(l2,X1),X2) is composed into [7]
% response(response(X1,X1),
% response(X2,X2)) ->
% response(l3,X2)
% New rule produced : [41] response(l2,X1) -> l3
% Rule [2] response(l2,lark) -> l3 collapsed.
% Rule
% [8]
% response(response(l2,X1),X2) <-> response(response(X1,X1),response(X2,X2))
% collapsed.
% Rule [11] response(response(l2,kestrel),X1) -> kestrel collapsed.
% Rule [13] response(l2,response(X1,X1)) -> l3 collapsed.
% Rule [18] response(response(l2,X1),lark) <-> response(response(X1,X1),l2)
% collapsed.
% Rule [21] response(response(l2,X1),l3) <-> response(response(X1,X1),l3)
% collapsed.
% Rule [22] response(response(l2,l3),X1) -> l3 collapsed.
% Rule
% [28]
% response(response(l2,X1),response(kestrel,X2)) <->
% response(response(X1,X1),X2) collapsed.
% Rule
% [33]
% response(response(X1,X1),response(response(l2,X2),X2)) ->
% response(response(l2,X1),response(X2,X2)) collapsed.
% Rule [34] response(response(response(l2,X1),X1),response(X2,X2)) -> l3
% collapsed.
% Rule [36] response(response(lark,response(l2,kestrel)),X1) -> kestrel
% collapsed.
% Rule [38] response(l2,response(kestrel,X1)) -> response(lark,X1) collapsed.
% Rule [39] response(lark,response(response(l2,X1),X1)) -> l3 collapsed.
% Rule [40] response(l2,l2) -> l3 collapsed.
% Current number of equations to process: 13
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced : [42] l3 <-> kestrel
% Current number of equations to process: 12
% Current number of ordered equations: 1
% Current number of rules: 21
% New rule produced : [43] kestrel <-> l3
% Current number of equations to process: 12
% Current number of ordered equations: 0
% Current number of rules: 22
% Rule [31]
% response(X1,response(response(X2,X2),response(X2,X2))) <->
% response(response(lark,response(lark,X1)),X2) is composed into [31]
% response(X1,
% response(
% response(X2,X2),
% response(X2,X2)))
% ->
% response(l3,X2)
% Rule [26] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2) is composed into
% [26] response(X1,response(X2,X2)) <-> response(l3,X2)
% Rule [23]
% response(X1,X1) <-> response(response(response(lark,kestrel),X1),X2) is composed into
% [23] response(X1,X1) <-> response(response(l3,X1),X2)
% Rule [5] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2) is composed into
% [5] response(X1,response(X2,X2)) <-> response(l3,X2)
% New rule produced : [44] response(lark,X1) -> l3
% Rule [1] response(lark,lark) -> l2 collapsed.
% Rule [6] response(response(lark,X1),X2) <-> response(X1,response(X2,X2))
% collapsed.
% Rule [12] response(lark,response(X1,X1)) -> l3 collapsed.
% Rule [16] response(response(lark,response(kestrel,X1)),X2) -> X1 collapsed.
% Rule [24] response(response(lark,X1),response(kestrel,X2)) -> response(X1,X2)
% collapsed.
% Rule
% [25] response(response(response(lark,kestrel),X1),X2) <-> response(X1,X1)
% collapsed.
% Rule
% [30]
% response(response(lark,X1),response(X2,X2)) -> response(X1,response(l3,X2))
% collapsed.
% Rule
% [32]
% response(response(lark,response(lark,X1)),X2) <->
% response(X1,response(response(X2,X2),response(X2,X2))) collapsed.
% Rule [37] response(lark,l2) -> l3 collapsed.
% Current number of equations to process: 17
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [45] l3 <-> l2
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 15
% Current number of ordered equations: 2
% Current number of rules: 15
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 5 rules have been used:
% [1]
% response(lark,lark) -> l2; trace = in the starting set
% [7] response(response(X1,X1),response(X2,X2)) <->
% response(response(l2,X1),X2); trace = in the starting set
% [13] response(l2,response(X1,X1)) -> l3; trace = Cp of 7 and 1
% [40] response(l2,l2) -> l3; trace = Cp of 13 and 1
% [45] l3 <-> l2; trace = in the starting set
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.030000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------