TSTP Solution File: GRP027-2 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : GRP027-2 : TPTP v6.4.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n066.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:54:15 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 : GRP027-2 : TPTP v6.4.0. Bugfixed v1.2.1.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.24 % Computer : n066.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.75MB
% 0.02/0.24 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Tue Feb 7 17:07:18 CST 2017
% 0.02/0.24 % CPUTime :
% 0.07/0.46 % SZS status Satisfiable
% 0.07/0.47 ============================== Mace4 =================================
% 0.07/0.47 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.47 Process 27527 was started by sandbox on n066.star.cs.uiowa.edu,
% 0.07/0.47 Tue Feb 7 17:07:18 2017
% 0.07/0.47 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_27417_n066.star.cs.uiowa.edu".
% 0.07/0.47 ============================== end of head ===========================
% 0.07/0.47
% 0.07/0.47 ============================== INPUT =================================
% 0.07/0.47
% 0.07/0.47 % Reading from file /tmp/Mace4_input_27417_n066.star.cs.uiowa.edu
% 0.07/0.47
% 0.07/0.47 set(prolog_style_variables).
% 0.07/0.47 set(print_models_tabular).
% 0.07/0.47 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.47
% 0.07/0.47 formulas(sos).
% 0.07/0.47 equalish(X,X) # label(reflexivity) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | equalish(Y,X) # label(symmetry) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | -equalish(Y,Z) | equalish(X,Z) # label(transitivity) # label(axiom).
% 0.07/0.47 -equalish(Xg,Yg) | -product(Xg,X,Y,Z) | product(Yg,X,Y,Z) # label(product_substitution1) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | -product(Xg,X,Z,W) | product(Xg,Y,Z,W) # label(product_substitution2) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | -product(Xg,W,X,Z) | product(Xg,W,Y,Z) # label(product_substitution3) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | -product(Xg,W,Z,X) | product(Xg,W,Z,Y) # label(product_substitution4) # label(axiom).
% 0.07/0.47 -equalish(Xg,Yg) | equalish(multiply(Xg,X,Y),multiply(Yg,X,Y)) # label(multiply_substitution1) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | equalish(multiply(Xg,X,Z),multiply(Xg,Y,Z)) # label(multiply_substitution2) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | equalish(multiply(Xg,Z,X),multiply(Xg,Z,Y)) # label(multiply_substitution3) # label(axiom).
% 0.07/0.47 -equalish(Xg,Yg) | equalish(inverse(Xg,X),inverse(Yg,X)) # label(inverse_substitution1) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | equalish(inverse(Xg,X),inverse(Xg,Y)) # label(inverse_substitution2) # label(axiom).
% 0.07/0.47 -equalish(Xg,Yg) | -group_member(X,Xg) | group_member(X,Yg) # label(group_member_substitution1) # label(axiom).
% 0.07/0.47 -equalish(X,Y) | -group_member(X,Xg) | group_member(Y,Xg) # label(group_member_substitution2) # label(axiom).
% 0.07/0.47 -equalish(Xg,Yg) | equalish(identity_for(Xg),identity_for(Yg)) # label(identity_substitution) # label(axiom).
% 0.07/0.47 group_member(identity_for(Xg),Xg) # label(identity_in_group) # label(axiom).
% 0.07/0.47 product(Xg,identity_for(Xg),X,X) # label(left_identity) # label(axiom).
% 0.07/0.47 product(Xg,X,identity_for(Xg),X) # label(right_identity) # label(axiom).
% 0.07/0.47 -group_member(X,Xg) | group_member(inverse(Xg,X),Xg) # label(inverse_in_group) # label(axiom).
% 0.07/0.47 product(Xg,inverse(Xg,X),X,identity_for(Xg)) # label(left_inverse) # label(axiom).
% 0.07/0.47 product(Xg,X,inverse(Xg,X),identity_for(Xg)) # label(right_inverse) # label(axiom).
% 0.07/0.47 -group_member(X,Xg) | -group_member(Y,Xg) | product(Xg,X,Y,multiply(Xg,X,Y)) # label(total_function1_1) # label(axiom).
% 0.07/0.47 -group_member(X,Xg) | -group_member(Y,Xg) | group_member(multiply(Xg,X,Y),Xg) # label(total_function1_2) # label(axiom).
% 0.07/0.47 -product(Xg,X,Y,Z) | -product(Xg,X,Y,W) | equalish(W,Z) # label(total_function2) # label(axiom).
% 0.07/0.47 -product(Xg,X,Y,Xy) | -product(Xg,Y,Z,Yz) | -product(Xg,Xy,Z,Xyz) | product(Xg,X,Yz,Xyz) # label(associativity1) # label(axiom).
% 0.07/0.47 -product(Xg,X,Y,Xy) | -product(Xg,Y,Z,Yz) | -product(Xg,X,Yz,Xyz) | product(Xg,Xy,Z,Xyz) # label(associativity2) # label(axiom).
% 0.07/0.47 group_member(a,g) # label(a_in_group) # label(hypothesis).
% 0.07/0.47 group_member(b,g) # label(b_in_group) # label(hypothesis).
% 0.07/0.47 group_member(c,g) # label(c_in_group) # label(hypothesis).
% 0.07/0.47 group_member(d,g) # label(d_in_group) # label(hypothesis).
% 0.07/0.47 group_member(i,g) # label(i_in_group) # label(hypothesis).
% 0.07/0.47 equalish(identity_for(g),i) # label(i_is_identity) # label(hypothesis).
% 0.07/0.47 -group_member(X,g) | equalish(X,a) | equalish(X,b) | equalish(X,c) | equalish(X,d) | equalish(X,i) # label(all_of_group) # label(hypothesis).
% 0.07/0.47 equalish(multiply(g,X,multiply(g,X,multiply(g,X,multiply(g,X,X)))),i) # label(multiplication_to_identity) # label(hypothesis).
% 0.07/0.47 -equalish(not_power_of(g,X),X) # label(all_multiply_to_identity) # label(hypothesis).
% 0.07/0.47 -product(g,X,X,not_power_of(g,X)) # label(x2_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,X,multiply(g,X,X),not_power_of(g,X)) # label(x3_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,X,multiply(g,X,multiply(g,X,X)),not_power_of(g,X)) # label(x4_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,X,multiply(g,X,multiply(g,X,multiply(g,X,X))),not_power_of(g,X)) # label(x5_is_not_power) # label(negated_conjecture).
% 0.07/0.47 end_of_list.
% 0.07/0.47
% 0.07/0.47 % From the command line: assign(max_seconds, 300).
% 0.07/0.47
% 0.07/0.47 ============================== end of input ==========================
% 0.07/0.47
% 0.07/0.47 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.47
% 0.07/0.47 % Formulas that are not ordinary clauses:
% 0.07/0.47
% 0.07/0.47 ============================== end of process non-clausal formulas ===
% 0.07/0.47
% 0.07/0.47 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.47
% 0.07/0.47 formulas(mace4_clauses).
% 0.07/0.47 equalish(A,A) # label(reflexivity) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(B,A) # label(symmetry) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivity) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -product(A,C,D,E) | product(B,C,D,E) # label(product_substitution1) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -product(C,A,D,E) | product(C,B,D,E) # label(product_substitution2) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -product(C,D,A,E) | product(C,D,B,E) # label(product_substitution3) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -product(C,D,E,A) | product(C,D,E,B) # label(product_substitution4) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(multiply(A,C,D),multiply(B,C,D)) # label(multiply_substitution1) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(multiply(C,A,D),multiply(C,B,D)) # label(multiply_substitution2) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(multiply(C,D,A),multiply(C,D,B)) # label(multiply_substitution3) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(inverse(A,C),inverse(B,C)) # label(inverse_substitution1) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(inverse(C,A),inverse(C,B)) # label(inverse_substitution2) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -group_member(C,A) | group_member(C,B) # label(group_member_substitution1) # label(axiom).
% 0.07/0.47 -equalish(A,B) | -group_member(A,C) | group_member(B,C) # label(group_member_substitution2) # label(axiom).
% 0.07/0.47 -equalish(A,B) | equalish(identity_for(A),identity_for(B)) # label(identity_substitution) # label(axiom).
% 0.07/0.47 group_member(identity_for(A),A) # label(identity_in_group) # label(axiom).
% 0.07/0.47 product(A,identity_for(A),B,B) # label(left_identity) # label(axiom).
% 0.07/0.47 product(A,B,identity_for(A),B) # label(right_identity) # label(axiom).
% 0.07/0.47 -group_member(A,B) | group_member(inverse(B,A),B) # label(inverse_in_group) # label(axiom).
% 0.07/0.47 product(A,inverse(A,B),B,identity_for(A)) # label(left_inverse) # label(axiom).
% 0.07/0.47 product(A,B,inverse(A,B),identity_for(A)) # label(right_inverse) # label(axiom).
% 0.07/0.47 -group_member(A,B) | -group_member(C,B) | product(B,A,C,multiply(B,A,C)) # label(total_function1_1) # label(axiom).
% 0.07/0.47 -group_member(A,B) | -group_member(C,B) | group_member(multiply(B,A,C),B) # label(total_function1_2) # label(axiom).
% 0.07/0.47 -product(A,B,C,D) | -product(A,B,C,E) | equalish(E,D) # label(total_function2) # label(axiom).
% 0.07/0.47 -product(A,B,C,D) | -product(A,C,E,F) | -product(A,D,E,V6) | product(A,B,F,V6) # label(associativity1) # label(axiom).
% 0.07/0.47 -product(A,B,C,D) | -product(A,C,E,F) | -product(A,B,F,V6) | product(A,D,E,V6) # label(associativity2) # label(axiom).
% 0.07/0.47 group_member(a,g) # label(a_in_group) # label(hypothesis).
% 0.07/0.47 group_member(b,g) # label(b_in_group) # label(hypothesis).
% 0.07/0.47 group_member(c,g) # label(c_in_group) # label(hypothesis).
% 0.07/0.47 group_member(d,g) # label(d_in_group) # label(hypothesis).
% 0.07/0.47 group_member(i,g) # label(i_in_group) # label(hypothesis).
% 0.07/0.47 equalish(identity_for(g),i) # label(i_is_identity) # label(hypothesis).
% 0.07/0.47 -group_member(A,g) | equalish(A,a) | equalish(A,b) | equalish(A,c) | equalish(A,d) | equalish(A,i) # label(all_of_group) # label(hypothesis).
% 0.07/0.47 equalish(multiply(g,A,multiply(g,A,multiply(g,A,multiply(g,A,A)))),i) # label(multiplication_to_identity) # label(hypothesis).
% 0.07/0.47 -equalish(not_power_of(g,A),A) # label(all_multiply_to_identity) # label(hypothesis).
% 0.07/0.47 -product(g,A,A,not_power_of(g,A)) # label(x2_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,A,multiply(g,A,A),not_power_of(g,A)) # label(x3_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,A,multiply(g,A,multiply(g,A,A)),not_power_of(g,A)) # label(x4_is_not_power) # label(negated_conjecture).
% 0.07/0.47 -product(g,A,multiply(g,A,multiply(g,A,multiply(g,A,A))),not_power_of(g,A)) # label(x5_is_not_power) # label(negated_conjecture).
% 0.07/0.47 end_of_list.
% 0.07/0.47
% 0.07/0.47 ============================== end of clauses for search =============
% 0.07/0.47 % SZS output start FiniteModel
% 0.07/0.47
% 0.07/0.47 % There are no natural numbers in the input.
% 0.07/0.47
% 0.07/0.47 a : 0
% 0.07/0.47
% 0.07/0.47 b : 0
% 0.07/0.47
% 0.07/0.47 c : 0
% 0.07/0.47
% 0.07/0.47 d : 0
% 0.07/0.47
% 0.07/0.47 g : 0
% 0.07/0.47
% 0.07/0.47 i : 0
% 0.07/0.47
% 0.07/0.47 identity_for :
% 0.07/0.47 0 1 2
% 0.07/0.47 ---------
% 0.07/0.47 0 0 0
% 0.07/0.47
% 0.07/0.47 inverse :
% 0.07/0.47 | 0 1 2
% 0.07/0.47 --+------
% 0.07/0.47 0 | 0 1 2
% 0.07/0.47 1 | 0 1 2
% 0.07/0.47 2 | 0 1 2
% 0.07/0.47
% 0.07/0.47 not_power_of :
% 0.07/0.47 | 0 1 2
% 0.07/0.47 --+------
% 0.07/0.47 0 | 1 2 1
% 0.07/0.47 1 | 0 0 0
% 0.07/0.47 2 | 0 0 0
% 0.07/0.47 multiply(0,0,0) = 0.
% 0.07/0.47 multiply(0,0,1) = 0.
% 0.07/0.47 multiply(0,0,2) = 0.
% 0.07/0.47 multiply(0,1,0) = 0.
% 0.07/0.47 multiply(0,1,1) = 0.
% 0.07/0.47 multiply(0,1,2) = 0.
% 0.07/0.47 multiply(0,2,0) = 0.
% 0.07/0.47 multiply(0,2,1) = 0.
% 0.07/0.47 multiply(0,2,2) = 0.
% 0.07/0.47 multiply(1,0,0) = 0.
% 0.07/0.47 multiply(1,0,1) = 0.
% 0.07/0.47 multiply(1,0,2) = 0.
% 0.07/0.47 multiply(1,1,0) = 0.
% 0.07/0.47 multiply(1,1,1) = 0.
% 0.07/0.47 multiply(1,1,2) = 0.
% 0.07/0.47 multiply(1,2,0) = 0.
% 0.07/0.47 multiply(1,2,1) = 0.
% 0.07/0.47 multiply(1,2,2) = 0.
% 0.07/0.47 multiply(2,0,0) = 0.
% 0.07/0.47 multiply(2,0,1) = 0.
% 0.07/0.47 multiply(2,0,2) = 0.
% 0.07/0.47 multiply(2,1,0) = 0.
% 0.07/0.47 multiply(2,1,1) = 0.
% 0.07/0.47 multiply(2,1,2) = 0.
% 0.07/0.47 multiply(2,2,0) = 0.
% 0.07/0.47 multiply(2,2,1) = 0.
% 0.07/0.47 multiply(2,2,2) = 0.
% 0.07/0.47
% 0.07/0.47 equalish :
% 0.07/0.47 | 0 1 2
% 0.07/0.47 --+------
% 0.07/0.47 0 | 1 0 0
% 0.07/0.47 1 | 0 1 0
% 0.07/0.47 2 | 0 0 1
% 0.07/0.47
% 0.07/0.47 group_member :
% 0.07/0.47 | 0 1 2
% 0.07/0.47 --+------
% 0.07/0.47 0 | 1 1 1
% 0.07/0.47 1 | 0 0 0
% 0.07/0.47 2 | 0 0 0
% 0.07/0.47 product(0,0,0,0) = 1.
% 0.07/0.47 product(0,0,0,1) = 0.
% 0.07/0.47 product(0,0,0,2) = 0.
% 0.07/0.47 product(0,0,1,0) = 0.
% 0.07/0.47 product(0,0,1,1) = 1.
% 0.07/0.47 product(0,0,1,2) = 0.
% 0.07/0.47 product(0,0,2,0) = 0.
% 0.07/0.47 product(0,0,2,1) = 0.
% 0.07/0.47 product(0,0,2,2) = 1.
% 0.07/0.47 product(0,1,0,0) = 0.
% 0.07/0.47 product(0,1,0,1) = 1.
% 0.07/0.47 product(0,1,0,2) = 0.
% 0.07/0.47 product(0,1,1,0) = 1.
% 0.07/0.47 product(0,1,1,1) = 0.
% 0.07/0.47 product(0,1,1,2) = 0.
% 0.07/0.47 product(0,1,2,0) = 0.
% 0.07/0.47 product(0,1,2,1) = 0.
% 0.07/0.47 product(0,1,2,2) = 0.
% 0.07/0.47 product(0,2,0,0) = 0.
% 0.07/0.47 product(0,2,0,1) = 0.
% 0.07/0.47 product(0,2,0,2) = 1.
% 0.07/0.47 product(0,2,1,0) = 0.
% 0.07/0.47 product(0,2,1,1) = 0.
% 0.07/0.47 product(0,2,1,2) = 0.
% 0.07/0.47 product(0,2,2,0) = 1.
% 0.07/0.47 product(0,2,2,1) = 0.
% 0.07/0.47 product(0,2,2,2) = 0.
% 0.07/0.47 product(1,0,0,0) = 1.
% 0.07/0.47 product(1,0,0,1) = 0.
% 0.07/0.47 product(1,0,0,2) = 0.
% 0.07/0.47 product(1,0,1,0) = 0.
% 0.07/0.47 product(1,0,1,1) = 1.
% 0.07/0.47 product(1,0,1,2) = 0.
% 0.07/0.47 product(1,0,2,0) = 0.
% 0.07/0.47 product(1,0,2,1) = 0.
% 0.07/0.47 product(1,0,2,2) = 1.
% 0.07/0.47 product(1,1,0,0) = 0.
% 0.07/0.47 product(1,1,0,1) = 1.
% 0.07/0.47 product(1,1,0,2) = 0.
% 0.07/0.47 product(1,1,1,0) = 1.
% 0.07/0.47 product(1,1,1,1) = 0.
% 0.07/0.47 product(1,1,1,2) = 0.
% 0.07/0.47 product(1,1,2,0) = 0.
% 0.07/0.47 product(1,1,2,1) = 0.
% 0.07/0.47 product(1,1,2,2) = 0.
% 0.07/0.47 product(1,2,0,0) = 0.
% 0.07/0.47 product(1,2,0,1) = 0.
% 0.07/0.47 product(1,2,0,2) = 1.
% 0.07/0.47 product(1,2,1,0) = 0.
% 0.07/0.47 product(1,2,1,1) = 0.
% 0.07/0.47 product(1,2,1,2) = 0.
% 0.07/0.47 product(1,2,2,0) = 1.
% 0.07/0.47 product(1,2,2,1) = 0.
% 0.07/0.47 product(1,2,2,2) = 0.
% 0.07/0.47 product(2,0,0,0) = 1.
% 0.07/0.47 product(2,0,0,1) = 0.
% 0.07/0.47 product(2,0,0,2) = 0.
% 0.07/0.47 product(2,0,1,0) = 0.
% 0.07/0.47 product(2,0,1,1) = 1.
% 0.07/0.47 product(2,0,1,2) = 0.
% 0.07/0.47 product(2,0,2,0) = 0.
% 0.07/0.47 product(2,0,2,1) = 0.
% 0.07/0.47 product(2,0,2,2) = 1.
% 0.07/0.47 product(2,1,0,0) = 0.
% 0.07/0.47 product(2,1,0,1) = 1.
% 0.07/0.47 product(2,1,0,2) = 0.
% 0.07/0.47 product(2,1,1,0) = 1.
% 0.07/0.47 product(2,1,1,1) = 0.
% 0.07/0.47 product(2,1,1,2) = 0.
% 0.07/0.47 product(2,1,2,0) = 0.
% 0.07/0.47 product(2,1,2,1) = 0.
% 0.07/0.47 product(2,1,2,2) = 0.
% 0.07/0.47 product(2,2,0,0) = 0.
% 0.07/0.47 product(2,2,0,1) = 0.
% 0.07/0.47 product(2,2,0,2) = 1.
% 0.07/0.47 product(2,2,1,0) = 0.
% 0.07/0.47 product(2,2,1,1) = 0.
% 0.07/0.47 product(2,2,1,2) = 0.
% 0.07/0.47 product(2,2,2,0) = 1.
% 0.07/0.47 product(2,2,2,1) = 0.
% 0.07/0.47 product(2,2,2,2) = 0.
% 0.07/0.47
% 0.07/0.47 % SZS output end FiniteModel
% 0.07/0.47 ------ process 27527 exit (max_models) ------
% 0.07/0.47
% 0.07/0.47 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.07/0.47
% 0.07/0.47 Exiting with 1 model.
% 0.07/0.47
% 0.07/0.47 Process 27527 exit (max_models) Tue Feb 7 17:07:18 2017
% 0.07/0.47 The process finished Tue Feb 7 17:07:18 2017
% 0.07/0.47 Mace4 ended
%------------------------------------------------------------------------------