TSTP Solution File: SYN001-1.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN001-1.005 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 11:15:12 EDT 2022
% Result : Unsatisfiable 0.42s 0.97s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN001-1.005 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 06:26:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.42/0.97 ============================== Prover9 ===============================
% 0.42/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.97 Process 8817 was started by sandbox2 on n004.cluster.edu,
% 0.42/0.97 Tue Jul 12 06:26:38 2022
% 0.42/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8663_n004.cluster.edu".
% 0.42/0.97 ============================== end of head ===========================
% 0.42/0.97
% 0.42/0.97 ============================== INPUT =================================
% 0.42/0.97
% 0.42/0.97 % Reading from file /tmp/Prover9_8663_n004.cluster.edu
% 0.42/0.97
% 0.42/0.97 set(prolog_style_variables).
% 0.42/0.97 set(auto2).
% 0.42/0.97 % set(auto2) -> set(auto).
% 0.42/0.97 % set(auto) -> set(auto_inference).
% 0.42/0.97 % set(auto) -> set(auto_setup).
% 0.42/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.97 % set(auto) -> set(auto_limits).
% 0.42/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.97 % set(auto) -> set(auto_denials).
% 0.42/0.97 % set(auto) -> set(auto_process).
% 0.42/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.97 % set(auto2) -> assign(stats, some).
% 0.42/0.97 % set(auto2) -> clear(echo_input).
% 0.42/0.97 % set(auto2) -> set(quiet).
% 0.42/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.97 % set(auto2) -> clear(print_given).
% 0.42/0.97 assign(lrs_ticks,-1).
% 0.42/0.97 assign(sos_limit,10000).
% 0.42/0.97 assign(order,kbo).
% 0.42/0.97 set(lex_order_vars).
% 0.42/0.97 clear(print_given).
% 0.42/0.97
% 0.42/0.97 % formulas(sos). % not echoed (32 formulas)
% 0.42/0.97
% 0.42/0.97 ============================== end of input ==========================
% 0.42/0.97
% 0.42/0.97 % From the command line: assign(max_seconds, 300).
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.97
% 0.42/0.97 % Formulas that are not ordinary clauses:
% 0.42/0.97
% 0.42/0.97 ============================== end of process non-clausal formulas ===
% 0.42/0.97
% 0.42/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.97
% 0.42/0.97 ============================== PREDICATE ELIMINATION =================
% 0.42/0.97
% 0.42/0.97 ============================== end predicate elimination =============
% 0.42/0.97
% 0.42/0.97 Auto_denials: (non-Horn, no changes).
% 0.42/0.97
% 0.42/0.97 Term ordering decisions:
% 0.42/0.97 Function symbol KB weights:
% 0.42/0.97
% 0.42/0.97 ============================== end of process initial clauses ========
% 0.42/0.97
% 0.42/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.97
% 0.42/0.97 ============================== end of clauses for search =============
% 0.42/0.97
% 0.42/0.97 ============================== SEARCH ================================
% 0.42/0.97
% 0.42/0.97 % Starting search at 0.01 seconds.
% 0.42/0.97
% 0.42/0.97 ============================== PROOF =================================
% 0.42/0.97 % SZS status Unsatisfiable
% 0.42/0.97 % SZS output start Refutation
% 0.42/0.97
% 0.42/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.42/0.97 % Length of proof is 111.
% 0.42/0.97 % Level of proof is 54.
% 0.42/0.97 % Maximum clause weight is 5.000.
% 0.42/0.97 % Given clauses 104.
% 0.42/0.97
% 0.42/0.97 1 p_1 | p_2 | p_3 | p_4 | p_5 # label(ppppp) # label(negated_conjecture). [assumption].
% 0.42/0.97 2 -p_1 | -p_2 | -p_3 | -p_4 | -p_5 # label(nnnnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 3 p_1 | p_2 | p_3 | p_4 | -p_5 # label(ppppn) # label(negated_conjecture). [assumption].
% 0.42/0.97 4 p_1 | p_2 | p_3 | -p_4 | p_5 # label(pppnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 5 p_1 | p_2 | p_3 | -p_4 | -p_5 # label(pppnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 6 p_1 | p_2 | -p_3 | p_4 | p_5 # label(ppnpp) # label(negated_conjecture). [assumption].
% 0.42/0.97 7 p_1 | p_2 | -p_3 | p_4 | -p_5 # label(ppnpn) # label(negated_conjecture). [assumption].
% 0.42/0.97 8 p_1 | p_2 | -p_3 | -p_4 | p_5 # label(ppnnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 9 p_1 | p_2 | -p_3 | -p_4 | -p_5 # label(ppnnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 10 p_1 | -p_2 | p_3 | p_4 | p_5 # label(pnppp) # label(negated_conjecture). [assumption].
% 0.42/0.97 11 p_1 | -p_2 | p_3 | p_4 | -p_5 # label(pnppn) # label(negated_conjecture). [assumption].
% 0.42/0.97 12 p_1 | -p_2 | p_3 | -p_4 | p_5 # label(pnpnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 13 p_1 | -p_2 | p_3 | -p_4 | -p_5 # label(pnpnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 14 p_1 | -p_2 | -p_3 | p_4 | p_5 # label(pnnpp) # label(negated_conjecture). [assumption].
% 0.42/0.97 15 p_1 | -p_2 | -p_3 | p_4 | -p_5 # label(pnnpn) # label(negated_conjecture). [assumption].
% 0.42/0.97 16 p_1 | -p_2 | -p_3 | -p_4 | p_5 # label(pnnnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 17 p_1 | -p_2 | -p_3 | -p_4 | -p_5 # label(pnnnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 18 -p_1 | p_2 | p_3 | p_4 | p_5 # label(npppp) # label(negated_conjecture). [assumption].
% 0.42/0.97 19 -p_1 | p_2 | p_3 | p_4 | -p_5 # label(npppn) # label(negated_conjecture). [assumption].
% 0.42/0.97 20 -p_1 | p_2 | p_3 | -p_4 | p_5 # label(nppnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 21 -p_1 | p_2 | p_3 | -p_4 | -p_5 # label(nppnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 22 -p_1 | p_2 | -p_3 | p_4 | p_5 # label(npnpp) # label(negated_conjecture). [assumption].
% 0.42/0.97 23 -p_1 | p_2 | -p_3 | p_4 | -p_5 # label(npnpn) # label(negated_conjecture). [assumption].
% 0.42/0.97 24 -p_1 | p_2 | -p_3 | -p_4 | p_5 # label(npnnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 25 -p_1 | p_2 | -p_3 | -p_4 | -p_5 # label(npnnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 26 -p_1 | -p_2 | p_3 | p_4 | p_5 # label(nnppp) # label(negated_conjecture). [assumption].
% 0.42/0.97 27 -p_1 | -p_2 | p_3 | p_4 | -p_5 # label(nnppn) # label(negated_conjecture). [assumption].
% 0.42/0.97 28 -p_1 | -p_2 | p_3 | -p_4 | p_5 # label(nnpnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 29 -p_1 | -p_2 | p_3 | -p_4 | -p_5 # label(nnpnn) # label(negated_conjecture). [assumption].
% 0.42/0.97 30 -p_1 | -p_2 | -p_3 | p_4 | p_5 # label(nnnpp) # label(negated_conjecture). [assumption].
% 0.42/0.97 31 -p_1 | -p_2 | -p_3 | p_4 | -p_5 # label(nnnpn) # label(negated_conjecture). [assumption].
% 0.42/0.97 32 -p_1 | -p_2 | -p_3 | -p_4 | p_5 # label(nnnnp) # label(negated_conjecture). [assumption].
% 0.42/0.97 33 p_1 | p_2 | p_3 | p_4. [resolve(3,e,1,e),merge(e),merge(f),merge(g),merge(h)].
% 0.42/0.97 34 p_1 | p_2 | p_3 | p_5. [resolve(33,d,4,d),merge(d),merge(e),merge(f)].
% 0.42/0.97 35 p_1 | p_2 | p_3 | -p_4. [resolve(34,d,5,e),merge(d),merge(e),merge(f)].
% 0.42/0.97 36 p_1 | p_2 | p_3. [resolve(35,d,33,d),merge(d),merge(e),merge(f)].
% 0.42/0.97 37 p_1 | p_2 | p_4 | p_5. [resolve(36,c,6,c),merge(c),merge(d)].
% 0.42/0.97 38 p_1 | p_2 | p_4 | -p_3. [resolve(37,d,7,e),merge(d),merge(e),merge(g)].
% 0.42/0.97 39 p_1 | p_2 | p_4. [resolve(38,d,36,c),merge(d),merge(e)].
% 0.42/0.97 40 p_1 | p_2 | -p_3 | p_5. [resolve(39,c,8,d),merge(c),merge(d)].
% 0.42/0.97 41 p_1 | p_2 | p_5. [resolve(40,c,36,c),merge(d),merge(e)].
% 0.42/0.97 42 p_1 | p_2 | -p_3 | -p_4. [resolve(41,c,9,e),merge(c),merge(d)].
% 0.42/0.97 43 p_1 | p_2 | -p_3. [resolve(42,d,39,c),merge(d),merge(e)].
% 0.42/0.97 44 p_1 | p_2. [resolve(43,c,36,c),merge(c),merge(d)].
% 0.42/0.97 45 p_1 | p_3 | p_4 | p_5. [resolve(44,b,10,b),merge(b)].
% 0.42/0.97 46 p_1 | p_3 | p_4 | -p_2. [resolve(45,d,11,e),merge(d),merge(f),merge(g)].
% 0.42/0.97 47 p_1 | p_3 | p_4. [resolve(46,d,44,b),merge(d)].
% 0.42/0.97 48 p_1 | p_3 | -p_2 | p_5. [resolve(47,c,12,d),merge(c),merge(e)].
% 0.42/0.97 49 p_1 | p_3 | p_5. [resolve(48,c,44,b),merge(d)].
% 0.42/0.97 50 p_1 | p_3 | -p_2 | -p_4. [resolve(49,c,13,e),merge(c),merge(e)].
% 0.42/0.97 51 p_1 | p_3 | -p_2. [resolve(50,d,47,c),merge(d),merge(e)].
% 0.42/0.97 52 p_1 | p_3. [resolve(51,c,44,b),merge(c)].
% 0.42/0.97 53 p_1 | -p_2 | p_4 | p_5. [resolve(52,b,14,c),merge(b)].
% 0.42/0.97 54 p_1 | p_4 | p_5. [resolve(53,b,44,b),merge(d)].
% 0.42/0.97 55 p_1 | p_4 | -p_2 | -p_3. [resolve(54,c,15,e),merge(c),merge(f)].
% 0.42/0.97 56 p_1 | p_4 | -p_2. [resolve(55,d,52,b),merge(d)].
% 0.42/0.97 57 p_1 | p_4. [resolve(56,c,44,b),merge(c)].
% 0.42/0.97 58 p_1 | -p_2 | -p_3 | p_5. [resolve(57,b,16,d),merge(b)].
% 0.42/0.97 59 p_1 | -p_2 | p_5. [resolve(58,c,52,b),merge(d)].
% 0.42/0.97 60 p_1 | p_5. [resolve(59,b,44,b),merge(c)].
% 0.42/0.97 61 p_1 | -p_2 | -p_3 | -p_4. [resolve(60,b,17,e),merge(b)].
% 0.42/0.97 62 p_1 | -p_2 | -p_3. [resolve(61,d,57,b),merge(d)].
% 0.42/0.97 63 p_1 | -p_2. [resolve(62,c,52,b),merge(c)].
% 0.42/0.97 64 p_1. [resolve(63,b,44,b),merge(b)].
% 0.42/0.97 65 -p_2 | -p_3 | -p_4 | p_5. [back_unit_del(32),unit_del(a,64)].
% 0.42/0.97 66 -p_2 | -p_3 | p_4 | -p_5. [back_unit_del(31),unit_del(a,64)].
% 0.42/0.97 67 -p_2 | -p_3 | p_4 | p_5. [back_unit_del(30),unit_del(a,64)].
% 0.42/0.97 68 -p_2 | p_3 | -p_4 | -p_5. [back_unit_del(29),unit_del(a,64)].
% 0.42/0.97 69 -p_2 | p_3 | -p_4 | p_5. [back_unit_del(28),unit_del(a,64)].
% 0.42/0.97 70 -p_2 | p_3 | p_4 | -p_5. [back_unit_del(27),unit_del(a,64)].
% 0.42/0.97 71 -p_2 | p_3 | p_4 | p_5. [back_unit_del(26),unit_del(a,64)].
% 0.42/0.97 72 p_2 | -p_3 | -p_4 | -p_5. [back_unit_del(25),unit_del(a,64)].
% 0.42/0.97 73 p_2 | -p_3 | -p_4 | p_5. [back_unit_del(24),unit_del(a,64)].
% 0.42/0.97 74 p_2 | -p_3 | p_4 | -p_5. [back_unit_del(23),unit_del(a,64)].
% 0.42/0.97 75 p_2 | -p_3 | p_4 | p_5. [back_unit_del(22),unit_del(a,64)].
% 0.42/0.97 76 p_2 | p_3 | -p_4 | -p_5. [back_unit_del(21),unit_del(a,64)].
% 0.42/0.97 77 p_2 | p_3 | -p_4 | p_5. [back_unit_del(20),unit_del(a,64)].
% 0.42/0.97 78 p_2 | p_3 | p_4 | -p_5. [back_unit_del(19),unit_del(a,64)].
% 0.42/0.97 79 p_2 | p_3 | p_4 | p_5. [back_unit_del(18),unit_del(a,64)].
% 0.42/0.97 80 -p_2 | -p_3 | -p_4 | -p_5. [back_unit_del(2),unit_del(a,64)].
% 0.42/0.97 81 p_2 | p_3 | p_4. [resolve(79,d,78,d),merge(d),merge(e),merge(f)].
% 0.42/0.97 82 p_2 | p_3 | p_5. [resolve(81,c,77,c),merge(c),merge(d)].
% 0.42/0.97 83 p_2 | p_3 | -p_4. [resolve(82,c,76,d),merge(c),merge(d)].
% 0.42/0.97 84 p_2 | p_3. [resolve(83,c,81,c),merge(c),merge(d)].
% 0.42/0.97 85 p_2 | p_4 | p_5. [resolve(84,b,75,b),merge(b)].
% 0.42/0.97 86 p_2 | p_4 | -p_3. [resolve(85,c,74,d),merge(c),merge(e)].
% 0.42/0.97 87 p_2 | p_4. [resolve(86,c,84,b),merge(c)].
% 0.42/0.97 88 p_2 | -p_3 | p_5. [resolve(87,b,73,c),merge(b)].
% 0.42/0.97 89 p_2 | p_5. [resolve(88,b,84,b),merge(c)].
% 0.42/0.97 90 p_2 | -p_3 | -p_4. [resolve(89,b,72,d),merge(b)].
% 0.42/0.97 91 p_2 | -p_3. [resolve(90,c,87,b),merge(c)].
% 0.42/0.97 92 p_2. [resolve(91,b,84,b),merge(b)].
% 0.42/0.97 93 -p_3 | -p_4 | -p_5. [back_unit_del(80),unit_del(a,92)].
% 0.42/0.97 94 p_3 | p_4 | p_5. [back_unit_del(71),unit_del(a,92)].
% 0.42/0.97 95 p_3 | p_4 | -p_5. [back_unit_del(70),unit_del(a,92)].
% 0.42/0.97 96 p_3 | -p_4 | p_5. [back_unit_del(69),unit_del(a,92)].
% 0.42/0.97 97 p_3 | -p_4 | -p_5. [back_unit_del(68),unit_del(a,92)].
% 0.42/0.97 98 -p_3 | p_4 | p_5. [back_unit_del(67),unit_del(a,92)].
% 0.42/0.97 99 -p_3 | p_4 | -p_5. [back_unit_del(66),unit_del(a,92)].
% 0.42/0.97 100 -p_3 | -p_4 | p_5. [back_unit_del(65),unit_del(a,92)].
% 0.42/0.97 101 p_3 | p_4. [resolve(95,c,94,c),merge(c),merge(d)].
% 0.42/0.97 102 p_3 | p_5. [resolve(96,b,101,b),merge(c)].
% 0.42/0.97 103 p_3 | -p_4. [resolve(97,c,102,b),merge(c)].
% 0.42/0.97 104 p_3. [resolve(103,b,101,b),merge(b)].
% 0.42/0.97 105 -p_4 | p_5. [back_unit_del(100),unit_del(a,104)].
% 0.42/0.97 106 p_4 | -p_5. [back_unit_del(99),unit_del(a,104)].
% 0.42/0.97 107 p_4 | p_5. [back_unit_del(98),unit_del(a,104)].
% 0.42/0.97 108 -p_4 | -p_5. [back_unit_del(93),unit_del(a,104)].
% 0.42/0.97 109 p_4. [resolve(107,b,106,b),merge(b)].
% 0.42/0.97 110 -p_5. [back_unit_del(108),unit_del(a,109)].
% 0.42/0.97 111 $F. [back_unit_del(105),unit_del(a,109),unit_del(b,110)].
% 0.42/0.97
% 0.42/0.97 % SZS output end Refutation
% 0.42/0.97 ============================== end of proof ==========================
% 0.42/0.97
% 0.42/0.97 ============================== STATISTICS ============================
% 0.42/0.97
% 0.42/0.97 Given=104. Generated=247. Kept=110. proofs=1.
% 0.42/0.97 Usable=3. Sos=0. Demods=0. Limbo=2, Disabled=137. Hints=0.
% 0.42/0.97 Megabytes=0.07.
% 0.42/0.97 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.97
% 0.42/0.97 ============================== end of statistics =====================
% 0.42/0.97
% 0.42/0.97 ============================== end of search =========================
% 0.42/0.97
% 0.42/0.97 THEOREM PROVED
% 0.42/0.97 % SZS status Unsatisfiable
% 0.42/0.97
% 0.42/0.97 Exiting with 1 proof.
% 0.42/0.97
% 0.42/0.97 Process 8817 exit (max_proofs) Tue Jul 12 06:26:38 2022
% 0.42/0.97 Prover9 interrupted
%------------------------------------------------------------------------------