TSTP Solution File: SYN059+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN059+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:55 EDT 2022
% Result : Theorem 0.58s 0.91s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SYN059+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.29 % Computer : n025.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Tue Jul 12 00:36:17 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.58/0.91 ============================== Prover9 ===============================
% 0.58/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.58/0.91 Process 21834 was started by sandbox on n025.cluster.edu,
% 0.58/0.91 Tue Jul 12 00:36:18 2022
% 0.58/0.91 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21681_n025.cluster.edu".
% 0.58/0.91 ============================== end of head ===========================
% 0.58/0.91
% 0.58/0.91 ============================== INPUT =================================
% 0.58/0.91
% 0.58/0.91 % Reading from file /tmp/Prover9_21681_n025.cluster.edu
% 0.58/0.91
% 0.58/0.91 set(prolog_style_variables).
% 0.58/0.91 set(auto2).
% 0.58/0.91 % set(auto2) -> set(auto).
% 0.58/0.91 % set(auto) -> set(auto_inference).
% 0.58/0.91 % set(auto) -> set(auto_setup).
% 0.58/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.58/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.58/0.91 % set(auto) -> set(auto_limits).
% 0.58/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.58/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.58/0.91 % set(auto) -> set(auto_denials).
% 0.58/0.91 % set(auto) -> set(auto_process).
% 0.58/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.58/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.58/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.58/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.58/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.58/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.58/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.58/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.58/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.58/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.58/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.58/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.58/0.91 % set(auto2) -> assign(stats, some).
% 0.58/0.91 % set(auto2) -> clear(echo_input).
% 0.58/0.91 % set(auto2) -> set(quiet).
% 0.58/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.58/0.91 % set(auto2) -> clear(print_given).
% 0.58/0.91 assign(lrs_ticks,-1).
% 0.58/0.91 assign(sos_limit,10000).
% 0.58/0.91 assign(order,kbo).
% 0.58/0.91 set(lex_order_vars).
% 0.58/0.91 clear(print_given).
% 0.58/0.91
% 0.58/0.91 % formulas(sos). % not echoed (3 formulas)
% 0.58/0.91
% 0.58/0.91 ============================== end of input ==========================
% 0.58/0.91
% 0.58/0.91 % From the command line: assign(max_seconds, 300).
% 0.58/0.91
% 0.58/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.58/0.91
% 0.58/0.91 % Formulas that are not ordinary clauses:
% 0.58/0.91 1 (exists X big_f(X)) # label(pel29_1) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.91 2 (exists Y big_g(Y)) # label(pel29_2) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.91 3 -((all X (big_f(X) -> big_h(X))) & (all U (big_g(U) -> big_j(U))) <-> (all W all Y (big_f(W) & big_g(Y) -> big_h(W) & big_j(Y)))) # label(pel29) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.58/0.91
% 0.58/0.91 ============================== end of process non-clausal formulas ===
% 0.58/0.91
% 0.58/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.58/0.91
% 0.58/0.91 ============================== PREDICATE ELIMINATION =================
% 0.58/0.91
% 0.58/0.91 ============================== end predicate elimination =============
% 0.58/0.91
% 0.58/0.91 Auto_denials: (non-Horn, no changes).
% 0.58/0.91
% 0.58/0.91 Term ordering decisions:
% 0.58/0.91 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1.
% 0.58/0.91
% 0.58/0.91 ============================== end of process initial clauses ========
% 0.58/0.91
% 0.58/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.58/0.91
% 0.58/0.91 ============================== end of clauses for search =============
% 0.58/0.91
% 0.58/0.91 ============================== SEARCH ================================
% 0.58/0.91
% 0.58/0.91 % Starting search at 0.01 seconds.
% 0.58/0.91
% 0.58/0.91 ============================== PROOF =================================
% 0.58/0.91 % SZS status Theorem
% 0.58/0.91 % SZS output start Refutation
% 0.58/0.91
% 0.58/0.91 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.58/0.91 % Length of proof is 59.
% 0.58/0.91 % Level of proof is 26.
% 0.58/0.91 % Maximum clause weight is 10.000.
% 0.58/0.91 % Given clauses 54.
% 0.58/0.91
% 0.58/0.91 1 (exists X big_f(X)) # label(pel29_1) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.91 2 (exists Y big_g(Y)) # label(pel29_2) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.91 3 -((all X (big_f(X) -> big_h(X))) & (all U (big_g(U) -> big_j(U))) <-> (all W all Y (big_f(W) & big_g(Y) -> big_h(W) & big_j(Y)))) # label(pel29) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.58/0.91 4 big_f(c1) # label(pel29_1) # label(axiom). [clausify(1)].
% 0.58/0.91 5 big_g(c2) # label(pel29_2) # label(axiom). [clausify(2)].
% 0.58/0.91 6 big_f(c3) | big_g(c4) | big_f(c5) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 7 big_f(c3) | big_g(c4) | big_g(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 8 -big_h(c3) | -big_j(c4) | -big_h(c5) | -big_j(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 9 big_f(c3) | -big_j(c4) | big_f(c5) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 10 big_f(c3) | -big_j(c4) | big_g(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 11 -big_h(c3) | big_g(c4) | big_f(c5) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 12 -big_h(c3) | big_g(c4) | big_g(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 13 -big_h(c3) | -big_j(c4) | big_f(c5) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 14 -big_h(c3) | -big_j(c4) | big_g(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 15 big_f(c3) | big_g(c4) | -big_h(c5) | -big_j(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 16 big_f(c3) | -big_j(c4) | -big_h(c5) | -big_j(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 17 -big_h(c3) | big_g(c4) | -big_h(c5) | -big_j(c6) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 18 -big_f(A) | big_h(A) | -big_f(B) | -big_g(C) | big_h(B) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 21 -big_g(A) | big_j(A) | -big_f(B) | -big_g(C) | big_j(C) # label(pel29) # label(negated_conjecture). [clausify(3)].
% 0.58/0.91 22 -big_f(A) | big_h(A) | -big_g(B). [factor(18,a,c),merge(d)].
% 0.58/0.91 23 -big_g(A) | big_j(A) | -big_f(B). [factor(21,a,d),merge(d)].
% 0.58/0.91 26 -big_f(A) | big_h(A). [resolve(22,c,5,a)].
% 0.58/0.91 27 big_j(c6) | -big_f(A) | big_f(c3) | big_g(c4). [resolve(23,a,7,c)].
% 0.58/0.91 28 big_j(c4) | -big_f(A) | big_f(c3) | big_f(c5). [resolve(23,a,6,b)].
% 0.58/0.91 32 big_j(c6) | big_f(c3) | big_g(c4). [resolve(27,b,4,a)].
% 0.58/0.91 33 big_j(c4) | big_f(c3) | big_f(c5). [resolve(28,b,4,a)].
% 0.58/0.91 36 big_f(c3) | big_g(c4) | -big_h(c5). [resolve(32,a,15,d),merge(c),merge(d)].
% 0.58/0.91 40 big_f(c3) | big_f(c5). [resolve(33,a,9,b),merge(c),merge(d)].
% 0.58/0.91 41 big_f(c3) | big_h(c5). [resolve(40,b,26,a)].
% 0.58/0.91 42 big_f(c3) | big_g(c4). [resolve(36,c,41,b),merge(c)].
% 0.58/0.91 43 big_f(c3) | big_j(c4) | -big_f(A). [resolve(42,b,23,a)].
% 0.58/0.91 44 big_f(c3) | big_j(c4). [resolve(43,c,40,b),merge(c)].
% 0.58/0.91 46 big_f(c3) | big_g(c6). [resolve(44,b,10,b),merge(b)].
% 0.58/0.91 47 big_f(c3) | big_j(c6) | -big_f(A). [resolve(46,b,23,a)].
% 0.58/0.91 48 big_f(c3) | big_j(c6). [resolve(47,c,40,b),merge(c)].
% 0.58/0.91 49 big_f(c3) | -big_j(c4) | -big_h(c5). [resolve(48,b,16,d),merge(b)].
% 0.58/0.91 50 big_f(c3) | -big_h(c5). [resolve(49,b,44,b),merge(c)].
% 0.58/0.91 51 big_f(c3). [resolve(50,b,41,b),merge(b)].
% 0.58/0.91 52 big_h(c3). [resolve(51,a,26,a)].
% 0.58/0.91 53 big_g(c4) | -big_h(c5) | -big_j(c6). [back_unit_del(17),unit_del(a,52)].
% 0.58/0.91 54 -big_j(c4) | big_g(c6). [back_unit_del(14),unit_del(a,52)].
% 0.58/0.91 55 -big_j(c4) | big_f(c5). [back_unit_del(13),unit_del(a,52)].
% 0.58/0.91 56 big_g(c4) | big_g(c6). [back_unit_del(12),unit_del(a,52)].
% 0.58/0.91 57 big_g(c4) | big_f(c5). [back_unit_del(11),unit_del(a,52)].
% 0.58/0.91 58 -big_j(c4) | -big_h(c5) | -big_j(c6). [back_unit_del(8),unit_del(a,52)].
% 0.58/0.91 59 big_g(c4) | big_j(c6) | -big_f(A). [resolve(56,b,23,a)].
% 0.58/0.91 60 big_f(c5) | big_j(c4) | -big_f(A). [resolve(57,a,23,a)].
% 0.58/0.91 61 big_g(c4) | big_j(c6). [resolve(59,c,51,a)].
% 0.58/0.91 63 big_g(c4) | -big_h(c5). [resolve(61,b,53,c),merge(b)].
% 0.58/0.91 64 big_f(c5) | big_j(c4). [resolve(60,c,51,a)].
% 0.58/0.91 65 big_f(c5). [resolve(64,b,55,a),merge(b)].
% 0.58/0.91 66 big_h(c5). [resolve(65,a,26,a)].
% 0.58/0.91 67 big_g(c4). [back_unit_del(63),unit_del(b,66)].
% 0.58/0.91 68 -big_j(c4) | -big_j(c6). [back_unit_del(58),unit_del(b,66)].
% 0.58/0.91 69 big_j(c4) | -big_f(A). [resolve(67,a,23,a)].
% 0.58/0.91 70 big_j(c4). [resolve(69,b,65,a)].
% 0.58/0.91 71 -big_j(c6). [back_unit_del(68),unit_del(a,70)].
% 0.58/0.91 72 big_g(c6). [back_unit_del(54),unit_del(a,70)].
% 0.58/0.91 73 $F. [ur(23,b,71,a,c,65,a),unit_del(a,72)].
% 0.58/0.91
% 0.58/0.91 % SZS output end Refutation
% 0.58/0.91 ============================== end of proof ==========================
% 0.58/0.91
% 0.58/0.91 ============================== STATISTICS ============================
% 0.58/0.91
% 0.58/0.91 Given=54. Generated=85. Kept=69. proofs=1.
% 0.58/0.91 Usable=13. Sos=1. Demods=0. Limbo=0, Disabled=73. Hints=0.
% 0.58/0.91 Megabytes=0.06.
% 0.58/0.91 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.58/0.91
% 0.58/0.91 ============================== end of statistics =====================
% 0.58/0.91
% 0.58/0.91 ============================== end of search =========================
% 0.58/0.91
% 0.58/0.91 THEOREM PROVED
% 0.58/0.91 % SZS status Theorem
% 0.58/0.91
% 0.58/0.91 Exiting with 1 proof.
% 0.58/0.91
% 0.58/0.91 Process 21834 exit (max_proofs) Tue Jul 12 00:36:18 2022
% 0.58/0.91 Prover9 interrupted
%------------------------------------------------------------------------------