TSTP Solution File: PUZ056-2.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 : Mon Jul 18 18:23:57 EDT 2022
% Result : Unsatisfiable 0.50s 0.81s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.0.
% 0.00/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Sat May 28 22:52:56 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.50/0.77
% 0.50/0.77 WARNING: denials share constants (see output).
% 0.50/0.77
% 0.50/0.81 ============================== Prover9 ===============================
% 0.50/0.81 Prover9 (32) version 2009-11A, November 2009.
% 0.50/0.81 Process 7613 was started by sandbox2 on n032.cluster.edu,
% 0.50/0.81 Sat May 28 22:52:56 2022
% 0.50/0.81 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7274_n032.cluster.edu".
% 0.50/0.81 ============================== end of head ===========================
% 0.50/0.81
% 0.50/0.81 ============================== INPUT =================================
% 0.50/0.81
% 0.50/0.81 % Reading from file /tmp/Prover9_7274_n032.cluster.edu
% 0.50/0.81
% 0.50/0.81 set(prolog_style_variables).
% 0.50/0.81 set(auto2).
% 0.50/0.81 % set(auto2) -> set(auto).
% 0.50/0.81 % set(auto) -> set(auto_inference).
% 0.50/0.81 % set(auto) -> set(auto_setup).
% 0.50/0.81 % set(auto_setup) -> set(predicate_elim).
% 0.50/0.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/0.81 % set(auto) -> set(auto_limits).
% 0.50/0.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/0.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/0.81 % set(auto) -> set(auto_denials).
% 0.50/0.81 % set(auto) -> set(auto_process).
% 0.50/0.81 % set(auto2) -> assign(new_constants, 1).
% 0.50/0.81 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/0.81 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/0.81 % set(auto2) -> assign(max_hours, 1).
% 0.50/0.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/0.81 % set(auto2) -> assign(max_seconds, 0).
% 0.50/0.81 % set(auto2) -> assign(max_minutes, 5).
% 0.50/0.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/0.81 % set(auto2) -> set(sort_initial_sos).
% 0.50/0.81 % set(auto2) -> assign(sos_limit, -1).
% 0.50/0.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/0.81 % set(auto2) -> assign(max_megs, 400).
% 0.50/0.81 % set(auto2) -> assign(stats, some).
% 0.50/0.81 % set(auto2) -> clear(echo_input).
% 0.50/0.81 % set(auto2) -> set(quiet).
% 0.50/0.81 % set(auto2) -> clear(print_initial_clauses).
% 0.50/0.81 % set(auto2) -> clear(print_given).
% 0.50/0.81 assign(lrs_ticks,-1).
% 0.50/0.81 assign(sos_limit,10000).
% 0.50/0.81 assign(order,kbo).
% 0.50/0.81 set(lex_order_vars).
% 0.50/0.81 clear(print_given).
% 0.50/0.81
% 0.50/0.81 % formulas(sos). % not echoed (16 formulas)
% 0.50/0.81
% 0.50/0.81 ============================== end of input ==========================
% 0.50/0.81
% 0.50/0.81 % From the command line: assign(max_seconds, 300).
% 0.50/0.81
% 0.50/0.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/0.81
% 0.50/0.81 % Formulas that are not ordinary clauses:
% 0.50/0.81
% 0.50/0.81 ============================== end of process non-clausal formulas ===
% 0.50/0.81
% 0.50/0.81 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/0.81
% 0.50/0.81 ============================== PREDICATE ELIMINATION =================
% 0.50/0.81
% 0.50/0.81 ============================== end predicate elimination =============
% 0.50/0.81
% 0.50/0.81 Auto_denials:
% 0.50/0.81 % copying label neq1 to answer in negative clause
% 0.50/0.81 % copying label neq5 to answer in negative clause
% 0.50/0.81 % copying label neq9 to answer in negative clause
% 0.50/0.81 % copying label goal to answer in negative clause
% 0.50/0.81 % assign(max_proofs, 4). % (Horn set with more than one neg. clause)
% 0.50/0.81
% 0.50/0.81 WARNING, because some of the denials share constants,
% 0.50/0.81 some of the denials or their descendents may be subsumed,
% 0.50/0.81 preventing the target number of proofs from being found.
% 0.50/0.81 The shared constants are: s2.
% 0.50/0.81
% 0.50/0.81 Term ordering decisions:
% 0.50/0.81 Function symbol KB weights: s0=1. s1=1. s2=1.
% 0.50/0.81
% 0.50/0.81 ============================== end of process initial clauses ========
% 0.50/0.81
% 0.50/0.81 ============================== CLAUSES FOR SEARCH ====================
% 0.50/0.81
% 0.50/0.81 ============================== end of clauses for search =============
% 0.50/0.81
% 0.50/0.81 ============================== SEARCH ================================
% 0.50/0.81
% 0.50/0.81 % Starting search at 0.01 seconds.
% 0.50/0.81
% 0.50/0.81 ============================== PROOF =================================
% 0.50/0.81 % SZS status Unsatisfiable
% 0.50/0.81 % SZS output start Refutation
% 0.50/0.81
% 0.50/0.81 % Proof 1 at 0.04 (+ 0.00) seconds: goal.
% 0.50/0.81 % Length of proof is 45.
% 0.50/0.81 % Level of proof is 17.
% 0.50/0.81 % Maximum clause weight is 36.000.
% 0.50/0.81 % Given clauses 122.
% 0.50/0.81
% 0.50/0.81 1 neq(s0,s1) # label(neq2) # label(axiom). [assumption].
% 0.50/0.81 2 neq(s0,s2) # label(neq3) # label(axiom). [assumption].
% 0.50/0.81 3 neq(s1,s0) # label(neq4) # label(axiom). [assumption].
% 0.50/0.81 4 neq(s1,s2) # label(neq6) # label(axiom). [assumption].
% 0.50/0.81 5 neq(s2,s0) # label(neq7) # label(axiom). [assumption].
% 0.50/0.81 6 neq(s2,s1) # label(neq8) # label(axiom). [assumption].
% 0.50/0.81 7 p(s0,s0,s0,s0,s0) # label(init) # label(axiom). [assumption].
% 0.50/0.81 11 -p(s2,s2,s2,s2,s2) # label(goal) # label(negated_conjecture) # answer(goal). [assumption].
% 0.50/0.84 12 -p(A,B,C,D,E) | p(F,B,C,D,E) # label(rule1) # label(axiom). [assumption].
% 0.50/0.84 13 -p(A,B,C,D,E) | -neq(A,B) | -neq(A,F) | p(A,F,C,D,E) # label(rule2) # label(axiom). [assumption].
% 0.50/0.84 14 -p(A,B,C,D,E) | -neq(A,C) | -neq(A,F) | -neq(B,C) | -neq(B,F) | p(A,B,F,D,E) # label(rule3) # label(axiom). [assumption].
% 0.50/0.84 15 -p(A,B,C,D,E) | -neq(A,D) | -neq(A,F) | -neq(B,D) | -neq(B,F) | -neq(C,D) | -neq(C,F) | p(A,B,C,F,E) # label(rule4) # label(axiom). [assumption].
% 0.50/0.84 16 -p(A,B,C,D,E) | -neq(A,E) | -neq(A,F) | -neq(B,E) | -neq(B,F) | -neq(C,E) | -neq(C,F) | -neq(D,E) | -neq(D,F) | p(A,B,C,D,F) # label(rule5) # label(axiom). [assumption].
% 0.50/0.84 17 -p(A,s2,s2,s2,s2) # answer(goal). [resolve(12,b,11,a)].
% 0.50/0.84 18 p(A,s0,s0,s0,s0). [ur(12,a,7,a)].
% 0.50/0.84 21 -p(s0,s1,s2,s2,s2) # answer(goal). [ur(13,b,1,a,c,2,a,d,17,a)].
% 0.50/0.84 27 -p(A,s1,s2,s2,s2) # answer(goal). [resolve(21,a,12,b)].
% 0.50/0.84 33 -p(s1,s1,s0,s2,s2) # answer(goal). [ur(14,b,3,a,c,4,a,d,3,a,e,4,a,f,27,a)].
% 0.50/0.84 34 p(s2,s1,s0,s0,s0). [ur(13,a,18,a,b,5,a,c,6,a)].
% 0.50/0.84 36 p(A,s1,s0,s0,s0). [ur(12,a,34,a)].
% 0.50/0.84 38 p(s1,s1,s2,s0,s0). [ur(14,a,36,a,b,3,a,c,4,a,d,3,a,e,4,a)].
% 0.50/0.84 48 -p(A,s1,s0,s2,s2) # answer(goal). [resolve(33,a,12,b)].
% 0.50/0.84 57 -p(s2,s0,s0,s2,s2) # answer(goal). [ur(13,b,5,a,c,6,a,d,48,a)].
% 0.50/0.84 60 p(A,s1,s2,s0,s0). [ur(12,a,38,a)].
% 0.50/0.84 63 p(s0,s2,s2,s0,s0). [ur(13,a,60,a,b,1,a,c,2,a)].
% 0.50/0.84 75 -p(A,s0,s0,s2,s2) # answer(goal). [resolve(57,a,12,b)].
% 0.50/0.84 81 p(A,s2,s2,s0,s0). [ur(12,a,63,a)].
% 0.50/0.84 92 -p(s0,s0,s0,s1,s2) # answer(goal). [ur(15,b,1,a,c,2,a,d,1,a,e,2,a,f,1,a,g,2,a,h,75,a)].
% 0.50/0.84 96 p(s2,s2,s2,s1,s0). [ur(15,a,81,a,b,5,a,c,6,a,d,5,a,e,6,a,f,5,a,g,6,a)].
% 0.50/0.84 108 -p(A,s0,s0,s1,s2) # answer(goal). [resolve(92,a,12,b)].
% 0.50/0.84 118 -p(s1,s2,s0,s1,s2) # answer(goal). [ur(13,b,4,a,c,3,a,d,108,a)].
% 0.50/0.84 120 p(A,s2,s2,s1,s0). [ur(12,a,96,a)].
% 0.50/0.84 122 p(s1,s0,s2,s1,s0). [ur(13,a,120,a,b,4,a,c,3,a)].
% 0.50/0.84 136 -p(A,s2,s0,s1,s2) # answer(goal). [resolve(118,a,12,b)].
% 0.50/0.84 139 p(A,s0,s2,s1,s0). [ur(12,a,122,a)].
% 0.50/0.84 162 -p(s2,s2,s1,s1,s2) # answer(goal). [ur(14,b,6,a,c,5,a,d,6,a,e,5,a,f,136,a)].
% 0.50/0.84 164 p(s0,s0,s1,s1,s0). [ur(14,a,139,a,b,2,a,c,1,a,d,2,a,e,1,a)].
% 0.50/0.84 178 -p(A,s2,s1,s1,s2) # answer(goal). [resolve(162,a,12,b)].
% 0.50/0.84 180 p(A,s0,s1,s1,s0). [ur(12,a,164,a)].
% 0.50/0.84 203 -p(s0,s1,s1,s1,s2) # answer(goal). [ur(13,b,1,a,c,2,a,d,178,a)].
% 0.50/0.84 205 p(s2,s1,s1,s1,s0). [ur(13,a,180,a,b,5,a,c,6,a)].
% 0.50/0.84 228 p(A,s1,s1,s1,s0). [ur(12,a,205,a)].
% 0.50/0.84 247 -p(A,s1,s1,s1,s2) # answer(goal). [resolve(203,a,12,b)].
% 0.50/0.84 267 p(s1,s1,s1,s1,s2). [ur(16,a,228,a,b,3,a,c,4,a,d,3,a,e,4,a,f,3,a,g,4,a,h,3,a,i,4,a)].
% 0.50/0.84 268 $F # answer(goal). [resolve(267,a,247,a)].
% 0.50/0.84
% 0.50/0.84 % SZS output end Refutation
% 0.50/0.84 ============================== end of proof ==========================
% 0.50/0.84
% 0.50/0.84 % Disable descendants (x means already disabled):
% 0.50/0.84 11x 17 19x 20x 21x 22x 23x 24 25x 26x
% 0.50/0.84 27 28x 29x 30x 31x 32x 33x 39x 40 41x
% 0.50/0.84 42x 43x 44x 45 46x 47x 48 49x 50x 51
% 0.50/0.84 52x 53x 54x 55x 56 57x 58x 64 65x 66
% 0.50/0.84 67 68x 69 70x 71 72x 73 74x 75 76x
% 0.50/0.84 77 83 84 85 86 87x 88 89 90 91
% 0.50/0.84 92x 93 94 97 98x 99 100x 101 102 103
% 0.50/0.84 104 105 106 107 108 109 110 111 112x 113x
% 0.50/0.84 114 115 116 117x 118x 124 125x 126x 127 128x
% 0.50/0.84 129x 130 131x 132x 133 134x 135x 136 142 143
% 0.50/0.84 144 145 146 147 148 149 150x 151 152 153
% 0.50/0.84 154x 155 156 157 158x 159 160 161 162x 167
% 0.50/0.84 168 169 170 171 172 173 174 175 176 177
% 0.50/0.84 178 183 184 185 186 187 188 189 190x 191x
% 0.50/0.84 192 193 194x 195x 196 197 198x 199x 200 201
% 0.50/0.84 202x 203x 211 212 213 214 215x 216 217x 218x
% 0.50/0.84 219 220x 221x 222 223 224x 225 231 232 233
% 0.50/0.84 234 235 236 237 238 239 240 241 242 243
% 0.50/0.84 244 245 246 247 252 253 254 255 256 257
% 0.50/0.84 258 259 260 261 262 263 264 265
% 0.50/0.84
% 0.50/0.84 ============================== STATISTICS ============================
% 0.50/0.84
% 0.50/0.84 Given=237. Generated=1750. Kept=374. proofs=1.
% 0.50/0.84 Usable=95. Sos=0. Demods=0. Limbo=0, Disabled=295. Hints=0.
% 0.50/0.84 Megabytes=0.22.
% 0.50/0.84 User_CPU=0.08, System_CPU=0.00, Wall_clock=0.
% 0.50/0.84
% 0.50/0.84 ============================== end of statistics =====================
% 0.50/0.84
% 0.50/0.84 ============================== end of search =========================
% 0.50/0.84
% 0.50/0.84 SEARCH FAILED
% 0.50/0.84
% 0.50/0.84 Exiting with 1 proof.
% 0.50/0.84
% 0.50/0.84 Process 7613 exit (sos_empty) Sat May 28 22:52:56 2022
% 0.50/0.84 Prover9 interrupted
%------------------------------------------------------------------------------