TSTP Solution File: KLE172+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KLE172+1 : TPTP v6.4.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n104.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 : CounterSatisfiable 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.04 % Problem : KLE172+1 : TPTP v6.4.0. Released v5.5.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.25 % Computer : n104.star.cs.uiowa.edu
% 0.02/0.25 % Model : x86_64 x86_64
% 0.02/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.25 % Memory : 32218.75MB
% 0.02/0.25 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.25 % CPULimit : 300
% 0.02/0.25 % DateTime : Tue Feb 7 19:39:15 CST 2017
% 0.02/0.25 % CPUTime :
% 0.06/0.46 % SZS status CounterSatisfiable
% 0.06/0.46 ============================== Mace4 =================================
% 0.06/0.46 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.46 Process 56643 was started by sandbox2 on n104.star.cs.uiowa.edu,
% 0.06/0.46 Tue Feb 7 19:39:16 2017
% 0.06/0.46 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_56610_n104.star.cs.uiowa.edu".
% 0.06/0.46 ============================== end of head ===========================
% 0.06/0.46
% 0.06/0.46 ============================== INPUT =================================
% 0.06/0.46
% 0.06/0.46 % Reading from file /tmp/Mace4_input_56610_n104.star.cs.uiowa.edu
% 0.06/0.46
% 0.06/0.46 set(prolog_style_variables).
% 0.06/0.46 set(print_models_tabular).
% 0.06/0.46 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.46
% 0.06/0.46 formulas(sos).
% 0.06/0.46 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom).
% 0.06/0.46 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom).
% 0.06/0.46 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom).
% 0.06/0.46 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom).
% 0.06/0.46 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom).
% 0.06/0.46 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom).
% 0.06/0.46 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom).
% 0.06/0.46 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom).
% 0.06/0.46 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom).
% 0.06/0.46 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom).
% 0.06/0.46 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom).
% 0.06/0.46 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom).
% 0.06/0.46 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom).
% 0.06/0.46 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom).
% 0.06/0.46 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom).
% 0.06/0.46 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom).
% 0.06/0.46 sigma = addition(a,b) # label(an) # label(axiom).
% 0.06/0.46 -leq(multiplication(a,multiplication(b,multiplication(b,multiplication(a,b)))),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) # label(a) # label(negated_conjecture).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 % From the command line: assign(max_seconds, 300).
% 0.06/0.46
% 0.06/0.46 ============================== end of input ==========================
% 0.06/0.46
% 0.06/0.46 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.46
% 0.06/0.46 % Formulas that are not ordinary clauses:
% 0.06/0.46 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 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.06/0.46 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 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.06/0.46 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 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.06/0.46 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.06/0.46 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 13 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 15 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46 16 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.46
% 0.06/0.46 ============================== end of process non-clausal formulas ===
% 0.06/0.46
% 0.06/0.46 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.46
% 0.06/0.46 formulas(mace4_clauses).
% 0.06/0.46 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom).
% 0.06/0.46 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom).
% 0.06/0.46 addition(A,zero) = A # label(additive_identity) # label(axiom).
% 0.06/0.46 addition(A,A) = A # label(additive_idempotence) # label(axiom).
% 0.06/0.46 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom).
% 0.06/0.46 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom).
% 0.06/0.46 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom).
% 0.06/0.46 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom).
% 0.06/0.46 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom).
% 0.06/0.46 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom).
% 0.06/0.46 multiplication(zero,A) = zero # label(left_annihilation) # label(axiom).
% 0.06/0.46 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom).
% 0.06/0.46 leq(A,B) | addition(A,B) != B # label(order) # label(axiom).
% 0.06/0.46 leq(addition(one,multiplication(A,star(A))),star(A)) # label(star_unfold_right) # label(axiom).
% 0.06/0.46 leq(addition(one,multiplication(star(A),A)),star(A)) # label(star_unfold_left) # label(axiom).
% 0.06/0.46 -leq(addition(multiplication(A,B),C),B) | leq(multiplication(star(A),C),B) # label(star_induction_left) # label(axiom).
% 0.06/0.46 -leq(addition(multiplication(A,B),C),A) | leq(multiplication(C,star(B)),A) # label(star_induction_right) # label(axiom).
% 0.06/0.46 sigma = addition(a,b) # label(an) # label(axiom).
% 0.06/0.46 -leq(multiplication(a,multiplication(b,multiplication(b,multiplication(a,b)))),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) # label(a) # label(negated_conjecture).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 ============================== end of clauses for search =============
% 0.06/0.46 % SZS output start FiniteModel
% 0.06/0.46
% 0.06/0.46 % There are no natural numbers in the input.
% 0.06/0.46
% 0.06/0.46 a : 0
% 0.06/0.46
% 0.06/0.46 b : 1
% 0.06/0.46
% 0.06/0.46 one : 2
% 0.06/0.46
% 0.06/0.46 sigma : 1
% 0.06/0.46
% 0.06/0.46 zero : 3
% 0.06/0.46
% 0.06/0.46 star :
% 0.06/0.46 0 1 2 3
% 0.06/0.46 -----------
% 0.06/0.46 2 1 2 2
% 0.06/0.46
% 0.06/0.46 addition :
% 0.06/0.46 | 0 1 2 3
% 0.06/0.46 --+--------
% 0.06/0.46 0 | 0 1 2 0
% 0.06/0.46 1 | 1 1 1 1
% 0.06/0.46 2 | 2 1 2 2
% 0.06/0.46 3 | 0 1 2 3
% 0.06/0.46
% 0.06/0.46 multiplication :
% 0.06/0.46 | 0 1 2 3
% 0.06/0.46 --+--------
% 0.06/0.46 0 | 0 1 0 3
% 0.06/0.46 1 | 0 1 1 3
% 0.06/0.46 2 | 0 1 2 3
% 0.06/0.46 3 | 3 3 3 3
% 0.06/0.46
% 0.06/0.46 leq :
% 0.06/0.46 | 0 1 2 3
% 0.06/0.46 --+--------
% 0.06/0.46 0 | 1 1 1 0
% 0.06/0.46 1 | 0 1 0 0
% 0.06/0.46 2 | 0 1 1 0
% 0.06/0.46 3 | 1 1 1 1
% 0.06/0.46
% 0.06/0.46 % SZS output end FiniteModel
% 0.06/0.46 ------ process 56643 exit (max_models) ------
% 0.06/0.46
% 0.06/0.46 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.06/0.46
% 0.06/0.46 Exiting with 1 model.
% 0.06/0.46
% 0.06/0.46 Process 56643 exit (max_models) Tue Feb 7 19:39:16 2017
% 0.06/0.46 The process finished Tue Feb 7 19:39:16 2017
% 0.06/0.46 Mace4 ended
%------------------------------------------------------------------------------