TSTP Solution File: SYN122-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN122-1 : TPTP v8.1.0. Released v1.1.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:16:39 EDT 2022
% Result : Unsatisfiable 0.99s 1.25s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN122-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 18:04:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.80/1.07 ============================== Prover9 ===============================
% 0.80/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.07 Process 21175 was started by sandbox on n021.cluster.edu,
% 0.80/1.07 Mon Jul 11 18:04:39 2022
% 0.80/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21022_n021.cluster.edu".
% 0.80/1.07 ============================== end of head ===========================
% 0.80/1.07
% 0.80/1.07 ============================== INPUT =================================
% 0.80/1.07
% 0.80/1.07 % Reading from file /tmp/Prover9_21022_n021.cluster.edu
% 0.80/1.07
% 0.80/1.07 set(prolog_style_variables).
% 0.80/1.07 set(auto2).
% 0.80/1.07 % set(auto2) -> set(auto).
% 0.80/1.07 % set(auto) -> set(auto_inference).
% 0.80/1.07 % set(auto) -> set(auto_setup).
% 0.80/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.07 % set(auto) -> set(auto_limits).
% 0.80/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.07 % set(auto) -> set(auto_denials).
% 0.80/1.07 % set(auto) -> set(auto_process).
% 0.80/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.07 % set(auto2) -> assign(stats, some).
% 0.80/1.07 % set(auto2) -> clear(echo_input).
% 0.80/1.07 % set(auto2) -> set(quiet).
% 0.80/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.07 % set(auto2) -> clear(print_given).
% 0.80/1.07 assign(lrs_ticks,-1).
% 0.80/1.07 assign(sos_limit,10000).
% 0.80/1.07 assign(order,kbo).
% 0.80/1.07 set(lex_order_vars).
% 0.80/1.07 clear(print_given).
% 0.80/1.07
% 0.80/1.07 % formulas(sos). % not echoed (369 formulas)
% 0.80/1.07
% 0.80/1.07 ============================== end of input ==========================
% 0.80/1.07
% 0.80/1.07 % From the command line: assign(max_seconds, 300).
% 0.80/1.07
% 0.80/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.07
% 0.80/1.07 % Formulas that are not ordinary clauses:
% 0.80/1.07
% 0.80/1.07 ============================== end of process non-clausal formulas ===
% 0.80/1.07
% 0.80/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.07
% 0.80/1.07 ============================== PREDICATE ELIMINATION =================
% 0.80/1.07 1 k1(A) | -n0(B,A) # label(rule_001) # label(axiom). [assumption].
% 0.80/1.07 2 n0(d,e) # label(axiom_3) # label(axiom). [assumption].
% 0.80/1.07 3 n0(d,b) # label(axiom_7) # label(axiom). [assumption].
% 0.80/1.07 4 n0(e,b) # label(axiom_11) # label(axiom). [assumption].
% 0.80/1.07 5 n0(a,b) # label(axiom_15) # label(axiom). [assumption].
% 0.80/1.07 6 n0(d,c) # label(axiom_26) # label(axiom). [assumption].
% 0.80/1.07 7 n0(e,e) # label(axiom_30) # label(axiom). [assumption].
% 0.80/1.07 8 n0(c,d) # label(axiom_34) # label(axiom). [assumption].
% 0.80/1.07 9 n0(b,a) # label(axiom_37) # label(axiom). [assumption].
% 0.80/1.07 Derived: k1(e). [resolve(1,b,2,a)].
% 0.80/1.07 Derived: k1(b). [resolve(1,b,3,a)].
% 0.80/1.07 Derived: k1(c). [resolve(1,b,6,a)].
% 0.80/1.07 Derived: k1(d). [resolve(1,b,8,a)].
% 0.80/1.07 Derived: k1(a). [resolve(1,b,9,a)].
% 0.80/1.07 10 l1(A,A) | -n0(B,A) # label(rule_002) # label(axiom). [assumption].
% 0.80/1.07 Derived: l1(e,e). [resolve(10,b,2,a)].
% 0.80/1.07 Derived: l1(b,b). [resolve(10,b,3,a)].
% 0.80/1.07 Derived: l1(c,c). [resolve(10,b,6,a)].
% 0.80/1.07 Derived: l1(d,d). [resolve(10,b,8,a)].
% 0.80/1.07 Derived: l1(a,a). [resolve(10,b,9,a)].
% 0.80/1.07 11 m1(A,A,c) | -n0(B,B) | -l1(c,c) | -p0(B,A) # label(rule_010) # label(axiom). [assumption].
% 0.80/1.07 Derived: m1(A,A,c) | -l1(c,c) | -p0(e,A). [resolve(11,b,7,a)].
% 0.80/1.07 12 m1(A,A,B) | -k0(A) | -n0(B,B) # label(rule_011) # label(axiom). [assumption].
% 0.80/1.07 Derived: m1(A,A,e) | -k0(A). [resolve(12,c,7,a)].
% 0.80/1.07 13 n1(A,A,A) | -n0(A,A) | -q0(a,A) # label(rule_038) # label(axiom). [assumption].
% 0.80/1.07 Derived: n1(e,e,e) | -q0(a,e). [resolve(13,b,7,a)].
% 0.80/1.07 14 n1(A,A,A) | -l1(B,A) | -n0(B,A) # label(rule_058) # label(axiom). [assumption].
% 0.80/1.07 Derived: n1(e,e,e) | -l1(d,e). [resolve(14,c,2,a)].
% 0.80/1.07 Derived: n1(b,b,b) | -l1(d,b). [resolve(14,c,3,a)].
% 0.80/1.07 Derived: n1(b,b,b) | -l1(e,b). [resolve(14,c,4,a)].
% 0.80/1.07 Derived: n1(b,b,b) | -l1(a,b). [resolve(14,c,5,a)].
% 0.80/1.07 Derived: n1(c,c,c) | -l1(d,c). [resolve(14,c,6,a)].
% 0.83/1.08 Derived: n1(e,e,e) | -l1(e,e). [resolve(14,c,7,a)].
% 0.83/1.08 Derived: n1(d,d,d) | -l1(c,d). [resolve(14,c,8,a)].
% 0.83/1.08 Derived: n1(a,a,a) | -l1(b,a). [resolve(14,c,9,a)].
% 0.83/1.08 15 p1(A,A,B) | -n0(d,A) | -k0(B) # label(rule_063) # label(axiom). [assumption].
% 0.83/1.08 Derived: p1(e,e,A) | -k0(A). [resolve(15,b,2,a)].
% 0.83/1.08 Derived: p1(b,b,A) | -k0(A). [resolve(15,b,3,a)].
% 0.83/1.08 Derived: p1(c,c,A) | -k0(A). [resolve(15,b,6,a)].
% 0.83/1.08 16 p1(A,A,A) | -l1(B,B) | -p0(A,B) | -n0(B,B) # label(rule_065) # label(axiom). [assumption].
% 0.83/1.08 Derived: p1(A,A,A) | -l1(e,e) | -p0(A,e). [resolve(16,d,7,a)].
% 0.83/1.08 17 p1(A,A,A) | -n0(B,A) # label(rule_066) # label(axiom). [assumption].
% 0.83/1.08 Derived: p1(e,e,e). [resolve(17,b,2,a)].
% 0.83/1.08 Derived: p1(b,b,b). [resolve(17,b,3,a)].
% 0.83/1.08 Derived: p1(c,c,c). [resolve(17,b,6,a)].
% 0.83/1.08 Derived: p1(d,d,d). [resolve(17,b,8,a)].
% 0.83/1.08 Derived: p1(a,a,a). [resolve(17,b,9,a)].
% 0.83/1.08 18 p1(A,A,A) | -n0(e,b) | -k0(b) | -k0(A) | -k1(B) # label(rule_073) # label(axiom). [assumption].
% 0.83/1.08 Derived: p1(A,A,A) | -k0(b) | -k0(A) | -k1(B). [resolve(18,b,4,a)].
% 0.83/1.08 19 p1(A,A,A) | -n0(B,B) | -l0(C) | -n1(B,D,A) # label(rule_080) # label(axiom). [assumption].
% 0.83/1.08 Derived: p1(A,A,A) | -l0(B) | -n1(e,C,A). [resolve(19,b,7,a)].
% 0.83/1.08 20 p1(d,d,A) | -s0(A) | -n1(c,d,A) | -r0(d) | -n0(c,A) # label(rule_089) # label(axiom). [assumption].
% 0.83/1.08 21 q1(A,B,A) | -n0(C,B) | -p0(D,A) # label(rule_092) # label(axiom). [assumption].
% 0.83/1.08 Derived: q1(A,e,A) | -p0(B,A). [resolve(21,b,2,a)].
% 0.83/1.08 Derived: q1(A,b,A) | -p0(B,A). [resolve(21,b,3,a)].
% 0.83/1.08 Derived: q1(A,c,A) | -p0(B,A). [resolve(21,b,6,a)].
% 0.83/1.08 Derived: q1(A,d,A) | -p0(B,A). [resolve(21,b,8,a)].
% 0.83/1.08 Derived: q1(A,a,A) | -p0(B,A). [resolve(21,b,9,a)].
% 0.83/1.08 22 q1(A,A,A) | -n0(B,A) # label(rule_100) # label(axiom). [assumption].
% 0.83/1.08 Derived: q1(e,e,e). [resolve(22,b,2,a)].
% 0.83/1.08 Derived: q1(b,b,b). [resolve(22,b,3,a)].
% 0.83/1.08 Derived: q1(c,c,c). [resolve(22,b,6,a)].
% 0.83/1.08 Derived: q1(d,d,d). [resolve(22,b,8,a)].
% 0.83/1.08 Derived: q1(a,a,a). [resolve(22,b,9,a)].
% 0.83/1.08 23 l2(A,B) | -s1(A) | -n0(e,B) | -l2(B,B) # label(rule_131) # label(axiom). [assumption].
% 0.83/1.08 Derived: l2(A,b) | -s1(A) | -l2(b,b). [resolve(23,c,4,a)].
% 0.83/1.08 Derived: l2(A,e) | -s1(A) | -l2(e,e). [resolve(23,c,7,a)].
% 0.83/1.08 24 p2(a,A,d) | -n0(A,d) | -m1(a,A,d) # label(rule_166) # label(axiom). [assumption].
% 0.83/1.08 Derived: p2(a,c,d) | -m1(a,c,d). [resolve(24,b,8,a)].
% 0.83/1.08 25 k3(A,B,A) | -s1(B) | -p2(C,B,D) | -n0(A,D) # label(rule_192) # label(axiom). [assumption].
% 0.83/1.08 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,e). [resolve(25,d,2,a)].
% 0.83/1.08 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,b). [resolve(25,d,3,a)].
% 0.83/1.08 Derived: k3(e,A,e) | -s1(A) | -p2(B,A,b). [resolve(25,d,4,a)].
% 0.83/1.08 Derived: k3(a,A,a) | -s1(A) | -p2(B,A,b). [resolve(25,d,5,a)].
% 0.83/1.08 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,c). [resolve(25,d,6,a)].
% 0.83/1.08 Derived: k3(e,A,e) | -s1(A) | -p2(B,A,e). [resolve(25,d,7,a)].
% 0.83/1.08 Derived: k3(c,A,c) | -s1(A) | -p2(B,A,d). [resolve(25,d,8,a)].
% 0.83/1.08 Derived: k3(b,A,b) | -s1(A) | -p2(B,A,a). [resolve(25,d,9,a)].
% 0.83/1.08 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.83/1.08 Derived: m3(A,A,A) | -k2(B,b) | -m3(A,b,A) | -l2(a,a). [resolve(26,d,9,a)].
% 0.83/1.08 27 q3(A,B) | -q2(C,A,B) | -n0(C,A) # label(rule_255) # label(axiom). [assumption].
% 0.83/1.08 Derived: q3(e,A) | -q2(d,e,A). [resolve(27,c,2,a)].
% 0.83/1.08 Derived: q3(b,A) | -q2(d,b,A). [resolve(27,c,3,a)].
% 0.83/1.08 Derived: q3(b,A) | -q2(e,b,A). [resolve(27,c,4,a)].
% 0.83/1.08 Derived: q3(b,A) | -q2(a,b,A). [resolve(27,c,5,a)].
% 0.83/1.08 Derived: q3(c,A) | -q2(d,c,A). [resolve(27,c,6,a)].
% 0.83/1.08 Derived: q3(e,A) | -q2(e,e,A). [resolve(27,c,7,a)].
% 0.83/1.08 Derived: q3(d,A) | -q2(c,d,A). [resolve(27,c,8,a)].
% 0.83/1.08 Derived: q3(a,A) | -q2(b,a,A). [resolve(27,c,9,a)].
% 0.83/1.08 28 k4(c) | -n0(c,d) | -q3(e,b) | -n3(e) # label(rule_274) # label(axiom). [assumption].
% 0.83/1.08 Derived: k4(c) | -q3(e,b) | -n3(e). [resolve(28,b,8,a)].
% 0.83/1.08 29 k4(A) | -k3(B,B,B) | -n0(C,B) | -k4(A) # label(rule_275) # label(axiom). [assumption].
% 0.83/1.08 30 p4(A,A,A) | -l4(A) | -n0(A,B) | -p4(C,D,C) # label(rule_289) # label(axiom). [assumption].
% 0.83/1.08 Derived: p4(d,d,d) | -l4(d) | -p4(A,B,A). [resolve(30,c,2,a)].
% 0.83/1.08 Derived: p4(e,e,e) | -l4(e) | -p4(A,B,A). [resolve(30,c,4,a)].
% 0.83/1.08 Derived: p4(a,a,a) | -l4(a) | -p4(A,B,A). [resolve(30,c,5,a)].
% 0.83/1.10 Derived: p4(c,c,c) | -l4(c) | -p4(A,B,A). [resolve(30,c,8,a)].
% 0.83/1.10 Derived: p4(b,b,b) | -l4(b) | -p4(A,B,A). [resolve(30,c,9,a)].
% 0.83/1.10 31 n2(e) | -r1(b) | -r0(e) | -p1(b,A,B) # label(rule_140) # label(axiom). [assumption].
% 0.83/1.10 32 r1(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) # label(rule_124) # label(axiom). [assumption].
% 0.83/1.10 Derived: n2(e) | -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d). [resolve(31,b,32,a)].
% 0.83/1.10 33 p2(e,c,c) | -r1(d) | -l1(e,c) # label(rule_147) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(e,c,c) | -l1(e,c) | -q0(d,A) | -s0(d) | -q1(d,A,d). [resolve(33,b,32,a)].
% 0.83/1.10 34 p2(A,A,d) | -r1(a) | -m0(B,A,d) # label(rule_149) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(A,A,d) | -m0(B,A,d) | -q0(a,C) | -s0(d) | -q1(d,C,d). [resolve(34,b,32,a)].
% 0.83/1.10 35 p2(A,A,A) | -p0(A,A) | -r1(B) | -p2(C,B,A) # label(rule_164) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(A,A,A) | -p0(A,A) | -p2(B,C,A) | -q0(C,D) | -s0(d) | -q1(d,D,d). [resolve(35,c,32,a)].
% 0.83/1.10 36 p2(a,c,b) | -l1(e,c) | -l2(e,b) | -r1(e) | -m1(d,a,c) # label(rule_168) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(a,c,b) | -l1(e,c) | -l2(e,b) | -m1(d,a,c) | -q0(e,A) | -s0(d) | -q1(d,A,d). [resolve(36,d,32,a)].
% 0.83/1.10 37 p2(A,A,A) | -r1(B) | -r0(A) # label(rule_173) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(A,A,A) | -r0(A) | -q0(B,C) | -s0(d) | -q1(d,C,d). [resolve(37,b,32,a)].
% 0.83/1.10 38 q2(A,B,A) | -r1(B) | -m0(C,D,A) | -k0(B) | -q2(B,B,B) # label(rule_187) # label(axiom). [assumption].
% 0.83/1.10 Derived: q2(A,B,A) | -m0(C,D,A) | -k0(B) | -q2(B,B,B) | -q0(B,E) | -s0(d) | -q1(d,E,d). [resolve(38,b,32,a)].
% 0.83/1.10 39 r2(A) | -r1(A) | -l0(A) # label(rule_188) # label(axiom). [assumption].
% 0.83/1.10 Derived: r2(A) | -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d). [resolve(39,b,32,a)].
% 0.83/1.10 40 s2(d) | -r1(d) | -s1(d) # label(rule_191) # label(axiom). [assumption].
% 0.83/1.10 Derived: s2(d) | -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d). [resolve(40,b,32,a)].
% 0.83/1.10 41 k3(A,A,A) | -r1(A) | -p2(B,C,C) # label(rule_213) # label(axiom). [assumption].
% 0.83/1.10 Derived: k3(A,A,A) | -p2(B,C,C) | -q0(A,D) | -s0(d) | -q1(d,D,d). [resolve(41,b,32,a)].
% 0.83/1.10 42 q4(A,A) | -r1(A) | -l4(B) | -q4(B,C) # label(rule_296) # label(axiom). [assumption].
% 0.83/1.10 Derived: q4(A,A) | -l4(B) | -q4(B,C) | -q0(A,D) | -s0(d) | -q1(d,D,d). [resolve(42,b,32,a)].
% 0.83/1.10 43 p2(A,A,A) | -n2(A) | -k1(e) # label(rule_174) # label(axiom). [assumption].
% 0.83/1.10 44 n2(A) | -p1(B,C,A) # label(rule_137) # label(axiom). [assumption].
% 0.83/1.10 45 n2(a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d) # label(rule_138) # label(axiom). [assumption].
% 0.83/1.10 46 n2(c) | -l1(e,c) | -k0(b) # label(rule_139) # label(axiom). [assumption].
% 0.83/1.10 Derived: p2(A,A,A) | -k1(e) | -p1(B,C,A). [resolve(43,b,44,a)].
% 0.83/1.10 Derived: p2(a,a,a) | -k1(e) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(43,b,45,a)].
% 0.83/1.10 47 k3(A,A,A) | -n2(A) # label(rule_210) # label(axiom). [assumption].
% 0.83/1.10 Derived: k3(A,A,A) | -p1(B,C,A). [resolve(47,b,44,a)].
% 0.83/1.10 Derived: k3(a,a,a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(47,b,45,a)].
% 0.83/1.10 Derived: k3(c,c,c) | -l1(e,c) | -k0(b). [resolve(47,b,46,a)].
% 0.83/1.10 48 l3(A,A) | -n2(A) | -m2(b) # label(rule_217) # label(axiom). [assumption].
% 0.83/1.10 Derived: l3(A,A) | -m2(b) | -p1(B,C,A). [resolve(48,b,44,a)].
% 0.83/1.10 Derived: l3(a,a) | -m2(b) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(48,b,45,a)].
% 0.83/1.10 Derived: l3(c,c) | -m2(b) | -l1(e,c) | -k0(b). [resolve(48,b,46,a)].
% 0.83/1.10 49 l3(A,A) | -n2(B) | -l1(C,A) | -l3(C,C) # label(rule_219) # label(axiom). [assumption].
% 0.83/1.10 Derived: l3(A,A) | -l1(B,A) | -l3(B,B) | -p1(C,D,E). [resolve(49,b,44,a)].
% 0.83/1.10 Derived: l3(A,A) | -l1(B,A) | -l3(B,B) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(49,b,45,a)].
% 0.83/1.10 Derived: l3(A,A) | -l1(B,A) | -l3(B,B) | -l1(e,c) | -k0(b). [resolve(49,b,46,a)].
% 0.83/1.10 50 m3(A,B,B) | -n2(A) | -m2(B) | -m3(C,A,C) # label(rule_228) # label(axiom). [assumption].
% 0.83/1.10 Derived: m3(A,B,B) | -m2(B) | -m3(C,A,C) | -p1(D,E,A). [resolve(50,b,44,a)].
% 0.83/1.10 Derived: m3(a,A,A) | -m2(A) | -m3(B,a,B) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(50,b,45,a)].
% 0.83/1.10 Derived: m3(c,A,A) | -m2(A) | -m3(B,c,B) | -l1(e,c) | -k0(b). [resolve(50,b,46,a)].
% 0.83/1.10 51 m3(A,A,A) | -l2(A,A) | -n2(A) # label(rule_232) # label(axiom). [assumption].
% 0.83/1.12 Derived: m3(A,A,A) | -l2(A,A) | -p1(B,C,A). [resolve(51,c,44,a)].
% 0.83/1.12 Derived: m3(a,a,a) | -l2(a,a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(51,c,45,a)].
% 0.83/1.12 Derived: m3(c,c,c) | -l2(c,c) | -l1(e,c) | -k0(b). [resolve(51,c,46,a)].
% 0.83/1.12 52 m3(A,A,A) | -n2(A) | -m2(B) # label(rule_233) # label(axiom). [assumption].
% 0.83/1.12 Derived: m3(A,A,A) | -m2(B) | -p1(C,D,A). [resolve(52,b,44,a)].
% 0.83/1.12 Derived: m3(a,a,a) | -m2(A) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(52,b,45,a)].
% 0.83/1.12 Derived: m3(c,c,c) | -m2(A) | -l1(e,c) | -k0(b). [resolve(52,b,46,a)].
% 0.83/1.12 53 m3(A,e,e) | -n2(e) | -p2(A,e,e) # label(rule_234) # label(axiom). [assumption].
% 0.83/1.12 Derived: m3(A,e,e) | -p2(A,e,e) | -p1(B,C,e). [resolve(53,b,44,a)].
% 0.83/1.12 54 m3(A,A,A) | -n2(A) # label(rule_236) # label(axiom). [assumption].
% 0.83/1.12 Derived: m3(A,A,A) | -p1(B,C,A). [resolve(54,b,44,a)].
% 0.83/1.12 Derived: m3(a,a,a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(54,b,45,a)].
% 0.83/1.12 Derived: m3(c,c,c) | -l1(e,c) | -k0(b). [resolve(54,b,46,a)].
% 0.83/1.12 55 p3(A,A,A) | -n2(A) # label(rule_244) # label(axiom). [assumption].
% 0.83/1.12 Derived: p3(A,A,A) | -p1(B,C,A). [resolve(55,b,44,a)].
% 0.83/1.12 Derived: p3(a,a,a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d). [resolve(55,b,45,a)].
% 0.83/1.12 Derived: p3(c,c,c) | -l1(e,c) | -k0(b). [resolve(55,b,46,a)].
% 0.83/1.12 56 p3(A,A,A) | -n2(A) | -q2(B,C,A) | -s1(B) # label(rule_247) # label(axiom). [assumption].
% 0.83/1.12 57 p3(A,A,A) | -k1(A) | -n2(A) # label(rule_249) # label(axiom). [assumption].
% 0.83/1.12 58 n2(e) | -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d). [resolve(31,b,32,a)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | k3(e,e,e). [resolve(58,a,47,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | l3(e,e) | -m2(b). [resolve(58,a,48,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | m3(e,D,D) | -m2(D) | -m3(E,e,E). [resolve(58,a,50,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | m3(e,e,e) | -l2(e,e). [resolve(58,a,51,c)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | m3(e,e,e) | -m2(D). [resolve(58,a,52,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | m3(D,e,e) | -p2(D,e,e). [resolve(58,a,53,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | m3(e,e,e). [resolve(58,a,54,b)].
% 0.83/1.12 Derived: -r0(e) | -p1(b,A,B) | -q0(b,C) | -s0(d) | -q1(d,C,d) | p3(e,e,e). [resolve(58,a,55,b)].
% 0.83/1.12 59 k3(A,A,A) | -s1(A) | -q2(d,B,d) | -s2(B) # label(rule_193) # label(axiom). [assumption].
% 0.83/1.12 60 s2(A) | -q2(b,A,b) | -s1(b) # label(rule_189) # label(axiom). [assumption].
% 0.83/1.12 61 s2(d) | -s1(a) | -s0(d) # label(rule_190) # label(axiom). [assumption].
% 0.83/1.12 Derived: k3(A,A,A) | -s1(A) | -q2(d,B,d) | -q2(b,B,b) | -s1(b). [resolve(59,d,60,a)].
% 0.83/1.12 Derived: k3(A,A,A) | -s1(A) | -q2(d,d,d) | -s1(a) | -s0(d). [resolve(59,d,61,a)].
% 0.83/1.12 62 k3(c,c,c) | -s2(e) | -k2(c,e) # label(rule_195) # label(axiom). [assumption].
% 0.83/1.12 Derived: k3(c,c,c) | -k2(c,e) | -q2(b,e,b) | -s1(b). [resolve(62,b,60,a)].
% 0.83/1.12 63 k3(A,A,A) | -m2(B) | -l1(C,D) | -s2(A) | -k3(C,D,C) # label(rule_209) # label(axiom). [assumption].
% 0.83/1.12 Derived: k3(A,A,A) | -m2(B) | -l1(C,D) | -k3(C,D,C) | -q2(b,A,b) | -s1(b). [resolve(63,d,60,a)].
% 0.83/1.12 Derived: k3(d,d,d) | -m2(A) | -l1(B,C) | -k3(B,C,B) | -s1(a) | -s0(d). [resolve(63,d,61,a)].
% 0.83/1.12 64 l3(A,A) | -s2(B) | -l1(A,A) # label(rule_220) # label(axiom). [assumption].
% 0.83/1.12 Derived: l3(A,A) | -l1(A,A) | -q2(b,B,b) | -s1(b). [resolve(64,b,60,a)].
% 0.83/1.12 Derived: l3(A,A) | -l1(A,A) | -s1(a) | -s0(d). [resolve(64,b,61,a)].
% 0.83/1.12 65 l3(d,c) | -s2(d) | -k3(a,c,a) | -r0(b) # label(rule_224) # label(axiom). [assumption].
% 0.83/1.12 Derived: l3(d,c) | -k3(a,c,a) | -r0(b) | -q2(b,d,b) | -s1(b). [resolve(65,b,60,a)].
% 0.83/1.12 Derived: l3(d,c) | -k3(a,c,a) | -r0(b) | -s1(a) | -s0(d). [resolve(65,b,61,a)].
% 0.83/1.12 66 m3(A,B,A) | -m0(C,C,B) | -l2(D,A) | -m0(A,D,D) | -s2(C) # label(rule_225) # label(axiom). [assumption].
% 0.83/1.12 Derived: m3(A,B,A) | -m0(C,C,B) | -l2(D,A) | -m0(A,D,D) | -q2(b,C,b) | -s1(b). [resolve(66,e,60,a)].
% 0.83/1.12 Derived: m3(A,B,A) | -m0(d,d,B) | -l2(C,A) | -m0(A,C,C) | -s1(a) | -s0(d). [resolve(66,e,61,a)].
% 0.83/1.12 67 m3(A,A,A) | -q0(B,C) | -s0(D) | -s2(C) | -r2(A) # label(rule_227) # label(axiom). [assumption].
% 0.87/1.13 Derived: m3(A,A,A) | -q0(B,C) | -s0(D) | -r2(A) | -q2(b,C,b) | -s1(b). [resolve(67,d,60,a)].
% 0.87/1.13 Derived: m3(A,A,A) | -q0(B,d) | -s0(C) | -r2(A) | -s1(a) | -s0(d). [resolve(67,d,61,a)].
% 0.87/1.13 68 m3(A,c,A) | -s2(c) | -q2(A,c,c) # label(rule_237) # label(axiom). [assumption].
% 0.87/1.13 Derived: m3(A,c,A) | -q2(A,c,c) | -q2(b,c,b) | -s1(b). [resolve(68,b,60,a)].
% 0.87/1.13 69 q3(A,B) | -n1(C,A,B) | -s2(A) | -q3(B,A) # label(rule_257) # label(axiom). [assumption].
% 0.87/1.13 Derived: q3(A,B) | -n1(C,A,B) | -q3(B,A) | -q2(b,A,b) | -s1(b). [resolve(69,c,60,a)].
% 0.87/1.13 Derived: q3(d,A) | -n1(B,d,A) | -q3(A,d) | -s1(a) | -s0(d). [resolve(69,c,61,a)].
% 0.87/1.13 70 r3(A,B,B) | -s2(B) | -l2(c,A) # label(rule_260) # label(axiom). [assumption].
% 0.87/1.13 Derived: r3(A,B,B) | -l2(c,A) | -q2(b,B,b) | -s1(b). [resolve(70,b,60,a)].
% 0.87/1.13 Derived: r3(A,d,d) | -l2(c,A) | -s1(a) | -s0(d). [resolve(70,b,61,a)].
% 0.87/1.13 71 r3(A,A,A) | -s2(A) # label(rule_264) # label(axiom). [assumption].
% 0.87/1.13 Derived: r3(A,A,A) | -q2(b,A,b) | -s1(b). [resolve(71,b,60,a)].
% 0.87/1.13 Derived: r3(d,d,d) | -s1(a) | -s0(d). [resolve(71,b,61,a)].
% 0.87/1.13 72 s3(A,B) | -q2(C,A,C) | -s2(A) | -m0(C,D,B) # label(rule_273) # label(axiom). [assumption].
% 0.87/1.13 Derived: s3(A,B) | -q2(C,A,C) | -m0(C,D,B) | -q2(b,A,b) | -s1(b). [resolve(72,c,60,a)].
% 0.87/1.13 Derived: s3(d,A) | -q2(B,d,B) | -m0(B,C,A) | -s1(a) | -s0(d). [resolve(72,c,61,a)].
% 0.87/1.13 73 s2(d) | -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d). [resolve(40,b,32,a)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | k3(B,B,B) | -s1(B) | -q2(d,d,d). [resolve(73,a,59,d)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | k3(d,d,d) | -m2(B) | -l1(C,D) | -k3(C,D,C). [resolve(73,a,63,d)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | l3(B,B) | -l1(B,B). [resolve(73,a,64,b)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | l3(d,c) | -k3(a,c,a) | -r0(b). [resolve(73,a,65,b)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | m3(B,C,B) | -m0(d,d,C) | -l2(D,B) | -m0(B,D,D). [resolve(73,a,66,e)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | m3(B,B,B) | -q0(C,d) | -s0(D) | -r2(B). [resolve(73,a,67,d)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | q3(d,B) | -n1(C,d,B) | -q3(B,d). [resolve(73,a,69,c)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | r3(B,d,d) | -l2(c,B). [resolve(73,a,70,b)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | r3(d,d,d). [resolve(73,a,71,b)].
% 0.87/1.13 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | s3(d,B) | -q2(C,d,C) | -m0(C,D,B). [resolve(73,a,72,c)].
% 0.87/1.13 74 r2(A) | -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d). [resolve(39,b,32,a)].
% 0.87/1.13 75 k3(c,c,c) | -k0(a) | -r2(c) # label(rule_198) # label(axiom). [assumption].
% 0.87/1.13 76 k3(d,d,d) | -p1(a,d,b) | -r2(a) | -l2(e,b) # label(rule_203) # label(axiom). [assumption].
% 0.87/1.13 77 k3(a,a,a) | -r2(a) # label(rule_204) # label(axiom). [assumption].
% 0.87/1.13 78 k3(A,A,A) | -r2(c) | -l1(b,A) # label(rule_208) # label(axiom). [assumption].
% 0.87/1.13 79 k3(A,A,A) | -l0(A) | -r2(e) | -r0(e) # label(rule_211) # label(axiom). [assumption].
% 0.87/1.13 80 k3(c,c,c) | -r2(c) # label(rule_214) # label(axiom). [assumption].
% 0.87/1.13 81 l3(A,A) | -r2(A) # label(rule_218) # label(axiom). [assumption].
% 0.87/1.13 82 m3(A,B,A) | -r2(A) | -k2(c,B) # label(rule_231) # label(axiom). [assumption].
% 0.87/1.13 83 m3(A,A,B) | -r2(B) | -k3(A,B,A) # label(rule_235) # label(axiom). [assumption].
% 0.87/1.13 84 p3(A,B,C) | -r2(B) | -k3(B,C,A) # label(rule_242) # label(axiom). [assumption].
% 0.87/1.13 85 q3(A,A) | -r2(A) | -s1(B) | -l2(C,C) # label(rule_258) # label(axiom). [assumption].
% 0.87/1.13 86 q3(A,A) | -m0(B,d,B) | -k1(A) | -r2(d) | -q3(B,A) # label(rule_259) # label(axiom). [assumption].
% 0.87/1.13 87 r3(A,A,A) | -l1(B,C) | -n1(C,C,C) | -r2(A) # label(rule_261) # label(axiom). [assumption].
% 0.87/1.13 88 r3(A,A,A) | -r2(A) # label(rule_266) # label(axiom). [assumption].
% 0.87/1.13 89 r3(A,B,C) | -k2(B,C) | -r2(C) | -r3(C,A,A) # label(rule_272) # label(axiom). [assumption].
% 0.87/1.13 Derived: -l0(c) | -q0(c,A) | -s0(d) | -q1(d,A,d) | k3(c,c,c) | -k0(a). [resolve(74,a,75,c)].
% 0.87/1.13 Derived: -l0(a) | -q0(a,A) | -s0(d) | -q1(d,A,d) | k3(d,d,d) | -p1(a,d,b) | -l2(e,b). [resolve(74,a,76,c)].
% 0.87/1.13 Derived: -l0(a) | -q0(a,A) | -s0(d) | -q1(d,A,d) | k3(a,a,a). [resolve(74,a,77,b)].
% 0.91/1.16 Derived: -l0(c) | -q0(c,A) | -s0(d) | -q1(d,A,d) | k3(B,B,B) | -l1(b,B). [resolve(74,a,78,b)].
% 0.91/1.16 Derived: -l0(e) | -q0(e,A) | -s0(d) | -q1(d,A,d) | k3(B,B,B) | -l0(B) | -r0(e). [resolve(74,a,79,c)].
% 0.91/1.16 Derived: -l0(c) | -q0(c,A) | -s0(d) | -q1(d,A,d) | k3(c,c,c). [resolve(74,a,80,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | l3(A,A). [resolve(74,a,81,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | m3(A,C,A) | -k2(c,C). [resolve(74,a,82,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | m3(C,C,A) | -k3(C,A,C). [resolve(74,a,83,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | p3(C,A,D) | -k3(A,D,C). [resolve(74,a,84,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | q3(A,A) | -s1(C) | -l2(D,D). [resolve(74,a,85,b)].
% 0.91/1.16 Derived: -l0(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | q3(B,B) | -m0(C,d,C) | -k1(B) | -q3(C,B). [resolve(74,a,86,d)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | r3(A,A,A) | -l1(C,D) | -n1(D,D,D). [resolve(74,a,87,d)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | r3(A,A,A). [resolve(74,a,88,b)].
% 0.91/1.16 Derived: -l0(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) | r3(C,D,A) | -k2(D,A) | -r3(A,C,C). [resolve(74,a,89,c)].
% 0.91/1.16 90 m3(A,A,A) | -q0(B,C) | -s0(D) | -r2(A) | -q2(b,C,b) | -s1(b). [resolve(67,d,60,a)].
% 0.91/1.16 Derived: m3(A,A,A) | -q0(B,C) | -s0(D) | -q2(b,C,b) | -s1(b) | -l0(A) | -q0(A,E) | -s0(d) | -q1(d,E,d). [resolve(90,d,74,a)].
% 0.91/1.16 91 m3(A,A,A) | -q0(B,d) | -s0(C) | -r2(A) | -s1(a) | -s0(d). [resolve(67,d,61,a)].
% 0.91/1.16 Derived: m3(A,A,A) | -q0(B,d) | -s0(C) | -s1(a) | -s0(d) | -l0(A) | -q0(A,D) | -s0(d) | -q1(d,D,d). [resolve(91,d,74,a)].
% 0.91/1.16 92 -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | m3(B,B,B) | -q0(C,d) | -s0(D) | -r2(B). [resolve(73,a,67,d)].
% 0.91/1.16 Derived: -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | m3(B,B,B) | -q0(C,d) | -s0(D) | -l0(B) | -q0(B,E) | -s0(d) | -q1(d,E,d). [resolve(92,h,74,a)].
% 0.91/1.16 93 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.16 94 n3(A) | -p2(B,C,A) # label(rule_240) # label(axiom). [assumption].
% 0.91/1.16 Derived: p3(A,d,e) | -l3(b,e) | -p2(d,b,c) | -q2(A,d,A) | -p2(B,C,A). [resolve(93,d,94,a)].
% 0.91/1.16 95 p3(A,A,A) | -p2(B,A,A) | -n3(A) # label(rule_248) # label(axiom). [assumption].
% 0.91/1.16 Derived: p3(A,A,A) | -p2(B,A,A) | -p2(C,D,A). [resolve(95,c,94,a)].
% 0.91/1.16 96 p4(A,A,A) | -q3(B,C) | -n3(A) # label(rule_286) # label(axiom). [assumption].
% 0.91/1.16 Derived: p4(A,A,A) | -q3(B,C) | -p2(D,E,A). [resolve(96,c,94,a)].
% 0.91/1.16 97 p4(c,c,A) | -n3(a) | -m3(A,c,a) # label(rule_294) # label(axiom). [assumption].
% 0.91/1.16 Derived: p4(c,c,A) | -m3(A,c,a) | -p2(B,C,a). [resolve(97,b,94,a)].
% 0.91/1.16 98 r4(A) | -n3(A) | -q3(B,C) | -p0(D,A) # label(rule_298) # label(axiom). [assumption].
% 0.91/1.16 Derived: r4(A) | -q3(B,C) | -p0(D,A) | -p2(E,F,A). [resolve(98,b,94,a)].
% 0.91/1.16 99 r5(A,B) | -s4(A) | -k0(b) | -n3(B) # label(rule_327) # label(axiom). [assumption].
% 0.91/1.16 Derived: r5(A,B) | -s4(A) | -k0(b) | -p2(C,D,B). [resolve(99,d,94,a)].
% 0.91/1.16 100 k4(c) | -q3(e,b) | -n3(e). [resolve(28,b,8,a)].
% 0.91/1.16 Derived: k4(c) | -q3(e,b) | -p2(A,B,e). [resolve(100,c,94,a)].
% 0.91/1.16 101 n4(A,A) | -k4(B) | -m3(A,A,A) # label(rule_284) # label(axiom). [assumption].
% 0.91/1.16 102 k4(e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B) # label(rule_276) # label(axiom). [assumption].
% 0.91/1.16 Derived: n4(A,A) | -m3(A,A,A) | -q3(B,B) | -q1(a,a,C) | -r3(B,e,C). [resolve(101,b,102,a)].
% 0.91/1.16 103 m5(A,A) | -k4(A) # label(rule_304) # label(axiom). [assumption].
% 0.91/1.16 Derived: m5(e,e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B). [resolve(103,b,102,a)].
% 0.91/1.16 104 n5(A,A) | -s1(A) | -k4(A) # label(rule_315) # label(axiom). [assumption].
% 0.91/1.16 Derived: n5(e,e) | -s1(e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B). [resolve(104,c,102,a)].
% 0.91/1.16 105 r5(A,A) | -k4(A) # label(rule_328) # label(axiom). [assumption].
% 0.91/1.16 Derived: r5(e,e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B). [resolve(105,b,102,a)].
% 0.91/1.16 106 s5(A) | -k4(A) | -s3(A,B) | -l5(C) | -s5(C) # label(rule_330) # label(axiom). [assumption].
% 0.91/1.16 Derived: s5(e) | -s3(e,A) | -l5(B) | -s5(B) | -q3(C,C) | -q1(a,a,D) | -r3(C,e,D). [resolve(106,b,102,a)].
% 0.91/1.16 107 k4(c) | -q3(e,b) | -p2(A,B,e). [resolve(100,c,94,a)].
% 0.91/1.16 Derived: -q3(e,b) | -p2(A,B,e) | n4(C,C) | -m3(C,C,C). [resolve(107,a,101,b)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | m5(c,c). [resolve(107,a,103,b)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | n5(c,c) | -s1(c). [resolve(107,a,104,c)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | r5(c,c). [resolve(107,a,105,b)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | s5(c) | -s3(c,C) | -l5(D) | -s5(D). [resolve(107,a,106,b)].
% 0.91/1.21 108 s3(A,B) | -q2(C,A,C) | -m0(C,D,B) | -q2(b,A,b) | -s1(b). [resolve(72,c,60,a)].
% 0.91/1.21 109 m4(A,B) | -l2(C,B) | -s3(a,A) # label(rule_279) # label(axiom). [assumption].
% 0.91/1.21 Derived: -q2(A,a,A) | -m0(A,B,C) | -q2(b,a,b) | -s1(b) | m4(C,D) | -l2(E,D). [resolve(108,a,109,c)].
% 0.91/1.21 110 s3(d,A) | -q2(B,d,B) | -m0(B,C,A) | -s1(a) | -s0(d). [resolve(72,c,61,a)].
% 0.91/1.21 111 -s1(d) | -q0(d,A) | -s0(d) | -q1(d,A,d) | s3(d,B) | -q2(C,d,C) | -m0(C,D,B). [resolve(73,a,72,c)].
% 0.91/1.21 112 s5(e) | -s3(e,A) | -l5(B) | -s5(B) | -q3(C,C) | -q1(a,a,D) | -r3(C,e,D). [resolve(106,b,102,a)].
% 0.91/1.21 Derived: s5(e) | -l5(A) | -s5(A) | -q3(B,B) | -q1(a,a,C) | -r3(B,e,C) | -q2(D,e,D) | -m0(D,E,F) | -q2(b,e,b) | -s1(b). [resolve(112,b,108,a)].
% 0.91/1.21 113 -q3(e,b) | -p2(A,B,e) | s5(c) | -s3(c,C) | -l5(D) | -s5(D). [resolve(107,a,106,b)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | s5(c) | -l5(C) | -s5(C) | -q2(D,c,D) | -m0(D,E,F) | -q2(b,c,b) | -s1(b). [resolve(113,d,108,a)].
% 0.91/1.21 114 k5(A) | -s4(B) | -r3(C,A,A) # label(rule_300) # label(axiom). [assumption].
% 0.91/1.21 115 s4(A) | -p3(B,C,D) | -l1(A,C) # label(rule_299) # label(axiom). [assumption].
% 0.91/1.21 Derived: k5(A) | -r3(B,A,A) | -p3(C,D,E) | -l1(F,D). [resolve(114,b,115,a)].
% 0.91/1.21 116 k5(b) | -s4(e) | -n1(b,b,b) # label(rule_301) # label(axiom). [assumption].
% 0.91/1.21 Derived: k5(b) | -n1(b,b,b) | -p3(A,B,C) | -l1(e,B). [resolve(116,b,115,a)].
% 0.91/1.21 117 m5(A,A) | -s4(A) | -m4(e,e) # label(rule_305) # label(axiom). [assumption].
% 0.91/1.21 Derived: m5(A,A) | -m4(e,e) | -p3(B,C,D) | -l1(A,C). [resolve(117,b,115,a)].
% 0.91/1.21 118 m5(A,A) | -s4(B) | -r0(A) # label(rule_306) # label(axiom). [assumption].
% 0.91/1.21 Derived: m5(A,A) | -r0(A) | -p3(B,C,D) | -l1(E,C). [resolve(118,b,115,a)].
% 0.91/1.21 119 p5(A,A,B) | -s4(B) | -l2(A,A) # label(rule_318) # label(axiom). [assumption].
% 0.91/1.21 Derived: p5(A,A,B) | -l2(A,A) | -p3(C,D,E) | -l1(B,D). [resolve(119,b,115,a)].
% 0.91/1.21 120 q5(A,B) | -s4(A) | -m2(B) # label(rule_322) # label(axiom). [assumption].
% 0.91/1.21 Derived: q5(A,B) | -m2(B) | -p3(C,D,E) | -l1(A,D). [resolve(120,b,115,a)].
% 0.91/1.21 121 r5(A,B) | -s4(A) | -k0(b) | -p2(C,D,B). [resolve(99,d,94,a)].
% 0.91/1.21 Derived: r5(A,B) | -k0(b) | -p2(C,D,B) | -p3(E,F,V6) | -l1(A,F). [resolve(121,b,115,a)].
% 0.91/1.21 122 s5(e) | -l5(A) | -s5(A) | -q3(B,B) | -q1(a,a,C) | -r3(B,e,C) | -q2(D,e,D) | -m0(D,E,F) | -q2(b,e,b) | -s1(b). [resolve(112,b,108,a)].
% 0.91/1.21 123 l5(A) | -q4(B,B) | -k1(A) # label(rule_302) # label(axiom). [assumption].
% 0.91/1.21 Derived: s5(e) | -s5(A) | -q3(B,B) | -q1(a,a,C) | -r3(B,e,C) | -q2(D,e,D) | -m0(D,E,F) | -q2(b,e,b) | -s1(b) | -q4(V6,V6) | -k1(A). [resolve(122,b,123,a)].
% 0.91/1.21 124 -q3(e,b) | -p2(A,B,e) | s5(c) | -l5(C) | -s5(C) | -q2(D,c,D) | -m0(D,E,F) | -q2(b,c,b) | -s1(b). [resolve(113,d,108,a)].
% 0.91/1.21 Derived: -q3(e,b) | -p2(A,B,e) | s5(c) | -s5(C) | -q2(D,c,D) | -m0(D,E,F) | -q2(b,c,b) | -s1(b) | -q4(V6,V6) | -k1(C). [resolve(124,d,123,a)].
% 0.91/1.21 125 k5(A) | -r3(B,A,A) | -p3(C,D,E) | -l1(F,D). [resolve(114,b,115,a)].
% 0.91/1.21 126 n5(A,A) | -p0(A,B) | -m4(C,C) | -k5(d) # label(rule_310) # label(axiom). [assumption].
% 0.91/1.21 127 p5(b,b,b) | -p4(A,A,B) | -k5(b) # label(rule_321) # label(axiom). [assumption].
% 0.91/1.21 Derived: -r3(A,d,d) | -p3(B,C,D) | -l1(E,C) | n5(F,F) | -p0(F,V6) | -m4(V7,V7). [resolve(125,a,126,d)].
% 0.91/1.21 Derived: -r3(A,b,b) | -p3(B,C,D) | -l1(E,C) | p5(b,b,b) | -p4(F,F,V6). [resolve(125,a,127,c)].
% 0.91/1.21 128 k5(b) | -n1(b,b,b) | -p3(A,B,C) | -l1(e,B). [resolve(116,b,115,a)].
% 0.91/1.21 Derived: -n1(b,b,b) | -p3(A,B,C) | -l1(e,B) | p5(b,b,b) | -p4(D,D,E). [resolve(128,a,127,c)].
% 0.91/1.21 129 r4(A) | -q3(B,C) | -p0(D,A) | -p2(E,F,A). [resolve(98,b,94,a)].
% 0.91/1.21 130 n5(A,A) | -r4(A) # label(rule_314) # label(axiom). [assumption].
% 0.91/1.21 131 q5(a,a) | -r4(a) # label(rule_323) # label(axiom). [assumption].
% 0.91/1.21 132 s5(A) | -l4(A) | -r4(B) # label(rule_329) # label(axiom). [assumption].
% 0.91/1.21 Derived: -q3(A,B) | -p0(C,D) | -p2(E,F,D) | n5(D,D). [resolve(129,a,130,b)].
% 0.91/1.21 Derived: -q3(A,B) | -p0(C,a) | -p2(D,E,a) | q5(a,a). [resolve(129,a,131,b)].
% 0.99/1.25 Derived: -q3(A,B) | -p0(C,D) | -p2(E,F,D) | s5(V6) | -l4(V6). [resolve(129,a,132,c)].
% 0.99/1.25
% 0.99/1.25 ============================== end predicate elimination =============
% 0.99/1.25
% 0.99/1.25 Auto_denials:
% 0.99/1.25 % copying label prove_this to answer in negative clause
% 0.99/1.25
% 0.99/1.25 Term ordering decisions:
% 0.99/1.25 Function symbol KB weights: d=1. b=1. e=1. c=1. a=1.
% 0.99/1.25
% 0.99/1.25 ============================== end of process initial clauses ========
% 0.99/1.25
% 0.99/1.25 ============================== CLAUSES FOR SEARCH ====================
% 0.99/1.25
% 0.99/1.25 ============================== end of clauses for search =============
% 0.99/1.25
% 0.99/1.25 ============================== SEARCH ================================
% 0.99/1.25
% 0.99/1.25 % Starting search at 0.20 seconds.
% 0.99/1.25
% 0.99/1.25 ============================== PROOF =================================
% 0.99/1.25 % SZS status Unsatisfiable
% 0.99/1.25 % SZS output start Refutation
% 0.99/1.25
% 0.99/1.25 % Proof 1 at 0.21 (+ 0.00) seconds: prove_this.
% 0.99/1.25 % Length of proof is 14.
% 0.99/1.25 % Level of proof is 6.
% 0.99/1.25 % Maximum clause weight is 12.000.
% 0.99/1.25 % Given clauses 337.
% 0.99/1.25
% 0.99/1.25 7 n0(e,e) # label(axiom_30) # label(axiom). [assumption].
% 0.99/1.25 23 l2(A,B) | -s1(A) | -n0(e,B) | -l2(B,B) # label(rule_131) # label(axiom). [assumption].
% 0.99/1.25 143 p0(b,A) # label(axiom_14) # label(axiom). [assumption].
% 0.99/1.25 155 m0(b,b,e) # label(axiom_31) # label(axiom). [assumption].
% 0.99/1.25 255 s1(A) | -p0(A,A) # label(rule_125) # label(axiom). [assumption].
% 0.99/1.25 261 l2(A,A) | -p0(B,B) | -s1(C) | -m0(D,C,A) # label(rule_133) # label(axiom). [assumption].
% 0.99/1.25 362 -l2(b,e) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 0.99/1.25 405 l2(A,e) | -s1(A) | -l2(e,e). [resolve(23,c,7,a)].
% 0.99/1.25 581 s1(b). [ur(255,b,143,a)].
% 0.99/1.25 622 -s1(b) | -l2(e,e) # answer(prove_this). [resolve(405,a,362,a)].
% 0.99/1.25 625 -l2(e,e) | -p0(b,b) # answer(prove_this). [resolve(622,a,255,a)].
% 0.99/1.25 630 -l2(e,e) # answer(prove_this). [resolve(625,b,143,a)].
% 0.99/1.25 633 -s1(b) # answer(prove_this). [ur(261,a,630,a,b,143,a,d,155,a)].
% 0.99/1.25 634 $F # answer(prove_this). [resolve(633,a,581,a)].
% 0.99/1.25
% 0.99/1.25 % SZS output end Refutation
% 0.99/1.25 ============================== end of proof ==========================
% 0.99/1.25
% 0.99/1.25 ============================== STATISTICS ============================
% 0.99/1.25
% 0.99/1.25 Given=337. Generated=659. Kept=499. proofs=1.
% 0.99/1.25 Usable=295. Sos=68. Demods=0. Limbo=2, Disabled=701. Hints=0.
% 0.99/1.25 Megabytes=0.80.
% 0.99/1.25 User_CPU=0.21, System_CPU=0.00, Wall_clock=0.
% 0.99/1.25
% 0.99/1.25 ============================== end of statistics =====================
% 0.99/1.25
% 0.99/1.25 ============================== end of search =========================
% 0.99/1.25
% 0.99/1.25 THEOREM PROVED
% 0.99/1.25 % SZS status Unsatisfiable
% 0.99/1.25
% 0.99/1.25 Exiting with 1 proof.
% 0.99/1.25
% 0.99/1.25 Process 21175 exit (max_proofs) Mon Jul 11 18:04:39 2022
% 0.99/1.25 Prover9 interrupted
%------------------------------------------------------------------------------