TSTP Solution File: SYN099-1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN099-1.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:16:22 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN099-1.003 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n009.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 22:22:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 4339 was started by sandbox2 on n009.cluster.edu,
% 0.43/0.98 Mon Jul 11 22:22:52 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4183_n009.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_4183_n009.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (50 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98 1 p_1_2(A) | -p_2_2(A) | -p_1_1(A) # label(m_s2_type11_1) # label(axiom). [assumption].
% 0.43/0.98 2 p_1_1(a) # label(m_t2_1) # label(axiom). [assumption].
% 0.43/0.98 3 p_1_1(A) | -p_1_2(A) # label(m_s2_type21_1) # label(axiom). [assumption].
% 0.43/0.98 Derived: p_1_2(a) | -p_2_2(a). [resolve(1,c,2,a)].
% 0.43/0.98 4 q_1_2(A) | -q_2_2(A) | -p_1_1(A) # label(m_s2_type12_2) # label(axiom). [assumption].
% 0.43/0.98 Derived: q_1_2(a) | -q_2_2(a). [resolve(4,c,2,a)].
% 0.43/0.98 Derived: q_1_2(A) | -q_2_2(A) | -p_1_2(A). [resolve(4,c,3,a)].
% 0.43/0.98 5 p_1_2(A) | -q_2_2(A) | -q_1_1(A) # label(m_s2_type11_2) # label(axiom). [assumption].
% 0.43/0.98 6 q_1_1(a) # label(m_t2_2) # label(axiom). [assumption].
% 0.43/0.98 7 q_1_1(A) | -q_1_2(A) # label(m_s2_type21_2) # label(axiom). [assumption].
% 0.43/0.98 Derived: p_1_2(a) | -q_2_2(a). [resolve(5,c,6,a)].
% 0.43/0.98 Derived: p_1_2(A) | -q_2_2(A) | -q_1_2(A). [resolve(5,c,7,a)].
% 0.43/0.98 8 q_1_2(A) | -p_2_2(A) | -q_1_1(A) # label(m_s2_type12_1) # label(axiom). [assumption].
% 0.43/0.98 Derived: q_1_2(a) | -p_2_2(a). [resolve(8,c,6,a)].
% 0.43/0.98 9 p_2_3(A) | -p_3_3(A) | -p_2_2(A) # label(m_s2_type11_5) # label(axiom). [assumption].
% 0.43/0.98 10 p_2_2(a) # label(m_t2_3) # label(axiom). [assumption].
% 0.43/0.98 11 p_2_2(A) | -p_1_2(A) # label(m_s2_type22_1) # label(axiom). [assumption].
% 0.43/0.98 Derived: p_2_3(a) | -p_3_3(a). [resolve(9,c,10,a)].
% 0.43/0.98 Derived: p_2_3(A) | -p_3_3(A) | -p_1_2(A). [resolve(9,c,11,a)].
% 0.43/0.98 12 q_2_3(A) | -q_3_3(A) | -p_2_2(A) # label(m_s2_type12_6) # label(axiom). [assumption].
% 0.43/0.98 Derived: q_2_3(a) | -q_3_3(a). [resolve(12,c,10,a)].
% 0.43/0.98 Derived: q_2_3(A) | -q_3_3(A) | -p_1_2(A). [resolve(12,c,11,a)].
% 0.43/0.98 13 p_1_2(a) | -p_2_2(a). [resolve(1,c,2,a)].
% 0.43/0.98 Derived: p_1_2(a). [resolve(13,b,10,a)].
% 0.43/0.98 14 q_1_2(a) | -p_2_2(a). [resolve(8,c,6,a)].
% 0.43/0.98 Derived: q_1_2(a). [resolve(14,b,10,a)].
% 0.43/0.98 15 p_2_3(A) | -q_3_3(A) | -q_2_2(A) # label(m_s2_type11_6) # label(axiom). [assumption].
% 0.43/0.98 16 q_2_2(a) # label(m_t2_4) # label(axiom). [assumption].
% 0.43/0.98 17 q_2_2(A) | -q_1_2(A) # label(m_s2_type22_3) # label(axiom). [assumption].
% 0.43/0.98 Derived: p_2_3(a) | -q_3_3(a). [resolve(15,c,16,a)].
% 0.43/0.98 Derived: p_2_3(A) | -q_3_3(A) | -q_1_2(A). [resolve(15,c,17,a)].
% 0.43/0.98 18 q_2_3(A) | -p_3_3(A) | -q_2_2(A) # label(m_s2_type12_5) # label(axiom). [assumption].
% 0.43/0.98 Derived: q_2_3(a) | -p_3_3(a). [resolve(18,c,16,a)].
% 0.43/0.98 Derived: q_2_3(A) | -p_3_3(A) | -q_1_2(A). [resolve(18,c,17,a)].
% 0.43/0.98 19 q_1_2(a) | -q_2_2(a). [resolve(4,c,2,a)].
% 0.43/0.98 20 q_1_2(A) | -q_2_2(A) | -p_1_2(A). [resolve(4,c,3,a)].
% 0.43/0.98 21 p_1_2(a) | -q_2_2(a). [resolve(5,c,6,a)].
% 0.43/0.98 22 p_1_2(A) | -q_2_2(A) | -q_1_2(A). [resolve(5,c,7,a)].
% 0.43/0.98 Derived: p_1_2(A) | -q_1_2(A) | -q_1_2(A). [resolve(22,b,17,a)].
% 0.43/0.98 23 p_2_3(a) | -p_3_3(a). [resolve(9,c,10,a)].
% 0.43/0.98 24 p_3_3(a) # label(m_t2_5) # label(axiom). [assumption].
% 0.43/0.98 25 p_3_3(A) | -p_2_3(A) # label(m_s2_type22_2) # label(axiom). [assumption].
% 0.43/0.98 Derived: p_2_3(a). [resolve(23,b,24,a)].
% 0.43/0.98 26 p_2_3(A) | -p_3_3(A) | -p_1_2(A). [resolve(9,c,11,a)].
% 0.43/0.98 27 q_2_3(a) | -p_3_3(a). [resolve(18,c,16,a)].
% 0.43/0.98 Derived: q_2_3(a). [resolve(27,b,24,a)].
% 0.43/0.98 28 q_2_3(A) | -p_3_3(A) | -q_1_2(A). [resolve(18,c,17,a)].
% 0.43/0.98 Derived: q_2_3(A) | -q_1_2(A) | -p_2_3(A). [resolve(28,b,25,a)].
% 0.43/0.98 29 q_2_3(a) | -q_3_3(a). [resolve(12,c,10,a)].
% 0.43/0.98 30 q_3_3(a) # label(m_t2_6) # label(axiom). [assumption].
% 0.43/0.98 31 q_3_3(A) | -q_2_3(A) # label(m_s2_type22_4) # label(axiom). [assumption].
% 0.43/0.98 32 q_2_3(A) | -q_3_3(A) | -p_1_2(A). [resolve(12,c,11,a)].
% 0.43/0.98 33 p_2_3(a) | -q_3_3(a). [resolve(15,c,16,a)].
% 0.43/0.98 34 p_2_3(A) | -q_3_3(A) | -q_1_2(A). [resolve(15,c,17,a)].
% 0.43/0.98 Derived: p_2_3(A) | -q_1_2(A) | -q_2_3(A). [resolve(34,b,31,a)].
% 0.43/0.98 35 -sym_p_1_3(A) | sym_p_2_3(A) | sym_p_1_2(A) # label(sym_m_s2_type11_3) # label(axiom). [assumption].
% 0.43/0.98 36 sym_p_1_3(A) # label(sym_m_s2_goal_1) # label(axiom). [assumption].
% 0.43/0.98 Derived: sym_p_2_3(A) | sym_p_1_2(A). [resolve(35,a,36,a)].
% 0.43/0.98 37 -sym_p_1_3(A) | sym_q_2_3(A) | sym_q_1_2(A) # label(sym_m_s2_type11_4) # label(axiom). [assumption].
% 0.43/0.98 Derived: sym_q_2_3(A) | sym_q_1_2(A). [resolve(37,a,36,a)].
% 0.43/0.99 38 p_1_3(A) | -p_2_3(A) | -p_1_2(A) # label(m_s2_type11_3) # label(axiom). [assumption].
% 0.43/0.99 39 -p_1_3(A) # label(m_s2_goal_1) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -p_2_3(A) | -p_1_2(A). [resolve(38,a,39,a)].
% 0.43/0.99 40 p_1_3(A) | -q_2_3(A) | -q_1_2(A) # label(m_s2_type11_4) # label(axiom). [assumption].
% 0.43/0.99 Derived: -q_2_3(A) | -q_1_2(A). [resolve(40,a,39,a)].
% 0.43/0.99 41 -sym_p_1_2(A) | sym_p_2_2(A) | sym_p_1_1(A) # label(sym_m_s2_type11_1) # label(axiom). [assumption].
% 0.43/0.99 42 -sym_p_1_1(a) # label(sym_m_t2_1) # label(axiom). [assumption].
% 0.43/0.99 43 -sym_p_1_1(A) | sym_p_1_2(A) # label(sym_m_s2_type21_1) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_p_1_2(a) | sym_p_2_2(a). [resolve(41,c,42,a)].
% 0.43/0.99 44 -sym_q_1_2(A) | sym_q_2_2(A) | sym_p_1_1(A) # label(sym_m_s2_type12_2) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_q_1_2(a) | sym_q_2_2(a). [resolve(44,c,42,a)].
% 0.43/0.99 Derived: -sym_q_1_2(A) | sym_q_2_2(A) | sym_p_1_2(A). [resolve(44,c,43,a)].
% 0.43/0.99 45 -sym_p_1_2(A) | sym_q_2_2(A) | sym_q_1_1(A) # label(sym_m_s2_type11_2) # label(axiom). [assumption].
% 0.43/0.99 46 -sym_q_1_1(a) # label(sym_m_t2_2) # label(axiom). [assumption].
% 0.43/0.99 47 -sym_q_1_1(A) | sym_q_1_2(A) # label(sym_m_s2_type21_2) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_p_1_2(a) | sym_q_2_2(a). [resolve(45,c,46,a)].
% 0.43/0.99 Derived: -sym_p_1_2(A) | sym_q_2_2(A) | sym_q_1_2(A). [resolve(45,c,47,a)].
% 0.43/0.99 48 -sym_q_1_2(A) | sym_p_2_2(A) | sym_q_1_1(A) # label(sym_m_s2_type12_1) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_q_1_2(a) | sym_p_2_2(a). [resolve(48,c,46,a)].
% 0.43/0.99 49 -sym_p_2_3(A) | sym_p_3_3(A) | sym_p_2_2(A) # label(sym_m_s2_type11_5) # label(axiom). [assumption].
% 0.43/0.99 50 -sym_p_2_2(a) # label(sym_m_t2_3) # label(axiom). [assumption].
% 0.43/0.99 51 -sym_p_2_2(A) | sym_p_1_2(A) # label(sym_m_s2_type22_1) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_p_2_3(a) | sym_p_3_3(a). [resolve(49,c,50,a)].
% 0.43/0.99 Derived: -sym_p_2_3(A) | sym_p_3_3(A) | sym_p_1_2(A). [resolve(49,c,51,a)].
% 0.43/0.99 52 -sym_q_2_3(A) | sym_q_3_3(A) | sym_p_2_2(A) # label(sym_m_s2_type12_6) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_q_2_3(a) | sym_q_3_3(a). [resolve(52,c,50,a)].
% 0.43/0.99 Derived: -sym_q_2_3(A) | sym_q_3_3(A) | sym_p_1_2(A). [resolve(52,c,51,a)].
% 0.43/0.99 53 -sym_p_1_2(a) | sym_p_2_2(a). [resolve(41,c,42,a)].
% 0.43/0.99 Derived: -sym_p_1_2(a). [resolve(53,b,50,a)].
% 0.43/0.99 54 -sym_q_1_2(a) | sym_p_2_2(a). [resolve(48,c,46,a)].
% 0.43/0.99 Derived: -sym_q_1_2(a). [resolve(54,b,50,a)].
% 0.43/0.99 55 -sym_p_2_3(A) | sym_q_3_3(A) | sym_q_2_2(A) # label(sym_m_s2_type11_6) # label(axiom). [assumption].
% 0.43/0.99 56 -sym_q_2_2(a) # label(sym_m_t2_4) # label(axiom). [assumption].
% 0.43/0.99 57 -sym_q_2_2(A) | sym_q_1_2(A) # label(sym_m_s2_type22_3) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_p_2_3(a) | sym_q_3_3(a). [resolve(55,c,56,a)].
% 0.43/0.99 Derived: -sym_p_2_3(A) | sym_q_3_3(A) | sym_q_1_2(A). [resolve(55,c,57,a)].
% 0.43/0.99 58 -sym_q_2_3(A) | sym_p_3_3(A) | sym_q_2_2(A) # label(sym_m_s2_type12_5) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_q_2_3(a) | sym_p_3_3(a). [resolve(58,c,56,a)].
% 0.43/0.99 Derived: -sym_q_2_3(A) | sym_p_3_3(A) | sym_q_1_2(A). [resolve(58,c,57,a)].
% 0.43/0.99 59 -sym_q_1_2(a) | sym_q_2_2(a). [resolve(44,c,42,a)].
% 0.43/0.99 60 -sym_q_1_2(A) | sym_q_2_2(A) | sym_p_1_2(A). [resolve(44,c,43,a)].
% 0.43/0.99 61 -sym_p_1_2(a) | sym_q_2_2(a). [resolve(45,c,46,a)].
% 0.43/0.99 62 -sym_p_1_2(A) | sym_q_2_2(A) | sym_q_1_2(A). [resolve(45,c,47,a)].
% 0.43/0.99 Derived: -sym_p_1_2(A) | sym_q_1_2(A) | sym_q_1_2(A). [resolve(62,b,57,a)].
% 0.43/0.99 63 -sym_p_2_3(a) | sym_p_3_3(a). [resolve(49,c,50,a)].
% 0.43/0.99 64 -sym_p_3_3(a) # label(sym_m_t2_5) # label(axiom). [assumption].
% 0.43/0.99 65 -sym_p_3_3(A) | sym_p_2_3(A) # label(sym_m_s2_type22_2) # label(axiom). [assumption].
% 0.43/0.99 Derived: -sym_p_2_3(a). [resolve(63,b,64,a)].
% 0.43/0.99 66 -sym_p_2_3(A) | sym_p_3_3(A) | sym_p_1_2(A). [resolve(49,c,51,a)].
% 0.43/0.99 67 -sym_q_2_3(a) | sym_p_3_3(a). [resolve(58,c,56,a)].
% 0.43/0.99 Derived: -sym_q_2_3(a). [resolve(67,b,64,a)].
% 0.43/0.99 68 -sym_q_2_3(A) | sym_p_3_3(A) | sym_q_1_2(A). [resolve(58,c,57,a)].
% 0.43/0.99 Derived: -sym_q_2_3(A) | sym_q_1_2(A) | sym_p_2_3(A). [resolve(68,b,65,a)].
% 0.43/0.99 69 -sym_q_2_3(a) | sym_q_3_3(a). [resolve(52,c,50,a)].
% 0.43/0.99 70 -sym_q_3_3(a) # label(sym_m_t2_6) # label(axiom). [assumption].
% 0.43/0.99 71 -sym_q_3_3(A) | sym_q_2_3(A) # label(sym_m_s2_type22_4) # label(axiom). [assumption].
% 0.43/0.99 72 -sym_q_2_3(A) | sym_q_3_3(A) | sym_p_1_2(A). [resolve(52,c,51,a)].
% 0.43/0.99 73 -sym_p_2_3(a) | sym_q_3_3(a). [resolve(55,c,56,a)].
% 0.43/0.99 74 -sym_p_2_3(A) | sym_q_3_3(A) | sym_q_1_2(A). [resolve(55,c,57,a)].
% 0.43/0.99 Derived: -sym_p_2_3(A) | sym_q_1_2(A) | sym_q_2_3(A). [resolve(74,b,71,a)].
% 0.43/0.99 75 -p_2_3(A) | -p_1_2(A). [resolve(38,a,39,a)].
% 0.43/0.99 76 p_1_2(a). [resolve(13,b,10,a)].
% 0.43/0.99 77 p_1_2(A) | -q_1_2(A) | -q_1_2(A). [resolve(22,b,17,a)].
% 0.43/0.99 Derived: -p_2_3(a). [resolve(75,b,76,a)].
% 0.43/0.99 Derived: -p_2_3(A) | -q_1_2(A) | -q_1_2(A). [resolve(75,b,77,a)].
% 0.43/0.99 78 q_2_3(A) | -q_1_2(A) | -p_2_3(A). [resolve(28,b,25,a)].
% 0.43/0.99 79 p_2_3(a). [resolve(23,b,24,a)].
% 0.43/0.99 Derived: q_2_3(a) | -q_1_2(a). [resolve(78,c,79,a)].
% 0.43/0.99 80 p_2_3(A) | -q_1_2(A) | -q_2_3(A). [resolve(34,b,31,a)].
% 0.43/0.99 81 -p_2_3(a). [resolve(75,b,76,a)].
% 0.43/0.99 Derived: $F. [resolve(81,a,79,a)].
% 0.43/0.99 82 -p_2_3(A) | -q_1_2(A) | -q_1_2(A). [resolve(75,b,77,a)].
% 0.43/0.99 83 -q_2_3(A) | -q_1_2(A). [resolve(40,a,39,a)].
% 0.43/0.99 84 q_1_2(a). [resolve(14,b,10,a)].
% 0.43/0.99 85 q_2_3(a) | -q_1_2(a). [resolve(78,c,79,a)].
% 0.43/0.99 86 -sym_p_2_3(a). [resolve(63,b,64,a)].
% 0.43/0.99 87 sym_p_2_3(A) | sym_p_1_2(A). [resolve(35,a,36,a)].
% 0.43/0.99 88 -sym_q_2_3(A) | sym_q_1_2(A) | sym_p_2_3(A). [resolve(68,b,65,a)].
% 0.43/0.99 89 -sym_p_2_3(A) | sym_q_1_2(A) | sym_q_2_3(A). [resolve(74,b,71,a)].
% 0.43/0.99 90 -sym_q_2_3(a). [resolve(67,b,64,a)].
% 0.43/0.99 91 sym_q_2_3(A) | sym_q_1_2(A). [resolve(37,a,36,a)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights:
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 14.
% 0.43/0.99 % Level of proof is 4.
% 0.43/0.99 % Maximum clause weight is 0.000.
% 0.43/0.99 % Given clauses 0.
% 0.43/0.99
% 0.43/0.99 1 p_1_2(A) | -p_2_2(A) | -p_1_1(A) # label(m_s2_type11_1) # label(axiom). [assumption].
% 0.43/0.99 2 p_1_1(a) # label(m_t2_1) # label(axiom). [assumption].
% 0.43/0.99 9 p_2_3(A) | -p_3_3(A) | -p_2_2(A) # label(m_s2_type11_5) # label(axiom). [assumption].
% 0.43/0.99 10 p_2_2(a) # label(m_t2_3) # label(axiom). [assumption].
% 0.43/0.99 13 p_1_2(a) | -p_2_2(a). [resolve(1,c,2,a)].
% 0.43/0.99 23 p_2_3(a) | -p_3_3(a). [resolve(9,c,10,a)].
% 0.43/0.99 24 p_3_3(a) # label(m_t2_5) # label(axiom). [assumption].
% 0.43/0.99 38 p_1_3(A) | -p_2_3(A) | -p_1_2(A) # label(m_s2_type11_3) # label(axiom). [assumption].
% 0.43/0.99 39 -p_1_3(A) # label(m_s2_goal_1) # label(negated_conjecture). [assumption].
% 0.43/0.99 75 -p_2_3(A) | -p_1_2(A). [resolve(38,a,39,a)].
% 0.43/0.99 76 p_1_2(a). [resolve(13,b,10,a)].
% 0.43/0.99 79 p_2_3(a). [resolve(23,b,24,a)].
% 0.43/0.99 81 -p_2_3(a). [resolve(75,b,76,a)].
% 0.43/0.99 92 $F. [resolve(81,a,79,a)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=0. Generated=1. Kept=0. proofs=1.
% 0.43/0.99 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=100. Hints=0.
% 0.43/0.99 Megabytes=0.05.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 4339 exit (max_proofs) Mon Jul 11 22:22:52 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------