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