TSTP Solution File: COL058-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : COL058-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n060.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 : COL058-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n060.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 22:47:13 CDT 2014
% % CPUTime : 1.13
% Processing problem /tmp/CiME_59859_n060.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " lark : constant; response : 2;";
% let X = vars "X1 X2 X";
% let Axioms = equations F X "
% response(response(lark,X1),X2) = response(X1,response(X2,X2));
% ";
%
% let s1 = status F "
% response lr_lex;
% lark lr_lex;
% ";
%
% let p1 = precedence F "
% response > lark";
%
% let s2 = status F "
% response mul;
% lark mul;
% ";
%
% let p2 = precedence F "
% response > lark";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " response(X,X) = X;"
% ;
% (*
% 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(lark,X1),X2) =
% response(X1,response(X2,X2)) } (1 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
%
% [lark] = 1;
% [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(X,X) = X } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] (eq)(response(X,X),X) -> (false)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 1
% New rule produced : [2] (eq)(X1,X1) -> (true)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 2
% New rule produced :
% [3] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2)
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 3
% New rule produced :
% [4] response(response(lark,X1),X2) <-> response(X1,response(X2,X2))
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5]
% (eq)(response(response(lark,response(X1,X1)),X1),response(X1,X1)) -> (false)
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6]
% (eq)(response(response(response(lark,lark),X1),X1),response(X1,X1)) ->
% (false)
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(X1,X1),response(X1,X1))) -> (false)
% Current number of equations to process: 6
% Current number of ordered equations: 2
% Current number of rules: 7
% New rule produced :
% [8]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(X1,X1),response(X1,X1))) -> (false)
% Current number of equations to process: 6
% Current number of ordered equations: 1
% Current number of rules: 8
% New rule produced :
% [9]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (false)
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (false)
% Current number of equations to process: 10
% Current number of ordered equations: 1
% Current number of rules: 10
% New rule produced :
% [11]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(X1,X1),response(X1,X1))) -> (false)
% Current number of equations to process: 10
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12]
% (eq)(response(response(response(lark,lark),response(lark,lark)),lark),
% response(response(lark,lark),response(lark,lark))) -> (false)
% Current number of equations to process: 15
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(lark,response(X1,X1)),X1)) -> (false)
% Current number of equations to process: 14
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (false)
% Current number of equations to process: 18
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (false)
% Current number of equations to process: 22
% Current number of ordered equations: 1
% Current number of rules: 15
% New rule produced :
% [16]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(lark,response(X1,X1)),X1)) -> (false)
% Current number of equations to process: 22
% Current number of ordered equations: 0
% Current number of rules: 16
% Rule [16]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(lark,response(X1,X1)),X1)) -> (false) is composed into
% [16]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(lark,response(X1,X1)),X1)) -> (true)
% Rule [15]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (false) is composed into
% [15]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (true)
% Rule [14]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (false) is composed into
% [14]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(response(lark,lark),X1),X1)) -> (true)
% Rule [13]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(lark,response(X1,X1)),X1)) -> (false) is composed into
% [13]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(lark,response(X1,X1)),X1)) -> (true)
% Rule [12]
% (eq)(response(response(response(lark,lark),response(lark,lark)),lark),
% response(response(lark,lark),response(lark,lark))) -> (false) is composed into
% [12]
% (eq)(response(response(response(lark,lark),response(lark,lark)),lark),
% response(response(lark,lark),response(lark,lark))) -> (true)
% Rule [11]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(X1,X1),response(X1,X1))) -> (false) is composed into
% [11]
% (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(X1,X1),response(X1,X1))) -> (true)
% Rule [10]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (false) is composed into
% [10]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (true)
% Rule [9]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (false) is composed into
% [9]
% (eq)(response(response(response(lark,lark),response(X1,X1)),response(X1,X1)),
% response(response(lark,response(X1,X1)),X1)) -> (true)
% Rule [8]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(X1,X1),response(X1,X1))) -> (false) is composed into
% [8]
% (eq)(response(response(lark,response(response(lark,lark),response(X1,X1))),X1),
% response(response(X1,X1),response(X1,X1))) -> (true)
% Rule [7]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(X1,X1),response(X1,X1))) -> (false) is composed into
% [7]
% (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(X1,X1),response(X1,X1))) -> (true)
% Rule [6]
% (eq)(response(response(response(lark,lark),X1),X1),response(X1,X1)) ->
% (false) is composed into [6]
% (eq)(response(response(response(lark,lark),X1),X1),
% response(X1,X1)) -> (true)
% Rule [5]
% (eq)(response(response(lark,response(X1,X1)),X1),response(X1,X1)) ->
% (false) is composed into [5]
% (eq)(response(response(lark,response(X1,X1)),X1),
% response(X1,X1)) -> (true)
% Rule [1] (eq)(response(X,X),X) -> (false) is composed into [1]
% (eq)(response(X,X),X)
% -> (true)
% New rule produced : [17] (false) -> (true)
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 26
% Current number of ordered equations: 0
% Current number of rules: 17
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 7 rules have been used:
% [1]
% (eq)(response(X,X),X) -> (false); trace = in the starting set
% [3] response(X1,response(X2,X2)) <-> response(response(lark,X1),X2); trace = in the starting set
% [5] (eq)(response(response(lark,response(X1,X1)),X1),response(X1,X1)) ->
% (false); trace = Cp of 3 and 1
% [6] (eq)(response(response(response(lark,lark),X1),X1),response(X1,X1)) ->
% (false); trace = Cp of 5 and 3
% [7] (eq)(response(response(response(lark,response(lark,lark)),X1),response(X1,X1)),
% response(response(X1,X1),response(X1,X1))) -> (false); trace = Cp of 6 and 3
% [11] (eq)(response(response(lark,response(response(lark,response(lark,lark)),X1)),X1),
% response(response(X1,X1),response(X1,X1))) -> (false); trace = Cp of 7 and 3
% [17] (false) -> (true); trace = Cp of 11 and 3
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.020000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------