TSTP Solution File: COL014-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : COL014-1 : TPTP v6.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n071.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:41 EDT 2014
% Result : Unsatisfiable 1.10s
% Output : Refutation 1.10s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : COL014-1 : TPTP v6.0.0. Released v1.0.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n071.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:18:48 CDT 2014
% % CPUTime : 1.10
% Processing problem /tmp/CiME_59267_n071.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " combinator,o,l : constant; apply : 2;";
% let X = vars "X Y";
% let Axioms = equations F X "
% apply(apply(l,X),Y) = apply(X,apply(Y,Y));
% apply(apply(o,X),Y) = apply(Y,apply(X,Y));
% ";
%
% let s1 = status F "
% combinator lr_lex;
% o lr_lex;
% apply lr_lex;
% l lr_lex;
% ";
%
% let p1 = precedence F "
% apply > l > o > combinator";
%
% let s2 = status F "
% combinator mul;
% o mul;
% apply mul;
% l mul;
% ";
%
% let p2 = precedence F "
% apply > l = o = combinator";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X " Y = apply(combinator,Y);"
% ;
% (*
% 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 = { apply(apply(l,X),Y) = apply(X,apply(Y,Y)),
% apply(apply(o,X),Y) = apply(Y,apply(X,Y)) }
% (2 equation(s))
% s1 : F status = <status>
% p1 : F precedence = <precedence>
% s2 : F status = <status>
% p2 : F precedence = <precedence>
%
% [combinator] = 1;
% [o] = 2;
% [l] = 3;
% [apply](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 = { Y = apply(combinator,Y) } (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] (eq)(Y,apply(combinator,Y)) -> (false)
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 1
% New rule produced : [2] (eq)(X,X) -> (true)
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 2
% New rule produced : [3] apply(X,apply(Y,Y)) <-> apply(apply(l,X),Y)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 3
% New rule produced : [4] apply(Y,apply(X,Y)) <-> apply(apply(o,X),Y)
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 4
% New rule produced : [5] apply(apply(l,X),Y) <-> apply(X,apply(Y,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 1
% Current number of rules: 5
% New rule produced : [6] apply(apply(o,X),Y) <-> apply(Y,apply(X,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7] (eq)(apply(X,X),apply(apply(l,combinator),X)) -> (false)
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 7
% Rule [7] (eq)(apply(X,X),apply(apply(l,combinator),X)) -> (false) is composed into
% [7] (eq)(apply(X,X),apply(apply(l,combinator),X)) -> (true)
% Rule [1] (eq)(Y,apply(combinator,Y)) -> (false) is composed into [1]
% (eq)(Y,
% apply(combinator,Y))
% -> (true)
% New rule produced : [8] (false) -> (true)
% The conjecture has been reduced.
% Conjecture is now:
% Trivial
%
% Current number of equations to process: 10
% Current number of ordered equations: 0
% Current number of rules: 8
% The current conjecture is true and the solution is the identity
% % SZS output start Refutation
%
% The following 5 rules have been used:
% [1]
% (eq)(Y,apply(combinator,Y)) -> (false); trace = in the starting set
% [2] (eq)(X,X) -> (true); trace = in the starting set
% [3] apply(X,apply(Y,Y)) <-> apply(apply(l,X),Y); trace = in the starting set
% [7] (eq)(apply(X,X),apply(apply(l,combinator),X)) -> (false); trace = Cp of 3 and 1
% [8] (false) -> (true); trace = Cp of 7 and 2
% % SZS output end Refutation
% All conjectures have been proven
%
% Execution time: 0.010000 sec
% res : bool = true
% time is now off
%
% status : string = "unsatisfiable"
% % SZS status Unsatisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------