TSTP Solution File: LCL651+1.001 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : LCL651+1.001 : TPTP v6.4.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n045.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:11 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 : LCL651+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 : n045.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:25:15 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 15502 was started by sandbox on n045.star.cs.uiowa.edu,
% 0.06/0.44 Tue Feb 7 19:25:16 2017
% 0.06/0.44 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_15469_n045.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_15469_n045.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 --(exists X -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -p10(Y) & -p8(Y) & -p6(Y) & -p4(Y) & -p2(Y))))))))))) | (all Y (-r1(X,Y) | p6(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p4(Y) & -p1(Y) | p1(Y) & p4(Y)))))))))) | (all X (-r1(Y,X) | p5(X))) | -(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p3(Y) & -p4(Y) | p4(Y) & p3(Y)))))))) | (all Y (-r1(X,Y) | p4(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p2(Y) & -p3(Y) | p3(Y) & p2(Y)))))) | (all X (-r1(Y,X) | p3(X))) | -(all X (-r1(Y,X) | --(all Y (-r1(X,Y) | -(-p1(Y) & -p2(Y) | p2(Y) & p1(Y))))))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p5(Y) & p4(Y) & p3(Y) & p2(Y) & p1(Y))))))))))))) # 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 --(exists X -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -p10(Y) & -p8(Y) & -p6(Y) & -p4(Y) & -p2(Y))))))))))) | (all Y (-r1(X,Y) | p6(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p4(Y) & -p1(Y) | p1(Y) & p4(Y)))))))))) | (all X (-r1(Y,X) | p5(X))) | -(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p3(Y) & -p4(Y) | p4(Y) & p3(Y)))))))) | (all Y (-r1(X,Y) | p4(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p2(Y) & -p3(Y) | p3(Y) & p2(Y)))))) | (all X (-r1(Y,X) | p3(X))) | -(all X (-r1(Y,X) | --(all Y (-r1(X,Y) | -(-p1(Y) & -p2(Y) | p2(Y) & p1(Y))))))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p5(Y) & p4(Y) & p3(Y) & p2(Y) & p1(Y))))))))))))) # 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(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,c4) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c4,c5) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c5,c6) # label(main) # label(negated_conjecture).
% 0.06/0.44 p10(c6) | p8(c6) | p6(c6) | p4(c6) | p2(c6) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c1,c7) # label(main) # label(negated_conjecture).
% 0.06/0.44 -p6(c7) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p4(E) | p1(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p1(E) | -p4(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | r1(A,f1(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -p5(f1(A)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p3(E) | p4(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p4(E) | -p3(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | r1(B,f2(A,B)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -p4(f2(A,B)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p2(E) | p3(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p3(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)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f3(A,B,C)) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p1(E) | p2(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p2(E) | -p1(E) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c1,c8) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c8,c9) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c9,c10) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c10,c11) # label(main) # label(negated_conjecture).
% 0.06/0.44 r1(c11,c12) # label(main) # label(negated_conjecture).
% 0.06/0.44 -p5(c12) | -p4(c12) | -p3(c12) | -p2(c12) | -p1(c12) # 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 : 0
% 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 c6 : 0
% 0.06/0.44
% 0.06/0.44 c7 : 0
% 0.06/0.44
% 0.06/0.44 c8 : 0
% 0.06/0.44
% 0.06/0.44 c9 : 0
% 0.06/0.44
% 0.06/0.44 c10 : 0
% 0.06/0.44
% 0.06/0.44 c11 : 0
% 0.06/0.44
% 0.06/0.44 c12 : 0
% 0.06/0.44
% 0.06/0.44 f1 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 f2 :
% 0.06/0.44 | 0 1
% 0.06/0.44 --+----
% 0.06/0.44 0 | 0 0
% 0.06/0.44 1 | 0 0
% 0.06/0.44 f3(0,0,0) = 1.
% 0.06/0.44 f3(0,0,1) = 1.
% 0.06/0.44 f3(0,1,0) = 1.
% 0.06/0.44 f3(0,1,1) = 1.
% 0.06/0.44 f3(1,0,0) = 1.
% 0.06/0.44 f3(1,0,1) = 1.
% 0.06/0.44 f3(1,1,0) = 1.
% 0.06/0.44 f3(1,1,1) = 1.
% 0.06/0.44
% 0.06/0.44 p1 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 1 0
% 0.06/0.44
% 0.06/0.44 p10 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 p2 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 1
% 0.06/0.44
% 0.06/0.44 p3 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 1 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 1
% 0.06/0.44
% 0.06/0.44 p5 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 p6 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 0 0
% 0.06/0.44
% 0.06/0.44 p8 :
% 0.06/0.44 0 1
% 0.06/0.44 -------
% 0.06/0.44 1 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 | 1 1
% 0.06/0.44
% 0.06/0.44 % SZS output end FiniteModel
% 0.06/0.44 ------ process 15502 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 15502 exit (max_models) Tue Feb 7 19:25:16 2017
% 0.06/0.44 The process finished Tue Feb 7 19:25:16 2017
% 0.06/0.44 Mace4 ended
%------------------------------------------------------------------------------