TSTP Solution File: SYN954+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN954+1 : TPTP v8.1.0. Released v3.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:23:49 EDT 2022
% Result : Theorem 0.43s 1.04s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN954+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 11 17:31:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 18299 was started by sandbox2 on n026.cluster.edu,
% 0.43/1.04 Mon Jul 11 17:31:58 2022
% 0.43/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17996_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_17996_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 -(all A all B ((all Z (q(Z) -> p(Z))) -> (exists X ((p(X) -> p(A)) & (q(X) -> p(B)))))) # label(prove_this) # 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 -q(A) | p(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 3 p(A) | q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 Derived: p(A) | p(A). [resolve(2,a,3,b)].
% 0.43/1.04 4 -p(c1) | q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04
% 0.43/1.04 ============================== end predicate elimination =============
% 0.43/1.04
% 0.43/1.04 Auto_denials: (non-Horn, no changes).
% 0.43/1.04
% 0.43/1.04 Term ordering decisions:
% 0.43/1.04 Function symbol KB weights: c1=1. c2=1.
% 0.43/1.04
% 0.43/1.04 ============================== PROOF =================================
% 0.43/1.04 % SZS status Theorem
% 0.43/1.04 % SZS output start Refutation
% 0.43/1.04
% 0.43/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.04 % Length of proof is 7.
% 0.43/1.04 % Level of proof is 4.
% 0.43/1.04 % Maximum clause weight is 4.000.
% 0.43/1.04 % Given clauses 0.
% 0.43/1.04
% 0.43/1.04 1 -(all A all B ((all Z (q(Z) -> p(Z))) -> (exists X ((p(X) -> p(A)) & (q(X) -> p(B)))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.04 2 -q(A) | p(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 3 p(A) | q(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 5 -p(c1) | -p(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.43/1.04 7 p(A) | p(A). [resolve(2,a,3,b)].
% 0.43/1.04 8 p(A). [copy(7),merge(b)].
% 0.43/1.04 9 $F. [back_unit_del(5),unit_del(a,8),unit_del(b,8)].
% 0.43/1.04
% 0.43/1.04 % SZS output end Refutation
% 0.43/1.04 ============================== end of proof ==========================
% 0.43/1.04
% 0.43/1.04 ============================== STATISTICS ============================
% 0.43/1.04
% 0.43/1.04 Given=0. Generated=4. Kept=3. proofs=1.
% 0.43/1.04 Usable=0. Sos=0. Demods=0. Limbo=1, Disabled=8. Hints=0.
% 0.43/1.04 Megabytes=0.02.
% 0.43/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.04
% 0.43/1.04 ============================== end of statistics =====================
% 0.43/1.04
% 0.43/1.04 ============================== end of search =========================
% 0.43/1.04
% 0.43/1.04 THEOREM PROVED
% 0.43/1.04 % SZS status Theorem
% 0.43/1.04
% 0.43/1.04 Exiting with 1 proof.
% 0.43/1.04
% 0.43/1.04 Process 18299 exit (max_proofs) Mon Jul 11 17:31:58 2022
% 0.43/1.04 Prover9 interrupted
%------------------------------------------------------------------------------