TSTP Solution File: KLE175+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KLE175+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n034.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:56:13 EST 2017
% Result : Satisfiable 0.07s
% Output : FiniteModel 0.07s
% 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 : KLE175+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n034.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 19:39:00 CST 2017
% 0.02/0.23 % CPUTime :
% 0.07/0.43 % SZS status Satisfiable
% 0.07/0.43 ============================== Mace4 =================================
% 0.07/0.43 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.43 Process 51997 was started by sandbox on n034.star.cs.uiowa.edu,
% 0.07/0.43 Tue Feb 7 19:39:01 2017
% 0.07/0.43 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_51964_n034.star.cs.uiowa.edu".
% 0.07/0.43 ============================== end of head ===========================
% 0.07/0.43
% 0.07/0.43 ============================== INPUT =================================
% 0.07/0.43
% 0.07/0.43 % Reading from file /tmp/Mace4_input_51964_n034.star.cs.uiowa.edu
% 0.07/0.43
% 0.07/0.43 set(prolog_style_variables).
% 0.07/0.43 set(print_models_tabular).
% 0.07/0.43 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.43
% 0.07/0.43 formulas(sos).
% 0.07/0.43 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom).
% 0.07/0.43 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom).
% 0.07/0.43 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom).
% 0.07/0.43 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom).
% 0.07/0.43 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom).
% 0.07/0.43 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom).
% 0.07/0.43 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom).
% 0.07/0.43 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom).
% 0.07/0.43 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom).
% 0.07/0.43 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom).
% 0.07/0.43 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom).
% 0.07/0.43 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom).
% 0.07/0.43 (all X0 addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0)) # label(domain1) # label(axiom).
% 0.07/0.43 (all X0 all X1 domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))) # label(domain2) # label(axiom).
% 0.07/0.43 (all X0 addition(domain(X0),one) = one) # label(domain3) # label(axiom).
% 0.07/0.43 domain(zero) = zero # label(domain4) # label(axiom).
% 0.07/0.43 (all X0 all X1 domain(addition(X0,X1)) = addition(domain(X0),domain(X1))) # label(domain5) # label(axiom).
% 0.07/0.43 end_of_list.
% 0.07/0.43
% 0.07/0.43 % From the command line: assign(max_seconds, 300).
% 0.07/0.43
% 0.07/0.43 ============================== end of input ==========================
% 0.07/0.43
% 0.07/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.43
% 0.07/0.43 % Formulas that are not ordinary clauses:
% 0.07/0.43 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 13 (all X0 addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0)) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 14 (all X0 all X1 domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 15 (all X0 addition(domain(X0),one) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43 16 (all X0 all X1 domain(addition(X0,X1)) = addition(domain(X0),domain(X1))) # label(domain5) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.43
% 0.07/0.43 ============================== end of process non-clausal formulas ===
% 0.07/0.43
% 0.07/0.43 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.43
% 0.07/0.43 formulas(mace4_clauses).
% 0.07/0.43 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom).
% 0.07/0.43 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom).
% 0.07/0.43 addition(A,zero) = A # label(additive_identity) # label(axiom).
% 0.07/0.43 addition(A,A) = A # label(additive_idempotence) # label(axiom).
% 0.07/0.43 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom).
% 0.07/0.43 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom).
% 0.07/0.43 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom).
% 0.07/0.43 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom).
% 0.07/0.43 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom).
% 0.07/0.43 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom).
% 0.07/0.43 multiplication(zero,A) = zero # label(left_annihilation) # label(axiom).
% 0.07/0.43 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom).
% 0.07/0.43 leq(A,B) | addition(A,B) != B # label(order) # label(axiom).
% 0.07/0.43 multiplication(domain(A),A) = addition(A,multiplication(domain(A),A)) # label(domain1) # label(axiom).
% 0.07/0.43 domain(multiplication(A,domain(B))) = domain(multiplication(A,B)) # label(domain2) # label(axiom).
% 0.07/0.43 addition(domain(A),one) = one # label(domain3) # label(axiom).
% 0.07/0.43 domain(zero) = zero # label(domain4) # label(axiom).
% 0.07/0.43 domain(addition(A,B)) = addition(domain(A),domain(B)) # label(domain5) # label(axiom).
% 0.07/0.43 end_of_list.
% 0.07/0.43
% 0.07/0.43 ============================== end of clauses for search =============
% 0.07/0.43 % SZS output start FiniteModel
% 0.07/0.43
% 0.07/0.43 % There are no natural numbers in the input.
% 0.07/0.43
% 0.07/0.43 one : 0
% 0.07/0.43
% 0.07/0.43 zero : 1
% 0.07/0.43
% 0.07/0.43 domain :
% 0.07/0.43 0 1
% 0.07/0.43 -------
% 0.07/0.43 0 1
% 0.07/0.43
% 0.07/0.43 addition :
% 0.07/0.43 | 0 1
% 0.07/0.43 --+----
% 0.07/0.43 0 | 0 0
% 0.07/0.43 1 | 0 1
% 0.07/0.43
% 0.07/0.43 multiplication :
% 0.07/0.43 | 0 1
% 0.07/0.43 --+----
% 0.07/0.43 0 | 0 1
% 0.07/0.43 1 | 1 1
% 0.07/0.43
% 0.07/0.43 leq :
% 0.07/0.43 | 0 1
% 0.07/0.43 --+----
% 0.07/0.43 0 | 1 0
% 0.07/0.43 1 | 1 1
% 0.07/0.43
% 0.07/0.43 % SZS output end FiniteModel
% 0.07/0.43 ------ process 51997 exit (max_models) ------
% 0.07/0.43
% 0.07/0.43 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.07/0.43
% 0.07/0.43 Exiting with 1 model.
% 0.07/0.43
% 0.07/0.43 Process 51997 exit (max_models) Tue Feb 7 19:39:01 2017
% 0.07/0.43 The process finished Tue Feb 7 19:39:01 2017
% 0.07/0.43 Mace4 ended
%------------------------------------------------------------------------------