TSTP Solution File: CAT019-10 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : CAT019-10 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n186.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.5MB
% OS : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 11:43:14 EST 2019
% Result : Satisfiable 0.08s
% Output : FiniteModel 0.08s
% 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 : CAT019-10 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05 % Command : mace4 -t %d -f %s
% 0.03/0.25 % Computer : n186.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.5MB
% 0.03/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Mon Feb 18 11:42:00 CST 2019
% 0.03/0.25 % CPUTime :
% 0.08/0.53 % SZS status Satisfiable
% 0.08/0.53 ============================== Mace4 =================================
% 0.08/0.53 Mace4 (32) version 2009-11A, November 2009.
% 0.08/0.53 Process 63351 was started by sandbox2 on n186.star.cs.uiowa.edu,
% 0.08/0.53 Mon Feb 18 11:42:00 2019
% 0.08/0.53 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_63308_n186.star.cs.uiowa.edu".
% 0.08/0.53 ============================== end of head ===========================
% 0.08/0.53
% 0.08/0.53 ============================== INPUT =================================
% 0.08/0.53
% 0.08/0.53 % Reading from file /tmp/Mace4_input_63308_n186.star.cs.uiowa.edu
% 0.08/0.53
% 0.08/0.53 set(prolog_style_variables).
% 0.08/0.53 set(print_models_tabular).
% 0.08/0.53 % set(print_models_tabular) -> clear(print_models).
% 0.08/0.53
% 0.08/0.53 formulas(sos).
% 0.08/0.53 ifeq4(A,A,B,C) = B # label(ifeq_axiom) # label(axiom).
% 0.08/0.53 ifeq3(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom).
% 0.08/0.53 ifeq2(A,A,B,C) = B # label(ifeq_axiom_002) # label(axiom).
% 0.08/0.53 ifeq(A,A,B,C) = B # label(ifeq_axiom_003) # label(axiom).
% 0.08/0.53 ifeq(equivalent(X,Y),true,there_exists(X),true) = true # label(equivalence_implies_existence1) # label(axiom).
% 0.08/0.53 ifeq2(equivalent(X,Y),true,X,Y) = Y # label(equivalence_implies_existence2) # label(axiom).
% 0.08/0.53 ifeq(there_exists(Y),true,equivalent(Y,Y),true) = true # label(existence_and_equality_implies_equivalence1) # label(axiom).
% 0.08/0.53 ifeq(there_exists(domain(X)),true,there_exists(X),true) = true # label(domain_has_elements) # label(axiom).
% 0.08/0.53 ifeq(there_exists(codomain(X)),true,there_exists(X),true) = true # label(codomain_has_elements) # label(axiom).
% 0.08/0.53 ifeq(there_exists(compose(X,Y)),true,there_exists(domain(X)),true) = true # label(composition_implies_domain) # label(axiom).
% 0.08/0.53 ifeq2(there_exists(compose(X,Y)),true,domain(X),codomain(Y)) = codomain(Y) # label(domain_codomain_composition1) # label(axiom).
% 0.08/0.53 ifeq(there_exists(domain(X)),true,ifeq3(domain(X),codomain(Y),there_exists(compose(X,Y)),true),true) = true # label(domain_codomain_composition2) # label(axiom).
% 0.08/0.53 compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) # label(associativity_of_compose) # label(axiom).
% 0.08/0.53 compose(X,domain(X)) = X # label(compose_domain) # label(axiom).
% 0.08/0.53 compose(codomain(X),X) = X # label(compose_codomain) # label(axiom).
% 0.08/0.53 ifeq2(there_exists(Z),true,ifeq4(a,Z,b,Z),Z) = Z # label(equality_of_a_and_b1) # label(hypothesis).
% 0.08/0.53 ifeq2(there_exists(Z),true,ifeq4(b,Z,a,Z),Z) = Z # label(equality_of_a_and_b2) # label(hypothesis).
% 0.08/0.53 a != b # label(prove_a_equals_b) # label(negated_conjecture).
% 0.08/0.53 end_of_list.
% 0.08/0.53
% 0.08/0.53 % From the command line: assign(max_seconds, 300).
% 0.08/0.53
% 0.08/0.53 ============================== end of input ==========================
% 0.08/0.53
% 0.08/0.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.08/0.53
% 0.08/0.53 % Formulas that are not ordinary clauses:
% 0.08/0.53
% 0.08/0.53 ============================== end of process non-clausal formulas ===
% 0.08/0.53
% 0.08/0.53 ============================== CLAUSES FOR SEARCH ====================
% 0.08/0.53
% 0.08/0.53 formulas(mace4_clauses).
% 0.08/0.53 ifeq4(A,A,B,C) = B # label(ifeq_axiom) # label(axiom).
% 0.08/0.53 ifeq3(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom).
% 0.08/0.53 ifeq2(A,A,B,C) = B # label(ifeq_axiom_002) # label(axiom).
% 0.08/0.53 ifeq(A,A,B,C) = B # label(ifeq_axiom_003) # label(axiom).
% 0.08/0.53 ifeq(equivalent(A,B),true,there_exists(A),true) = true # label(equivalence_implies_existence1) # label(axiom).
% 0.08/0.53 ifeq2(equivalent(A,B),true,A,B) = B # label(equivalence_implies_existence2) # label(axiom).
% 0.08/0.53 ifeq(there_exists(A),true,equivalent(A,A),true) = true # label(existence_and_equality_implies_equivalence1) # label(axiom).
% 0.08/0.53 ifeq(there_exists(domain(A)),true,there_exists(A),true) = true # label(domain_has_elements) # label(axiom).
% 0.08/0.53 ifeq(there_exists(codomain(A)),true,there_exists(A),true) = true # label(codomain_has_elements) # label(axiom).
% 0.08/0.53 ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true) = true # label(composition_implies_domain) # label(axiom).
% 0.08/0.53 ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)) = codomain(B) # label(domain_codomain_composition1) # label(axiom).
% 0.08/0.53 ifeq(there_exists(domain(A)),true,ifeq3(domain(A),codomain(B),there_exists(compose(A,B)),true),true) = true # label(domain_codomain_composition2) # label(axiom).
% 0.08/0.53 compose(A,compose(B,C)) = compose(compose(A,B),C) # label(associativity_of_compose) # label(axiom).
% 0.08/0.53 compose(A,domain(A)) = A # label(compose_domain) # label(axiom).
% 0.08/0.53 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom).
% 0.08/0.53 ifeq2(there_exists(A),true,ifeq4(a,A,b,A),A) = A # label(equality_of_a_and_b1) # label(hypothesis).
% 0.08/0.53 ifeq2(there_exists(A),true,ifeq4(b,A,a,A),A) = A # label(equality_of_a_and_b2) # label(hypothesis).
% 0.08/0.53 a != b # label(prove_a_equals_b) # label(negated_conjecture).
% 0.08/0.53 end_of_list.
% 0.08/0.53
% 0.08/0.53 ============================== end of clauses for search =============
% 0.08/0.53 % SZS output start FiniteModel
% 0.08/0.53
% 0.08/0.53 % There are no natural numbers in the input.
% 0.08/0.53
% 0.08/0.53 a : 0
% 0.08/0.53
% 0.08/0.53 b : 1
% 0.08/0.53
% 0.08/0.53 true : 0
% 0.08/0.53
% 0.08/0.53 codomain :
% 0.08/0.53 0 1
% 0.08/0.53 -------
% 0.08/0.53 0 0
% 0.08/0.53
% 0.08/0.53 domain :
% 0.08/0.53 0 1
% 0.08/0.53 -------
% 0.08/0.53 0 0
% 0.08/0.53
% 0.08/0.53 there_exists :
% 0.08/0.53 0 1
% 0.08/0.53 -------
% 0.08/0.53 1 1
% 0.08/0.53
% 0.08/0.53 compose :
% 0.08/0.53 | 0 1
% 0.08/0.53 --+----
% 0.08/0.53 0 | 0 1
% 0.08/0.53 1 | 1 0
% 0.08/0.53
% 0.08/0.53 equivalent :
% 0.08/0.53 | 0 1
% 0.08/0.53 --+----
% 0.08/0.53 0 | 1 1
% 0.08/0.53 1 | 1 1
% 0.08/0.53 ifeq(0,0,0,0) = 0.
% 0.08/0.53 ifeq(0,0,0,1) = 0.
% 0.08/0.53 ifeq(0,0,1,0) = 1.
% 0.08/0.53 ifeq(0,0,1,1) = 1.
% 0.08/0.53 ifeq(0,1,0,0) = 0.
% 0.08/0.53 ifeq(0,1,0,1) = 0.
% 0.08/0.53 ifeq(0,1,1,0) = 0.
% 0.08/0.53 ifeq(0,1,1,1) = 0.
% 0.08/0.53 ifeq(1,0,0,0) = 0.
% 0.08/0.53 ifeq(1,0,0,1) = 0.
% 0.08/0.53 ifeq(1,0,1,0) = 0.
% 0.08/0.53 ifeq(1,0,1,1) = 0.
% 0.08/0.53 ifeq(1,1,0,0) = 0.
% 0.08/0.53 ifeq(1,1,0,1) = 0.
% 0.08/0.53 ifeq(1,1,1,0) = 1.
% 0.08/0.53 ifeq(1,1,1,1) = 1.
% 0.08/0.53 ifeq2(0,0,0,0) = 0.
% 0.08/0.53 ifeq2(0,0,0,1) = 0.
% 0.08/0.53 ifeq2(0,0,1,0) = 1.
% 0.08/0.53 ifeq2(0,0,1,1) = 1.
% 0.08/0.53 ifeq2(0,1,0,0) = 0.
% 0.08/0.53 ifeq2(0,1,0,1) = 0.
% 0.08/0.53 ifeq2(0,1,1,0) = 0.
% 0.08/0.53 ifeq2(0,1,1,1) = 0.
% 0.08/0.53 ifeq2(1,0,0,0) = 0.
% 0.08/0.53 ifeq2(1,0,0,1) = 1.
% 0.08/0.53 ifeq2(1,0,1,0) = 0.
% 0.08/0.53 ifeq2(1,0,1,1) = 1.
% 0.08/0.53 ifeq2(1,1,0,0) = 0.
% 0.08/0.53 ifeq2(1,1,0,1) = 0.
% 0.08/0.53 ifeq2(1,1,1,0) = 1.
% 0.08/0.53 ifeq2(1,1,1,1) = 1.
% 0.08/0.53 ifeq3(0,0,0,0) = 0.
% 0.08/0.53 ifeq3(0,0,0,1) = 0.
% 0.08/0.53 ifeq3(0,0,1,0) = 1.
% 0.08/0.53 ifeq3(0,0,1,1) = 1.
% 0.08/0.53 ifeq3(0,1,0,0) = 0.
% 0.08/0.53 ifeq3(0,1,0,1) = 0.
% 0.08/0.53 ifeq3(0,1,1,0) = 0.
% 0.08/0.53 ifeq3(0,1,1,1) = 0.
% 0.08/0.53 ifeq3(1,0,0,0) = 0.
% 0.08/0.53 ifeq3(1,0,0,1) = 0.
% 0.08/0.53 ifeq3(1,0,1,0) = 0.
% 0.08/0.53 ifeq3(1,0,1,1) = 0.
% 0.08/0.53 ifeq3(1,1,0,0) = 0.
% 0.08/0.53 ifeq3(1,1,0,1) = 0.
% 0.08/0.53 ifeq3(1,1,1,0) = 1.
% 0.08/0.53 ifeq3(1,1,1,1) = 1.
% 0.08/0.53 ifeq4(0,0,0,0) = 0.
% 0.08/0.53 ifeq4(0,0,0,1) = 0.
% 0.08/0.53 ifeq4(0,0,1,0) = 1.
% 0.08/0.53 ifeq4(0,0,1,1) = 1.
% 0.08/0.53 ifeq4(0,1,0,0) = 0.
% 0.08/0.53 ifeq4(0,1,0,1) = 0.
% 0.08/0.53 ifeq4(0,1,1,0) = 0.
% 0.08/0.53 ifeq4(0,1,1,1) = 0.
% 0.08/0.53 ifeq4(1,0,0,0) = 0.
% 0.08/0.53 ifeq4(1,0,0,1) = 0.
% 0.08/0.53 ifeq4(1,0,1,0) = 0.
% 0.08/0.53 ifeq4(1,0,1,1) = 0.
% 0.08/0.53 ifeq4(1,1,0,0) = 0.
% 0.08/0.53 ifeq4(1,1,0,1) = 0.
% 0.08/0.53 ifeq4(1,1,1,0) = 1.
% 0.08/0.53 ifeq4(1,1,1,1) = 1.
% 0.08/0.53
% 0.08/0.53 % SZS output end FiniteModel
% 0.08/0.53 ------ process 63351 exit (max_models) ------
% 0.08/0.53
% 0.08/0.53 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.08/0.53
% 0.08/0.53 Exiting with 1 model.
% 0.08/0.53
% 0.08/0.53 Process 63351 exit (max_models) Mon Feb 18 11:42:00 2019
% 0.08/0.53 The process finished Mon Feb 18 11:42:00 2019
% 0.08/0.53 Mace4 ended
%------------------------------------------------------------------------------