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