TSTP Solution File: LCL655+1.001 by Mace4---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Mace4---1109a
% Problem  : LCL655+1.001 : TPTP v6.4.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : mace4 -t %d -f %s

% Computer : n072.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:58:13 EST 2017

% Result   : CounterSatisfiable 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  : LCL655+1.001 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04  % Command  : mace4 -t %d -f %s
% 0.02/0.23  % Computer : n072.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 19:25:46 CST 2017
% 0.02/0.23  % CPUTime  : 
% 0.06/0.45  % SZS status CounterSatisfiable
% 0.06/0.45  ============================== Mace4 =================================
% 0.06/0.45  Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.45  Process 17253 was started by sandbox2 on n072.star.cs.uiowa.edu,
% 0.06/0.45  Tue Feb  7 19:25:46 2017
% 0.06/0.45  The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_17219_n072.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_17219_n072.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 X r1(X,X)) # label(reflexivity) # label(axiom).
% 0.06/0.45  --(exists X -(-(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -(all X (-r1(Y,X) | -p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | (all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))) # label(main) # label(negated_conjecture).
% 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 X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
% 0.06/0.45  2 --(exists X -(-(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -(all X (-r1(Y,X) | -p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | (all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))) # label(main) # label(negated_conjecture) # 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  r1(A,A) # label(reflexivity) # label(axiom).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(C,f1(A,B,C)) | r1(A,f2(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(C,f1(A,B,C)) | -p1(f2(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(C,f1(A,B,C)) | -r1(f2(A),D) | p1(D) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f1(A,B,C)) | r1(A,f2(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f1(A,B,C)) | -p1(f2(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f1(A,B,C)) | -r1(f2(A),D) | p1(D) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -r1(C,D) | -p1(D) | r1(A,f3(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -r1(C,D) | -p1(D) | -p1(f3(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -r1(C,D) | -p1(D) | r1(f3(A),f4(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -r1(C,D) | -p1(D) | p1(f4(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | p1(A) | r1(A,f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | p1(A) | -p1(f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f6(A,B,C)) | r1(A,f7(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f6(A,B,C)) | -r1(f7(A),D) | -p1(D) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(f6(A,B,C)) | r1(A,f7(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(f6(A,B,C)) | -r1(f7(A),D) | -p1(D) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(A,f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.45  r1(c1,c2) # label(main) # label(negated_conjecture).
% 0.06/0.45  r1(c2,c3) # label(main) # label(negated_conjecture).
% 0.06/0.45  -r1(c3,A) | p1(A) # label(main) # label(negated_conjecture).
% 0.06/0.45  r1(c2,c4) # label(main) # label(negated_conjecture).
% 0.06/0.45  -p1(c4) # label(main) # label(negated_conjecture).
% 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   c1 : 0
% 0.06/0.45  
% 0.06/0.45   c2 : 0
% 0.06/0.45  
% 0.06/0.45   c3 : 1
% 0.06/0.45  
% 0.06/0.45   c4 : 0
% 0.06/0.45  
% 0.06/0.45   f2 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 0
% 0.06/0.45  
% 0.06/0.45   f3 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 0
% 0.06/0.45  
% 0.06/0.45   f4 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          1 0
% 0.06/0.45  
% 0.06/0.45   f5 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 0
% 0.06/0.45  
% 0.06/0.45   f7 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 0
% 0.06/0.45  
% 0.06/0.45   f8 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 0
% 0.06/0.45  f1(0,0,0) = 0.
% 0.06/0.45  f1(0,0,1) = 0.
% 0.06/0.45  f1(0,1,0) = 0.
% 0.06/0.45  f1(0,1,1) = 0.
% 0.06/0.45  f1(1,0,0) = 0.
% 0.06/0.45  f1(1,0,1) = 0.
% 0.06/0.45  f1(1,1,0) = 0.
% 0.06/0.45  f1(1,1,1) = 0.
% 0.06/0.45  f6(0,0,0) = 1.
% 0.06/0.45  f6(0,0,1) = 1.
% 0.06/0.45  f6(0,1,0) = 0.
% 0.06/0.45  f6(0,1,1) = 1.
% 0.06/0.45  f6(1,0,0) = 0.
% 0.06/0.45  f6(1,0,1) = 0.
% 0.06/0.45  f6(1,1,0) = 0.
% 0.06/0.45  f6(1,1,1) = 1.
% 0.06/0.45  
% 0.06/0.45   p1 :
% 0.06/0.45          0 1
% 0.06/0.45      -------
% 0.06/0.45          0 1
% 0.06/0.45  
% 0.06/0.45   r1 :
% 0.06/0.45        | 0 1
% 0.06/0.45      --+----
% 0.06/0.45      0 | 1 1
% 0.06/0.45      1 | 0 1
% 0.06/0.45  
% 0.06/0.45  % SZS output end FiniteModel
% 0.06/0.45  ------ process 17253 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 17253 exit (max_models) Tue Feb  7 19:25:46 2017
% 0.06/0.45  The process finished Tue Feb  7 19:25:46 2017
% 0.06/0.45  Mace4 ended
%------------------------------------------------------------------------------