TSTP Solution File: SYN969+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:23:55 EDT 2022
% Result : Theorem 0.63s 0.94s
% Output : Refutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 : Mon Jul 11 13:10:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.63/0.94 ============================== Prover9 ===============================
% 0.63/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.63/0.94 Process 23037 was started by sandbox on n023.cluster.edu,
% 0.63/0.94 Mon Jul 11 13:10:55 2022
% 0.63/0.94 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22883_n023.cluster.edu".
% 0.63/0.94 ============================== end of head ===========================
% 0.63/0.94
% 0.63/0.94 ============================== INPUT =================================
% 0.63/0.94
% 0.63/0.94 % Reading from file /tmp/Prover9_22883_n023.cluster.edu
% 0.63/0.94
% 0.63/0.94 set(prolog_style_variables).
% 0.63/0.94 set(auto2).
% 0.63/0.94 % set(auto2) -> set(auto).
% 0.63/0.94 % set(auto) -> set(auto_inference).
% 0.63/0.94 % set(auto) -> set(auto_setup).
% 0.63/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.63/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.63/0.94 % set(auto) -> set(auto_limits).
% 0.63/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.63/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.63/0.94 % set(auto) -> set(auto_denials).
% 0.63/0.94 % set(auto) -> set(auto_process).
% 0.63/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.63/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.63/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.63/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.63/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.63/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.63/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.63/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.63/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.63/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.63/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.63/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.63/0.94 % set(auto2) -> assign(stats, some).
% 0.63/0.94 % set(auto2) -> clear(echo_input).
% 0.63/0.94 % set(auto2) -> set(quiet).
% 0.63/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.63/0.94 % set(auto2) -> clear(print_given).
% 0.63/0.94 assign(lrs_ticks,-1).
% 0.63/0.94 assign(sos_limit,10000).
% 0.63/0.94 assign(order,kbo).
% 0.63/0.94 set(lex_order_vars).
% 0.63/0.94 clear(print_given).
% 0.63/0.94
% 0.63/0.94 % formulas(sos). % not echoed (1 formulas)
% 0.63/0.94
% 0.63/0.94 ============================== end of input ==========================
% 0.63/0.94
% 0.63/0.94 % From the command line: assign(max_seconds, 300).
% 0.63/0.94
% 0.63/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.63/0.94
% 0.63/0.94 % Formulas that are not ordinary clauses:
% 0.63/0.94 1 -(all B ((all X (p(X) -> q(X))) & r(B) -> ((all Y (r(Y) -> p(Y))) -> q(B)))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.63/0.94
% 0.63/0.94 ============================== end of process non-clausal formulas ===
% 0.63/0.94
% 0.63/0.94 ============================== PROCESS INITIAL CLAUSES ===============
% 0.63/0.94
% 0.63/0.94 ============================== PREDICATE ELIMINATION =================
% 0.63/0.94 2 -r(A) | p(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 3 r(c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 Derived: p(c1). [resolve(2,a,3,a)].
% 0.63/0.94 4 -p(A) | q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 5 -q(c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 Derived: -p(c1). [resolve(4,b,5,a)].
% 0.63/0.94 6 -p(c1). [resolve(4,b,5,a)].
% 0.63/0.94 7 p(c1). [resolve(2,a,3,a)].
% 0.63/0.94 Derived: $F. [resolve(6,a,7,a)].
% 0.63/0.94
% 0.63/0.94 ============================== end predicate elimination =============
% 0.63/0.94
% 0.63/0.94 Auto_denials: (no changes).
% 0.63/0.94
% 0.63/0.94 Term ordering decisions:
% 0.63/0.94 Function symbol KB weights:
% 0.63/0.94
% 0.63/0.94 ============================== PROOF =================================
% 0.63/0.94 % SZS status Theorem
% 0.63/0.94 % SZS output start Refutation
% 0.63/0.94
% 0.63/0.94 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.63/0.94 % Length of proof is 8.
% 0.63/0.94 % Level of proof is 3.
% 0.63/0.94 % Maximum clause weight is 0.000.
% 0.63/0.94 % Given clauses 0.
% 0.63/0.94
% 0.63/0.94 1 -(all B ((all X (p(X) -> q(X))) & r(B) -> ((all Y (r(Y) -> p(Y))) -> q(B)))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.63/0.94 2 -r(A) | p(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 3 r(c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 4 -p(A) | q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 5 -q(c1) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.63/0.94 6 -p(c1). [resolve(4,b,5,a)].
% 0.63/0.94 7 p(c1). [resolve(2,a,3,a)].
% 0.63/0.94 8 $F. [resolve(6,a,7,a)].
% 0.63/0.94
% 0.63/0.94 % SZS output end Refutation
% 0.63/0.94 ============================== end of proof ==========================
% 0.63/0.94
% 0.63/0.94 ============================== STATISTICS ============================
% 0.63/0.94
% 0.63/0.94 Given=0. Generated=1. Kept=0. proofs=1.
% 0.63/0.94 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=7. Hints=0.
% 0.63/0.94 Megabytes=0.02.
% 0.63/0.94 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.63/0.94
% 0.63/0.94 ============================== end of statistics =====================
% 0.63/0.94
% 0.63/0.94 ============================== end of search =========================
% 0.63/0.94
% 0.63/0.94 THEOREM PROVED
% 0.63/0.94 % SZS status Theorem
% 0.63/0.94
% 0.63/0.94 Exiting with 1 proof.
% 0.63/0.94
% 0.63/0.94 Process 23037 exit (max_proofs) Mon Jul 11 13:10:55 2022
% 0.63/0.94 Prover9 interrupted
%------------------------------------------------------------------------------