TSTP Solution File: KLE179+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KLE179+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n021.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:14 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 : KLE179+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.23 % Computer : n021.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.75MB
% 0.03/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Tue Feb 7 19:39:00 CST 2017
% 0.03/0.23 % CPUTime :
% 0.06/0.45 % SZS status Satisfiable
% 0.06/0.45 ============================== Mace4 =================================
% 0.06/0.45 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.45 Process 61746 was started by sandbox on n021.star.cs.uiowa.edu,
% 0.06/0.45 Tue Feb 7 19:39:01 2017
% 0.06/0.45 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_61713_n021.star.cs.uiowa.edu".
% 0.06/0.45 ============================== end of head ===========================
% 0.06/0.45
% 0.06/0.45 ============================== INPUT =================================
% 0.06/0.45
% 0.06/0.45 % Reading from file /tmp/Mace4_input_61713_n021.star.cs.uiowa.edu
% 0.06/0.45
% 0.06/0.45 set(prolog_style_variables).
% 0.06/0.45 set(print_models_tabular).
% 0.06/0.45 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.45
% 0.06/0.45 formulas(sos).
% 0.06/0.45 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom).
% 0.06/0.45 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom).
% 0.06/0.45 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom).
% 0.06/0.45 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom).
% 0.06/0.45 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom).
% 0.06/0.45 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom).
% 0.06/0.45 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom).
% 0.06/0.45 (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.45 (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.45 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom).
% 0.06/0.45 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom).
% 0.06/0.45 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom).
% 0.06/0.45 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom).
% 0.06/0.45 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom).
% 0.06/0.45 (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.45 (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.45 (all A multiplication(A,omega(A)) = omega(A)) # label(omega_unfold) # label(axiom).
% 0.06/0.45 (all A all B all C (leq(A,addition(multiplication(B,A),C)) -> leq(A,addition(omega(B),multiplication(star(B),C))))) # label(omega_co_induction) # label(axiom).
% 0.06/0.45 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom).
% 0.06/0.45 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom).
% 0.06/0.45 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom).
% 0.06/0.45 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom).
% 0.06/0.45 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom).
% 0.06/0.45 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom).
% 0.06/0.45 (all X0 all X1 all X2 (ismeet(X2,X0,X1) <-> leq(X2,X0) & leq(X2,X1) & (all X3 (leq(X3,X0) & leq(X3,X1) -> leq(X3,X2))))) # label(ismeet) # label(axiom).
% 0.06/0.45 (all X0 all X1 all X2 (ismeetu(X2,X0,X1) <-> (all X3 (leq(X3,X0) & leq(X3,X1) <-> leq(X3,X2))))) # label(ismeetu) # label(axiom).
% 0.06/0.45 end_of_list.
% 0.06/0.45
% 0.06/0.45 % From the command line: assign(max_seconds, 300).
% 0.06/0.45
% 0.06/0.45 ============================== end of input ==========================
% 0.06/0.45
% 0.06/0.45 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.45
% 0.06/0.45 % Formulas that are not ordinary clauses:
% 0.06/0.45 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 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.45 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 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.45 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 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.45 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.45 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 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.45 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.45 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.45 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.45 17 (all A multiplication(A,omega(A)) = omega(A)) # label(omega_unfold) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 18 (all A all B all C (leq(A,addition(multiplication(B,A),C)) -> leq(A,addition(omega(B),multiplication(star(B),C))))) # label(omega_co_induction) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 19 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 20 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 21 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 22 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 23 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 24 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 25 (all X0 all X1 all X2 (ismeet(X2,X0,X1) <-> leq(X2,X0) & leq(X2,X1) & (all X3 (leq(X3,X0) & leq(X3,X1) -> leq(X3,X2))))) # label(ismeet) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 26 (all X0 all X1 all X2 (ismeetu(X2,X0,X1) <-> (all X3 (leq(X3,X0) & leq(X3,X1) <-> leq(X3,X2))))) # label(ismeetu) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45
% 0.06/0.45 ============================== end of process non-clausal formulas ===
% 0.06/0.45
% 0.06/0.45 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.45
% 0.06/0.45 formulas(mace4_clauses).
% 0.06/0.45 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom).
% 0.06/0.45 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom).
% 0.06/0.45 addition(A,zero) = A # label(additive_identity) # label(axiom).
% 0.06/0.45 addition(A,A) = A # label(additive_idempotence) # label(axiom).
% 0.06/0.45 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom).
% 0.06/0.45 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom).
% 0.06/0.45 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom).
% 0.06/0.45 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom).
% 0.06/0.45 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom).
% 0.06/0.45 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom).
% 0.06/0.45 multiplication(zero,A) = zero # label(left_annihilation) # label(axiom).
% 0.06/0.45 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom).
% 0.06/0.45 leq(A,B) | addition(A,B) != B # label(order) # label(axiom).
% 0.06/0.45 leq(addition(one,multiplication(A,star(A))),star(A)) # label(star_unfold_right) # label(axiom).
% 0.06/0.45 leq(addition(one,multiplication(star(A),A)),star(A)) # label(star_unfold_left) # label(axiom).
% 0.06/0.45 -leq(addition(multiplication(A,B),C),B) | leq(multiplication(star(A),C),B) # label(star_induction_left) # label(axiom).
% 0.06/0.45 -leq(addition(multiplication(A,B),C),A) | leq(multiplication(C,star(B)),A) # label(star_induction_right) # label(axiom).
% 0.06/0.45 omega(A) = multiplication(A,omega(A)) # label(omega_unfold) # label(axiom).
% 0.06/0.45 -leq(A,addition(multiplication(B,A),C)) | leq(A,addition(omega(B),multiplication(star(B),C))) # label(omega_co_induction) # label(axiom).
% 0.06/0.45 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom).
% 0.06/0.45 test(A) | -complement(B,A) # label(test_1) # label(axiom).
% 0.06/0.45 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom).
% 0.06/0.45 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom).
% 0.06/0.45 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom).
% 0.06/0.45 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom).
% 0.06/0.45 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom).
% 0.06/0.45 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom).
% 0.06/0.45 test(A) | c(A) = zero # label(test_4) # label(axiom).
% 0.06/0.45 -test(A) | -test(B) | c(addition(A,B)) = multiplication(c(A),c(B)) # label(test_deMorgan1) # label(axiom).
% 0.06/0.45 -test(A) | -test(B) | c(multiplication(A,B)) = addition(c(A),c(B)) # label(test_deMorgan2) # label(axiom).
% 0.06/0.45 -ismeet(A,B,C) | leq(A,B) # label(ismeet) # label(axiom).
% 0.06/0.45 -ismeet(A,B,C) | leq(A,C) # label(ismeet) # label(axiom).
% 0.06/0.45 -ismeet(A,B,C) | -leq(D,B) | -leq(D,C) | leq(D,A) # label(ismeet) # label(axiom).
% 0.06/0.45 ismeet(A,B,C) | -leq(A,B) | -leq(A,C) | leq(f2(B,C,A),B) # label(ismeet) # label(axiom).
% 0.06/0.45 ismeet(A,B,C) | -leq(A,B) | -leq(A,C) | leq(f2(B,C,A),C) # label(ismeet) # label(axiom).
% 0.06/0.45 ismeet(A,B,C) | -leq(A,B) | -leq(A,C) | -leq(f2(B,C,A),A) # label(ismeet) # label(axiom).
% 0.06/0.45 -ismeetu(A,B,C) | -leq(D,B) | -leq(D,C) | leq(D,A) # label(ismeetu) # label(axiom).
% 0.06/0.45 -ismeetu(A,B,C) | leq(D,B) | -leq(D,A) # label(ismeetu) # label(axiom).
% 0.06/0.45 -ismeetu(A,B,C) | leq(D,C) | -leq(D,A) # label(ismeetu) # label(axiom).
% 0.06/0.45 ismeetu(A,B,C) | leq(f3(B,C,A),B) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom).
% 0.06/0.45 ismeetu(A,B,C) | leq(f3(B,C,A),C) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom).
% 0.06/0.45 ismeetu(A,B,C) | -leq(f3(B,C,A),B) | -leq(f3(B,C,A),C) | -leq(f3(B,C,A),A) # label(ismeetu) # label(axiom).
% 0.06/0.45 end_of_list.
% 0.06/0.45
% 0.06/0.45 ============================== end of clauses for search =============
% 0.06/0.45 % SZS output start FiniteModel
% 0.06/0.45
% 0.06/0.45 % There are no natural numbers in the input.
% 0.06/0.45
% 0.06/0.45 one : 0
% 0.06/0.45
% 0.06/0.45 zero : 1
% 0.06/0.45
% 0.06/0.45 c :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 0
% 0.06/0.45
% 0.06/0.45 omega :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 1
% 0.06/0.45
% 0.06/0.45 star :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 0
% 0.06/0.45
% 0.06/0.45 f1 :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 0
% 0.06/0.45
% 0.06/0.45 addition :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 0 0
% 0.06/0.45 1 | 0 1
% 0.06/0.45
% 0.06/0.45 multiplication :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 0 1
% 0.06/0.45 1 | 1 1
% 0.06/0.45 f2(0,0,0) = 0.
% 0.06/0.45 f2(0,0,1) = 0.
% 0.06/0.45 f2(0,1,0) = 0.
% 0.06/0.45 f2(0,1,1) = 0.
% 0.06/0.45 f2(1,0,0) = 0.
% 0.06/0.45 f2(1,0,1) = 0.
% 0.06/0.45 f2(1,1,0) = 0.
% 0.06/0.45 f2(1,1,1) = 0.
% 0.06/0.45 f3(0,0,0) = 0.
% 0.06/0.45 f3(0,0,1) = 0.
% 0.06/0.45 f3(0,1,0) = 0.
% 0.06/0.45 f3(0,1,1) = 0.
% 0.06/0.45 f3(1,0,0) = 0.
% 0.06/0.45 f3(1,0,1) = 0.
% 0.06/0.45 f3(1,1,0) = 0.
% 0.06/0.45 f3(1,1,1) = 0.
% 0.06/0.45
% 0.06/0.45 test :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 1
% 0.06/0.45
% 0.06/0.45 complement :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 0 1
% 0.06/0.45 1 | 1 0
% 0.06/0.45
% 0.06/0.45 leq :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 1 0
% 0.06/0.45 1 | 1 1
% 0.06/0.45 ismeet(0,0,0) = 1.
% 0.06/0.45 ismeet(0,0,1) = 0.
% 0.06/0.45 ismeet(0,1,0) = 0.
% 0.06/0.45 ismeet(0,1,1) = 0.
% 0.06/0.45 ismeet(1,0,0) = 0.
% 0.06/0.45 ismeet(1,0,1) = 1.
% 0.06/0.45 ismeet(1,1,0) = 1.
% 0.06/0.45 ismeet(1,1,1) = 1.
% 0.06/0.45 ismeetu(0,0,0) = 1.
% 0.06/0.45 ismeetu(0,0,1) = 0.
% 0.06/0.45 ismeetu(0,1,0) = 0.
% 0.06/0.45 ismeetu(0,1,1) = 0.
% 0.06/0.45 ismeetu(1,0,0) = 0.
% 0.06/0.45 ismeetu(1,0,1) = 1.
% 0.06/0.45 ismeetu(1,1,0) = 1.
% 0.06/0.45 ismeetu(1,1,1) = 1.
% 0.06/0.45
% 0.06/0.45 % SZS output end FiniteModel
% 0.06/0.45 ------ process 61746 exit (max_models) ------
% 0.06/0.45
% 0.06/0.45 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.45
% 0.06/0.45 Exiting with 1 model.
% 0.06/0.45
% 0.06/0.45 Process 61746 exit (max_models) Tue Feb 7 19:39:01 2017
% 0.06/0.45 The process finished Tue Feb 7 19:39:01 2017
% 0.06/0.45 Mace4 ended
%------------------------------------------------------------------------------