TSTP Solution File: RNG007-5 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : RNG007-5 : TPTP v6.4.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n017.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 10:02:08 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 : RNG007-5 : TPTP v6.4.0. Released v1.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.23 % Computer : n017.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 21:31:00 CST 2017
% 0.03/0.23 % CPUTime :
% 0.06/0.43 % SZS status Satisfiable
% 0.06/0.43 ============================== Mace4 =================================
% 0.06/0.43 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.43 Process 17954 was started by sandbox on n017.star.cs.uiowa.edu,
% 0.06/0.43 Tue Feb 7 21:31:01 2017
% 0.06/0.43 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_17921_n017.star.cs.uiowa.edu".
% 0.06/0.43 ============================== end of head ===========================
% 0.06/0.43
% 0.06/0.43 ============================== INPUT =================================
% 0.06/0.43
% 0.06/0.43 % Reading from file /tmp/Mace4_input_17921_n017.star.cs.uiowa.edu
% 0.06/0.43
% 0.06/0.43 set(prolog_style_variables).
% 0.06/0.43 set(print_models_tabular).
% 0.06/0.43 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.43
% 0.06/0.43 formulas(sos).
% 0.06/0.43 sum(additive_identity,X,X) # label(additive_identity1) # label(axiom).
% 0.06/0.43 sum(X,additive_identity,X) # label(additive_identity2) # label(axiom).
% 0.06/0.43 product(X,Y,multiply(X,Y)) # label(closure_of_multiplication) # label(axiom).
% 0.06/0.43 sum(X,Y,add(X,Y)) # label(closure_of_addition) # label(axiom).
% 0.06/0.43 sum(additive_inverse(X),X,additive_identity) # label(left_inverse) # label(axiom).
% 0.06/0.43 sum(X,additive_inverse(X),additive_identity) # label(right_inverse) # label(axiom).
% 0.06/0.43 -sum(X,Y,U) | -sum(Y,Z,V) | -sum(U,Z,W) | sum(X,V,W) # label(associativity_of_addition1) # label(axiom).
% 0.06/0.43 -sum(X,Y,U) | -sum(Y,Z,V) | -sum(X,V,W) | sum(U,Z,W) # label(associativity_of_addition2) # label(axiom).
% 0.06/0.43 -sum(X,Y,Z) | sum(Y,X,Z) # label(commutativity_of_addition) # label(axiom).
% 0.06/0.43 -product(X,Y,U) | -product(Y,Z,V) | -product(U,Z,W) | product(X,V,W) # label(associativity_of_multiplication1) # label(axiom).
% 0.06/0.43 -product(X,Y,U) | -product(Y,Z,V) | -product(X,V,W) | product(U,Z,W) # label(associativity_of_multiplication2) # label(axiom).
% 0.06/0.43 -product(X,Y,V1) | -product(X,Z,V2) | -sum(Y,Z,V3) | -product(X,V3,V4) | sum(V1,V2,V4) # label(distributivity1) # label(axiom).
% 0.06/0.43 -product(X,Y,V1) | -product(X,Z,V2) | -sum(Y,Z,V3) | -sum(V1,V2,V4) | product(X,V3,V4) # label(distributivity2) # label(axiom).
% 0.06/0.43 -product(Y,X,V1) | -product(Z,X,V2) | -sum(Y,Z,V3) | -product(V3,X,V4) | sum(V1,V2,V4) # label(distributivity3) # label(axiom).
% 0.06/0.43 -product(Y,X,V1) | -product(Z,X,V2) | -sum(Y,Z,V3) | -sum(V1,V2,V4) | product(V3,X,V4) # label(distributivity4) # label(axiom).
% 0.06/0.43 -sum(X,Y,U) | -sum(X,Y,V) | U = V # label(addition_is_well_defined) # label(axiom).
% 0.06/0.43 -product(X,Y,U) | -product(X,Y,V) | U = V # label(multiplication_is_well_defined) # label(axiom).
% 0.06/0.43 sum(additive_inverse(additive_identity),additive_identity,additive_identity) # label(additive_inverse_identity) # label(axiom).
% 0.06/0.43 sum(additive_inverse(additive_inverse(X)),additive_identity,X) # label(additive_inverse_additive_inverse) # label(axiom).
% 0.06/0.43 product(X,additive_identity,additive_identity) # label(multiply_additive_id1) # label(axiom).
% 0.06/0.43 product(additive_identity,X,additive_identity) # label(multiply_additive_id2) # label(axiom).
% 0.06/0.43 sum(additive_inverse(X),additive_inverse(Y),additive_inverse(add(X,Y))) # label(distribute_additive_inverse) # label(axiom).
% 0.06/0.43 product(X,additive_inverse(Y),additive_inverse(multiply(X,Y))) # label(multiply_additive_inverse) # label(axiom).
% 0.06/0.43 product(X,X,X) # label(x_squared_is_x) # label(hypothesis).
% 0.06/0.43 multiply(a,a) != additive_identity # label(prove_a_plus_a_is_id) # label(negated_conjecture).
% 0.06/0.43 end_of_list.
% 0.06/0.43
% 0.06/0.43 % From the command line: assign(max_seconds, 300).
% 0.06/0.43
% 0.06/0.43 ============================== end of input ==========================
% 0.06/0.43
% 0.06/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.43
% 0.06/0.43 % Formulas that are not ordinary clauses:
% 0.06/0.43
% 0.06/0.43 ============================== end of process non-clausal formulas ===
% 0.06/0.43
% 0.06/0.43 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.43
% 0.06/0.43 formulas(mace4_clauses).
% 0.06/0.43 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom).
% 0.06/0.43 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom).
% 0.06/0.43 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom).
% 0.06/0.43 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom).
% 0.06/0.43 sum(additive_inverse(A),A,additive_identity) # label(left_inverse) # label(axiom).
% 0.06/0.43 sum(A,additive_inverse(A),additive_identity) # label(right_inverse) # label(axiom).
% 0.06/0.43 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom).
% 0.06/0.43 -sum(A,B,C) | -sum(B,D,E) | -sum(A,E,F) | sum(C,D,F) # label(associativity_of_addition2) # label(axiom).
% 0.06/0.43 -sum(A,B,C) | sum(B,A,C) # label(commutativity_of_addition) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(B,D,E) | -product(C,D,F) | product(A,E,F) # label(associativity_of_multiplication1) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(B,D,E) | -product(A,E,F) | product(C,D,F) # label(associativity_of_multiplication2) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -product(A,F,V6) | sum(C,E,V6) # label(distributivity1) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -sum(C,E,V6) | product(A,F,V6) # label(distributivity2) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(D,B,E) | -sum(A,D,F) | -product(F,B,V6) | sum(C,E,V6) # label(distributivity3) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(D,B,E) | -sum(A,D,F) | -sum(C,E,V6) | product(F,B,V6) # label(distributivity4) # label(axiom).
% 0.06/0.43 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom).
% 0.06/0.43 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom).
% 0.06/0.43 sum(additive_inverse(additive_identity),additive_identity,additive_identity) # label(additive_inverse_identity) # label(axiom).
% 0.06/0.43 sum(additive_inverse(additive_inverse(A)),additive_identity,A) # label(additive_inverse_additive_inverse) # label(axiom).
% 0.06/0.43 product(A,additive_identity,additive_identity) # label(multiply_additive_id1) # label(axiom).
% 0.06/0.43 product(additive_identity,A,additive_identity) # label(multiply_additive_id2) # label(axiom).
% 0.06/0.43 sum(additive_inverse(A),additive_inverse(B),additive_inverse(add(A,B))) # label(distribute_additive_inverse) # label(axiom).
% 0.06/0.43 product(A,additive_inverse(B),additive_inverse(multiply(A,B))) # label(multiply_additive_inverse) # label(axiom).
% 0.06/0.43 product(A,A,A) # label(x_squared_is_x) # label(hypothesis).
% 0.06/0.43 multiply(a,a) != additive_identity # label(prove_a_plus_a_is_id) # label(negated_conjecture).
% 0.06/0.43 end_of_list.
% 0.06/0.43
% 0.06/0.43 ============================== end of clauses for search =============
% 0.06/0.43 % SZS output start FiniteModel
% 0.06/0.43
% 0.06/0.43 % There are no natural numbers in the input.
% 0.06/0.43
% 0.06/0.43 a : 0
% 0.06/0.43
% 0.06/0.43 additive_identity : 1
% 0.06/0.43
% 0.06/0.43 additive_inverse :
% 0.06/0.43 0 1
% 0.06/0.43 -------
% 0.06/0.43 0 1
% 0.06/0.43
% 0.06/0.43 add :
% 0.06/0.43 | 0 1
% 0.06/0.43 --+----
% 0.06/0.43 0 | 1 0
% 0.06/0.43 1 | 0 1
% 0.06/0.43
% 0.06/0.43 multiply :
% 0.06/0.43 | 0 1
% 0.06/0.43 --+----
% 0.06/0.43 0 | 0 1
% 0.06/0.43 1 | 1 1
% 0.06/0.43 product(0,0,0) = 1.
% 0.06/0.43 product(0,0,1) = 0.
% 0.06/0.43 product(0,1,0) = 0.
% 0.06/0.43 product(0,1,1) = 1.
% 0.06/0.43 product(1,0,0) = 0.
% 0.06/0.43 product(1,0,1) = 1.
% 0.06/0.43 product(1,1,0) = 0.
% 0.06/0.43 product(1,1,1) = 1.
% 0.06/0.43 sum(0,0,0) = 0.
% 0.06/0.43 sum(0,0,1) = 1.
% 0.06/0.43 sum(0,1,0) = 1.
% 0.06/0.43 sum(0,1,1) = 0.
% 0.06/0.43 sum(1,0,0) = 1.
% 0.06/0.43 sum(1,0,1) = 0.
% 0.06/0.43 sum(1,1,0) = 0.
% 0.06/0.43 sum(1,1,1) = 1.
% 0.06/0.43
% 0.06/0.43 % SZS output end FiniteModel
% 0.06/0.43 ------ process 17954 exit (max_models) ------
% 0.06/0.43
% 0.06/0.43 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.43
% 0.06/0.43 Exiting with 1 model.
% 0.06/0.43
% 0.06/0.43 Process 17954 exit (max_models) Tue Feb 7 21:31:01 2017
% 0.06/0.43 The process finished Tue Feb 7 21:31:01 2017
% 0.06/0.43 Mace4 ended
%------------------------------------------------------------------------------