TSTP Solution File: SYN056+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:52 EDT 2022
% Result : Theorem 0.47s 1.03s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 22:14:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.02 ============================== Prover9 ===============================
% 0.47/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.02 Process 10136 was started by sandbox2 on n015.cluster.edu,
% 0.47/1.02 Mon Jul 11 22:14:40 2022
% 0.47/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9983_n015.cluster.edu".
% 0.47/1.02 ============================== end of head ===========================
% 0.47/1.02
% 0.47/1.02 ============================== INPUT =================================
% 0.47/1.02
% 0.47/1.02 % Reading from file /tmp/Prover9_9983_n015.cluster.edu
% 0.47/1.02
% 0.47/1.02 set(prolog_style_variables).
% 0.47/1.02 set(auto2).
% 0.47/1.02 % set(auto2) -> set(auto).
% 0.47/1.02 % set(auto) -> set(auto_inference).
% 0.47/1.02 % set(auto) -> set(auto_setup).
% 0.47/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.02 % set(auto) -> set(auto_limits).
% 0.47/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.02 % set(auto) -> set(auto_denials).
% 0.47/1.02 % set(auto) -> set(auto_process).
% 0.47/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.02 % set(auto2) -> assign(stats, some).
% 0.47/1.02 % set(auto2) -> clear(echo_input).
% 0.47/1.02 % set(auto2) -> set(quiet).
% 0.47/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.02 % set(auto2) -> clear(print_given).
% 0.47/1.02 assign(lrs_ticks,-1).
% 0.47/1.02 assign(sos_limit,10000).
% 0.47/1.02 assign(order,kbo).
% 0.47/1.02 set(lex_order_vars).
% 0.47/1.02 clear(print_given).
% 0.47/1.02
% 0.47/1.02 % formulas(sos). % not echoed (3 formulas)
% 0.47/1.02
% 0.47/1.02 ============================== end of input ==========================
% 0.47/1.02
% 0.47/1.02 % From the command line: assign(max_seconds, 300).
% 0.47/1.02
% 0.47/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.02
% 0.47/1.02 % Formulas that are not ordinary clauses:
% 0.47/1.02 1 (exists X big_p(X)) <-> (exists Y big_q(Y)) # label(pel26_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.02 2 (all X all Y (big_p(X) & big_q(Y) -> (big_r(X) <-> big_s(Y)))) # label(pel26_2) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.02 3 -((all X (big_p(X) -> big_r(X))) <-> (all Y (big_q(Y) -> big_s(Y)))) # label(pel26) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.02
% 0.47/1.02 ============================== end of process non-clausal formulas ===
% 0.47/1.02
% 0.47/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.02
% 0.47/1.02 ============================== PREDICATE ELIMINATION =================
% 0.47/1.02 4 -big_p(A) | big_q(c1) # label(pel26_1) # label(axiom). [clausify(1)].
% 0.47/1.02 5 big_p(c3) | big_q(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.02 Derived: big_q(c1) | big_q(c4). [resolve(4,a,5,a)].
% 0.47/1.02 6 big_p(c2) | -big_q(A) # label(pel26_1) # label(axiom). [clausify(1)].
% 0.47/1.02 Derived: -big_q(A) | big_q(c1). [resolve(6,a,4,a)].
% 0.47/1.02 7 big_p(c3) | -big_s(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.02 Derived: -big_s(c4) | big_q(c1). [resolve(7,a,4,a)].
% 0.47/1.02 8 -big_p(A) | -big_q(B) | -big_r(A) | big_s(B) # label(pel26_2) # label(axiom). [clausify(2)].
% 0.47/1.02 Derived: -big_q(A) | -big_r(c3) | big_s(A) | big_q(c4). [resolve(8,a,5,a)].
% 0.47/1.02 Derived: -big_q(A) | -big_r(c2) | big_s(A) | -big_q(B). [resolve(8,a,6,a)].
% 0.47/1.02 Derived: -big_q(A) | -big_r(c3) | big_s(A) | -big_s(c4). [resolve(8,a,7,a)].
% 0.47/1.02 9 -big_p(A) | -big_q(B) | big_r(A) | -big_s(B) # label(pel26_2) # label(axiom). [clausify(2)].
% 0.47/1.02 Derived: -big_q(A) | big_r(c3) | -big_s(A) | big_q(c4). [resolve(9,a,5,a)].
% 0.47/1.02 Derived: -big_q(A) | big_r(c2) | -big_s(A) | -big_q(B). [resolve(9,a,6,a)].
% 0.47/1.02 Derived: -big_q(A) | big_r(c3) | -big_s(A) | -big_s(c4). [resolve(9,a,7,a)].
% 0.47/1.02 10 -big_p(A) | big_r(A) | -big_q(B) | big_s(B) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.02 Derived: big_r(c3) | -big_q(A) | big_s(A) | big_q(c4). [resolve(10,a,5,a)].
% 0.47/1.02 Derived: big_r(c2) | -big_q(A) | big_s(A) | -big_q(B). [resolve(10,a,6,a)].
% 0.47/1.03 Derived: big_r(c3) | -big_q(A) | big_s(A) | -big_s(c4). [resolve(10,a,7,a)].
% 0.47/1.03 11 -big_q(A) | big_r(c3) | -big_s(A) | big_q(c4). [resolve(9,a,5,a)].
% 0.47/1.03 12 -big_r(c3) | -big_s(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 13 -big_r(c3) | big_q(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 14 -big_q(A) | -big_r(c3) | big_s(A) | big_q(c4). [resolve(8,a,5,a)].
% 0.47/1.03 15 -big_q(A) | -big_r(c2) | big_s(A) | -big_q(B). [resolve(8,a,6,a)].
% 0.47/1.03 16 -big_q(A) | -big_r(c3) | big_s(A) | -big_s(c4). [resolve(8,a,7,a)].
% 0.47/1.03 Derived: -big_q(A) | -big_s(A) | big_q(c4) | -big_s(c4). [resolve(11,b,12,a)].
% 0.47/1.03 Derived: -big_q(A) | -big_s(A) | big_q(c4) | big_q(c4). [resolve(11,b,13,a)].
% 0.47/1.03 17 -big_q(A) | big_r(c2) | -big_s(A) | -big_q(B). [resolve(9,a,6,a)].
% 0.47/1.03 Derived: -big_q(A) | -big_s(A) | -big_q(B) | -big_q(C) | big_s(C) | -big_q(D). [resolve(17,b,15,b)].
% 0.47/1.03 18 -big_q(A) | big_r(c3) | -big_s(A) | -big_s(c4). [resolve(9,a,7,a)].
% 0.47/1.03 Derived: -big_q(A) | -big_s(A) | -big_s(c4) | -big_s(c4). [resolve(18,b,12,a)].
% 0.47/1.03 19 big_r(c3) | -big_q(A) | big_s(A) | big_q(c4). [resolve(10,a,5,a)].
% 0.47/1.03 Derived: -big_q(A) | big_s(A) | big_q(c4) | -big_s(c4). [resolve(19,a,12,a)].
% 0.47/1.03 Derived: -big_q(A) | big_s(A) | big_q(c4) | big_q(c4). [resolve(19,a,13,a)].
% 0.47/1.03 20 big_r(c2) | -big_q(A) | big_s(A) | -big_q(B). [resolve(10,a,6,a)].
% 0.47/1.03 Derived: -big_q(A) | big_s(A) | -big_q(B) | -big_q(C) | big_s(C) | -big_q(D). [resolve(20,a,15,b)].
% 0.47/1.03 21 big_r(c3) | -big_q(A) | big_s(A) | -big_s(c4). [resolve(10,a,7,a)].
% 0.47/1.03
% 0.47/1.03 ============================== end predicate elimination =============
% 0.47/1.03
% 0.47/1.03 Auto_denials: (non-Horn, no changes).
% 0.47/1.03
% 0.47/1.03 Term ordering decisions:
% 0.47/1.03 Function symbol KB weights: c1=1. c4=1.
% 0.47/1.03
% 0.47/1.03 ============================== end of process initial clauses ========
% 0.47/1.03
% 0.47/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.03
% 0.47/1.03 ============================== end of clauses for search =============
% 0.47/1.03
% 0.47/1.03 ============================== SEARCH ================================
% 0.47/1.03
% 0.47/1.03 % Starting search at 0.01 seconds.
% 0.47/1.03
% 0.47/1.03 ============================== PROOF =================================
% 0.47/1.03 % SZS status Theorem
% 0.47/1.03 % SZS output start Refutation
% 0.47/1.03
% 0.47/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.47/1.03 % Length of proof is 31.
% 0.47/1.03 % Level of proof is 9.
% 0.47/1.03 % Maximum clause weight is 12.000.
% 0.47/1.03 % Given clauses 9.
% 0.47/1.03
% 0.47/1.03 1 (exists X big_p(X)) <-> (exists Y big_q(Y)) # label(pel26_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 2 (all X all Y (big_p(X) & big_q(Y) -> (big_r(X) <-> big_s(Y)))) # label(pel26_2) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 3 -((all X (big_p(X) -> big_r(X))) <-> (all Y (big_q(Y) -> big_s(Y)))) # label(pel26) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/1.03 4 -big_p(A) | big_q(c1) # label(pel26_1) # label(axiom). [clausify(1)].
% 0.47/1.03 5 big_p(c3) | big_q(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 6 big_p(c2) | -big_q(A) # label(pel26_1) # label(axiom). [clausify(1)].
% 0.47/1.03 7 big_p(c3) | -big_s(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 8 -big_p(A) | -big_q(B) | -big_r(A) | big_s(B) # label(pel26_2) # label(axiom). [clausify(2)].
% 0.47/1.03 9 -big_p(A) | -big_q(B) | big_r(A) | -big_s(B) # label(pel26_2) # label(axiom). [clausify(2)].
% 0.47/1.03 10 -big_p(A) | big_r(A) | -big_q(B) | big_s(B) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 11 -big_q(A) | big_r(c3) | -big_s(A) | big_q(c4). [resolve(9,a,5,a)].
% 0.47/1.03 12 -big_r(c3) | -big_s(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 13 -big_r(c3) | big_q(c4) # label(pel26) # label(negated_conjecture). [clausify(3)].
% 0.47/1.03 15 -big_q(A) | -big_r(c2) | big_s(A) | -big_q(B). [resolve(8,a,6,a)].
% 0.47/1.03 18 -big_q(A) | big_r(c3) | -big_s(A) | -big_s(c4). [resolve(9,a,7,a)].
% 0.47/1.03 20 big_r(c2) | -big_q(A) | big_s(A) | -big_q(B). [resolve(10,a,6,a)].
% 0.47/1.03 22 big_q(c1) | big_q(c4). [resolve(4,a,5,a)].
% 0.47/1.03 23 -big_q(A) | big_q(c1). [resolve(6,a,4,a)].
% 0.47/1.03 26 -big_q(A) | -big_s(A) | big_q(c4) | big_q(c4). [resolve(11,b,13,a)].
% 0.47/1.03 27 -big_q(A) | -big_s(A) | big_q(c4). [copy(26),merge(d)].
% 0.47/1.03 29 -big_q(A) | -big_s(A) | -big_s(c4) | -big_s(c4). [resolve(18,b,12,a)].
% 0.47/1.03 30 -big_q(A) | -big_s(A) | -big_s(c4). [copy(29),merge(d)].
% 0.47/1.03 34 -big_q(A) | big_s(A) | -big_q(B) | -big_q(C) | big_s(C) | -big_q(D). [resolve(20,a,15,b)].
% 0.47/1.03 37 -big_q(A) | big_s(A) | -big_q(B) | big_s(B) | -big_q(C). [factor(34,a,c)].
% 0.47/1.03 40 -big_q(A) | big_s(A) | -big_q(B). [factor(37,a,c),merge(c)].
% 0.47/1.03 41 -big_q(A) | big_s(A). [factor(40,a,c)].
% 0.47/1.03 42 big_q(c1). [resolve(23,a,22,b),merge(b)].
% 0.47/1.03 43 big_s(c1). [resolve(42,a,41,a)].
% 0.47/1.03 44 -big_s(c4). [resolve(43,a,30,b),unit_del(a,42)].
% 0.47/1.03 45 big_q(c4). [resolve(43,a,27,b),unit_del(a,42)].
% 0.47/1.03 46 $F. [resolve(45,a,41,a),unit_del(a,44)].
% 0.47/1.03
% 0.47/1.03 % SZS output end Refutation
% 0.47/1.03 ============================== end of proof ==========================
% 0.47/1.03
% 0.47/1.03 ============================== STATISTICS ============================
% 0.47/1.03
% 0.47/1.03 Given=9. Generated=43. Kept=21. proofs=1.
% 0.47/1.03 Usable=4. Sos=1. Demods=0. Limbo=0, Disabled=44. Hints=0.
% 0.47/1.03 Megabytes=0.04.
% 0.47/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.03
% 0.47/1.03 ============================== end of statistics =====================
% 0.47/1.03
% 0.47/1.03 ============================== end of search =========================
% 0.47/1.03
% 0.47/1.03 THEOREM PROVED
% 0.47/1.03 % SZS status Theorem
% 0.47/1.03
% 0.47/1.03 Exiting with 1 proof.
% 0.47/1.03
% 0.47/1.03 Process 10136 exit (max_proofs) Mon Jul 11 22:14:40 2022
% 0.47/1.03 Prover9 interrupted
%------------------------------------------------------------------------------