%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN103-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n008.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:31 EDT 2022

% Result   : Unsatisfiable 0.94s 1.21s
% Output   : Refutation 0.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN103-1 : TPTP v8.1.0. Released v1.1.0.
% 0.13/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n008.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 06:29:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.82/1.10  ============================== Prover9 ===============================
% 0.82/1.10  Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.10  Process 12633 was started by sandbox on n008.cluster.edu,
% 0.82/1.10  Tue Jul 12 06:29:39 2022
% 0.82/1.10  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12279_n008.cluster.edu".
% 0.82/1.10  ============================== end of head ===========================
% 0.82/1.10  
% 0.82/1.10  ============================== INPUT =================================
% 0.82/1.10  
% 0.82/1.10  % Reading from file /tmp/Prover9_12279_n008.cluster.edu
% 0.82/1.10  
% 0.82/1.10  set(prolog_style_variables).
% 0.82/1.10  set(auto2).
% 0.82/1.10      % set(auto2) -> set(auto).
% 0.82/1.10      % set(auto) -> set(auto_inference).
% 0.82/1.10      % set(auto) -> set(auto_setup).
% 0.82/1.10      % set(auto_setup) -> set(predicate_elim).
% 0.82/1.10      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.10      % set(auto) -> set(auto_limits).
% 0.82/1.10      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.10      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.10      % set(auto) -> set(auto_denials).
% 0.82/1.10      % set(auto) -> set(auto_process).
% 0.82/1.10      % set(auto2) -> assign(new_constants, 1).
% 0.82/1.10      % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.10      % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.10      % set(auto2) -> assign(max_hours, 1).
% 0.82/1.10      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.10      % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.10      % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.10      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.10      % set(auto2) -> set(sort_initial_sos).
% 0.82/1.10      % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.10      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.10      % set(auto2) -> assign(max_megs, 400).
% 0.82/1.10      % set(auto2) -> assign(stats, some).
% 0.82/1.10      % set(auto2) -> clear(echo_input).
% 0.82/1.10      % set(auto2) -> set(quiet).
% 0.82/1.10      % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.10      % set(auto2) -> clear(print_given).
% 0.82/1.10  assign(lrs_ticks,-1).
% 0.82/1.10  assign(sos_limit,10000).
% 0.82/1.10  assign(order,kbo).
% 0.82/1.10  set(lex_order_vars).
% 0.82/1.10  clear(print_given).
% 0.82/1.10  
% 0.82/1.10  % formulas(sos).  % not echoed (369 formulas)
% 0.82/1.10  
% 0.82/1.10  ============================== end of input ==========================
% 0.82/1.10  
% 0.82/1.10  % From the command line: assign(max_seconds, 300).
% 0.82/1.10  
% 0.82/1.10  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.10  
% 0.82/1.10  % Formulas that are not ordinary clauses:
% 0.82/1.10  
% 0.82/1.10  ============================== end of process non-clausal formulas ===
% 0.82/1.10  
% 0.82/1.10  ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.10  
% 0.82/1.10  ============================== PREDICATE ELIMINATION =================
% 0.82/1.10  1 k1(A) | -n0(B,A) # label(rule_001) # label(axiom).  [assumption].
% 0.82/1.10  2 n0(d,e) # label(axiom_3) # label(axiom).  [assumption].
% 0.82/1.10  3 n0(d,b) # label(axiom_7) # label(axiom).  [assumption].
% 0.82/1.10  4 n0(e,b) # label(axiom_11) # label(axiom).  [assumption].
% 0.82/1.10  5 n0(a,b) # label(axiom_15) # label(axiom).  [assumption].
% 0.82/1.10  6 n0(d,c) # label(axiom_26) # label(axiom).  [assumption].
% 0.82/1.10  7 n0(e,e) # label(axiom_30) # label(axiom).  [assumption].
% 0.82/1.10  8 n0(c,d) # label(axiom_34) # label(axiom).  [assumption].
% 0.82/1.10  9 n0(b,a) # label(axiom_37) # label(axiom).  [assumption].
% 0.82/1.10  Derived: k1(e).  [resolve(1,b,2,a)].
% 0.82/1.10  Derived: k1(b).  [resolve(1,b,3,a)].
% 0.82/1.10  Derived: k1(c).  [resolve(1,b,6,a)].
% 0.82/1.10  Derived: k1(d).  [resolve(1,b,8,a)].
% 0.82/1.10  Derived: k1(a).  [resolve(1,b,9,a)].
% 0.82/1.10  10 l1(A,A) | -n0(B,A) # label(rule_002) # label(axiom).  [assumption].
% 0.82/1.10  Derived: l1(e,e).  [resolve(10,b,2,a)].
% 0.82/1.10  Derived: l1(b,b).  [resolve(10,b,3,a)].
% 0.82/1.10  Derived: l1(c,c).  [resolve(10,b,6,a)].
% 0.82/1.10  Derived: l1(d,d).  [resolve(10,b,8,a)].
% 0.82/1.10  Derived: l1(a,a).  [resolve(10,b,9,a)].
% 0.82/1.10  11 m1(A,A,c) | -n0(B,B) | -l1(c,c) | -p0(B,A) # label(rule_010) # label(axiom).  [assumption].
% 0.82/1.10  Derived: m1(A,A,c) | -l1(c,c) | -p0(e,A).  [resolve(11,b,7,a)].
% 0.82/1.10  12 m1(A,A,B) | -k0(A) | -n0(B,B) # label(rule_011) # label(axiom).  [assumption].
% 0.82/1.10  Derived: m1(A,A,e) | -k0(A).  [resolve(12,c,7,a)].
% 0.82/1.10  13 n1(A,A,A) | -n0(A,A) | -q0(a,A) # label(rule_038) # label(axiom).  [assumption].
% 0.82/1.10  Derived: n1(e,e,e) | -q0(a,e).  [resolve(13,b,7,a)].
% 0.82/1.10  14 n1(A,A,A) | -l1(B,A) | -n0(B,A) # label(rule_058) # label(axiom).  [assumption].
% 0.82/1.10  Derived: n1(e,e,e) | -l1(d,e).  [resolve(14,c,2,a)].
% 0.82/1.10  Derived: n1(b,b,b) | -l1(d,b).  [resolve(14,c,3,a)].
% 0.82/1.10  Derived: n1(b,b,b) | -l1(e,b).  [resolve(14,c,4,a)].
% 0.82/1.10  Derived: n1(b,b,b) | -l1(a,b).  [resolve(14,c,5,a)].
% 0.82/1.10  Derived: n1(c,c,c) | -l1(d,c).  [resolve(14,c,6,a)].
% 0.82/1.11  Derived: n1(e,e,e) | -l1(e,e).  [resolve(14,c,7,a)].
% 0.82/1.11  Derived: n1(d,d,d) | -l1(c,d).  [resolve(14,c,8,a)].
% 0.82/1.11  Derived: n1(a,a,a) | -l1(b,a).  [resolve(14,c,9,a)].
% 0.82/1.11  15 p1(A,A,B) | -n0(d,A) | -k0(B) # label(rule_063) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p1(e,e,A) | -k0(A).  [resolve(15,b,2,a)].
% 0.82/1.11  Derived: p1(b,b,A) | -k0(A).  [resolve(15,b,3,a)].
% 0.82/1.11  Derived: p1(c,c,A) | -k0(A).  [resolve(15,b,6,a)].
% 0.82/1.11  16 p1(A,A,A) | -l1(B,B) | -p0(A,B) | -n0(B,B) # label(rule_065) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p1(A,A,A) | -l1(e,e) | -p0(A,e).  [resolve(16,d,7,a)].
% 0.82/1.11  17 p1(A,A,A) | -n0(B,A) # label(rule_066) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p1(e,e,e).  [resolve(17,b,2,a)].
% 0.82/1.11  Derived: p1(b,b,b).  [resolve(17,b,3,a)].
% 0.82/1.11  Derived: p1(c,c,c).  [resolve(17,b,6,a)].
% 0.82/1.11  Derived: p1(d,d,d).  [resolve(17,b,8,a)].
% 0.82/1.11  Derived: p1(a,a,a).  [resolve(17,b,9,a)].
% 0.82/1.11  18 p1(A,A,A) | -n0(e,b) | -k0(b) | -k0(A) | -k1(B) # label(rule_073) # label(axiom).  [assumption].
% 0.82/1.11  19 p1(A,A,A) | -n0(B,B) | -l0(C) | -n1(B,D,A) # label(rule_080) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p1(A,A,A) | -l0(B) | -n1(e,C,A).  [resolve(19,b,7,a)].
% 0.82/1.11  20 p1(d,d,A) | -s0(A) | -n1(c,d,A) | -r0(d) | -n0(c,A) # label(rule_089) # label(axiom).  [assumption].
% 0.82/1.11  21 q1(A,B,A) | -n0(C,B) | -p0(D,A) # label(rule_092) # label(axiom).  [assumption].
% 0.82/1.11  Derived: q1(A,e,A) | -p0(B,A).  [resolve(21,b,2,a)].
% 0.82/1.11  Derived: q1(A,b,A) | -p0(B,A).  [resolve(21,b,3,a)].
% 0.82/1.11  Derived: q1(A,c,A) | -p0(B,A).  [resolve(21,b,6,a)].
% 0.82/1.11  Derived: q1(A,d,A) | -p0(B,A).  [resolve(21,b,8,a)].
% 0.82/1.11  Derived: q1(A,a,A) | -p0(B,A).  [resolve(21,b,9,a)].
% 0.82/1.11  22 q1(A,A,A) | -n0(B,A) # label(rule_100) # label(axiom).  [assumption].
% 0.82/1.11  Derived: q1(e,e,e).  [resolve(22,b,2,a)].
% 0.82/1.11  Derived: q1(b,b,b).  [resolve(22,b,3,a)].
% 0.82/1.11  Derived: q1(c,c,c).  [resolve(22,b,6,a)].
% 0.82/1.11  Derived: q1(d,d,d).  [resolve(22,b,8,a)].
% 0.82/1.11  Derived: q1(a,a,a).  [resolve(22,b,9,a)].
% 0.82/1.11  23 l2(A,B) | -s1(A) | -n0(e,B) | -l2(B,B) # label(rule_131) # label(axiom).  [assumption].
% 0.82/1.11  Derived: l2(A,b) | -s1(A) | -l2(b,b).  [resolve(23,c,4,a)].
% 0.82/1.11  Derived: l2(A,e) | -s1(A) | -l2(e,e).  [resolve(23,c,7,a)].
% 0.82/1.11  24 p2(a,A,d) | -n0(A,d) | -m1(a,A,d) # label(rule_166) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p2(a,c,d) | -m1(a,c,d).  [resolve(24,b,8,a)].
% 0.82/1.11  25 k3(A,B,A) | -s1(B) | -p2(C,B,D) | -n0(A,D) # label(rule_192) # label(axiom).  [assumption].
% 0.82/1.11  Derived: k3(d,A,d) | -s1(A) | -p2(B,A,e).  [resolve(25,d,2,a)].
% 0.82/1.11  Derived: k3(d,A,d) | -s1(A) | -p2(B,A,b).  [resolve(25,d,3,a)].
% 0.82/1.11  Derived: k3(e,A,e) | -s1(A) | -p2(B,A,b).  [resolve(25,d,4,a)].
% 0.82/1.11  Derived: k3(a,A,a) | -s1(A) | -p2(B,A,b).  [resolve(25,d,5,a)].
% 0.82/1.11  Derived: k3(d,A,d) | -s1(A) | -p2(B,A,c).  [resolve(25,d,6,a)].
% 0.82/1.11  Derived: k3(e,A,e) | -s1(A) | -p2(B,A,e).  [resolve(25,d,7,a)].
% 0.82/1.11  Derived: k3(c,A,c) | -s1(A) | -p2(B,A,d).  [resolve(25,d,8,a)].
% 0.82/1.11  Derived: k3(b,A,b) | -s1(A) | -p2(B,A,a).  [resolve(25,d,9,a)].
% 0.82/1.11  26 m3(A,A,A) | -k2(B,C) | -m3(A,C,A) | -n0(C,a) | -l2(a,a) # label(rule_226) # label(axiom).  [assumption].
% 0.82/1.11  Derived: m3(A,A,A) | -k2(B,b) | -m3(A,b,A) | -l2(a,a).  [resolve(26,d,9,a)].
% 0.82/1.11  27 q3(A,B) | -q2(C,A,B) | -n0(C,A) # label(rule_255) # label(axiom).  [assumption].
% 0.82/1.11  Derived: q3(e,A) | -q2(d,e,A).  [resolve(27,c,2,a)].
% 0.82/1.11  Derived: q3(b,A) | -q2(d,b,A).  [resolve(27,c,3,a)].
% 0.82/1.11  Derived: q3(b,A) | -q2(e,b,A).  [resolve(27,c,4,a)].
% 0.82/1.11  Derived: q3(b,A) | -q2(a,b,A).  [resolve(27,c,5,a)].
% 0.82/1.11  Derived: q3(c,A) | -q2(d,c,A).  [resolve(27,c,6,a)].
% 0.82/1.11  Derived: q3(e,A) | -q2(e,e,A).  [resolve(27,c,7,a)].
% 0.82/1.11  Derived: q3(d,A) | -q2(c,d,A).  [resolve(27,c,8,a)].
% 0.82/1.11  Derived: q3(a,A) | -q2(b,a,A).  [resolve(27,c,9,a)].
% 0.82/1.11  28 k4(c) | -n0(c,d) | -q3(e,b) | -n3(e) # label(rule_274) # label(axiom).  [assumption].
% 0.82/1.11  Derived: k4(c) | -q3(e,b) | -n3(e).  [resolve(28,b,8,a)].
% 0.82/1.11  29 k4(A) | -k3(B,B,B) | -n0(C,B) | -k4(A) # label(rule_275) # label(axiom).  [assumption].
% 0.82/1.11  30 p4(A,A,A) | -l4(A) | -n0(A,B) | -p4(C,D,C) # label(rule_289) # label(axiom).  [assumption].
% 0.82/1.11  Derived: p4(d,d,d) | -l4(d) | -p4(A,B,A).  [resolve(30,c,2,a)].
% 0.82/1.11  Derived: p4(e,e,e) | -l4(e) | -p4(A,B,A).  [resolve(30,c,4,a)].
% 0.82/1.11  Derived: p4(a,a,a) | -l4(a) | -p4(A,B,A).  [resolve(30,c,5,a)].
% 0.82/1.11  Derived: p4(c,c,c) | -l4(c) | -p4(A,B,A).  [resolve(30,c,8,a)].
% 0.82/1.13  Derived: p4(b,b,b) | -l4(b) | -p4(A,B,A).  [resolve(30,c,9,a)].
% 0.82/1.13  31 m1(A,B,A) | -l0(A) | -k0(B) # label(rule_021) # label(axiom).  [assumption].
% 0.82/1.13  32 k0(e) # label(axiom_28) # label(axiom).  [assumption].
% 0.82/1.13  33 k0(b) # label(axiom_32) # label(axiom).  [assumption].
% 0.82/1.13  Derived: m1(A,e,A) | -l0(A).  [resolve(31,c,32,a)].
% 0.82/1.13  Derived: m1(A,b,A) | -l0(A).  [resolve(31,c,33,a)].
% 0.82/1.13  34 m1(A,A,A) | -l0(A) | -k0(A) | -m0(A,A,A) # label(rule_028) # label(axiom).  [assumption].
% 0.82/1.13  35 m1(c,a,c) | -r0(e) | -m0(a,e,c) | -r0(A) | -k0(e) # label(rule_031) # label(axiom).  [assumption].
% 0.82/1.13  Derived: m1(c,a,c) | -r0(e) | -m0(a,e,c) | -r0(A).  [resolve(35,e,32,a)].
% 0.82/1.13  36 n1(A,A,A) | -m0(B,C,B) | -k0(A) | -q0(D,C) # label(rule_042) # label(axiom).  [assumption].
% 0.82/1.13  Derived: n1(e,e,e) | -m0(A,B,A) | -q0(C,B).  [resolve(36,c,32,a)].
% 0.82/1.13  Derived: n1(b,b,b) | -m0(A,B,A) | -q0(C,B).  [resolve(36,c,33,a)].
% 0.82/1.13  37 n1(A,A,A) | -m1(B,C,A) | -k0(B) # label(rule_046) # label(axiom).  [assumption].
% 0.82/1.13  Derived: n1(A,A,A) | -m1(e,B,A).  [resolve(37,c,32,a)].
% 0.82/1.13  Derived: n1(A,A,A) | -m1(b,B,A).  [resolve(37,c,33,a)].
% 0.82/1.13  38 n1(d,d,b) | -q0(b,e) | -m1(d,e,e) | -k0(b) # label(rule_060) # label(axiom).  [assumption].
% 0.82/1.13  Derived: n1(d,d,b) | -q0(b,e) | -m1(d,e,e).  [resolve(38,d,33,a)].
% 0.82/1.13  39 n1(A,A,A) | -k0(A) | -s0(A) # label(rule_061) # label(axiom).  [assumption].
% 0.82/1.13  Derived: n1(e,e,e) | -s0(e).  [resolve(39,b,32,a)].
% 0.82/1.13  Derived: n1(b,b,b) | -s0(b).  [resolve(39,b,33,a)].
% 0.82/1.13  40 p1(A,A,A) | -k0(A) # label(rule_068) # label(axiom).  [assumption].
% 0.82/1.13  41 p1(A,A,A) | -k0(e) | -k1(A) | -l0(c) # label(rule_079) # label(axiom).  [assumption].
% 0.82/1.13  Derived: p1(A,A,A) | -k1(A) | -l0(c).  [resolve(41,b,32,a)].
% 0.82/1.13  42 p1(A,b,B) | -m1(A,B,b) | -k0(B) # label(rule_083) # label(axiom).  [assumption].
% 0.82/1.13  Derived: p1(A,b,e) | -m1(A,e,b).  [resolve(42,c,32,a)].
% 0.82/1.13  Derived: p1(A,b,b) | -m1(A,b,b).  [resolve(42,c,33,a)].
% 0.82/1.13  43 p1(e,e,e) | -r0(e) | -k0(e) # label(rule_090) # label(axiom).  [assumption].
% 0.82/1.13  44 q1(b,e,e) | -s0(e) | -k0(b) | -l0(c) # label(rule_094) # label(axiom).  [assumption].
% 0.82/1.13  Derived: q1(b,e,e) | -s0(e) | -l0(c).  [resolve(44,c,33,a)].
% 0.82/1.13  45 q1(A,B,B) | -k0(C) | -l0(A) | -q1(B,B,C) # label(rule_099) # label(axiom).  [assumption].
% 0.82/1.13  Derived: q1(A,B,B) | -l0(A) | -q1(B,B,e).  [resolve(45,b,32,a)].
% 0.82/1.13  Derived: q1(A,B,B) | -l0(A) | -q1(B,B,b).  [resolve(45,b,33,a)].
% 0.82/1.13  46 q1(A,A,A) | -k0(A) | -l0(B) # label(rule_102) # label(axiom).  [assumption].
% 0.82/1.13  47 q1(A,A,A) | -m0(A,A,B) | -k0(B) # label(rule_114) # label(axiom).  [assumption].
% 0.82/1.13  Derived: q1(A,A,A) | -m0(A,A,e).  [resolve(47,c,32,a)].
% 0.82/1.13  Derived: q1(A,A,A) | -m0(A,A,b).  [resolve(47,c,33,a)].
% 0.82/1.13  48 q1(d,d,d) | -k0(e) | -s0(d) # label(rule_117) # label(axiom).  [assumption].
% 0.82/1.13  49 n2(c) | -l1(e,c) | -k0(b) # label(rule_139) # label(axiom).  [assumption].
% 0.82/1.13  Derived: n2(c) | -l1(e,c).  [resolve(49,c,33,a)].
% 0.82/1.13  50 p2(A,A,A) | -k1(B) | -k0(B) | -l2(a,B) | -k2(A,a) # label(rule_142) # label(axiom).  [assumption].
% 0.82/1.13  Derived: p2(A,A,A) | -k1(e) | -l2(a,e) | -k2(A,a).  [resolve(50,c,32,a)].
% 0.82/1.13  Derived: p2(A,A,A) | -k1(b) | -l2(a,b) | -k2(A,a).  [resolve(50,c,33,a)].
% 0.82/1.13  51 q2(A,B,B) | -k0(B) | -p1(A,A,A) # label(rule_177) # label(axiom).  [assumption].
% 0.82/1.13  Derived: q2(A,e,e) | -p1(A,A,A).  [resolve(51,b,32,a)].
% 0.82/1.13  Derived: q2(A,b,b) | -p1(A,A,A).  [resolve(51,b,33,a)].
% 0.82/1.13  52 q2(A,B,A) | -r1(B) | -m0(C,D,A) | -k0(B) | -q2(B,B,B) # label(rule_187) # label(axiom).  [assumption].
% 0.82/1.13  Derived: q2(A,e,A) | -r1(e) | -m0(B,C,A) | -q2(e,e,e).  [resolve(52,d,32,a)].
% 0.82/1.13  Derived: q2(A,b,A) | -r1(b) | -m0(B,C,A) | -q2(b,b,b).  [resolve(52,d,33,a)].
% 0.82/1.13  53 k3(c,c,c) | -k0(a) | -r2(c) # label(rule_198) # label(axiom).  [assumption].
% 0.82/1.13  54 r5(A,B) | -s4(A) | -k0(b) | -n3(B) # label(rule_327) # label(axiom).  [assumption].
% 0.82/1.13  Derived: r5(A,B) | -s4(A) | -n3(B).  [resolve(54,c,33,a)].
% 0.82/1.13  55 -k0(b) # label(prove_this) # label(negated_conjecture).  [assumption].
% 0.82/1.13  Derived: $F.  [resolve(55,a,33,a)].
% 0.82/1.13  56 m1(A,A,e) | -k0(A).  [resolve(12,c,7,a)].
% 0.82/1.13  57 p1(e,e,A) | -k0(A).  [resolve(15,b,2,a)].
% 0.82/1.13  58 p1(b,b,A) | -k0(A).  [resolve(15,b,3,a)].
% 0.82/1.13  59 p1(c,c,A) | -k0(A).  [resolve(15,b,6,a)].
% 0.82/1.13  60 n2(e) | -r1(b) | -r0(e) | -p1(b,A,B) # label(rule_140) # label(axiom).  [assumption].
% 0.82/1.13  61 r1(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) # label(rule_124) # label(axiom).  [assumption].
% 0.91/1.17  62 p2(e,c,c) | -r1(d) | -l1(e,c) # label(rule_147) # label(axiom).  [assumption].
% 0.91/1.17  63 p2(A,A,d) | -r1(a) | -m0(B,A,d) # label(rule_149) # label(axiom).  [assumption].
% 0.91/1.17  64 p2(A,A,A) | -p0(A,A) | -r1(B) | -p2(C,B,A) # label(rule_164) # label(axiom).  [assumption].
% 0.91/1.17  65 p2(a,c,b) | -l1(e,c) | -l2(e,b) | -r1(e) | -m1(d,a,c) # label(rule_168) # label(axiom).  [assumption].
% 0.91/1.17  66 p2(A,A,A) | -r1(B) | -r0(A) # label(rule_173) # label(axiom).  [assumption].
% 0.91/1.17  67 r2(A) | -r1(A) | -l0(A) # label(rule_188) # label(axiom).  [assumption].
% 0.91/1.17  68 s2(d) | -r1(d) | -s1(d) # label(rule_191) # label(axiom).  [assumption].
% 0.91/1.17  69 k3(A,A,A) | -r1(A) | -p2(B,C,C) # label(rule_213) # label(axiom).  [assumption].
% 0.91/1.17  70 q4(A,A) | -r1(A) | -l4(B) | -q4(B,C) # label(rule_296) # label(axiom).  [assumption].
% 0.91/1.17  71 q2(A,e,A) | -r1(e) | -m0(B,C,A) | -q2(e,e,e).  [resolve(52,d,32,a)].
% 0.91/1.17  72 q2(A,b,A) | -r1(b) | -m0(B,C,A) | -q2(b,b,b).  [resolve(52,d,33,a)].
% 0.91/1.17  73 p2(A,A,A) | -n2(A) | -k1(e) # label(rule_174) # label(axiom).  [assumption].
% 0.91/1.17  74 n2(A) | -p1(B,C,A) # label(rule_137) # label(axiom).  [assumption].
% 0.91/1.17  75 n2(a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d) # label(rule_138) # label(axiom).  [assumption].
% 0.91/1.17  76 k3(A,A,A) | -n2(A) # label(rule_210) # label(axiom).  [assumption].
% 0.91/1.17  77 l3(A,A) | -n2(A) | -m2(b) # label(rule_217) # label(axiom).  [assumption].
% 0.91/1.17  78 l3(A,A) | -n2(B) | -l1(C,A) | -l3(C,C) # label(rule_219) # label(axiom).  [assumption].
% 0.91/1.17  79 m3(A,B,B) | -n2(A) | -m2(B) | -m3(C,A,C) # label(rule_228) # label(axiom).  [assumption].
% 0.91/1.17  80 m3(A,A,A) | -l2(A,A) | -n2(A) # label(rule_232) # label(axiom).  [assumption].
% 0.91/1.17  81 m3(A,A,A) | -n2(A) | -m2(B) # label(rule_233) # label(axiom).  [assumption].
% 0.91/1.17  82 m3(A,e,e) | -n2(e) | -p2(A,e,e) # label(rule_234) # label(axiom).  [assumption].
% 0.91/1.17  83 m3(A,A,A) | -n2(A) # label(rule_236) # label(axiom).  [assumption].
% 0.91/1.17  84 p3(A,A,A) | -n2(A) # label(rule_244) # label(axiom).  [assumption].
% 0.91/1.17  85 p3(A,A,A) | -n2(A) | -q2(B,C,A) | -s1(B) # label(rule_247) # label(axiom).  [assumption].
% 0.91/1.17  86 p3(A,A,A) | -k1(A) | -n2(A) # label(rule_249) # label(axiom).  [assumption].
% 0.91/1.17  87 n2(c) | -l1(e,c).  [resolve(49,c,33,a)].
% 0.91/1.17  88 k3(A,A,A) | -s1(A) | -q2(d,B,d) | -s2(B) # label(rule_193) # label(axiom).  [assumption].
% 0.91/1.17  89 s2(A) | -q2(b,A,b) | -s1(b) # label(rule_189) # label(axiom).  [assumption].
% 0.91/1.17  90 s2(d) | -s1(a) | -s0(d) # label(rule_190) # label(axiom).  [assumption].
% 0.91/1.17  91 k3(c,c,c) | -s2(e) | -k2(c,e) # label(rule_195) # label(axiom).  [assumption].
% 0.91/1.17  92 k3(A,A,A) | -m2(B) | -l1(C,D) | -s2(A) | -k3(C,D,C) # label(rule_209) # label(axiom).  [assumption].
% 0.91/1.17  93 l3(A,A) | -s2(B) | -l1(A,A) # label(rule_220) # label(axiom).  [assumption].
% 0.91/1.17  94 l3(d,c) | -s2(d) | -k3(a,c,a) | -r0(b) # label(rule_224) # label(axiom).  [assumption].
% 0.91/1.17  95 m3(A,B,A) | -m0(C,C,B) | -l2(D,A) | -m0(A,D,D) | -s2(C) # label(rule_225) # label(axiom).  [assumption].
% 0.91/1.17  96 m3(A,A,A) | -q0(B,C) | -s0(D) | -s2(C) | -r2(A) # label(rule_227) # label(axiom).  [assumption].
% 0.91/1.17  97 m3(A,c,A) | -s2(c) | -q2(A,c,c) # label(rule_237) # label(axiom).  [assumption].
% 0.91/1.17  98 q3(A,B) | -n1(C,A,B) | -s2(A) | -q3(B,A) # label(rule_257) # label(axiom).  [assumption].
% 0.91/1.17  99 r3(A,B,B) | -s2(B) | -l2(c,A) # label(rule_260) # label(axiom).  [assumption].
% 0.91/1.17  100 r3(A,A,A) | -s2(A) # label(rule_264) # label(axiom).  [assumption].
% 0.91/1.17  101 s3(A,B) | -q2(C,A,C) | -s2(A) | -m0(C,D,B) # label(rule_273) # label(axiom).  [assumption].
% 0.91/1.17  102 p3(A,d,e) | -l3(b,e) | -p2(d,b,c) | -n3(A) | -q2(A,d,A) # label(rule_243) # label(axiom).  [assumption].
% 0.91/1.17  103 l3(A,B) | -r0(A) | -p2(A,B,A) # label(rule_215) # label(axiom).  [assumption].
% 0.91/1.17  104 l3(A,A) | -p1(A,A,B) | -p2(B,C,A) # label(rule_216) # label(axiom).  [assumption].
% 0.91/1.17  105 l3(d,d) | -k2(a,d) # label(rule_221) # label(axiom).  [assumption].
% 0.91/1.17  106 l3(A,A) | -k3(B,A,A) | -l2(C,C) # label(rule_222) # label(axiom).  [assumption].
% 0.91/1.17  107 l3(c,c) | -k2(b,c) # label(rule_223) # label(axiom).  [assumption].
% 0.91/1.17  108 p3(A,A,A) | -l1(B,B) | -l3(B,A) | -p3(C,C,B) # label(rule_245) # label(axiom).  [assumption].
% 0.91/1.17  109 n4(e,e) | -l3(b,a) | -p3(b,e,a) # label(rule_283) # label(axiom).  [assumption].
% 0.94/1.21  110 p4(A,A,A) | -q3(B,C) | -n4(C,A) | -l3(B,B) # label(rule_293) # label(axiom).  [assumption].
% 0.94/1.21  111 p3(A,A,A) | -p2(B,A,A) | -n3(A) # label(rule_248) # label(axiom).  [assumption].
% 0.94/1.21  112 n3(A) | -p2(B,C,A) # label(rule_240) # label(axiom).  [assumption].
% 0.94/1.21  113 p4(A,A,A) | -q3(B,C) | -n3(A) # label(rule_286) # label(axiom).  [assumption].
% 0.94/1.21  114 p4(c,c,A) | -n3(a) | -m3(A,c,a) # label(rule_294) # label(axiom).  [assumption].
% 0.94/1.21  115 r4(A) | -n3(A) | -q3(B,C) | -p0(D,A) # label(rule_298) # label(axiom).  [assumption].
% 0.94/1.21  116 k4(c) | -q3(e,b) | -n3(e).  [resolve(28,b,8,a)].
% 0.94/1.21  117 r5(A,B) | -s4(A) | -n3(B).  [resolve(54,c,33,a)].
% 0.94/1.21  118 r3(A,A,A) | -p3(B,A,C) | -r3(B,B,B) # label(rule_271) # label(axiom).  [assumption].
% 0.94/1.21  119 p3(A,B,C) | -q2(D,d,A) | -k2(B,C) # label(rule_241) # label(axiom).  [assumption].
% 0.94/1.21  120 p3(A,A,A) | -l2(A,A) # label(rule_246) # label(axiom).  [assumption].
% 0.94/1.21  121 p3(A,A,A) | -k1(A) | -q2(B,C,A) # label(rule_250) # label(axiom).  [assumption].
% 0.94/1.21  122 p3(A,B,B) | -m3(B,C,D) | -p2(A,B,D) # label(rule_251) # label(axiom).  [assumption].
% 0.94/1.21  123 p3(A,A,A) | -q0(B,A) | -k2(C,C) # label(rule_252) # label(axiom).  [assumption].
% 0.94/1.21  124 p3(b,c,b) | -k2(c,b) # label(rule_253) # label(axiom).  [assumption].
% 0.94/1.21  125 p3(e,b,e) | -m3(e,A,e) | -q2(A,A,b) # label(rule_254) # label(axiom).  [assumption].
% 0.94/1.21  126 l4(A) | -p3(B,C,A) # label(rule_277) # label(axiom).  [assumption].
% 0.94/1.21  127 m4(A,A) | -p3(B,B,B) | -m3(A,A,B) | -m4(A,A) # label(rule_280) # label(axiom).  [assumption].
% 0.94/1.21  128 n4(A,B) | -p3(A,B,B) | -n4(A,A) # label(rule_281) # label(axiom).  [assumption].
% 0.94/1.21  129 p4(A,A,A) | -p3(B,B,A) # label(rule_291) # label(axiom).  [assumption].
% 0.94/1.21  130 s4(A) | -p3(B,C,D) | -l1(A,C) # label(rule_299) # label(axiom).  [assumption].
% 0.94/1.21  131 n4(A,A) | -k4(B) | -m3(A,A,A) # label(rule_284) # label(axiom).  [assumption].
% 0.94/1.21  132 k4(e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B) # label(rule_276) # label(axiom).  [assumption].
% 0.94/1.21  133 m5(A,A) | -k4(A) # label(rule_304) # label(axiom).  [assumption].
% 0.94/1.21  134 n5(A,A) | -s1(A) | -k4(A) # label(rule_315) # label(axiom).  [assumption].
% 0.94/1.21  135 r5(A,A) | -k4(A) # label(rule_328) # label(axiom).  [assumption].
% 0.94/1.21  136 s5(A) | -k4(A) | -s3(A,B) | -l5(C) | -s5(C) # label(rule_330) # label(axiom).  [assumption].
% 0.94/1.21  137 m5(A,A) | -s4(A) | -m4(e,e) # label(rule_305) # label(axiom).  [assumption].
% 0.94/1.21  138 m4(A,B) | -l2(C,B) | -s3(a,A) # label(rule_279) # label(axiom).  [assumption].
% 0.94/1.21  139 n5(A,A) | -p0(A,B) | -m4(C,C) | -k5(d) # label(rule_310) # label(axiom).  [assumption].
% 0.94/1.21  140 p5(A,B,B) | -l2(A,C) | -p5(A,C,A) | -m4(C,B) # label(rule_319) # label(axiom).  [assumption].
% 0.94/1.21  141 q5(A,A) | -m4(A,A) # label(rule_326) # label(axiom).  [assumption].
% 0.94/1.21  142 p4(A,A,A) | -k3(B,C,C) | -n4(A,C) | -p1(C,B,A) # label(rule_292) # label(axiom).  [assumption].
% 0.94/1.21  143 n4(d,d) | -k3(c,c,e) | -q1(d,d,d) # label(rule_282) # label(axiom).  [assumption].
% 0.94/1.21  144 n5(A,B) | -q4(C,D) | -n4(A,D) | -p4(E,E,B) | -n5(E,B) # label(rule_307) # label(axiom).  [assumption].
% 0.94/1.21  145 n5(A,A) | -n4(B,A) # label(rule_309) # label(axiom).  [assumption].
% 0.94/1.21  146 n5(b,e) | -r3(d,b,c) | -n4(b,e) # label(rule_312) # label(axiom).  [assumption].
% 0.94/1.21  147 n5(d,A) | -k3(d,A,a) | -n4(A,d) # label(rule_317) # label(axiom).  [assumption].
% 0.94/1.21  148 l5(A) | -q4(B,B) | -k1(A) # label(rule_302) # label(axiom).  [assumption].
% 0.94/1.21  149 q4(A,B) | -k3(C,C,A) | -q2(D,B,A) | -m3(D,E,D) # label(rule_295) # label(axiom).  [assumption].
% 0.94/1.21  150 q4(b,b) | -k3(c,e,b) | -l1(b,c) # label(rule_297) # label(axiom).  [assumption].
% 0.94/1.21  151 n5(A,A) | -q4(B,A) # label(rule_313) # label(axiom).  [assumption].
% 0.94/1.21  152 p5(A,B,A) | -q4(B,C) | -s1(A) # label(rule_320) # label(axiom).  [assumption].
% 0.94/1.21  153 q5(A,A) | -q4(A,A) # label(rule_325) # label(axiom).  [assumption].
% 0.94/1.21  154 p5(b,b,b) | -p4(A,A,B) | -k5(b) # label(rule_321) # label(axiom).  [assumption].
% 0.94/1.21  155 k5(A) | -s4(B) | -r3(C,A,A) # label(rule_300) # label(axiom).  [assumption].
% 0.94/1.21  156 k5(b) | -s4(e) | -n1(b,b,b) # label(rule_301) # label(axiom).  [assumption].
% 0.94/1.21  
% 0.94/1.21  ============================== end predicate elimination =============
% 0.94/1.21  
% 0.94/1.21  Auto_denials:  (no changes).
% 0.94/1.21  
% 0.94/1.21  Term ordering decisions:
% 0.94/1.21  Function symbol KB weights:  b=1. e=1. a=1. d=1. c=1.
% 0.94/1.21  
% 0.94/1.21  ============================== PROOF =================================
% 0.94/1.21  % SZS status Unsatisfiable
% 0.94/1.21  % SZS output start Refutation
% 0.94/1.21  
% 0.94/1.21  % Proof 1 at 0.14 (+ 0.00) seconds.
% 0.94/1.21  % Length of proof is 3.
% 0.94/1.21  % Level of proof is 1.
% 0.94/1.21  % Maximum clause weight is 0.000.
% 0.94/1.21  % Given clauses 0.
% 0.94/1.21  
% 0.94/1.21  33 k0(b) # label(axiom_32) # label(axiom).  [assumption].
% 0.94/1.21  55 -k0(b) # label(prove_this) # label(negated_conjecture).  [assumption].
% 0.94/1.21  423 $F.  [resolve(55,a,33,a)].
% 0.94/1.21  
% 0.94/1.21  % SZS output end Refutation
% 0.94/1.21  ============================== end of proof ==========================
% 0.94/1.21  
% 0.94/1.21  ============================== STATISTICS ============================
% 0.94/1.21  
% 0.94/1.21  Given=0. Generated=285. Kept=266. proofs=1.
% 0.94/1.21  Usable=0. Sos=0. Demods=0. Limbo=266, Disabled=463. Hints=0.
% 0.94/1.21  Megabytes=0.51.
% 0.94/1.21  User_CPU=0.14, System_CPU=0.00, Wall_clock=0.
% 0.94/1.21  
% 0.94/1.21  ============================== end of statistics =====================
% 0.94/1.21  
% 0.94/1.21  ============================== end of search =========================
% 0.94/1.21  
% 0.94/1.21  THEOREM PROVED
% 0.94/1.21  % SZS status Unsatisfiable
% 0.94/1.21  
% 0.94/1.21  Exiting with 1 proof.
% 0.94/1.21  
% 0.94/1.21  Process 12633 exit (max_proofs) Tue Jul 12 06:29:39 2022
% 0.94/1.21  Prover9 interrupted
%------------------------------------------------------------------------------