TSTP Solution File: LCL671+1.001 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : LCL671+1.001 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n134.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:20 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 : LCL671+1.001 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.23 % Computer : n134.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 19:26:46 CST 2017
% 0.03/0.23 % CPUTime :
% 0.06/0.44 % SZS status CounterSatisfiable
% 0.06/0.44 ============================== Mace4 =================================
% 0.06/0.44 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.44 Process 43572 was started by sandbox2 on n134.star.cs.uiowa.edu,
% 0.06/0.44 Tue Feb 7 19:26:46 2017
% 0.06/0.44 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_43539_n134.star.cs.uiowa.edu".
% 0.06/0.44 ============================== end of head ===========================
% 0.06/0.44
% 0.06/0.44 ============================== INPUT =================================
% 0.06/0.44
% 0.06/0.44 % Reading from file /tmp/Mace4_input_43539_n134.star.cs.uiowa.edu
% 0.06/0.44
% 0.06/0.44 set(prolog_style_variables).
% 0.06/0.44 set(print_models_tabular).
% 0.06/0.44 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.44
% 0.06/0.44 formulas(sos).
% 0.06/0.44 (all X r1(X,X)) # label(reflexivity) # label(axiom).
% 0.06/0.44 --(exists X -(-(all Y (-r1(X,Y) | -p4(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p3(X))) | -p2(Y)))) & p2(X) & -(all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(Y)))))))))) | -(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p3(Y))) | -p2(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(Y))))) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p3(Y))) | -p2(X))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(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))))) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p2(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))))))) # label(main) # label(negated_conjecture).
% 0.06/0.44 end_of_list.
% 0.06/0.44
% 0.06/0.44 % From the command line: assign(max_seconds, 300).
% 0.06/0.44
% 0.06/0.44 ============================== end of input ==========================
% 0.06/0.44
% 0.06/0.44 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.44
% 0.06/0.44 % Formulas that are not ordinary clauses:
% 0.06/0.44 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.44 2 --(exists X -(-(all Y (-r1(X,Y) | -p4(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p3(X))) | -p2(Y)))) & p2(X) & -(all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(Y)))))))))) | -(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p3(Y))) | -p2(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(Y))))) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p3(Y))) | -p2(X))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p2(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))))) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p2(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))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.06/0.44
% 0.06/0.44 ============================== end of process non-clausal formulas ===
% 0.06/0.44
% 0.06/0.44 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.44
% 0.06/0.44 formulas(mace4_clauses).
% 0.06/0.44 r1(A,A) # label(reflexivity) # label(axiom).
% 0.06/0.44 -r1(c1,A) | -p4(A) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f1(A,B,C)) | -p2(B) | -r1(B,D) | r1(D,f2(A,B,D)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f1(A,B,C)) | -p2(B) | -r1(B,D) | -r1(f2(A,B,D),E) | -p2(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f1(A,B,C)) | -p2(B) | -r1(B,D) | r1(D,f2(A,B,D)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f1(A,B,C)) | -p2(B) | -r1(B,D) | -r1(f2(A,B,D),E) | -p2(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p2(C) | -p2(B) | -r1(B,D) | r1(D,f2(A,B,D)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p2(C) | -p2(B) | -r1(B,D) | -r1(f2(A,B,D),E) | -p2(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f3(A,B,C)) | r1(A,f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f3(A,B,C)) | -r1(f5(A),D) | -p2(D) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(f3(A,B,C),f4(A,B,C)) | r1(A,f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(f3(A,B,C),f4(A,B,C)) | -r1(f5(A),D) | -p2(D) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f4(A,B,C)) | r1(A,f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f4(A,B,C)) | -r1(f5(A),D) | -p2(D) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p2(f3(A,B,C)) | r1(A,f5(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p2(f3(A,B,C)) | -r1(f5(A),D) | -p2(D) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | r1(A,f6(A)) | r1(A,f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | r1(A,f6(A)) | -r1(f8(A),B) | -p2(B) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | r1(f6(A),f7(A)) | r1(A,f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | r1(f6(A),f7(A)) | -r1(f8(A),B) | -p2(B) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -p3(f7(A)) | r1(A,f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -p3(f7(A)) | -r1(f8(A),B) | -p2(B) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | p2(f6(A)) | r1(A,f8(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | p2(f6(A)) | -r1(f8(A),B) | -p2(B) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | r1(A,f9(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p1(C) | -p1(f9(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c1,c2) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c2,c3) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c3,A) | p1(A) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c2,c4) # label(main) # label(negated_conjecture).
% 0.06/0.44 -p1(c4) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c1,c5) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c5,A) | r1(A,f10(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c5,A) | -p2(f10(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p1(C) | r1(A,f11(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p1(C) | p1(f11(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 end_of_list.
% 0.06/0.44
% 0.06/0.44 ============================== end of clauses for search =============
% 0.06/0.44 % SZS output start FiniteModel
% 0.06/0.44
% 0.06/0.44 % There are no natural numbers in the input.
% 0.06/0.44
% 0.06/0.44 c1 : 0
% 0.06/0.44
% 0.06/0.44 c2 : 0
% 0.06/0.44
% 0.06/0.44 c3 : 1
% 0.06/0.44
% 0.06/0.44 c4 : 0
% 0.06/0.44
% 0.06/0.44 c5 : 0
% 0.06/0.44
% 0.06/0.44 f5 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 1
% 0.06/0.44
% 0.06/0.44 f6 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 f7 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 f8 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 1
% 0.06/0.44
% 0.06/0.44 f9 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 f10 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 1
% 0.06/0.44
% 0.06/0.44 f11 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 1 1
% 0.06/0.44 f1(0,0,0) = 0.
% 0.06/0.44 f1(0,0,1) = 0.
% 0.06/0.44 f1(0,1,0) = 0.
% 0.06/0.44 f1(0,1,1) = 0.
% 0.06/0.44 f1(1,0,0) = 0.
% 0.06/0.44 f1(1,0,1) = 0.
% 0.06/0.44 f1(1,1,0) = 0.
% 0.06/0.44 f1(1,1,1) = 0.
% 0.06/0.44 f2(0,0,0) = 0.
% 0.06/0.44 f2(0,0,1) = 0.
% 0.06/0.44 f2(0,1,0) = 0.
% 0.06/0.44 f2(0,1,1) = 0.
% 0.06/0.44 f2(1,0,0) = 0.
% 0.06/0.44 f2(1,0,1) = 0.
% 0.06/0.44 f2(1,1,0) = 0.
% 0.06/0.44 f2(1,1,1) = 0.
% 0.06/0.44 f3(0,0,0) = 0.
% 0.06/0.44 f3(0,0,1) = 0.
% 0.06/0.44 f3(0,1,0) = 0.
% 0.06/0.44 f3(0,1,1) = 0.
% 0.06/0.44 f3(1,0,0) = 0.
% 0.06/0.44 f3(1,0,1) = 0.
% 0.06/0.44 f3(1,1,0) = 0.
% 0.06/0.44 f3(1,1,1) = 0.
% 0.06/0.44 f4(0,0,0) = 0.
% 0.06/0.44 f4(0,0,1) = 0.
% 0.06/0.44 f4(0,1,0) = 0.
% 0.06/0.44 f4(0,1,1) = 0.
% 0.06/0.44 f4(1,0,0) = 0.
% 0.06/0.44 f4(1,0,1) = 0.
% 0.06/0.44 f4(1,1,0) = 0.
% 0.06/0.44 f4(1,1,1) = 0.
% 0.06/0.44
% 0.06/0.44 p1 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 1
% 0.06/0.44
% 0.06/0.44 p2 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 p3 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 p4 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 r1 :
% 0.06/0.44 | 0 1
% 0.06/0.44 --+----
% 0.06/0.44 0 | 1 1
% 0.06/0.44 1 | 0 1
% 0.06/0.44
% 0.06/0.44 % SZS output end FiniteModel
% 0.06/0.44 ------ process 43572 exit (max_models) ------
% 0.06/0.44
% 0.06/0.44 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.44
% 0.06/0.44 Exiting with 1 model.
% 0.06/0.44
% 0.06/0.44 Process 43572 exit (max_models) Tue Feb 7 19:26:46 2017
% 0.06/0.44 The process finished Tue Feb 7 19:26:46 2017
% 0.06/0.44 Mace4 ended
%------------------------------------------------------------------------------