TSTP Solution File: LCL407-2 by CiME---2.01
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CiME---2.01
% Problem : LCL407-2 : TPTP v6.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_cime %s
% Computer : n094.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:27:32 EDT 2014
% Result : Satisfiable 1.13s
% Output : Assurance 1.13s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : LCL407-2 : TPTP v6.0.0. Released v2.5.0.
% % Command : tptp2X_and_run_cime %s
% % Computer : n094.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 10:42:43 CDT 2014
% % CPUTime : 1.13
% Processing problem /tmp/CiME_44792_n094.star.cs.uiowa.edu
% #verbose 1;
% let F = signature " falsehood,truth : constant; and_star : 2; xor : 2; not : 1;not_truth_xor_falsehood_and_star__1, not_truth_xor_falsehood_and_star__2 : 0;";
% let X = vars "X Y";
% let Axioms = equations F X "
% not(X) = xor(X,truth);
% xor(X,falsehood) = X;
% xor(X,X) = falsehood;
% and_star(X,truth) = X;
% and_star(X,falsehood) = falsehood;
% and_star(xor(truth,X),X) = falsehood;
% xor(X,xor(truth,Y)) = xor(xor(X,truth),Y);
% and_star(xor(and_star(xor(truth,X),Y),truth),Y) = and_star(xor(and_star(xor(truth,Y),X),truth),X);
% ";
%
% let s1 = status F "
% and_star lr_lex;
% falsehood lr_lex;
% xor lr_lex;
% truth lr_lex;
% not lr_lex;
% ";
%
% let p1 = precedence F "
% not > xor > and_star > truth > falsehood > not_truth_xor_falsehood_and_star__1 > not_truth_xor_falsehood_and_star__2";
%
% let s2 = status F "
% and_star mul;
% falsehood mul;
% xor mul;
% truth mul;
% not mul;
% ";
%
% let p2 = precedence F "
% not > xor > and_star > truth = falsehood > not_truth_xor_falsehood_and_star__1 > not_truth_xor_falsehood_and_star__2";
%
% let o_auto = AUTO Axioms;
%
% let o = LEX o_auto (LEX (ACRPO s1 p1) (ACRPO s2 p2));
%
% let Conjectures = equations F X "not_truth_xor_falsehood_and_star__1 = not_truth_xor_falsehood_and_star__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 = { not(X) = xor(X,truth),
% xor(X,falsehood) = X,
% xor(X,X) = falsehood,
% and_star(X,truth) = X,
% and_star(X,falsehood) = falsehood,
% and_star(xor(truth,X),X) = falsehood,
% xor(X,xor(truth,Y)) = xor(xor(X,truth),Y),
% and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% =
% and_star(xor(and_star(xor(truth,Y),X),truth),X) }
% (8 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 = { not_truth_xor_falsehood_and_star__1 =
% not_truth_xor_falsehood_and_star__2 }
% (1 equation(s))
% time is now on
%
% Initializing completion ...
% New rule produced : [1] and_star(X,truth) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 8
% Current number of rules: 1
% New rule produced : [2] and_star(X,falsehood) -> falsehood
% Current number of equations to process: 0
% Current number of ordered equations: 7
% Current number of rules: 2
% New rule produced : [3] xor(X,X) -> falsehood
% Current number of equations to process: 0
% Current number of ordered equations: 6
% Current number of rules: 3
% New rule produced : [4] xor(X,falsehood) -> X
% Current number of equations to process: 0
% Current number of ordered equations: 5
% Current number of rules: 4
% New rule produced : [5] not(X) -> xor(X,truth)
% Current number of equations to process: 0
% Current number of ordered equations: 4
% Current number of rules: 5
% New rule produced : [6] and_star(xor(truth,X),X) -> falsehood
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 6
% New rule produced : [7] xor(xor(X,truth),Y) -> xor(X,xor(truth,Y))
% Current number of equations to process: 0
% Current number of ordered equations: 2
% Current number of rules: 7
% New rule produced :
% [8]
% and_star(xor(and_star(xor(truth,Y),X),truth),X) <->
% and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% Current number of equations to process: 0
% Current number of ordered equations: 3
% Current number of rules: 8
% New rule produced : [9] xor(truth,xor(truth,X)) -> xor(falsehood,X)
% Current number of equations to process: 1
% Current number of ordered equations: 1
% Current number of rules: 9
% New rule produced : [10] xor(X,xor(truth,xor(X,truth))) -> falsehood
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 10
% New rule produced : [11] xor(X,xor(falsehood,Y)) -> xor(X,Y)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 11
% New rule produced :
% [12] and_star(xor(and_star(truth,X),truth),X) -> falsehood
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 12
% New rule produced :
% [13] xor(xor(truth,X),truth) -> and_star(xor(and_star(falsehood,X),truth),X)
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 13
% New rule produced : [14] xor(falsehood,truth) -> truth
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 14
% New rule produced : [15] xor(falsehood,xor(truth,X)) -> xor(truth,X)
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 15
% New rule produced : [16] and_star(xor(falsehood,X),xor(truth,X)) -> falsehood
% Current number of equations to process: 0
% Current number of ordered equations: 0
% Current number of rules: 16
% New rule produced : [17] xor(xor(falsehood,X),X) -> falsehood
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 17
% New rule produced : [18] and_star(xor(truth,X),xor(falsehood,X)) -> falsehood
% Current number of equations to process: 1
% Current number of ordered equations: 0
% Current number of rules: 18
% New rule produced :
% [19] and_star(truth,xor(falsehood,X)) -> and_star(truth,X)
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 19
% New rule produced :
% [20] and_star(xor(and_star(truth,X),truth),xor(falsehood,X)) -> falsehood
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 20
% New rule produced :
% [21]
% xor(and_star(xor(and_star(falsehood,X),truth),X),Y) ->
% xor(xor(truth,X),xor(truth,Y))
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 21
% New rule produced :
% [22]
% and_star(xor(and_star(falsehood,xor(truth,X)),truth),xor(truth,X)) ->
% xor(xor(falsehood,X),truth)
% Current number of equations to process: 4
% Current number of ordered equations: 0
% Current number of rules: 22
% New rule produced :
% [23]
% xor(xor(truth,X),xor(truth,and_star(xor(and_star(falsehood,X),truth),X))) ->
% falsehood
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 23
% New rule produced :
% [24]
% and_star(xor(and_star(falsehood,xor(falsehood,X)),truth),xor(falsehood,X)) ->
% and_star(xor(and_star(falsehood,X),truth),X)
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 24
% New rule produced :
% [25]
% and_star(xor(and_star(xor(truth,Y),xor(truth,X)),truth),xor(truth,X)) <->
% and_star(xor(and_star(xor(falsehood,X),Y),truth),Y)
% Current number of equations to process: 2
% Current number of ordered equations: 1
% Current number of rules: 25
% New rule produced :
% [26]
% and_star(xor(and_star(xor(falsehood,X),Y),truth),Y) <->
% and_star(xor(and_star(xor(truth,Y),xor(truth,X)),truth),xor(truth,X))
% Current number of equations to process: 2
% Current number of ordered equations: 0
% Current number of rules: 26
% New rule produced :
% [27]
% and_star(xor(and_star(xor(truth,X),Y),truth),Y) <->
% and_star(xor(and_star(xor(truth,Y),xor(falsehood,X)),truth),xor(falsehood,X))
% Current number of equations to process: 5
% Current number of ordered equations: 1
% Current number of rules: 27
% New rule produced :
% [28]
% and_star(xor(and_star(xor(truth,Y),xor(falsehood,X)),truth),xor(falsehood,X))
% <-> and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% Current number of equations to process: 5
% Current number of ordered equations: 0
% Current number of rules: 28
% Rule [27]
% and_star(xor(and_star(xor(truth,X),Y),truth),Y) <->
% and_star(xor(and_star(xor(truth,Y),xor(falsehood,X)),truth),xor(falsehood,X)) is composed into
% [27]
% and_star(xor(and_star(xor(truth,X),Y),truth),Y) <->
% and_star(xor(and_star(xor(truth,Y),X),truth),X)
% New rule produced :
% [29]
% and_star(xor(and_star(xor(truth,X),xor(falsehood,Y)),truth),xor(falsehood,Y))
% -> and_star(xor(and_star(xor(truth,X),Y),truth),Y)
% Rule
% [28]
% and_star(xor(and_star(xor(truth,Y),xor(falsehood,X)),truth),xor(falsehood,X))
% <-> and_star(xor(and_star(xor(truth,X),Y),truth),Y) collapsed.
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 28
% New rule produced :
% [30]
% and_star(xor(and_star(xor(falsehood,X),xor(falsehood,Y)),truth),xor(falsehood,Y))
% -> and_star(xor(and_star(xor(falsehood,X),Y),truth),Y)
% Current number of equations to process: 6
% Current number of ordered equations: 0
% Current number of rules: 29
% New rule produced :
% [31]
% and_star(xor(and_star(xor(falsehood,Y),xor(truth,X)),truth),xor(truth,X)) <->
% and_star(xor(and_star(xor(falsehood,X),xor(truth,Y)),truth),xor(truth,Y))
% Current number of equations to process: 3
% Current number of ordered equations: 0
% Current number of rules: 30
% Warning: some conjectures remain
%
% Execution time: 0.030000 sec
% res : bool = false
% time is now off
%
% status : string = "satisfiable"
% % SZS status Satisfiable
% CiME interrupted
%
% EOF
%------------------------------------------------------------------------------