TSTP Solution File: SYN517+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN517+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:20:31 EDT 2022
% Result : Unknown 0.76s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN517+1 : TPTP v8.1.0. Released v2.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 00:01:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 20050 was started by sandbox on n026.cluster.edu,
% 0.43/1.04 Tue Jul 12 00:01:13 2022
% 0.43/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19896_n026.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_19896_n026.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (1 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.04
% 0.43/1.04 % Formulas that are not ordinary clauses:
% 0.43/1.04 1 --((c1_0 | ndr1_0 & ndr1_1(a50) & -c1_2(a50,a51) & -c4_2(a50,a51) & c3_2(a50,a51) & (all U (ndr1_1(a50) -> -c2_2(a50,U) | c4_2(a50,U) | c3_2(a50,U))) & c3_1(a50) | (all V (ndr1_0 -> c5_1(V) | c3_1(V) | (all W (ndr1_1(V) -> -c3_2(V,W) | c4_2(V,W)))))) & ((all X (ndr1_0 -> (all Y (ndr1_1(X) -> c3_2(X,Y) | -c4_2(X,Y) | -c2_2(X,Y))) | c4_1(X) | ndr1_1(X) & -c3_2(X,a52) & -c2_2(X,a52) & c1_2(X,a52))) | -c5_0 | -c1_0) & (c4_0 | c5_0) & (-c2_0 | -c3_0 | c5_0) & (c1_0 | ndr1_0 & c5_1(a53) & ndr1_1(a53) & -c1_2(a53,a54) & c3_2(a53,a54) & c2_2(a53,a54) & c1_1(a53) | c2_0) & (-c2_0 | ndr1_0 & ndr1_1(a55) & c4_2(a55,a56) & -c3_2(a55,a56) & c1_2(a55,a56) & c5_1(a55) & (all Z (ndr1_1(a55) -> c3_2(a55,Z) | c5_2(a55,Z) | c1_2(a55,Z))) | -c4_0) & (c3_0 | ndr1_0 & ndr1_1(a57) & c4_2(a57,a58) & -c1_2(a57,a58) & c2_2(a57,a58) & (all X1 (ndr1_1(a57) -> -c3_2(a57,X1) | c5_2(a57,X1) | c2_2(a57,X1))) & -c5_1(a57) | ndr1_0 & -c4_1(a59) & c2_1(a59) & c5_1(a59)) & (-c5_0 | -c3_0 | ndr1_0 & ndr1_1(a60) & -c4_2(a60,a61) & -c1_2(a60,a61) & -c5_2(a60,a61) & c5_1(a60) & (all X2 (ndr1_1(a60) -> c5_2(a60,X2) | c4_2(a60,X2)))) & (ndr1_0 & c1_1(a62) & (all X3 (ndr1_1(a62) -> c2_2(a62,X3) | -c5_2(a62,X3) | c1_2(a62,X3))) & ndr1_1(a62) & c3_2(a62,a63) & -c5_2(a62,a63) & -c2_2(a62,a63) | ndr1_0 & -c5_1(a64) & c2_1(a64) | -c5_0) & (ndr1_0 & (all X4 (ndr1_1(a65) -> -c1_2(a65,X4) | -c3_2(a65,X4))) & ndr1_1(a65) & -c3_2(a65,a66) & c5_2(a65,a66) & c4_2(a65,a66) | c2_0) & (c3_0 | ndr1_0 & (all X5 (ndr1_1(a67) -> -c2_2(a67,X5) | c1_2(a67,X5) | -c3_2(a67,X5))) & -c1_1(a67) | ndr1_0 & (all X6 (ndr1_1(a68) -> -c4_2(a68,X6) | -c5_2(a68,X6) | c3_2(a68,X6))) & -c3_1(a68)) & ((all X7 (ndr1_0 -> ndr1_1(X7) & c5_2(X7,a69) & -c1_2(X7,a69) & c4_2(X7,a69) | c4_1(X7) | c3_1(X7))) | (all X8 (ndr1_0 -> -c5_1(X8) | c3_1(X8) | (all X9 (ndr1_1(X8) -> c2_2(X8,X9) | c4_2(X8,X9) | c3_2(X8,X9))))) | c4_0)) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.04
% 0.43/1.04 ============================== end of process non-clausal formulas ===
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.04
% 0.43/1.04 ============================== PREDICATE ELIMINATION =================
% 0.43/1.04 2 c3_0 | -c1_1(a67) | -c3_1(a68) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 3 c1_0 | c1_1(a53) | c2_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 4 c1_1(a62) | -c5_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 5 c1_1(a62) | c2_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 6 c3_0 | -c1_1(a67) | -ndr1_1(a68) | -c4_2(a68,A) | -c5_2(a68,A) | c3_2(a68,A) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 7 -c5_0 | -c3_0 | -c5_2(a60,a61) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 8 c5_2(a65,a66) | c2_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 9 -c5_2(a62,a63) | -c5_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 10 -c5_2(a62,a63) | c2_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 11 -c5_0 | -c3_0 | -ndr1_1(a60) | c5_2(a60,A) | c4_2(a60,A) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 Derived: -c5_0 | -c3_0 | -ndr1_1(a60) | c4_2(a60,a61) | -c5_0 | -c3_0. [resolve(11,d,7,c)].
% 0.43/1.04 12 -c2_0 | -ndr1_1(a55) | c3_2(a55,A) | c5_2(a55,A) | c1_2(a55,A) | -c4_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 13 c3_0 | -ndr1_1(a57) | -c3_2(a57,A) | c5_2(a57,A) | c2_2(a57,A) | -c4_1(a59) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 14 c3_0 | -ndr1_1(a57) | -c3_2(a57,A) | c5_2(a57,A) | c2_2(a57,A) | c2_1(a59) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 15 c3_0 | -ndr1_1(a57) | -c3_2(a57,A) | c5_2(a57,A) | c2_2(a57,A) | c5_1(a59) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 16 -ndr1_1(a62) | c2_2(a62,A) | -c5_2(a62,A) | c1_2(a62,A) | -c5_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 17 -ndr1_1(a62) | c2_2(a62,A) | -c5_2(a62,A) | c1_2(a62,A) | c2_1(a64) | -c5_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 18 c3_0 | -ndr1_1(a67) | -c2_2(a67,A) | c1_2(a67,A) | -c3_2(a67,A) | -ndr1_1(a68) | -c4_2(a68,B) | -c5_2(a68,B) | c3_2(a68,B) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 19 -ndr1_0 | c5_2(A,a69) | c4_1(A) | c3_1(A) | -c5_1(B) | c3_1(B) | -ndr1_1(B) | c2_2(B,C) | c4_2(B,C) | c3_2(B,C) | c4_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 Derived: -ndr1_0 | c4_1(a62) | c3_1(a62) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | -ndr1_1(a62) | c2_2(a62,a69) | c1_2(a62,a69) | -c5_1(a64) | -c5_0. [resolve(19,b,16,c)].
% 0.43/1.04 Derived: -ndr1_0 | c4_1(a62) | c3_1(a62) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | -ndr1_1(a62) | c2_2(a62,a69) | c1_2(a62,a69) | c2_1(a64) | -c5_0. [resolve(19,b,17,c)].
% 0.43/1.04 Derived: -ndr1_0 | c4_1(a68) | c3_1(a68) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | c3_0 | -ndr1_1(a67) | -c2_2(a67,C) | c1_2(a67,C) | -c3_2(a67,C) | -ndr1_1(a68) | -c4_2(a68,a69) | c3_2(a68,a69). [resolve(19,b,18,h)].
% 0.43/1.04 20 -c2_0 | c1_2(a55,a56) | -c4_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 21 -c5_0 | -c3_0 | -c1_2(a60,a61) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 22 c1_0 | -c1_2(a53,a54) | c2_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 23 c3_0 | -c1_2(a57,a58) | -c4_1(a59) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 24 c3_0 | -c1_2(a57,a58) | c5_1(a59) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 25 -ndr1_1(a65) | -c1_2(a65,A) | -c3_2(a65,A) | c2_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 26 c3_0 | -ndr1_1(a67) | -c2_2(a67,A) | c1_2(a67,A) | -c3_2(a67,A) | -c3_1(a68) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 27 c1_0 | -c1_2(a50,a51) | -ndr1_0 | c5_1(A) | c3_1(A) | -ndr1_1(A) | -c3_2(A,B) | c4_2(A,B) # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 28 -ndr1_0 | -ndr1_1(A) | c3_2(A,B) | -c4_2(A,B) | -c2_2(A,B) | c4_1(A) | c1_2(A,a52) | -c5_0 | -c1_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.76/1.06 Derived: -ndr1_0 | -ndr1_1(a65) | c3_2(a65,A) | -c4_2(a65,A) | -c2_2(a65,A) | c4_1(a65) | -c5_0 | -c1_0 | -ndr1_1(a65) | -c3_2(a65,a52) | c2_0. [resolve(28,g,25,b)].
% 0.76/1.06 29 -ndr1_0 | -c1_2(A,a69) | c4_1(A) | c3_1(A) | -c5_1(B) | c3_1(B) | -ndr1_1(B) | c2_2(B,C) | c4_2(B,C) | c3_2(B,C) | c4_0 # label(co1) # label(negated_conjecture). [clausify(1)].
% 0.76/1.06 Derived: -ndr1_0 | c4_1(a67) | c3_1(a67) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | c3_0 | -ndr1_1(a67) | -c2_2(a67,a69) | -c3_2(a67,a69) | -c3_1(a68). [resolve(29,b,26,d)].
% 0.76/1.06 30 -ndr1_0 | c4_1(a62) | c3_1(a62) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | -ndr1_1(a62) | c2_2(a62,a69) | c1_2(a62,a69) | -c5_1(a64) | -c5_0. [resolve(19,b,16,c)].
% 0.76/1.06 Derived: -ndr1_0 | c4_1(a62) | c3_1(a62) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | -ndr1_1(a62) | c2_2(a62,a69) | -c5_1(a64) | -c5_0 | -ndr1_0 | c4_1(a62) | c3_1(a62) | -c5_1(C) | c3_1(C) | -ndr1_1(C) | c2_2(C,D) | c4_2(C,D) | c3_2(C,D) | c4_0. [resolve(30,m,29,b)].
% 0.76/1.06 31 -ndr1_0 | c4_1(a68) | c3_1(a68) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | c3_0 | -ndr1_1(a67) | -c2_2(a67,C) | c1_2(a67,C) | -c3_2(a67,C) | -ndr1_1(a68) | -c4_2(a68,a69) | c3_2(a68,a69). [resolve(19,b,18,h)].
% 0.76/1.06 Derived: -ndr1_0 | c4_1(a68) | c3_1(a68) | -c5_1(A) | c3_1(A) | -ndr1_1(A) | c2_2(A,B) | c4_2(A,B) | c3_2(A,B) | c4_0 | c3_0 | -ndr1_1(a67) | -c2_2(a67,a69) | -c3_2(a67,a69) | -ndr1_1(a68) | -c4_2(a68,a69) | c3_2(a68,a69) | -ndr1_0 | c4_1(a67) | c3_1(a67) | -c5_1(C) | c3_1(C) | -ndr1_1(C) | c2_2(C,D) | c4_2(C,D) | c3_2(C,D) | c4_0. [resolve(31,n,29,b)].
% 0.76/1.06
% 0.76/1.06 ============================== end predicate elimination =============
% 0.76/1.06
% 0.76/1.06 Auto_denials: (non-Horn, no changes).
% 0.76/1.06
% 0.76/1.06 Term ordering decisions:
% 0.76/1.06 Function symbol KB weights: a65=1. a67=1. a50=1. a57=1. a59=1. a62=1. a69=1. a68=1. a53=1. a58=1. a60=1. a52=1. a55=1. a64=1. a51=1. a54=1. a66=1. a56=1. a61=1. a63=1.
% 0.76/1.06
% 0.76/1.06 ============================== end of process initial clauses ========
% 0.76/1.06
% 0.76/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.06
% 0.76/1.06 ============================== end of clauses for search =============
% 0.76/1.06
% 0.76/1.06 ============================== SEARCH ================================
% 0.76/1.06
% 0.76/1.06 % Starting search at 0.03 seconds.
% 0.76/1.06
% 0.76/1.06 ============================== STATISTICS ============================
% 0.76/1.06
% 0.76/1.06 Given=98. Generated=296. Kept=125. proofs=0.
% 0.76/1.06 Usable=66. Sos=0. Demods=0. Limbo=0, Disabled=143. Hints=0.
% 0.76/1.06 Megabytes=0.33.
% 0.76/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.76/1.06
% 0.76/1.06 ============================== end of statistics =====================
% 0.76/1.06
% 0.76/1.06 ============================== end of search =========================
% 0.76/1.06
% 0.76/1.06 SEARCH FAILED
% 0.76/1.06
% 0.76/1.06 Exiting with failure.
% 0.76/1.06
% 0.76/1.06 Process 20050 exit (sos_empty) Tue Jul 12 00:01:13 2022
% 0.76/1.06 Prover9 interrupted
%------------------------------------------------------------------------------