TSTP Solution File: NUM285-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : NUM285-1 : TPTP v7.0.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n043.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 14:40:59 EST 2018
% 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 : NUM285-1 : TPTP v7.0.0. Released v1.1.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n043.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.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 00:21:31 CST 2018
% 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 2182 was started by sandbox2 on n043.star.cs.uiowa.edu,
% 0.07/0.43 Fri Jan 5 00:21:31 2018
% 0.07/0.43 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_2149_n043.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_2149_n043.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 -p1 | a0 | a1 # label(p1_is_a0_plus_a1_1) # label(negated_conjecture).
% 0.07/0.43 -p1 | -a0 | -a1 # label(p1_is_a0_plus_a1_2) # label(negated_conjecture).
% 0.07/0.43 p1 | a0 | -a1 # label(p1_is_a0_plus_a1_3) # label(negated_conjecture).
% 0.07/0.43 p1 | -a0 | a1 # label(p1_is_a0_plus_a1_4) # label(negated_conjecture).
% 0.07/0.43 -p2 | p1 | a2 # label(p2_is_p1_plus_a2_1) # label(negated_conjecture).
% 0.07/0.43 -p2 | -p1 | -a2 # label(p2_is_p1_plus_a2_2) # label(negated_conjecture).
% 0.07/0.43 p2 | p1 | -a2 # label(p2_is_p1_plus_a2_3) # label(negated_conjecture).
% 0.07/0.43 p2 | -p1 | a2 # label(p2_is_p1_plus_a2_4) # label(negated_conjecture).
% 0.07/0.43 -p3 | p2 | a3 # label(p3_is_p2_plus_a3_1) # label(negated_conjecture).
% 0.07/0.43 -p3 | -p2 | a3 # label(p3_is_p2_plus_a3_2) # label(negated_conjecture).
% 0.07/0.43 p3 | p2 | -a3 # label(p3_is_p2_plus_a3_3) # label(negated_conjecture).
% 0.07/0.43 p3 | -p2 | a3 # label(p3_is_p2_plus_a3_4) # label(negated_conjecture).
% 0.07/0.43 -p4 | p3 | a4 # label(p4_is_p3_plus_a4_1) # label(negated_conjecture).
% 0.07/0.43 -p4 | -p3 | a4 # label(p4_is_p3_plus_a4_2) # label(negated_conjecture).
% 0.07/0.43 p4 | p3 | -a4 # label(p4_is_p3_plus_a4_3) # label(negated_conjecture).
% 0.07/0.43 p4 | -p3 | a4 # label(p4_is_p3_plus_a4_4) # label(negated_conjecture).
% 0.07/0.43 -p5 | p4 | a5 # label(p5_is_p4_plus_a5_1) # label(negated_conjecture).
% 0.07/0.43 -p5 | -p4 | a5 # label(p5_is_p4_plus_a5_2) # label(negated_conjecture).
% 0.07/0.43 p5 | p4 | -a5 # label(p5_is_p4_plus_a5_3) # label(negated_conjecture).
% 0.07/0.43 p5 | -p4 | a5 # label(p5_is_p4_plus_a5_4) # label(negated_conjecture).
% 0.07/0.43 -q1 | b0 | b1 # label(q1_is_b0_plus_b1_1) # label(negated_conjecture).
% 0.07/0.43 -q1 | -b0 | -b1 # label(q1_is_b0_plus_b1_2) # label(negated_conjecture).
% 0.07/0.43 q1 | b0 | -b1 # label(q1_is_b0_plus_b1_3) # label(negated_conjecture).
% 0.07/0.43 q1 | -b0 | b1 # label(q1_is_b0_plus_b1_4) # label(negated_conjecture).
% 0.07/0.43 -q2 | q1 | b2 # label(q2_is_q1_plus_b2_1) # label(negated_conjecture).
% 0.07/0.43 -q2 | -q1 | -b2 # label(q2_is_q1_plus_b2_2) # label(negated_conjecture).
% 0.07/0.43 q2 | q1 | -b2 # label(q2_is_q1_plus_b2_3) # label(negated_conjecture).
% 0.07/0.43 q2 | -q1 | b2 # label(q2_is_q1_plus_b2_4) # label(negated_conjecture).
% 0.07/0.43 -q3 | q2 | b3 # label(q3_is_q2_plus_b3_1) # label(negated_conjecture).
% 0.07/0.43 -q3 | -q2 | b3 # label(q3_is_q2_plus_b3_2) # label(negated_conjecture).
% 0.07/0.43 q3 | q2 | -b3 # label(q3_is_q2_plus_b3_3) # label(negated_conjecture).
% 0.07/0.43 q3 | -q2 | b3 # label(q3_is_q2_plus_b3_4) # label(negated_conjecture).
% 0.07/0.43 -q4 | q3 | b4 # label(q4_is_q3_plus_b4_1) # label(negated_conjecture).
% 0.07/0.43 -q4 | -q3 | b4 # label(q4_is_q3_plus_b4_2) # label(negated_conjecture).
% 0.07/0.43 q4 | q3 | -b4 # label(q4_is_q3_plus_b4_3) # label(negated_conjecture).
% 0.07/0.43 q4 | -q3 | b4 # label(q4_is_q3_plus_b4_4) # label(negated_conjecture).
% 0.07/0.43 -q5 | q4 | b5 # label(q5_is_q4_plus_b5_1) # label(negated_conjecture).
% 0.07/0.43 -q5 | -q4 | b5 # label(q5_is_q4_plus_b5_2) # label(negated_conjecture).
% 0.07/0.43 q5 | q4 | -b5 # label(q5_is_q4_plus_b5_3) # label(negated_conjecture).
% 0.07/0.43 q5 | -q4 | b5 # label(q5_is_q4_plus_b5_4) # label(negated_conjecture).
% 0.07/0.43 a0 | b0 # label(a0_not_b0_1) # label(negated_conjecture).
% 0.07/0.43 -a0 | -b0 # label(a0_not_b0_2) # label(negated_conjecture).
% 0.07/0.43 a1 | -b1 # label(a1_is_b1_1) # label(negated_conjecture).
% 0.07/0.43 -a1 | b1 # label(a1_is_b1_2) # label(negated_conjecture).
% 0.07/0.43 a2 | -b2 # label(a2_is_b2_1) # label(negated_conjecture).
% 0.07/0.43 -a2 | b2 # label(a2_is_b2_2) # label(negated_conjecture).
% 0.07/0.43 a3 | -b3 # label(a3_is_b3_1) # label(negated_conjecture).
% 0.07/0.43 -a3 | b3 # label(a3_is_b3_2) # label(negated_conjecture).
% 0.07/0.43 a4 | -b4 # label(a4_is_b4_1) # label(negated_conjecture).
% 0.07/0.43 -a4 | b4 # label(a4_is_b4_2) # label(negated_conjecture).
% 0.07/0.43 a5 | -b5 # label(a5_is_b5_1) # label(negated_conjecture).
% 0.07/0.43 -a5 | b5 # label(a5_is_b5_2) # label(negated_conjecture).
% 0.07/0.43 q5 # label(equal_sum_1) # label(negated_conjecture).
% 0.07/0.43 p5 # label(equal_sum_2) # 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 -p1 | a0 | a1 # label(p1_is_a0_plus_a1_1) # label(negated_conjecture).
% 0.07/0.43 -p1 | -a0 | -a1 # label(p1_is_a0_plus_a1_2) # label(negated_conjecture).
% 0.07/0.43 p1 | a0 | -a1 # label(p1_is_a0_plus_a1_3) # label(negated_conjecture).
% 0.07/0.43 p1 | -a0 | a1 # label(p1_is_a0_plus_a1_4) # label(negated_conjecture).
% 0.07/0.43 -p2 | p1 | a2 # label(p2_is_p1_plus_a2_1) # label(negated_conjecture).
% 0.07/0.43 -p2 | -p1 | -a2 # label(p2_is_p1_plus_a2_2) # label(negated_conjecture).
% 0.07/0.43 p2 | p1 | -a2 # label(p2_is_p1_plus_a2_3) # label(negated_conjecture).
% 0.07/0.43 p2 | -p1 | a2 # label(p2_is_p1_plus_a2_4) # label(negated_conjecture).
% 0.07/0.43 -p3 | p2 | a3 # label(p3_is_p2_plus_a3_1) # label(negated_conjecture).
% 0.07/0.43 -p3 | -p2 | a3 # label(p3_is_p2_plus_a3_2) # label(negated_conjecture).
% 0.07/0.43 p3 | p2 | -a3 # label(p3_is_p2_plus_a3_3) # label(negated_conjecture).
% 0.07/0.43 p3 | -p2 | a3 # label(p3_is_p2_plus_a3_4) # label(negated_conjecture).
% 0.07/0.43 -p4 | p3 | a4 # label(p4_is_p3_plus_a4_1) # label(negated_conjecture).
% 0.07/0.43 -p4 | -p3 | a4 # label(p4_is_p3_plus_a4_2) # label(negated_conjecture).
% 0.07/0.43 p4 | p3 | -a4 # label(p4_is_p3_plus_a4_3) # label(negated_conjecture).
% 0.07/0.43 p4 | -p3 | a4 # label(p4_is_p3_plus_a4_4) # label(negated_conjecture).
% 0.07/0.43 -p5 | p4 | a5 # label(p5_is_p4_plus_a5_1) # label(negated_conjecture).
% 0.07/0.43 -p5 | -p4 | a5 # label(p5_is_p4_plus_a5_2) # label(negated_conjecture).
% 0.07/0.43 p5 | p4 | -a5 # label(p5_is_p4_plus_a5_3) # label(negated_conjecture).
% 0.07/0.43 p5 | -p4 | a5 # label(p5_is_p4_plus_a5_4) # label(negated_conjecture).
% 0.07/0.43 -q1 | b0 | b1 # label(q1_is_b0_plus_b1_1) # label(negated_conjecture).
% 0.07/0.43 -q1 | -b0 | -b1 # label(q1_is_b0_plus_b1_2) # label(negated_conjecture).
% 0.07/0.43 q1 | b0 | -b1 # label(q1_is_b0_plus_b1_3) # label(negated_conjecture).
% 0.07/0.43 q1 | -b0 | b1 # label(q1_is_b0_plus_b1_4) # label(negated_conjecture).
% 0.07/0.43 -q2 | q1 | b2 # label(q2_is_q1_plus_b2_1) # label(negated_conjecture).
% 0.07/0.43 -q2 | -q1 | -b2 # label(q2_is_q1_plus_b2_2) # label(negated_conjecture).
% 0.07/0.43 q2 | q1 | -b2 # label(q2_is_q1_plus_b2_3) # label(negated_conjecture).
% 0.07/0.43 q2 | -q1 | b2 # label(q2_is_q1_plus_b2_4) # label(negated_conjecture).
% 0.07/0.43 -q3 | q2 | b3 # label(q3_is_q2_plus_b3_1) # label(negated_conjecture).
% 0.07/0.43 -q3 | -q2 | b3 # label(q3_is_q2_plus_b3_2) # label(negated_conjecture).
% 0.07/0.43 q3 | q2 | -b3 # label(q3_is_q2_plus_b3_3) # label(negated_conjecture).
% 0.07/0.43 q3 | -q2 | b3 # label(q3_is_q2_plus_b3_4) # label(negated_conjecture).
% 0.07/0.43 -q4 | q3 | b4 # label(q4_is_q3_plus_b4_1) # label(negated_conjecture).
% 0.07/0.43 -q4 | -q3 | b4 # label(q4_is_q3_plus_b4_2) # label(negated_conjecture).
% 0.07/0.43 q4 | q3 | -b4 # label(q4_is_q3_plus_b4_3) # label(negated_conjecture).
% 0.07/0.43 q4 | -q3 | b4 # label(q4_is_q3_plus_b4_4) # label(negated_conjecture).
% 0.07/0.43 -q5 | q4 | b5 # label(q5_is_q4_plus_b5_1) # label(negated_conjecture).
% 0.07/0.43 -q5 | -q4 | b5 # label(q5_is_q4_plus_b5_2) # label(negated_conjecture).
% 0.07/0.43 q5 | q4 | -b5 # label(q5_is_q4_plus_b5_3) # label(negated_conjecture).
% 0.07/0.43 q5 | -q4 | b5 # label(q5_is_q4_plus_b5_4) # label(negated_conjecture).
% 0.07/0.43 a0 | b0 # label(a0_not_b0_1) # label(negated_conjecture).
% 0.07/0.43 -a0 | -b0 # label(a0_not_b0_2) # label(negated_conjecture).
% 0.07/0.43 a1 | -b1 # label(a1_is_b1_1) # label(negated_conjecture).
% 0.07/0.43 -a1 | b1 # label(a1_is_b1_2) # label(negated_conjecture).
% 0.07/0.43 a2 | -b2 # label(a2_is_b2_1) # label(negated_conjecture).
% 0.07/0.43 -a2 | b2 # label(a2_is_b2_2) # label(negated_conjecture).
% 0.07/0.43 a3 | -b3 # label(a3_is_b3_1) # label(negated_conjecture).
% 0.07/0.43 -a3 | b3 # label(a3_is_b3_2) # label(negated_conjecture).
% 0.07/0.43 a4 | -b4 # label(a4_is_b4_1) # label(negated_conjecture).
% 0.07/0.43 -a4 | b4 # label(a4_is_b4_2) # label(negated_conjecture).
% 0.07/0.43 a5 | -b5 # label(a5_is_b5_1) # label(negated_conjecture).
% 0.07/0.43 -a5 | b5 # label(a5_is_b5_2) # label(negated_conjecture).
% 0.07/0.43 q5 # label(equal_sum_1) # label(negated_conjecture).
% 0.07/0.43 p5 # label(equal_sum_2) # 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 a0 : 0
% 0.07/0.43
% 0.07/0.43 a1 : 0
% 0.07/0.43
% 0.07/0.43 a2 : 0
% 0.07/0.43
% 0.07/0.43 a3 : 1
% 0.07/0.43
% 0.07/0.43 a4 : 1
% 0.07/0.43
% 0.07/0.43 a5 : 1
% 0.07/0.43
% 0.07/0.43 b0 : 1
% 0.07/0.43
% 0.07/0.43 b1 : 0
% 0.07/0.43
% 0.07/0.43 b2 : 0
% 0.07/0.43
% 0.07/0.43 b3 : 1
% 0.07/0.43
% 0.07/0.43 b4 : 1
% 0.07/0.43
% 0.07/0.43 b5 : 1
% 0.07/0.43
% 0.07/0.43 p1 : 0
% 0.07/0.43
% 0.07/0.43 p2 : 0
% 0.07/0.43
% 0.07/0.43 p3 : 1
% 0.07/0.43
% 0.07/0.43 p4 : 0
% 0.07/0.43
% 0.07/0.43 p5 : 1
% 0.07/0.43
% 0.07/0.43 q1 : 1
% 0.07/0.43
% 0.07/0.43 q2 : 1
% 0.07/0.43
% 0.07/0.43 q3 : 0
% 0.07/0.43
% 0.07/0.43 q4 : 1
% 0.07/0.43
% 0.07/0.43 q5 : 1
% 0.07/0.43
% 0.07/0.43 % SZS output end FiniteModel
% 0.07/0.43 ------ process 2182 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 2182 exit (max_models) Fri Jan 5 00:21:31 2018
% 0.07/0.43 The process finished Fri Jan 5 00:21:31 2018
% 0.07/0.43 Mace4 ended
%------------------------------------------------------------------------------