TSTP Solution File: SYN036-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN036-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:34 EDT 2022
% Result : Unsatisfiable 0.50s 1.07s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN036-4 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jul 12 01:26:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.50/1.07 ============================== Prover9 ===============================
% 0.50/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.07 Process 18882 was started by sandbox2 on n008.cluster.edu,
% 0.50/1.07 Tue Jul 12 01:26:09 2022
% 0.50/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18729_n008.cluster.edu".
% 0.50/1.07 ============================== end of head ===========================
% 0.50/1.07
% 0.50/1.07 ============================== INPUT =================================
% 0.50/1.07
% 0.50/1.07 % Reading from file /tmp/Prover9_18729_n008.cluster.edu
% 0.50/1.07
% 0.50/1.07 set(prolog_style_variables).
% 0.50/1.07 set(auto2).
% 0.50/1.07 % set(auto2) -> set(auto).
% 0.50/1.07 % set(auto) -> set(auto_inference).
% 0.50/1.07 % set(auto) -> set(auto_setup).
% 0.50/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.07 % set(auto) -> set(auto_limits).
% 0.50/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.07 % set(auto) -> set(auto_denials).
% 0.50/1.07 % set(auto) -> set(auto_process).
% 0.50/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.07 % set(auto2) -> assign(stats, some).
% 0.50/1.07 % set(auto2) -> clear(echo_input).
% 0.50/1.07 % set(auto2) -> set(quiet).
% 0.50/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.07 % set(auto2) -> clear(print_given).
% 0.50/1.07 assign(lrs_ticks,-1).
% 0.50/1.07 assign(sos_limit,10000).
% 0.50/1.07 assign(order,kbo).
% 0.50/1.07 set(lex_order_vars).
% 0.50/1.07 clear(print_given).
% 0.50/1.07
% 0.50/1.07 % formulas(sos). % not echoed (32 formulas)
% 0.50/1.07
% 0.50/1.07 ============================== end of input ==========================
% 0.50/1.07
% 0.50/1.07 % From the command line: assign(max_seconds, 300).
% 0.50/1.07
% 0.50/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.07
% 0.50/1.07 % Formulas that are not ordinary clauses:
% 0.50/1.07
% 0.50/1.07 ============================== end of process non-clausal formulas ===
% 0.50/1.07
% 0.50/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.07
% 0.50/1.07 ============================== PREDICATE ELIMINATION =================
% 0.50/1.07
% 0.50/1.07 ============================== end predicate elimination =============
% 0.50/1.07
% 0.50/1.07 Auto_denials: (non-Horn, no changes).
% 0.50/1.07
% 0.50/1.07 Term ordering decisions:
% 0.50/1.07 Function symbol KB weights: cw=1. cx=1. fy=1. fz=1. fy5=1. fz5=1.
% 0.50/1.07
% 0.50/1.07 ============================== end of process initial clauses ========
% 0.50/1.07
% 0.50/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.50/1.07
% 0.50/1.07 ============================== end of clauses for search =============
% 0.50/1.07
% 0.50/1.07 ============================== SEARCH ================================
% 0.50/1.07
% 0.50/1.07 % Starting search at 0.01 seconds.
% 0.50/1.07
% 0.50/1.07 ============================== PROOF =================================
% 0.50/1.07 % SZS status Unsatisfiable
% 0.50/1.07 % SZS output start Refutation
% 0.50/1.07
% 0.50/1.07 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.50/1.07 % Length of proof is 70.
% 0.50/1.07 % Level of proof is 33.
% 0.50/1.07 % Maximum clause weight is 16.000.
% 0.50/1.07 % Given clauses 99.
% 0.50/1.07
% 0.50/1.07 1 p(cx) | p(A) | p(fy5(A)) | q(cw) | q(B) | q(fz5(B)) # label(clause_32) # label(negated_conjecture). [assumption].
% 0.50/1.07 2 -p(cx) | -p(A) | -p(fy5(A)) | -q(cw) | -q(B) | -q(fz5(B)) # label(clause_23) # label(negated_conjecture). [assumption].
% 0.50/1.07 3 -p(cx) | -q(cw) | p(A) | q(B) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.50/1.07 4 -p(cx) | -q(A) | p(B) | q(cw) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.50/1.07 5 -p(A) | -q(cw) | p(cx) | q(B) # label(clause_3) # label(negated_conjecture). [assumption].
% 0.50/1.07 6 -p(A) | -q(B) | p(cx) | q(cw) # label(clause_4) # label(negated_conjecture). [assumption].
% 0.50/1.07 7 -p(cx) | -p(A) | -p(fy5(A)) | -q(cw) | q(B) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.50/1.07 8 -p(cx) | -p(A) | -p(fy5(A)) | -q(B) | q(cw) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.50/1.07 9 -p(cx) | -q(cw) | -q(A) | -q(fz5(A)) | p(B) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.50/1.07 12 -p(cx) | p(A) | q(cw) | q(B) | q(fz(B)) # label(clause_10) # label(negated_conjecture). [assumption].
% 0.50/1.07 17 -p(A) | p(cx) | q(cw) | q(B) | q(fz(B)) # label(clause_15) # label(negated_conjecture). [assumption].
% 0.50/1.07 18 -p(A) | -q(cw) | -q(B) | -q(fz5(B)) | p(cx) # label(clause_16) # label(negated_conjecture). [assumption].
% 0.50/1.07 21 -q(cw) | p(cx) | p(A) | p(fy(A)) | q(B) # label(clause_19) # label(negated_conjecture). [assumption].
% 0.50/1.07 22 -q(A) | p(cx) | p(B) | p(fy(B)) | q(cw) # label(clause_20) # label(negated_conjecture). [assumption].
% 0.50/1.07 24 -p(cx) | -p(A) | -p(fy(A)) | q(cw) | q(B) | q(fz(B)) # label(clause_22) # label(negated_conjecture). [assumption].
% 0.50/1.07 31 -q(cw) | -q(A) | -q(fz(A)) | p(cx) | p(B) | p(fy(B)) # label(clause_30) # label(negated_conjecture). [assumption].
% 0.50/1.07 36 -p(cx) | -p(A) | -p(fy5(A)) | -q(cw) | -q(fz5(cw)). [factor(2,d,e)].
% 0.50/1.07 39 -p(cx) | -q(cw) | -q(fz5(cw)) | p(A). [factor(9,b,c)].
% 0.50/1.07 40 -p(cx) | p(A) | q(cw) | q(fz(cw)). [factor(12,c,d)].
% 0.50/1.07 42 -p(A) | p(cx) | q(cw) | q(fz(cw)). [factor(17,c,d)].
% 0.50/1.07 43 -p(A) | -q(cw) | -q(fz5(cw)) | p(cx). [factor(18,b,c)].
% 0.50/1.07 44 -q(cw) | p(cx) | p(fy(cx)) | q(A). [factor(21,b,c)].
% 0.50/1.07 45 -q(A) | p(cx) | p(fy(cx)) | q(cw). [factor(22,b,c)].
% 0.50/1.07 48 -p(cx) | -p(A) | -p(fy(A)) | q(cw) | q(fz(cw)). [factor(24,d,e)].
% 0.50/1.07 51 -q(cw) | -q(fz(cw)) | p(cx) | p(A) | p(fy(A)). [factor(31,a,b)].
% 0.50/1.07 57 -q(cw) | -q(fz(cw)) | p(cx) | p(fy(cx)). [factor(51,c,d)].
% 0.50/1.07 62 p(cx) | p(A) | p(fy(A)) | q(cw) | p(B) | p(fy5(B)) | q(C). [resolve(22,a,1,f),merge(e),merge(h)].
% 0.50/1.07 63 p(cx) | p(fy(cx)) | q(cw) | p(A) | p(fy5(A)) | q(B). [factor(62,a,b)].
% 0.50/1.07 69 p(cx) | p(fy(cx)) | q(cw) | p(fy5(cx)) | q(A). [factor(63,a,d)].
% 0.50/1.07 77 p(cx) | p(fy(cx)) | q(cw) | p(fy5(cx)). [factor(69,c,e)].
% 0.50/1.07 80 p(cx) | p(fy(cx)) | p(fy5(cx)) | q(A). [resolve(77,c,44,a),merge(d),merge(e)].
% 0.50/1.07 81 p(cx) | p(fy(cx)) | p(fy5(cx)) | -q(cw). [resolve(80,d,57,b),merge(e),merge(f)].
% 0.50/1.07 82 p(cx) | p(fy(cx)) | p(fy5(cx)). [resolve(81,d,80,d),merge(d),merge(e),merge(f)].
% 0.50/1.07 111 p(cx) | p(fy(cx)) | q(cw) | q(fz(cw)). [resolve(82,c,42,a),merge(c)].
% 0.50/1.07 113 p(cx) | p(fy(cx)) | q(cw). [resolve(111,d,45,a),merge(d),merge(e),merge(f)].
% 0.50/1.07 114 p(cx) | p(fy(cx)) | q(A). [resolve(113,c,44,a),merge(c),merge(d)].
% 0.50/1.07 115 p(cx) | p(fy(cx)) | -q(cw). [resolve(114,c,57,b),merge(d),merge(e)].
% 0.50/1.07 138 p(cx) | p(fy(cx)). [resolve(115,c,114,c),merge(c),merge(d)].
% 0.50/1.07 141 p(cx) | q(cw) | q(fz(cw)). [resolve(138,b,42,a),merge(b)].
% 0.50/1.07 150 p(cx) | q(cw) | -p(A). [resolve(141,c,6,b),merge(d),merge(e)].
% 0.50/1.07 151 p(cx) | q(cw). [resolve(150,c,138,b),merge(c)].
% 0.50/1.07 157 p(cx) | -p(A) | q(B). [resolve(151,b,5,b),merge(c)].
% 0.50/1.07 158 p(cx) | q(A). [resolve(157,b,138,b),merge(c)].
% 0.50/1.07 161 p(cx) | -p(A) | -q(cw). [resolve(158,b,43,c),merge(d)].
% 0.50/1.07 163 p(cx) | -p(A). [resolve(161,c,158,b),merge(c)].
% 0.50/1.07 164 p(cx). [resolve(163,b,138,b),merge(b)].
% 0.50/1.07 167 -p(A) | -p(fy(A)) | q(cw) | q(fz(cw)). [back_unit_del(48),unit_del(a,164)].
% 0.50/1.07 170 p(A) | q(cw) | q(fz(cw)). [back_unit_del(40),unit_del(a,164)].
% 0.50/1.07 171 -q(cw) | -q(fz5(cw)) | p(A). [back_unit_del(39),unit_del(a,164)].
% 0.50/1.07 174 -p(A) | -p(fy5(A)) | -q(cw) | -q(fz5(cw)). [back_unit_del(36),unit_del(a,164)].
% 0.50/1.07 182 -p(A) | -p(fy5(A)) | -q(B) | q(cw). [back_unit_del(8),unit_del(a,164)].
% 0.50/1.07 183 -p(A) | -p(fy5(A)) | -q(cw) | q(B). [back_unit_del(7),unit_del(a,164)].
% 0.50/1.07 184 -q(A) | p(B) | q(cw). [back_unit_del(4),unit_del(a,164)].
% 0.50/1.07 185 -q(cw) | p(A) | q(B). [back_unit_del(3),unit_del(a,164)].
% 0.50/1.07 187 p(A) | q(cw) | p(B). [resolve(170,c,184,a),merge(d)].
% 0.50/1.07 188 p(A) | q(cw). [factor(187,a,c)].
% 0.50/1.07 189 p(A) | p(B) | q(C). [resolve(188,b,185,a)].
% 0.50/1.07 190 p(A) | q(B). [factor(189,a,b)].
% 0.50/1.07 195 -q(cw) | p(A) | p(B). [resolve(171,b,190,b)].
% 0.50/1.07 196 -q(cw) | p(A). [factor(195,b,c)].
% 0.50/1.07 197 p(A) | p(B). [resolve(196,a,190,b)].
% 0.50/1.07 198 p(A). [factor(197,a,b)].
% 0.50/1.07 200 -q(cw) | q(A). [back_unit_del(183),unit_del(a,198),unit_del(b,198)].
% 0.50/1.07 201 -q(A) | q(cw). [back_unit_del(182),unit_del(a,198),unit_del(b,198)].
% 0.50/1.07 203 -q(cw) | -q(fz5(cw)). [back_unit_del(174),unit_del(a,198),unit_del(b,198)].
% 0.50/1.07 204 q(cw) | q(fz(cw)). [back_unit_del(167),unit_del(a,198),unit_del(b,198)].
% 0.50/1.07 205 q(cw). [resolve(204,b,201,a),merge(b)].
% 0.50/1.07 206 -q(fz5(cw)). [back_unit_del(203),unit_del(a,205)].
% 0.50/1.07 207 q(A). [back_unit_del(200),unit_del(a,205)].
% 0.50/1.07 208 $F. [resolve(207,a,206,a)].
% 0.50/1.07
% 0.50/1.07 % SZS output end Refutation
% 0.50/1.07 ============================== end of proof ==========================
% 0.50/1.07
% 0.50/1.07 ============================== STATISTICS ============================
% 0.50/1.07
% 0.50/1.07 Given=99. Generated=782. Kept=207. proofs=1.
% 0.50/1.07 Usable=2. Sos=0. Demods=0. Limbo=2, Disabled=234. Hints=0.
% 0.50/1.07 Megabytes=0.15.
% 0.50/1.07 User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.50/1.07
% 0.50/1.07 ============================== end of statistics =====================
% 0.50/1.07
% 0.50/1.07 ============================== end of search =========================
% 0.50/1.07
% 0.50/1.07 THEOREM PROVED
% 0.50/1.07 % SZS status Unsatisfiable
% 0.50/1.07
% 0.50/1.07 Exiting with 1 proof.
% 0.50/1.07
% 0.50/1.07 Process 18882 exit (max_proofs) Tue Jul 12 01:26:09 2022
% 0.50/1.07 Prover9 interrupted
%------------------------------------------------------------------------------