TSTP Solution File: SYN005-1.010 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:19 EDT 2022
% Result : Unsatisfiable 0.65s 0.97s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 05:03:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.65/0.96 ============================== Prover9 ===============================
% 0.65/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.96 Process 15023 was started by sandbox on n016.cluster.edu,
% 0.65/0.96 Tue Jul 12 05:03:59 2022
% 0.65/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14870_n016.cluster.edu".
% 0.65/0.96 ============================== end of head ===========================
% 0.65/0.96
% 0.65/0.96 ============================== INPUT =================================
% 0.65/0.96
% 0.65/0.96 % Reading from file /tmp/Prover9_14870_n016.cluster.edu
% 0.65/0.96
% 0.65/0.96 set(prolog_style_variables).
% 0.65/0.96 set(auto2).
% 0.65/0.96 % set(auto2) -> set(auto).
% 0.65/0.96 % set(auto) -> set(auto_inference).
% 0.65/0.96 % set(auto) -> set(auto_setup).
% 0.65/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.96 % set(auto) -> set(auto_limits).
% 0.65/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.96 % set(auto) -> set(auto_denials).
% 0.65/0.96 % set(auto) -> set(auto_process).
% 0.65/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.96 % set(auto2) -> assign(stats, some).
% 0.65/0.96 % set(auto2) -> clear(echo_input).
% 0.65/0.96 % set(auto2) -> set(quiet).
% 0.65/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.96 % set(auto2) -> clear(print_given).
% 0.65/0.96 assign(lrs_ticks,-1).
% 0.65/0.96 assign(sos_limit,10000).
% 0.65/0.96 assign(order,kbo).
% 0.65/0.96 set(lex_order_vars).
% 0.65/0.96 clear(print_given).
% 0.65/0.96
% 0.65/0.96 % formulas(sos). % not echoed (11 formulas)
% 0.65/0.96
% 0.65/0.96 ============================== end of input ==========================
% 0.65/0.96
% 0.65/0.96 % From the command line: assign(max_seconds, 300).
% 0.65/0.96
% 0.65/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.96
% 0.65/0.96 % Formulas that are not ordinary clauses:
% 0.65/0.96
% 0.65/0.96 ============================== end of process non-clausal formulas ===
% 0.65/0.96
% 0.65/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.96
% 0.65/0.96 ============================== PREDICATE ELIMINATION =================
% 0.65/0.96 1 -p_1(A,B) | -p_2(B,C) | -p_3(C,D) | -p_4(D,E) | -p_5(E,F) | -p_6(F,V6) | -p_7(V6,V7) | -p_8(V7,V8) | -p_9(V8,V9) | -p_10(V9,A) # label(disjunction) # label(negated_conjecture). [assumption].
% 0.65/0.96 2 p_1(a,a) # label(p_1) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_2(a,A) | -p_3(A,B) | -p_4(B,C) | -p_5(C,D) | -p_6(D,E) | -p_7(E,F) | -p_8(F,V6) | -p_9(V6,V7) | -p_10(V7,a). [resolve(1,a,2,a)].
% 0.65/0.96 3 -p_2(a,A) | -p_3(A,B) | -p_4(B,C) | -p_5(C,D) | -p_6(D,E) | -p_7(E,F) | -p_8(F,V6) | -p_9(V6,V7) | -p_10(V7,a). [resolve(1,a,2,a)].
% 0.65/0.96 4 p_2(a,a) # label(p_2) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_3(a,A) | -p_4(A,B) | -p_5(B,C) | -p_6(C,D) | -p_7(D,E) | -p_8(E,F) | -p_9(F,V6) | -p_10(V6,a). [resolve(3,a,4,a)].
% 0.65/0.96 5 -p_3(a,A) | -p_4(A,B) | -p_5(B,C) | -p_6(C,D) | -p_7(D,E) | -p_8(E,F) | -p_9(F,V6) | -p_10(V6,a). [resolve(3,a,4,a)].
% 0.65/0.96 6 p_3(a,a) # label(p_3) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_4(a,A) | -p_5(A,B) | -p_6(B,C) | -p_7(C,D) | -p_8(D,E) | -p_9(E,F) | -p_10(F,a). [resolve(5,a,6,a)].
% 0.65/0.96 7 -p_4(a,A) | -p_5(A,B) | -p_6(B,C) | -p_7(C,D) | -p_8(D,E) | -p_9(E,F) | -p_10(F,a). [resolve(5,a,6,a)].
% 0.65/0.96 8 p_4(a,a) # label(p_4) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_5(a,A) | -p_6(A,B) | -p_7(B,C) | -p_8(C,D) | -p_9(D,E) | -p_10(E,a). [resolve(7,a,8,a)].
% 0.65/0.96 9 -p_5(a,A) | -p_6(A,B) | -p_7(B,C) | -p_8(C,D) | -p_9(D,E) | -p_10(E,a). [resolve(7,a,8,a)].
% 0.65/0.96 10 p_5(a,a) # label(p_5) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_6(a,A) | -p_7(A,B) | -p_8(B,C) | -p_9(C,D) | -p_10(D,a). [resolve(9,a,10,a)].
% 0.65/0.96 11 -p_6(a,A) | -p_7(A,B) | -p_8(B,C) | -p_9(C,D) | -p_10(D,a). [resolve(9,a,10,a)].
% 0.65/0.96 12 p_6(a,a) # label(p_6) # label(negated_conjecture). [assumption].
% 0.65/0.96 Derived: -p_7(a,A) | -p_8(A,B) | -p_9(B,C) | -p_10(C,a). [resolve(11,a,12,a)].
% 0.65/0.97 13 -p_7(a,A) | -p_8(A,B) | -p_9(B,C) | -p_10(C,a). [resolve(11,a,12,a)].
% 0.65/0.97 14 p_7(a,a) # label(p_7) # label(negated_conjecture). [assumption].
% 0.65/0.97 Derived: -p_8(a,A) | -p_9(A,B) | -p_10(B,a). [resolve(13,a,14,a)].
% 0.65/0.97 15 -p_8(a,A) | -p_9(A,B) | -p_10(B,a). [resolve(13,a,14,a)].
% 0.65/0.97 16 p_8(a,a) # label(p_8) # label(negated_conjecture). [assumption].
% 0.65/0.97 Derived: -p_9(a,A) | -p_10(A,a). [resolve(15,a,16,a)].
% 0.65/0.97 17 -p_9(a,A) | -p_10(A,a). [resolve(15,a,16,a)].
% 0.65/0.97 18 p_9(a,a) # label(p_9) # label(negated_conjecture). [assumption].
% 0.65/0.97 Derived: -p_10(a,a). [resolve(17,a,18,a)].
% 0.65/0.97 19 -p_10(a,a). [resolve(17,a,18,a)].
% 0.65/0.97 20 p_10(a,a) # label(p_10) # label(negated_conjecture). [assumption].
% 0.65/0.97 Derived: $F. [resolve(19,a,20,a)].
% 0.65/0.97
% 0.65/0.97 ============================== end predicate elimination =============
% 0.65/0.97
% 0.65/0.97 Auto_denials: (no changes).
% 0.65/0.97
% 0.65/0.97 Term ordering decisions:
% 0.65/0.97 Function symbol KB weights:
% 0.65/0.97
% 0.65/0.97 ============================== PROOF =================================
% 0.65/0.97 % SZS status Unsatisfiable
% 0.65/0.97 % SZS output start Refutation
% 0.65/0.97
% 0.65/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.65/0.97 % Length of proof is 21.
% 0.65/0.97 % Level of proof is 10.
% 0.65/0.97 % Maximum clause weight is 0.000.
% 0.65/0.97 % Given clauses 0.
% 0.65/0.97
% 0.65/0.97 1 -p_1(A,B) | -p_2(B,C) | -p_3(C,D) | -p_4(D,E) | -p_5(E,F) | -p_6(F,V6) | -p_7(V6,V7) | -p_8(V7,V8) | -p_9(V8,V9) | -p_10(V9,A) # label(disjunction) # label(negated_conjecture). [assumption].
% 0.65/0.97 2 p_1(a,a) # label(p_1) # label(negated_conjecture). [assumption].
% 0.65/0.97 3 -p_2(a,A) | -p_3(A,B) | -p_4(B,C) | -p_5(C,D) | -p_6(D,E) | -p_7(E,F) | -p_8(F,V6) | -p_9(V6,V7) | -p_10(V7,a). [resolve(1,a,2,a)].
% 0.65/0.97 4 p_2(a,a) # label(p_2) # label(negated_conjecture). [assumption].
% 0.65/0.97 5 -p_3(a,A) | -p_4(A,B) | -p_5(B,C) | -p_6(C,D) | -p_7(D,E) | -p_8(E,F) | -p_9(F,V6) | -p_10(V6,a). [resolve(3,a,4,a)].
% 0.65/0.97 6 p_3(a,a) # label(p_3) # label(negated_conjecture). [assumption].
% 0.65/0.97 7 -p_4(a,A) | -p_5(A,B) | -p_6(B,C) | -p_7(C,D) | -p_8(D,E) | -p_9(E,F) | -p_10(F,a). [resolve(5,a,6,a)].
% 0.65/0.97 8 p_4(a,a) # label(p_4) # label(negated_conjecture). [assumption].
% 0.65/0.97 9 -p_5(a,A) | -p_6(A,B) | -p_7(B,C) | -p_8(C,D) | -p_9(D,E) | -p_10(E,a). [resolve(7,a,8,a)].
% 0.65/0.97 10 p_5(a,a) # label(p_5) # label(negated_conjecture). [assumption].
% 0.65/0.97 11 -p_6(a,A) | -p_7(A,B) | -p_8(B,C) | -p_9(C,D) | -p_10(D,a). [resolve(9,a,10,a)].
% 0.65/0.97 12 p_6(a,a) # label(p_6) # label(negated_conjecture). [assumption].
% 0.65/0.97 13 -p_7(a,A) | -p_8(A,B) | -p_9(B,C) | -p_10(C,a). [resolve(11,a,12,a)].
% 0.65/0.97 14 p_7(a,a) # label(p_7) # label(negated_conjecture). [assumption].
% 0.65/0.97 15 -p_8(a,A) | -p_9(A,B) | -p_10(B,a). [resolve(13,a,14,a)].
% 0.65/0.97 16 p_8(a,a) # label(p_8) # label(negated_conjecture). [assumption].
% 0.65/0.97 17 -p_9(a,A) | -p_10(A,a). [resolve(15,a,16,a)].
% 0.65/0.97 18 p_9(a,a) # label(p_9) # label(negated_conjecture). [assumption].
% 0.65/0.97 19 -p_10(a,a). [resolve(17,a,18,a)].
% 0.65/0.97 20 p_10(a,a) # label(p_10) # label(negated_conjecture). [assumption].
% 0.65/0.97 21 $F. [resolve(19,a,20,a)].
% 0.65/0.97
% 0.65/0.97 % SZS output end Refutation
% 0.65/0.97 ============================== end of proof ==========================
% 0.65/0.97
% 0.65/0.97 ============================== STATISTICS ============================
% 0.65/0.97
% 0.65/0.97 Given=0. Generated=1. Kept=0. proofs=1.
% 0.65/0.97 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=21. Hints=0.
% 0.65/0.97 Megabytes=0.03.
% 0.65/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.65/0.97
% 0.65/0.97 ============================== end of statistics =====================
% 0.65/0.97
% 0.65/0.97 ============================== end of search =========================
% 0.65/0.97
% 0.65/0.97 THEOREM PROVED
% 0.65/0.97 % SZS status Unsatisfiable
% 0.65/0.97
% 0.65/0.97 Exiting with 1 proof.
% 0.65/0.97
% 0.65/0.97 Process 15023 exit (max_proofs) Tue Jul 12 05:03:59 2022
% 0.65/0.97 Prover9 interrupted
%------------------------------------------------------------------------------