TSTP Solution File: ROB028-1 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : ROB028-1 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n162.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:32:02 EDT 2014
% Result : Timeout 300.07s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : ROB028-1 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n162.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 16:58:58 CDT 2014
% % CPUTime : 300.07
% Processing problem /tmp/CiME_47649_n162.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " add : AC; negate : 1;add_negate__1, add_negate__2 : 0;";
% let X = vars "X Y Z";
% let Axioms = equations F X "
% negate(negate(X add Y) add negate(X add negate(Y))) = X;
% ";
%
% let s1 = status F "
% negate lr_lex;
% add mul;
% ";
%
% let p1 = precedence F "
% negate > add > add_negate__1 > add_negate__2";
%
% let s2 = status F "
% negate mul;
% add mul;
% ";
%
% let p2 = precedence F "
% negate > add > add_negate__1 > add_negate__2";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X "add_negate__1 = add_negate__2"
% ;
% (*
% 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 = { negate(negate(negate(Y) add X) add negate(
% X add Y)) = X }
% (1 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 = { add_negate__1 = add_negate__2 }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced :
% [1] negate(negate(negate(Y) add X) add negate(X add Y)) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 1
% New rule produced :
% [2]
% negate(negate(negate(X add Y) add negate(Y) add X) add X) -> negate(X add Y)
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 2
% New rule produced :
% [3]
% negate(negate(negate(negate(X) add Y) add X add Y) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 19
% Current number of ordered equations: 0
% Current number of rules: 3
% New rule produced :
% [4]
% negate(negate(negate(X add Y) add negate(negate(negate(Y) add X))) add X) ->
% negate(X add Y)
% Current number of equations to process: 40
% Current number of ordered equations: 0
% Current number of rules: 4
% New rule produced :
% [5]
% negate(negate(negate(negate(X) add Y) add negate(negate(X add Y))) add Y) ->
% negate(negate(X) add Y)
% Current number of equations to process: 81
% Current number of ordered equations: 0
% Current number of rules: 5
% New rule produced :
% [6]
% negate(negate(negate(X add Y) add negate(Y) add X add X) add negate(X add Y))
% -> X
% Current number of equations to process: 137
% Current number of ordered equations: 0
% Current number of rules: 6
% New rule produced :
% [7]
% negate(negate(negate(negate(X) add Y) add negate(X add Y) add Z) add
% negate(Y add Z)) -> Z
% Current number of equations to process: 180
% Current number of ordered equations: 0
% Current number of rules: 7
% New rule produced :
% [8]
% negate(negate(negate(negate(X) add Y) add X add Y add Y) add negate(negate(X) add Y))
% -> Y
% Current number of equations to process: 275
% Current number of ordered equations: 0
% Current number of rules: 8
% New rule produced :
% [9]
% negate(negate(negate(X add Y) add negate(negate(negate(Y) add X)) add X) add
% negate(X add Y)) -> X
% Current number of equations to process: 329
% Current number of ordered equations: 0
% Current number of rules: 9
% New rule produced :
% [10]
% negate(negate(negate(negate(negate(X add Y) add negate(Y) add X)) add X) add
% negate(X add Y)) -> X
% Current number of equations to process: 418
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced :
% [11]
% negate(negate(negate(negate(X) add Y) add negate(negate(X add Y)) add Y) add
% negate(negate(X) add Y)) -> Y
% Current number of equations to process: 492
% Current number of ordered equations: 1
% Current number of rules: 11
% New rule produced :
% [12]
% negate(negate(negate(negate(negate(negate(X) add Y) add X add Y)) add Y) add
% negate(negate(X) add Y)) -> Y
% Current number of equations to process: 492
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13]
% negate(negate(negate(X add Y) add negate(X add Y) add negate(Y) add X add X) add X)
% -> negate(X add Y)
% Current number of equations to process: 684
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced :
% [14]
% negate(negate(negate(negate(negate(X add Y) add negate(negate(negate(Y) add X)))) add X) add
% negate(X add Y)) -> X
% Current number of equations to process: 810
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced :
% [15]
% negate(negate(negate(negate(X) add Y) add negate(X add Y) add negate(Y add Z) add Z) add Z)
% -> negate(Y add Z)
% Current number of equations to process: 944
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced :
% [16]
% negate(negate(negate(negate(X) add Y) add negate(negate(X) add Y) add X add Y add Y) add Y)
% -> negate(negate(X) add Y)
% Current number of equations to process: 1168
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced :
% [17]
% negate(negate(negate(negate(negate(negate(X) add Y) add negate(negate(
% X add Y)))) add Y) add
% negate(negate(X) add Y)) -> Y
% Current number of equations to process: 1323
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced :
% [18]
% negate(negate(negate(X add Y) add negate(negate(negate(X add Y) add negate(Y) add X)) add X) add X)
% -> negate(X add Y)
% Current number of equations to process: 1494
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19]
% negate(negate(negate(X add Y) add negate(X add Y) add negate(negate(negate(Y) add X)) add X) add X)
% -> negate(X add Y)
% Current number of equations to process: 1682
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20]
% negate(negate(negate(X add Y) add negate(negate(negate(X add Y) add negate(Y) add X add X))) add X)
% -> negate(X add Y)
% Current number of equations to process: 1925
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21]
% negate(negate(negate(negate(X add Y) add negate(Y) add X) add X add Z) add
% negate(negate(X add Y) add Z)) -> Z
% Current number of equations to process: 2132
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22]
% negate(negate(negate(negate(X add Y) add negate(X) add Y) add negate(
% negate(Y) add X) add Y) add X)
% -> negate(negate(Y) add X)
% Current number of equations to process: 2707
% Current number of ordered equations: 1
% Current number of rules: 22
% New rule produced :
% [23]
% negate(negate(negate(negate(X add Y) add negate(Y) add X) add negate(
% negate(Y) add X) add X) add X)
% -> negate(negate(Y) add X)
% Current number of equations to process: 2707
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24]
% negate(negate(negate(negate(X add Y) add negate(Y) add X) add negate(X)) add
% negate(X add Y)) -> negate(negate(X add Y) add negate(Y) add X)
% Current number of equations to process: 3336
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25]
% negate(negate(negate(X add Y) add negate(negate(negate(negate(Z) add X) add
% negate(X add Z) add Y))) add Y)
% -> negate(X add Y)
% Current number of equations to process: 3561
% Current number of ordered equations: 0
% Current number of rules: 25
% New rule produced :
% [26]
% negate(negate(negate(negate(negate(X) add Y) add negate(negate(X)) add Y) add
% negate(X add Y) add Y) add Y) -> negate(X add Y)
% Current number of equations to process: 3993
% Current number of ordered equatioCputime limit exceeded (core dumped)
%
% EOF
%------------------------------------------------------------------------------