TSTP Solution File: ANA006-2 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : ANA006-2 : TPTP v6.4.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n095.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 8 09:50:24 EST 2017
% Result : Satisfiable 0.06s
% Output : FiniteModel 0.06s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA006-2 : TPTP v6.4.0. Released v2.5.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n095.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Tue Feb 7 23:31:00 CST 2017
% 0.02/0.23 % CPUTime :
% 0.06/0.42 % SZS status Satisfiable
% 0.06/0.42 ============================== Mace4 =================================
% 0.06/0.42 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.42 Process 54649 was started by sandbox on n095.star.cs.uiowa.edu,
% 0.06/0.42 Tue Feb 7 23:31:01 2017
% 0.06/0.42 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_54616_n095.star.cs.uiowa.edu".
% 0.06/0.42 ============================== end of head ===========================
% 0.06/0.42
% 0.06/0.42 ============================== INPUT =================================
% 0.06/0.42
% 0.06/0.42 % Reading from file /tmp/Mace4_input_54616_n095.star.cs.uiowa.edu
% 0.06/0.42
% 0.06/0.42 set(prolog_style_variables).
% 0.06/0.42 set(print_models_tabular).
% 0.06/0.42 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.42
% 0.06/0.42 formulas(sos).
% 0.06/0.42 less_or_equal(absolute(add(X,Y)),add(absolute(X),absolute(Y))) # label(absolute_sum_less_or_equal_sum_of_absolutes1) # label(axiom).
% 0.06/0.42 -less_or_equal(add(absolute(X),absolute(Y)),Z) | less_or_equal(absolute(add(X,Y)),Z) # label(absolute_sum_less_or_equal_sum_of_absolutes2) # label(axiom).
% 0.06/0.42 -less_or_equal(X,Y) | minimum(X,Y) = X # label(minimum1) # label(axiom).
% 0.06/0.42 less_or_equal(minimum(X,Y),X) # label(minimum2) # label(axiom).
% 0.06/0.42 -less_or_equal(Z,minimum(X,Y)) | less_or_equal(Z,X) # label(minimum3) # label(axiom).
% 0.06/0.42 -less_or_equal(X,Y) | less_or_equal(X,minimum(X,Y)) # label(minimum4) # label(axiom).
% 0.06/0.42 -less_or_equal(Y,X) | minimum(X,Y) = Y # label(minimum5) # label(axiom).
% 0.06/0.42 less_or_equal(minimum(X,Y),Y) # label(minimum6) # label(axiom).
% 0.06/0.42 -less_or_equal(Z,minimum(X,Y)) | less_or_equal(Z,Y) # label(minimum7) # label(axiom).
% 0.06/0.42 -less_or_equal(Y,X) | less_or_equal(Y,minimum(X,Y)) # label(minimum8) # label(axiom).
% 0.06/0.42 less_or_equal(X,n0) | less_or_equal(Y,n0) | -less_or_equal(minimum(X,Y),n0) # label(minimum9) # label(axiom).
% 0.06/0.42 add(half(X),half(X)) = X # label(half_plus_half_is_whole) # label(axiom).
% 0.06/0.42 less_or_equal(add(half(X),half(X)),X) # label(half_plus_half_less_or_equal_whole) # label(axiom).
% 0.06/0.42 less_or_equal(X,add(half(X),half(X))) # label(whole_less_or_equal_half_plus_half) # label(axiom).
% 0.06/0.42 -less_or_equal(X,half(Z)) | -less_or_equal(Y,half(Z)) | less_or_equal(add(X,Y),Z) # label(less_or_equal_sum_of_halves) # label(axiom).
% 0.06/0.42 less_or_equal(X,n0) | -less_or_equal(half(X),n0) # label(zero_and_half) # label(axiom).
% 0.06/0.42 -less_or_equal(X,Y) | less_or_equal(add(X,Z),add(Y,Z)) # label(add_to_both_sides_of_less_equal1) # label(axiom).
% 0.06/0.42 -less_or_equal(X,Y) | -less_or_equal(Z,W) | less_or_equal(add(X,Z),add(Y,W)) # label(add_to_both_sides_of_less_equal2) # label(axiom).
% 0.06/0.42 less_or_equal(X,Y) | less_or_equal(Y,X) # label(commutativity_of_less_or_equal) # label(axiom).
% 0.06/0.42 -less_or_equal(X,Y) | -less_or_equal(Y,Z) | less_or_equal(X,Z) # label(transitivity_of_less_or_equal) # label(axiom).
% 0.06/0.42 add(X,Y) = add(Y,X) # label(commutativity_of_add) # label(axiom).
% 0.06/0.42 less_or_equal(add(X,Y),add(Y,X)) # label(commutativity_of_add_for_less_or_equal) # label(axiom).
% 0.06/0.42 add(add(X,Y),Z) = add(X,add(Y,Z)) # label(associativity_of_add) # label(axiom).
% 0.06/0.42 less_or_equal(add(add(X,Y),Z),add(X,add(Y,Z))) # label(associativity_of_add_for_less_or_equal1) # label(axiom).
% 0.06/0.42 less_or_equal(add(X,add(Y,Z)),add(add(X,Y),Z)) # label(associativity_of_add_for_less_or_equal2) # label(axiom).
% 0.06/0.42 X != Y | less_or_equal(X,Y) # label(equal_implies_less_or_equal) # label(axiom).
% 0.06/0.42 end_of_list.
% 0.06/0.42
% 0.06/0.42 % From the command line: assign(max_seconds, 300).
% 0.06/0.42
% 0.06/0.42 ============================== end of input ==========================
% 0.06/0.42
% 0.06/0.42 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.42
% 0.06/0.42 % Formulas that are not ordinary clauses:
% 0.06/0.42
% 0.06/0.42 ============================== end of process non-clausal formulas ===
% 0.06/0.42
% 0.06/0.42 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.42
% 0.06/0.42 formulas(mace4_clauses).
% 0.06/0.42 less_or_equal(absolute(add(A,B)),add(absolute(A),absolute(B))) # label(absolute_sum_less_or_equal_sum_of_absolutes1) # label(axiom).
% 0.06/0.42 -less_or_equal(add(absolute(A),absolute(B)),C) | less_or_equal(absolute(add(A,B)),C) # label(absolute_sum_less_or_equal_sum_of_absolutes2) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | minimum(A,B) = A # label(minimum1) # label(axiom).
% 0.06/0.42 less_or_equal(minimum(A,B),A) # label(minimum2) # label(axiom).
% 0.06/0.42 -less_or_equal(A,minimum(B,C)) | less_or_equal(A,B) # label(minimum3) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | less_or_equal(A,minimum(A,B)) # label(minimum4) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | minimum(B,A) = A # label(minimum5) # label(axiom).
% 0.06/0.42 less_or_equal(minimum(A,B),B) # label(minimum6) # label(axiom).
% 0.06/0.42 -less_or_equal(A,minimum(B,C)) | less_or_equal(A,C) # label(minimum7) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | less_or_equal(A,minimum(B,A)) # label(minimum8) # label(axiom).
% 0.06/0.42 less_or_equal(A,n0) | less_or_equal(B,n0) | -less_or_equal(minimum(A,B),n0) # label(minimum9) # label(axiom).
% 0.06/0.42 add(half(A),half(A)) = A # label(half_plus_half_is_whole) # label(axiom).
% 0.06/0.42 less_or_equal(add(half(A),half(A)),A) # label(half_plus_half_less_or_equal_whole) # label(axiom).
% 0.06/0.42 less_or_equal(A,add(half(A),half(A))) # label(whole_less_or_equal_half_plus_half) # label(axiom).
% 0.06/0.42 -less_or_equal(A,half(B)) | -less_or_equal(C,half(B)) | less_or_equal(add(A,C),B) # label(less_or_equal_sum_of_halves) # label(axiom).
% 0.06/0.42 less_or_equal(A,n0) | -less_or_equal(half(A),n0) # label(zero_and_half) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | less_or_equal(add(A,C),add(B,C)) # label(add_to_both_sides_of_less_equal1) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | -less_or_equal(C,D) | less_or_equal(add(A,C),add(B,D)) # label(add_to_both_sides_of_less_equal2) # label(axiom).
% 0.06/0.42 less_or_equal(A,B) | less_or_equal(B,A) # label(commutativity_of_less_or_equal) # label(axiom).
% 0.06/0.42 -less_or_equal(A,B) | -less_or_equal(B,C) | less_or_equal(A,C) # label(transitivity_of_less_or_equal) # label(axiom).
% 0.06/0.42 add(A,B) = add(B,A) # label(commutativity_of_add) # label(axiom).
% 0.06/0.42 less_or_equal(add(A,B),add(B,A)) # label(commutativity_of_add_for_less_or_equal) # label(axiom).
% 0.06/0.42 add(add(A,B),C) = add(A,add(B,C)) # label(associativity_of_add) # label(axiom).
% 0.06/0.42 less_or_equal(add(add(A,B),C),add(A,add(B,C))) # label(associativity_of_add_for_less_or_equal1) # label(axiom).
% 0.06/0.42 less_or_equal(add(A,add(B,C)),add(add(A,B),C)) # label(associativity_of_add_for_less_or_equal2) # label(axiom).
% 0.06/0.42 A != B | less_or_equal(A,B) # label(equal_implies_less_or_equal) # label(axiom).
% 0.06/0.42 end_of_list.
% 0.06/0.42
% 0.06/0.42 ============================== end of clauses for search =============
% 0.06/0.42 % SZS output start FiniteModel
% 0.06/0.42
% 0.06/0.42 % There are no natural numbers in the input.
% 0.06/0.42
% 0.06/0.42 n0 : 0
% 0.06/0.42
% 0.06/0.42 absolute :
% 0.06/0.42 0 1
% 0.06/0.42 -------
% 0.06/0.42 0 0
% 0.06/0.42
% 0.06/0.42 half :
% 0.06/0.42 0 1
% 0.06/0.42 -------
% 0.06/0.42 0 1
% 0.06/0.42
% 0.06/0.42 add :
% 0.06/0.42 | 0 1
% 0.06/0.42 --+----
% 0.06/0.42 0 | 0 0
% 0.06/0.42 1 | 0 1
% 0.06/0.42
% 0.06/0.42 minimum :
% 0.06/0.42 | 0 1
% 0.06/0.42 --+----
% 0.06/0.42 0 | 0 0
% 0.06/0.42 1 | 0 1
% 0.06/0.42
% 0.06/0.42 less_or_equal :
% 0.06/0.42 | 0 1
% 0.06/0.42 --+----
% 0.06/0.42 0 | 1 1
% 0.06/0.42 1 | 0 1
% 0.06/0.42
% 0.06/0.42 % SZS output end FiniteModel
% 0.06/0.42 ------ process 54649 exit (max_models) ------
% 0.06/0.42
% 0.06/0.42 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.42
% 0.06/0.42 Exiting with 1 model.
% 0.06/0.42
% 0.06/0.42 Process 54649 exit (max_models) Tue Feb 7 23:31:01 2017
% 0.06/0.42 The process finished Tue Feb 7 23:31:01 2017
% 0.06/0.42 Mace4 ended
%------------------------------------------------------------------------------