TSTP Solution File: SYN145-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN145-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:49 EDT 2022
% Result : Unsatisfiable 0.78s 1.17s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN145-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 05:33:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.06 ============================== Prover9 ===============================
% 0.45/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.06 Process 24893 was started by sandbox2 on n028.cluster.edu,
% 0.45/1.06 Tue Jul 12 05:34:00 2022
% 0.45/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24740_n028.cluster.edu".
% 0.45/1.06 ============================== end of head ===========================
% 0.45/1.06
% 0.45/1.06 ============================== INPUT =================================
% 0.45/1.06
% 0.45/1.06 % Reading from file /tmp/Prover9_24740_n028.cluster.edu
% 0.45/1.06
% 0.45/1.06 set(prolog_style_variables).
% 0.45/1.06 set(auto2).
% 0.45/1.06 % set(auto2) -> set(auto).
% 0.45/1.06 % set(auto) -> set(auto_inference).
% 0.45/1.06 % set(auto) -> set(auto_setup).
% 0.45/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.06 % set(auto) -> set(auto_limits).
% 0.45/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.06 % set(auto) -> set(auto_denials).
% 0.45/1.06 % set(auto) -> set(auto_process).
% 0.45/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.06 % set(auto2) -> assign(stats, some).
% 0.45/1.06 % set(auto2) -> clear(echo_input).
% 0.45/1.06 % set(auto2) -> set(quiet).
% 0.45/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.06 % set(auto2) -> clear(print_given).
% 0.45/1.06 assign(lrs_ticks,-1).
% 0.45/1.06 assign(sos_limit,10000).
% 0.45/1.06 assign(order,kbo).
% 0.45/1.06 set(lex_order_vars).
% 0.45/1.06 clear(print_given).
% 0.45/1.06
% 0.45/1.06 % formulas(sos). % not echoed (369 formulas)
% 0.45/1.06
% 0.45/1.06 ============================== end of input ==========================
% 0.45/1.06
% 0.45/1.06 % From the command line: assign(max_seconds, 300).
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.06
% 0.45/1.06 % Formulas that are not ordinary clauses:
% 0.45/1.06
% 0.45/1.06 ============================== end of process non-clausal formulas ===
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.06
% 0.45/1.06 ============================== PREDICATE ELIMINATION =================
% 0.45/1.06 1 k1(A) | -n0(B,A) # label(rule_001) # label(axiom). [assumption].
% 0.45/1.06 2 n0(d,e) # label(axiom_3) # label(axiom). [assumption].
% 0.45/1.06 3 n0(d,b) # label(axiom_7) # label(axiom). [assumption].
% 0.45/1.06 4 n0(e,b) # label(axiom_11) # label(axiom). [assumption].
% 0.45/1.06 5 n0(a,b) # label(axiom_15) # label(axiom). [assumption].
% 0.45/1.06 6 n0(d,c) # label(axiom_26) # label(axiom). [assumption].
% 0.45/1.06 7 n0(e,e) # label(axiom_30) # label(axiom). [assumption].
% 0.45/1.06 8 n0(c,d) # label(axiom_34) # label(axiom). [assumption].
% 0.45/1.06 9 n0(b,a) # label(axiom_37) # label(axiom). [assumption].
% 0.45/1.06 Derived: k1(e). [resolve(1,b,2,a)].
% 0.45/1.06 Derived: k1(b). [resolve(1,b,3,a)].
% 0.45/1.06 Derived: k1(c). [resolve(1,b,6,a)].
% 0.45/1.06 Derived: k1(d). [resolve(1,b,8,a)].
% 0.45/1.06 Derived: k1(a). [resolve(1,b,9,a)].
% 0.45/1.06 10 l1(A,A) | -n0(B,A) # label(rule_002) # label(axiom). [assumption].
% 0.45/1.06 Derived: l1(e,e). [resolve(10,b,2,a)].
% 0.45/1.06 Derived: l1(b,b). [resolve(10,b,3,a)].
% 0.45/1.06 Derived: l1(c,c). [resolve(10,b,6,a)].
% 0.45/1.06 Derived: l1(d,d). [resolve(10,b,8,a)].
% 0.45/1.06 Derived: l1(a,a). [resolve(10,b,9,a)].
% 0.45/1.06 11 m1(A,A,c) | -n0(B,B) | -l1(c,c) | -p0(B,A) # label(rule_010) # label(axiom). [assumption].
% 0.45/1.06 Derived: m1(A,A,c) | -l1(c,c) | -p0(e,A). [resolve(11,b,7,a)].
% 0.45/1.06 12 m1(A,A,B) | -k0(A) | -n0(B,B) # label(rule_011) # label(axiom). [assumption].
% 0.45/1.06 Derived: m1(A,A,e) | -k0(A). [resolve(12,c,7,a)].
% 0.45/1.06 13 n1(A,A,A) | -n0(A,A) | -q0(a,A) # label(rule_038) # label(axiom). [assumption].
% 0.45/1.06 Derived: n1(e,e,e) | -q0(a,e). [resolve(13,b,7,a)].
% 0.45/1.06 14 n1(A,A,A) | -l1(B,A) | -n0(B,A) # label(rule_058) # label(axiom). [assumption].
% 0.45/1.06 Derived: n1(e,e,e) | -l1(d,e). [resolve(14,c,2,a)].
% 0.45/1.06 Derived: n1(b,b,b) | -l1(d,b). [resolve(14,c,3,a)].
% 0.45/1.06 Derived: n1(b,b,b) | -l1(e,b). [resolve(14,c,4,a)].
% 0.45/1.06 Derived: n1(b,b,b) | -l1(a,b). [resolve(14,c,5,a)].
% 0.45/1.06 Derived: n1(c,c,c) | -l1(d,c). [resolve(14,c,6,a)].
% 0.45/1.07 Derived: n1(e,e,e) | -l1(e,e). [resolve(14,c,7,a)].
% 0.45/1.07 Derived: n1(d,d,d) | -l1(c,d). [resolve(14,c,8,a)].
% 0.45/1.07 Derived: n1(a,a,a) | -l1(b,a). [resolve(14,c,9,a)].
% 0.45/1.07 15 p1(A,A,B) | -n0(d,A) | -k0(B) # label(rule_063) # label(axiom). [assumption].
% 0.45/1.07 Derived: p1(e,e,A) | -k0(A). [resolve(15,b,2,a)].
% 0.45/1.07 Derived: p1(b,b,A) | -k0(A). [resolve(15,b,3,a)].
% 0.45/1.07 Derived: p1(c,c,A) | -k0(A). [resolve(15,b,6,a)].
% 0.45/1.07 16 p1(A,A,A) | -l1(B,B) | -p0(A,B) | -n0(B,B) # label(rule_065) # label(axiom). [assumption].
% 0.45/1.07 Derived: p1(A,A,A) | -l1(e,e) | -p0(A,e). [resolve(16,d,7,a)].
% 0.45/1.07 17 p1(A,A,A) | -n0(B,A) # label(rule_066) # label(axiom). [assumption].
% 0.45/1.07 Derived: p1(e,e,e). [resolve(17,b,2,a)].
% 0.45/1.07 Derived: p1(b,b,b). [resolve(17,b,3,a)].
% 0.45/1.07 Derived: p1(c,c,c). [resolve(17,b,6,a)].
% 0.45/1.07 Derived: p1(d,d,d). [resolve(17,b,8,a)].
% 0.45/1.07 Derived: p1(a,a,a). [resolve(17,b,9,a)].
% 0.45/1.07 18 p1(A,A,A) | -n0(e,b) | -k0(b) | -k0(A) | -k1(B) # label(rule_073) # label(axiom). [assumption].
% 0.45/1.07 Derived: p1(A,A,A) | -k0(b) | -k0(A) | -k1(B). [resolve(18,b,4,a)].
% 0.45/1.07 19 p1(A,A,A) | -n0(B,B) | -l0(C) | -n1(B,D,A) # label(rule_080) # label(axiom). [assumption].
% 0.45/1.07 Derived: p1(A,A,A) | -l0(B) | -n1(e,C,A). [resolve(19,b,7,a)].
% 0.45/1.07 20 p1(d,d,A) | -s0(A) | -n1(c,d,A) | -r0(d) | -n0(c,A) # label(rule_089) # label(axiom). [assumption].
% 0.45/1.07 21 q1(A,B,A) | -n0(C,B) | -p0(D,A) # label(rule_092) # label(axiom). [assumption].
% 0.45/1.07 Derived: q1(A,e,A) | -p0(B,A). [resolve(21,b,2,a)].
% 0.45/1.07 Derived: q1(A,b,A) | -p0(B,A). [resolve(21,b,3,a)].
% 0.45/1.07 Derived: q1(A,c,A) | -p0(B,A). [resolve(21,b,6,a)].
% 0.45/1.07 Derived: q1(A,d,A) | -p0(B,A). [resolve(21,b,8,a)].
% 0.45/1.07 Derived: q1(A,a,A) | -p0(B,A). [resolve(21,b,9,a)].
% 0.45/1.07 22 q1(A,A,A) | -n0(B,A) # label(rule_100) # label(axiom). [assumption].
% 0.45/1.07 Derived: q1(e,e,e). [resolve(22,b,2,a)].
% 0.45/1.07 Derived: q1(b,b,b). [resolve(22,b,3,a)].
% 0.45/1.07 Derived: q1(c,c,c). [resolve(22,b,6,a)].
% 0.45/1.07 Derived: q1(d,d,d). [resolve(22,b,8,a)].
% 0.45/1.07 Derived: q1(a,a,a). [resolve(22,b,9,a)].
% 0.45/1.07 23 l2(A,B) | -s1(A) | -n0(e,B) | -l2(B,B) # label(rule_131) # label(axiom). [assumption].
% 0.45/1.07 Derived: l2(A,b) | -s1(A) | -l2(b,b). [resolve(23,c,4,a)].
% 0.45/1.07 Derived: l2(A,e) | -s1(A) | -l2(e,e). [resolve(23,c,7,a)].
% 0.45/1.07 24 p2(a,A,d) | -n0(A,d) | -m1(a,A,d) # label(rule_166) # label(axiom). [assumption].
% 0.45/1.07 Derived: p2(a,c,d) | -m1(a,c,d). [resolve(24,b,8,a)].
% 0.45/1.07 25 k3(A,B,A) | -s1(B) | -p2(C,B,D) | -n0(A,D) # label(rule_192) # label(axiom). [assumption].
% 0.45/1.07 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,e). [resolve(25,d,2,a)].
% 0.45/1.07 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,b). [resolve(25,d,3,a)].
% 0.45/1.07 Derived: k3(e,A,e) | -s1(A) | -p2(B,A,b). [resolve(25,d,4,a)].
% 0.45/1.07 Derived: k3(a,A,a) | -s1(A) | -p2(B,A,b). [resolve(25,d,5,a)].
% 0.45/1.07 Derived: k3(d,A,d) | -s1(A) | -p2(B,A,c). [resolve(25,d,6,a)].
% 0.45/1.07 Derived: k3(e,A,e) | -s1(A) | -p2(B,A,e). [resolve(25,d,7,a)].
% 0.45/1.07 Derived: k3(c,A,c) | -s1(A) | -p2(B,A,d). [resolve(25,d,8,a)].
% 0.45/1.07 Derived: k3(b,A,b) | -s1(A) | -p2(B,A,a). [resolve(25,d,9,a)].
% 0.45/1.07 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.45/1.07 Derived: m3(A,A,A) | -k2(B,b) | -m3(A,b,A) | -l2(a,a). [resolve(26,d,9,a)].
% 0.45/1.07 27 q3(A,B) | -q2(C,A,B) | -n0(C,A) # label(rule_255) # label(axiom). [assumption].
% 0.45/1.07 Derived: q3(e,A) | -q2(d,e,A). [resolve(27,c,2,a)].
% 0.45/1.07 Derived: q3(b,A) | -q2(d,b,A). [resolve(27,c,3,a)].
% 0.45/1.07 Derived: q3(b,A) | -q2(e,b,A). [resolve(27,c,4,a)].
% 0.45/1.07 Derived: q3(b,A) | -q2(a,b,A). [resolve(27,c,5,a)].
% 0.45/1.07 Derived: q3(c,A) | -q2(d,c,A). [resolve(27,c,6,a)].
% 0.45/1.07 Derived: q3(e,A) | -q2(e,e,A). [resolve(27,c,7,a)].
% 0.45/1.07 Derived: q3(d,A) | -q2(c,d,A). [resolve(27,c,8,a)].
% 0.45/1.07 Derived: q3(a,A) | -q2(b,a,A). [resolve(27,c,9,a)].
% 0.45/1.07 28 k4(c) | -n0(c,d) | -q3(e,b) | -n3(e) # label(rule_274) # label(axiom). [assumption].
% 0.45/1.07 Derived: k4(c) | -q3(e,b) | -n3(e). [resolve(28,b,8,a)].
% 0.45/1.07 29 k4(A) | -k3(B,B,B) | -n0(C,B) | -k4(A) # label(rule_275) # label(axiom). [assumption].
% 0.45/1.07 30 p4(A,A,A) | -l4(A) | -n0(A,B) | -p4(C,D,C) # label(rule_289) # label(axiom). [assumption].
% 0.45/1.07 Derived: p4(d,d,d) | -l4(d) | -p4(A,B,A). [resolve(30,c,2,a)].
% 0.45/1.07 Derived: p4(e,e,e) | -l4(e) | -p4(A,B,A). [resolve(30,c,4,a)].
% 0.45/1.07 Derived: p4(a,a,a) | -l4(a) | -p4(A,B,A). [resolve(30,c,5,a)].
% 0.78/1.11 Derived: p4(c,c,c) | -l4(c) | -p4(A,B,A). [resolve(30,c,8,a)].
% 0.78/1.11 Derived: p4(b,b,b) | -l4(b) | -p4(A,B,A). [resolve(30,c,9,a)].
% 0.78/1.11 31 -n0(d,A) # label(prove_this) # label(negated_conjecture). [assumption].
% 0.78/1.11 Derived: $F. [resolve(31,a,2,a)].
% 0.78/1.11 32 n2(e) | -r1(b) | -r0(e) | -p1(b,A,B) # label(rule_140) # label(axiom). [assumption].
% 0.78/1.11 33 r1(A) | -q0(A,B) | -s0(d) | -q1(d,B,d) # label(rule_124) # label(axiom). [assumption].
% 0.78/1.11 34 p2(e,c,c) | -r1(d) | -l1(e,c) # label(rule_147) # label(axiom). [assumption].
% 0.78/1.11 35 p2(A,A,d) | -r1(a) | -m0(B,A,d) # label(rule_149) # label(axiom). [assumption].
% 0.78/1.11 36 p2(A,A,A) | -p0(A,A) | -r1(B) | -p2(C,B,A) # label(rule_164) # label(axiom). [assumption].
% 0.78/1.11 37 p2(a,c,b) | -l1(e,c) | -l2(e,b) | -r1(e) | -m1(d,a,c) # label(rule_168) # label(axiom). [assumption].
% 0.78/1.11 38 p2(A,A,A) | -r1(B) | -r0(A) # label(rule_173) # label(axiom). [assumption].
% 0.78/1.11 39 q2(A,B,A) | -r1(B) | -m0(C,D,A) | -k0(B) | -q2(B,B,B) # label(rule_187) # label(axiom). [assumption].
% 0.78/1.11 40 r2(A) | -r1(A) | -l0(A) # label(rule_188) # label(axiom). [assumption].
% 0.78/1.11 41 s2(d) | -r1(d) | -s1(d) # label(rule_191) # label(axiom). [assumption].
% 0.78/1.11 42 k3(A,A,A) | -r1(A) | -p2(B,C,C) # label(rule_213) # label(axiom). [assumption].
% 0.78/1.11 43 q4(A,A) | -r1(A) | -l4(B) | -q4(B,C) # label(rule_296) # label(axiom). [assumption].
% 0.78/1.11 44 p2(A,A,A) | -n2(A) | -k1(e) # label(rule_174) # label(axiom). [assumption].
% 0.78/1.11 45 n2(A) | -p1(B,C,A) # label(rule_137) # label(axiom). [assumption].
% 0.78/1.11 46 n2(a) | -m1(b,a,e) | -k1(c) | -n1(e,a,e) | -q1(c,a,d) # label(rule_138) # label(axiom). [assumption].
% 0.78/1.11 47 n2(c) | -l1(e,c) | -k0(b) # label(rule_139) # label(axiom). [assumption].
% 0.78/1.11 48 k3(A,A,A) | -n2(A) # label(rule_210) # label(axiom). [assumption].
% 0.78/1.11 49 l3(A,A) | -n2(A) | -m2(b) # label(rule_217) # label(axiom). [assumption].
% 0.78/1.11 50 l3(A,A) | -n2(B) | -l1(C,A) | -l3(C,C) # label(rule_219) # label(axiom). [assumption].
% 0.78/1.11 51 m3(A,B,B) | -n2(A) | -m2(B) | -m3(C,A,C) # label(rule_228) # label(axiom). [assumption].
% 0.78/1.11 52 m3(A,A,A) | -l2(A,A) | -n2(A) # label(rule_232) # label(axiom). [assumption].
% 0.78/1.11 53 m3(A,A,A) | -n2(A) | -m2(B) # label(rule_233) # label(axiom). [assumption].
% 0.78/1.11 54 m3(A,e,e) | -n2(e) | -p2(A,e,e) # label(rule_234) # label(axiom). [assumption].
% 0.78/1.11 55 m3(A,A,A) | -n2(A) # label(rule_236) # label(axiom). [assumption].
% 0.78/1.11 56 p3(A,A,A) | -n2(A) # label(rule_244) # label(axiom). [assumption].
% 0.78/1.11 57 p3(A,A,A) | -n2(A) | -q2(B,C,A) | -s1(B) # label(rule_247) # label(axiom). [assumption].
% 0.78/1.11 58 p3(A,A,A) | -k1(A) | -n2(A) # label(rule_249) # label(axiom). [assumption].
% 0.78/1.11 59 k3(A,A,A) | -s1(A) | -q2(d,B,d) | -s2(B) # label(rule_193) # label(axiom). [assumption].
% 0.78/1.11 60 s2(A) | -q2(b,A,b) | -s1(b) # label(rule_189) # label(axiom). [assumption].
% 0.78/1.11 61 s2(d) | -s1(a) | -s0(d) # label(rule_190) # label(axiom). [assumption].
% 0.78/1.11 62 k3(c,c,c) | -s2(e) | -k2(c,e) # label(rule_195) # label(axiom). [assumption].
% 0.78/1.11 63 k3(A,A,A) | -m2(B) | -l1(C,D) | -s2(A) | -k3(C,D,C) # label(rule_209) # label(axiom). [assumption].
% 0.78/1.11 64 l3(A,A) | -s2(B) | -l1(A,A) # label(rule_220) # label(axiom). [assumption].
% 0.78/1.11 65 l3(d,c) | -s2(d) | -k3(a,c,a) | -r0(b) # label(rule_224) # label(axiom). [assumption].
% 0.78/1.11 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.78/1.11 67 m3(A,A,A) | -q0(B,C) | -s0(D) | -s2(C) | -r2(A) # label(rule_227) # label(axiom). [assumption].
% 0.78/1.11 68 m3(A,c,A) | -s2(c) | -q2(A,c,c) # label(rule_237) # label(axiom). [assumption].
% 0.78/1.11 69 q3(A,B) | -n1(C,A,B) | -s2(A) | -q3(B,A) # label(rule_257) # label(axiom). [assumption].
% 0.78/1.11 70 r3(A,B,B) | -s2(B) | -l2(c,A) # label(rule_260) # label(axiom). [assumption].
% 0.78/1.11 71 r3(A,A,A) | -s2(A) # label(rule_264) # label(axiom). [assumption].
% 0.78/1.11 72 s3(A,B) | -q2(C,A,C) | -s2(A) | -m0(C,D,B) # label(rule_273) # label(axiom). [assumption].
% 0.78/1.11 73 p3(A,d,e) | -l3(b,e) | -p2(d,b,c) | -n3(A) | -q2(A,d,A) # label(rule_243) # label(axiom). [assumption].
% 0.78/1.11 74 l3(A,B) | -r0(A) | -p2(A,B,A) # label(rule_215) # label(axiom). [assumption].
% 0.78/1.11 75 l3(A,A) | -p1(A,A,B) | -p2(B,C,A) # label(rule_216) # label(axiom). [assumption].
% 0.78/1.11 76 l3(d,d) | -k2(a,d) # label(rule_221) # label(axiom). [assumption].
% 0.78/1.15 77 l3(A,A) | -k3(B,A,A) | -l2(C,C) # label(rule_222) # label(axiom). [assumption].
% 0.78/1.15 78 l3(c,c) | -k2(b,c) # label(rule_223) # label(axiom). [assumption].
% 0.78/1.15 79 p3(A,A,A) | -l1(B,B) | -l3(B,A) | -p3(C,C,B) # label(rule_245) # label(axiom). [assumption].
% 0.78/1.15 80 n4(e,e) | -l3(b,a) | -p3(b,e,a) # label(rule_283) # label(axiom). [assumption].
% 0.78/1.15 81 p4(A,A,A) | -q3(B,C) | -n4(C,A) | -l3(B,B) # label(rule_293) # label(axiom). [assumption].
% 0.78/1.15 82 p3(A,A,A) | -p2(B,A,A) | -n3(A) # label(rule_248) # label(axiom). [assumption].
% 0.78/1.15 83 n3(A) | -p2(B,C,A) # label(rule_240) # label(axiom). [assumption].
% 0.78/1.15 84 p4(A,A,A) | -q3(B,C) | -n3(A) # label(rule_286) # label(axiom). [assumption].
% 0.78/1.15 85 p4(c,c,A) | -n3(a) | -m3(A,c,a) # label(rule_294) # label(axiom). [assumption].
% 0.78/1.15 86 r4(A) | -n3(A) | -q3(B,C) | -p0(D,A) # label(rule_298) # label(axiom). [assumption].
% 0.78/1.15 87 r5(A,B) | -s4(A) | -k0(b) | -n3(B) # label(rule_327) # label(axiom). [assumption].
% 0.78/1.15 88 k4(c) | -q3(e,b) | -n3(e). [resolve(28,b,8,a)].
% 0.78/1.15 89 r3(A,A,A) | -p3(B,A,C) | -r3(B,B,B) # label(rule_271) # label(axiom). [assumption].
% 0.78/1.15 90 p3(A,B,C) | -q2(D,d,A) | -k2(B,C) # label(rule_241) # label(axiom). [assumption].
% 0.78/1.15 91 p3(A,A,A) | -l2(A,A) # label(rule_246) # label(axiom). [assumption].
% 0.78/1.15 92 p3(A,A,A) | -k1(A) | -q2(B,C,A) # label(rule_250) # label(axiom). [assumption].
% 0.78/1.15 93 p3(A,B,B) | -m3(B,C,D) | -p2(A,B,D) # label(rule_251) # label(axiom). [assumption].
% 0.78/1.15 94 p3(A,A,A) | -q0(B,A) | -k2(C,C) # label(rule_252) # label(axiom). [assumption].
% 0.78/1.15 95 p3(b,c,b) | -k2(c,b) # label(rule_253) # label(axiom). [assumption].
% 0.78/1.15 96 p3(e,b,e) | -m3(e,A,e) | -q2(A,A,b) # label(rule_254) # label(axiom). [assumption].
% 0.78/1.15 97 l4(A) | -p3(B,C,A) # label(rule_277) # label(axiom). [assumption].
% 0.78/1.15 98 m4(A,A) | -p3(B,B,B) | -m3(A,A,B) | -m4(A,A) # label(rule_280) # label(axiom). [assumption].
% 0.78/1.15 99 n4(A,B) | -p3(A,B,B) | -n4(A,A) # label(rule_281) # label(axiom). [assumption].
% 0.78/1.15 100 p4(A,A,A) | -p3(B,B,A) # label(rule_291) # label(axiom). [assumption].
% 0.78/1.15 101 s4(A) | -p3(B,C,D) | -l1(A,C) # label(rule_299) # label(axiom). [assumption].
% 0.78/1.15 102 n4(A,A) | -k4(B) | -m3(A,A,A) # label(rule_284) # label(axiom). [assumption].
% 0.78/1.15 103 k4(e) | -q3(A,A) | -q1(a,a,B) | -r3(A,e,B) # label(rule_276) # label(axiom). [assumption].
% 0.78/1.15 104 m5(A,A) | -k4(A) # label(rule_304) # label(axiom). [assumption].
% 0.78/1.15 105 n5(A,A) | -s1(A) | -k4(A) # label(rule_315) # label(axiom). [assumption].
% 0.78/1.15 106 r5(A,A) | -k4(A) # label(rule_328) # label(axiom). [assumption].
% 0.78/1.15 107 s5(A) | -k4(A) | -s3(A,B) | -l5(C) | -s5(C) # label(rule_330) # label(axiom). [assumption].
% 0.78/1.15 108 m5(A,A) | -s4(A) | -m4(e,e) # label(rule_305) # label(axiom). [assumption].
% 0.78/1.15 109 m4(A,B) | -l2(C,B) | -s3(a,A) # label(rule_279) # label(axiom). [assumption].
% 0.78/1.15 110 n5(A,A) | -p0(A,B) | -m4(C,C) | -k5(d) # label(rule_310) # label(axiom). [assumption].
% 0.78/1.15 111 p5(A,B,B) | -l2(A,C) | -p5(A,C,A) | -m4(C,B) # label(rule_319) # label(axiom). [assumption].
% 0.78/1.15 112 q5(A,A) | -m4(A,A) # label(rule_326) # label(axiom). [assumption].
% 0.78/1.15 113 p4(A,A,A) | -k3(B,C,C) | -n4(A,C) | -p1(C,B,A) # label(rule_292) # label(axiom). [assumption].
% 0.78/1.15 114 n4(d,d) | -k3(c,c,e) | -q1(d,d,d) # label(rule_282) # label(axiom). [assumption].
% 0.78/1.15 115 n5(A,B) | -q4(C,D) | -n4(A,D) | -p4(E,E,B) | -n5(E,B) # label(rule_307) # label(axiom). [assumption].
% 0.78/1.15 116 n5(A,A) | -n4(B,A) # label(rule_309) # label(axiom). [assumption].
% 0.78/1.15 117 n5(b,e) | -r3(d,b,c) | -n4(b,e) # label(rule_312) # label(axiom). [assumption].
% 0.78/1.15 118 n5(d,A) | -k3(d,A,a) | -n4(A,d) # label(rule_317) # label(axiom). [assumption].
% 0.78/1.15 119 l5(A) | -q4(B,B) | -k1(A) # label(rule_302) # label(axiom). [assumption].
% 0.78/1.15 120 q4(A,B) | -k3(C,C,A) | -q2(D,B,A) | -m3(D,E,D) # label(rule_295) # label(axiom). [assumption].
% 0.78/1.15 121 q4(b,b) | -k3(c,e,b) | -l1(b,c) # label(rule_297) # label(axiom). [assumption].
% 0.78/1.15 122 n5(A,A) | -q4(B,A) # label(rule_313) # label(axiom). [assumption].
% 0.78/1.15 123 p5(A,B,A) | -q4(B,C) | -s1(A) # label(rule_320) # label(axiom). [assumption].
% 0.78/1.15 124 q5(A,A) | -q4(A,A) # label(rule_325) # label(axiom). [assumption].
% 0.78/1.15 125 p5(b,b,b) | -p4(A,A,B) | -k5(b) # label(rule_321) # label(axiom). [assumption].
% 0.78/1.17 126 k5(A) | -s4(B) | -r3(C,A,A) # label(rule_300) # label(axiom). [assumption].
% 0.78/1.17 127 k5(b) | -s4(e) | -n1(b,b,b) # label(rule_301) # label(axiom). [assumption].
% 0.78/1.17
% 0.78/1.17 ============================== end predicate elimination =============
% 0.78/1.17
% 0.78/1.17 Auto_denials: (no changes).
% 0.78/1.17
% 0.78/1.17 Term ordering decisions:
% 0.78/1.17 Function symbol KB weights: b=1. e=1. d=1. a=1. c=1.
% 0.78/1.17
% 0.78/1.17 ============================== PROOF =================================
% 0.78/1.17 % SZS status Unsatisfiable
% 0.78/1.17 % SZS output start Refutation
% 0.78/1.17
% 0.78/1.17 % Proof 1 at 0.15 (+ 0.00) seconds.
% 0.78/1.17 % Length of proof is 3.
% 0.78/1.17 % Level of proof is 1.
% 0.78/1.17 % Maximum clause weight is 0.000.
% 0.78/1.17 % Given clauses 0.
% 0.78/1.17
% 0.78/1.17 2 n0(d,e) # label(axiom_3) # label(axiom). [assumption].
% 0.78/1.17 31 -n0(d,A) # label(prove_this) # label(negated_conjecture). [assumption].
% 0.78/1.17 393 $F. [resolve(31,a,2,a)].
% 0.78/1.17
% 0.78/1.17 % SZS output end Refutation
% 0.78/1.17 ============================== end of proof ==========================
% 0.78/1.17
% 0.78/1.17 ============================== STATISTICS ============================
% 0.78/1.17
% 0.78/1.17 Given=0. Generated=288. Kept=265. proofs=1.
% 0.78/1.17 Usable=0. Sos=0. Demods=0. Limbo=265, Disabled=438. Hints=0.
% 0.78/1.17 Megabytes=0.50.
% 0.78/1.17 User_CPU=0.15, System_CPU=0.00, Wall_clock=0.
% 0.78/1.17
% 0.78/1.17 ============================== end of statistics =====================
% 0.78/1.17
% 0.78/1.17 ============================== end of search =========================
% 0.78/1.17
% 0.78/1.17 THEOREM PROVED
% 0.78/1.17 % SZS status Unsatisfiable
% 0.78/1.17
% 0.78/1.17 Exiting with 1 proof.
% 0.78/1.17
% 0.78/1.17 Process 24893 exit (max_proofs) Tue Jul 12 05:34:00 2022
% 0.78/1.17 Prover9 interrupted
%------------------------------------------------------------------------------