TSTP Solution File: PUZ028-2 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : PUZ028-2 : TPTP v6.4.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n078.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:01:37 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 : PUZ028-2 : TPTP v6.4.0. Bugfixed v1.2.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n078.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Tue Feb 7 20:33:45 CST 2017
% 0.02/0.23 % CPUTime :
% 0.07/0.43 % SZS status Satisfiable
% 0.07/0.43 ============================== Mace4 =================================
% 0.07/0.43 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.43 Process 8839 was started by sandbox2 on n078.star.cs.uiowa.edu,
% 0.07/0.43 Tue Feb 7 20:33:46 2017
% 0.07/0.43 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_8806_n078.star.cs.uiowa.edu".
% 0.07/0.43 ============================== end of head ===========================
% 0.07/0.43
% 0.07/0.43 ============================== INPUT =================================
% 0.07/0.43
% 0.07/0.43 % Reading from file /tmp/Mace4_input_8806_n078.star.cs.uiowa.edu
% 0.07/0.43
% 0.07/0.43 set(prolog_style_variables).
% 0.07/0.43 set(print_models_tabular).
% 0.07/0.43 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.43
% 0.07/0.43 formulas(sos).
% 0.07/0.43 person(n1) # label(person_1) # label(axiom).
% 0.07/0.43 person(n2) # label(person_2) # label(axiom).
% 0.07/0.43 person(n3) # label(person_3) # label(axiom).
% 0.07/0.43 person(n4) # label(person_4) # label(axiom).
% 0.07/0.43 person(n5) # label(person_5) # label(axiom).
% 0.07/0.43 person(n6) # label(person_6) # label(axiom).
% 0.07/0.43 not_equal(n1,n2) # label(not_equal_1_2) # label(axiom).
% 0.07/0.43 not_equal(n1,n3) # label(not_equal_1_3) # label(axiom).
% 0.07/0.43 not_equal(n1,n4) # label(not_equal_1_4) # label(axiom).
% 0.07/0.43 not_equal(n1,n5) # label(not_equal_1_5) # label(axiom).
% 0.07/0.43 not_equal(n1,n6) # label(not_equal_1_6) # label(axiom).
% 0.07/0.43 not_equal(n2,n1) # label(not_equal_2_1) # label(axiom).
% 0.07/0.43 not_equal(n2,n3) # label(not_equal_2_3) # label(axiom).
% 0.07/0.43 not_equal(n2,n4) # label(not_equal_2_4) # label(axiom).
% 0.07/0.43 not_equal(n2,n5) # label(not_equal_2_5) # label(axiom).
% 0.07/0.43 not_equal(n2,n6) # label(not_equal_2_6) # label(axiom).
% 0.07/0.43 not_equal(n3,n1) # label(not_equal_3_1) # label(axiom).
% 0.07/0.43 not_equal(n3,n2) # label(not_equal_3_2) # label(axiom).
% 0.07/0.43 not_equal(n3,n4) # label(not_equal_3_4) # label(axiom).
% 0.07/0.43 not_equal(n3,n5) # label(not_equal_3_5) # label(axiom).
% 0.07/0.43 not_equal(n3,n6) # label(not_equal_3_6) # label(axiom).
% 0.07/0.43 not_equal(n4,n1) # label(not_equal_4_1) # label(axiom).
% 0.07/0.43 not_equal(n4,n2) # label(not_equal_4_2) # label(axiom).
% 0.07/0.43 not_equal(n4,n3) # label(not_equal_4_3) # label(axiom).
% 0.07/0.43 not_equal(n4,n5) # label(not_equal_4_5) # label(axiom).
% 0.07/0.43 not_equal(n4,n6) # label(not_equal_4_6) # label(axiom).
% 0.07/0.43 not_equal(n5,n1) # label(not_equal_5_1) # label(axiom).
% 0.07/0.43 not_equal(n5,n2) # label(not_equal_5_2) # label(axiom).
% 0.07/0.43 not_equal(n5,n3) # label(not_equal_5_3) # label(axiom).
% 0.07/0.43 not_equal(n5,n4) # label(not_equal_5_4) # label(axiom).
% 0.07/0.43 not_equal(n5,n6) # label(not_equal_5_6) # label(axiom).
% 0.07/0.43 not_equal(n6,n1) # label(not_equal_6_1) # label(axiom).
% 0.07/0.43 not_equal(n6,n2) # label(not_equal_6_2) # label(axiom).
% 0.07/0.43 not_equal(n6,n3) # label(not_equal_6_3) # label(axiom).
% 0.07/0.43 not_equal(n6,n4) # label(not_equal_6_4) # label(axiom).
% 0.07/0.43 not_equal(n6,n5) # label(not_equal_6_5) # label(axiom).
% 0.07/0.43 familiar(X,Y) | not_familiar(X,Y) | -person(X) | -person(Y) | -not_equal(X,Y) # label(familiar_or_not) # label(axiom).
% 0.07/0.43 -familiar(X1,X2) | -familiar(X2,X3) | -familiar(X3,X1) # label(three_familiar) # label(negated_conjecture).
% 0.07/0.43 -not_familiar(X1,X2) | -not_familiar(X2,X3) | -not_familiar(X3,X1) # label(three_not_familiar) # label(negated_conjecture).
% 0.07/0.43 end_of_list.
% 0.07/0.43
% 0.07/0.43 % From the command line: assign(max_seconds, 300).
% 0.07/0.43
% 0.07/0.43 ============================== end of input ==========================
% 0.07/0.43
% 0.07/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.43
% 0.07/0.43 % Formulas that are not ordinary clauses:
% 0.07/0.43
% 0.07/0.43 ============================== end of process non-clausal formulas ===
% 0.07/0.43
% 0.07/0.43 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.43
% 0.07/0.43 formulas(mace4_clauses).
% 0.07/0.43 person(n1) # label(person_1) # label(axiom).
% 0.07/0.43 person(n2) # label(person_2) # label(axiom).
% 0.07/0.43 person(n3) # label(person_3) # label(axiom).
% 0.07/0.43 person(n4) # label(person_4) # label(axiom).
% 0.07/0.43 person(n5) # label(person_5) # label(axiom).
% 0.07/0.43 person(n6) # label(person_6) # label(axiom).
% 0.07/0.43 not_equal(n1,n2) # label(not_equal_1_2) # label(axiom).
% 0.07/0.43 not_equal(n1,n3) # label(not_equal_1_3) # label(axiom).
% 0.07/0.43 not_equal(n1,n4) # label(not_equal_1_4) # label(axiom).
% 0.07/0.43 not_equal(n1,n5) # label(not_equal_1_5) # label(axiom).
% 0.07/0.43 not_equal(n1,n6) # label(not_equal_1_6) # label(axiom).
% 0.07/0.43 not_equal(n2,n1) # label(not_equal_2_1) # label(axiom).
% 0.07/0.43 not_equal(n2,n3) # label(not_equal_2_3) # label(axiom).
% 0.07/0.43 not_equal(n2,n4) # label(not_equal_2_4) # label(axiom).
% 0.07/0.43 not_equal(n2,n5) # label(not_equal_2_5) # label(axiom).
% 0.07/0.43 not_equal(n2,n6) # label(not_equal_2_6) # label(axiom).
% 0.07/0.43 not_equal(n3,n1) # label(not_equal_3_1) # label(axiom).
% 0.07/0.43 not_equal(n3,n2) # label(not_equal_3_2) # label(axiom).
% 0.07/0.43 not_equal(n3,n4) # label(not_equal_3_4) # label(axiom).
% 0.07/0.43 not_equal(n3,n5) # label(not_equal_3_5) # label(axiom).
% 0.07/0.43 not_equal(n3,n6) # label(not_equal_3_6) # label(axiom).
% 0.07/0.43 not_equal(n4,n1) # label(not_equal_4_1) # label(axiom).
% 0.07/0.43 not_equal(n4,n2) # label(not_equal_4_2) # label(axiom).
% 0.07/0.43 not_equal(n4,n3) # label(not_equal_4_3) # label(axiom).
% 0.07/0.43 not_equal(n4,n5) # label(not_equal_4_5) # label(axiom).
% 0.07/0.43 not_equal(n4,n6) # label(not_equal_4_6) # label(axiom).
% 0.07/0.43 not_equal(n5,n1) # label(not_equal_5_1) # label(axiom).
% 0.07/0.43 not_equal(n5,n2) # label(not_equal_5_2) # label(axiom).
% 0.07/0.43 not_equal(n5,n3) # label(not_equal_5_3) # label(axiom).
% 0.07/0.43 not_equal(n5,n4) # label(not_equal_5_4) # label(axiom).
% 0.07/0.43 not_equal(n5,n6) # label(not_equal_5_6) # label(axiom).
% 0.07/0.43 not_equal(n6,n1) # label(not_equal_6_1) # label(axiom).
% 0.07/0.43 not_equal(n6,n2) # label(not_equal_6_2) # label(axiom).
% 0.07/0.43 not_equal(n6,n3) # label(not_equal_6_3) # label(axiom).
% 0.07/0.43 not_equal(n6,n4) # label(not_equal_6_4) # label(axiom).
% 0.07/0.43 not_equal(n6,n5) # label(not_equal_6_5) # label(axiom).
% 0.07/0.43 familiar(A,B) | not_familiar(A,B) | -person(A) | -person(B) | -not_equal(A,B) # label(familiar_or_not) # label(axiom).
% 0.07/0.43 -familiar(A,B) | -familiar(B,C) | -familiar(C,A) # label(three_familiar) # label(negated_conjecture).
% 0.07/0.43 -not_familiar(A,B) | -not_familiar(B,C) | -not_familiar(C,A) # label(three_not_familiar) # label(negated_conjecture).
% 0.07/0.43 end_of_list.
% 0.07/0.43
% 0.07/0.43 ============================== end of clauses for search =============
% 0.07/0.43 % SZS output start FiniteModel
% 0.07/0.43
% 0.07/0.43 % There are no natural numbers in the input.
% 0.07/0.43
% 0.07/0.43 n1 : 0
% 0.07/0.43
% 0.07/0.43 n2 : 1
% 0.07/0.43
% 0.07/0.43 n3 : 2
% 0.07/0.43
% 0.07/0.43 n4 : 3
% 0.07/0.43
% 0.07/0.43 n5 : 4
% 0.07/0.43
% 0.07/0.43 n6 : 5
% 0.07/0.43
% 0.07/0.43 person :
% 0.07/0.43 0 1 2 3 4 5
% 0.07/0.43 ---------------
% 0.07/0.43 1 1 1 1 1 1
% 0.07/0.43
% 0.07/0.43 familiar :
% 0.07/0.43 | 0 1 2 3 4 5
% 0.07/0.43 --+------------
% 0.07/0.43 0 | 0 0 0 0 0 0
% 0.07/0.43 1 | 0 0 1 0 0 0
% 0.07/0.43 2 | 0 1 0 0 0 0
% 0.07/0.43 3 | 1 1 1 0 0 0
% 0.07/0.43 4 | 1 1 1 0 0 1
% 0.07/0.43 5 | 1 1 1 0 1 0
% 0.07/0.43
% 0.07/0.43 not_equal :
% 0.07/0.43 | 0 1 2 3 4 5
% 0.07/0.43 --+------------
% 0.07/0.43 0 | 0 1 1 1 1 1
% 0.07/0.43 1 | 1 0 1 1 1 1
% 0.07/0.43 2 | 1 1 0 1 1 1
% 0.07/0.43 3 | 1 1 1 0 1 1
% 0.07/0.43 4 | 1 1 1 1 0 1
% 0.07/0.43 5 | 1 1 1 1 1 0
% 0.07/0.43
% 0.07/0.43 not_familiar :
% 0.07/0.43 | 0 1 2 3 4 5
% 0.07/0.43 --+------------
% 0.07/0.43 0 | 0 1 1 1 1 1
% 0.07/0.43 1 | 1 0 0 1 1 1
% 0.07/0.43 2 | 1 0 0 1 1 1
% 0.07/0.43 3 | 0 0 0 0 1 1
% 0.07/0.43 4 | 0 0 0 1 0 0
% 0.07/0.43 5 | 0 0 0 1 0 0
% 0.07/0.43
% 0.07/0.43 % SZS output end FiniteModel
% 0.07/0.43 ------ process 8839 exit (max_models) ------
% 0.07/0.43
% 0.07/0.43 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.07/0.43
% 0.07/0.43 Exiting with 1 model.
% 0.07/0.43
% 0.07/0.43 Process 8839 exit (max_models) Tue Feb 7 20:33:46 2017
% 0.07/0.43 The process finished Tue Feb 7 20:33:46 2017
% 0.07/0.43 Mace4 ended
%------------------------------------------------------------------------------