TSTP Solution File: NUN072+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUN072+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 : Mon Jul 18 16:37:12 EDT 2022
% Result : Theorem 2.98s 3.29s
% Output : Refutation 2.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUN072+2 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Thu Jun 2 10:11:59 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.84/1.09 ============================== Prover9 ===============================
% 0.84/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.84/1.09 Process 2471 was started by sandbox2 on n025.cluster.edu,
% 0.84/1.09 Thu Jun 2 10:12:00 2022
% 0.84/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2318_n025.cluster.edu".
% 0.84/1.09 ============================== end of head ===========================
% 0.84/1.09
% 0.84/1.09 ============================== INPUT =================================
% 0.84/1.09
% 0.84/1.09 % Reading from file /tmp/Prover9_2318_n025.cluster.edu
% 0.84/1.09
% 0.84/1.09 set(prolog_style_variables).
% 0.84/1.09 set(auto2).
% 0.84/1.09 % set(auto2) -> set(auto).
% 0.84/1.09 % set(auto) -> set(auto_inference).
% 0.84/1.09 % set(auto) -> set(auto_setup).
% 0.84/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.84/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.84/1.09 % set(auto) -> set(auto_limits).
% 0.84/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.84/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.84/1.09 % set(auto) -> set(auto_denials).
% 0.84/1.09 % set(auto) -> set(auto_process).
% 0.84/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.84/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.84/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.84/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.84/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.84/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.84/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.84/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.84/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.84/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.84/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.84/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.84/1.09 % set(auto2) -> assign(stats, some).
% 0.84/1.09 % set(auto2) -> clear(echo_input).
% 0.84/1.09 % set(auto2) -> set(quiet).
% 0.84/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.84/1.09 % set(auto2) -> clear(print_given).
% 0.84/1.09 assign(lrs_ticks,-1).
% 0.84/1.09 assign(sos_limit,10000).
% 0.84/1.09 assign(order,kbo).
% 0.84/1.09 set(lex_order_vars).
% 0.84/1.09 clear(print_given).
% 0.84/1.09
% 0.84/1.09 % formulas(sos). % not echoed (12 formulas)
% 0.84/1.09
% 0.84/1.09 ============================== end of input ==========================
% 0.84/1.09
% 0.84/1.09 % From the command line: assign(max_seconds, 300).
% 0.84/1.09
% 0.84/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.84/1.09
% 0.84/1.09 % Formulas that are not ordinary clauses:
% 0.84/1.09 1 (exists Y24 all X19 (-r1(X19) & X19 != Y24 | r1(X19) & X19 = Y24)) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 2 (all X11 exists Y21 all X12 (-r2(X11,X12) & X12 != Y21 | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 3 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & X15 = Y22)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 4 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & X18 != Y23 | r4(X16,X17,X18) & X18 = Y23)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 5 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 6 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y3 = Y2)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 7 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | Y13 != Y12)) | -r2(X10,Y12))) | X3 = X10)) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 8 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & Y9 = X4)) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 9 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 10 (all X6 ((exists Y19 (r1(Y19) & X6 = Y19)) | (exists Y1 exists Y11 (r2(Y1,Y11) & X6 = Y11)))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 11 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.09 12 -(exists Y1 ((exists Y2 ((exists Y4 (r2(Y4,Y2) & (exists Y7 (r1(Y7) & r2(Y7,Y4))))) & (exists Y5 (r4(Y5,Y2,Y1) & (exists Y8 (r1(Y8) & r2(Y8,Y5))))))) & (exists Y3 (Y1 = Y3 & (exists Y6 (r2(Y6,Y3) & (exists Y9 (r1(Y9) & r2(Y9,Y6))))))))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.98/3.29
% 2.98/3.29 ============================== end of process non-clausal formulas ===
% 2.98/3.29
% 2.98/3.29 ============================== PROCESS INITIAL CLAUSES ===============
% 2.98/3.29
% 2.98/3.29 ============================== PREDICATE ELIMINATION =================
% 2.98/3.29 13 -r3(A,B,C) | C = f2(A,B) # label(axiom_3) # label(axiom). [clausify(3)].
% 2.98/3.29 14 r3(A,B,f7(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 15 r3(A,f13(A),f12(A)) # label(axiom_4a) # label(axiom). [clausify(8)].
% 2.98/3.29 16 r3(A,f6(A,B),f5(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 17 r3(f11(A,B),A,f8(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 Derived: f7(A,B) = f2(A,B). [resolve(13,a,14,a)].
% 2.98/3.29 Derived: f12(A) = f2(A,f13(A)). [resolve(13,a,15,a)].
% 2.98/3.29 Derived: f5(A,B) = f2(A,f6(A,B)). [resolve(13,a,16,a)].
% 2.98/3.29 Derived: f8(A,B) = f2(f11(A,B),A). [resolve(13,a,17,a)].
% 2.98/3.29 18 A != f2(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(3)].
% 2.98/3.29 19 -r2(A,B) | -r1(C) | -r2(C,A) | -r4(D,B,E) | -r1(F) | -r2(F,D) | E != V6 | -r2(V7,V6) | -r1(V8) | -r2(V8,V7) # label(onetimestwoeqtwo) # label(negated_conjecture). [clausify(12)].
% 2.98/3.29 20 r4(A,B,f11(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 21 r4(A,f15(A),f14(A)) # label(axiom_5a) # label(axiom). [clausify(9)].
% 2.98/3.29 22 r4(A,f10(A,B),f9(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 Derived: -r2(A,B) | -r1(C) | -r2(C,A) | -r1(D) | -r2(D,E) | f11(E,B) != F | -r2(V6,F) | -r1(V7) | -r2(V7,V6). [resolve(19,d,20,a)].
% 2.98/3.29 Derived: -r2(A,f15(B)) | -r1(C) | -r2(C,A) | -r1(D) | -r2(D,B) | f14(B) != E | -r2(F,E) | -r1(V6) | -r2(V6,F). [resolve(19,d,21,a)].
% 2.98/3.29 Derived: -r2(A,f10(B,C)) | -r1(D) | -r2(D,A) | -r1(E) | -r2(E,B) | f9(B,C) != F | -r2(V6,F) | -r1(V7) | -r2(V7,V6). [resolve(19,d,22,a)].
% 2.98/3.29 23 -r4(A,B,C) | C = f3(A,B) # label(axiom_4) # label(axiom). [clausify(4)].
% 2.98/3.29 Derived: f11(A,B) = f3(A,B). [resolve(23,a,20,a)].
% 2.98/3.29 Derived: f14(A) = f3(A,f15(A)). [resolve(23,a,21,a)].
% 2.98/3.29 Derived: f9(A,B) = f3(A,f10(A,B)). [resolve(23,a,22,a)].
% 2.98/3.29 24 A != f3(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(4)].
% 2.98/3.29 Derived: A != f3(B,C) | -r2(D,C) | -r1(E) | -r2(E,D) | -r1(F) | -r2(F,B) | A != V6 | -r2(V7,V6) | -r1(V8) | -r2(V8,V7). [resolve(24,b,19,d)].
% 2.98/3.29
% 2.98/3.29 ============================== end predicate elimination =============
% 2.98/3.29
% 2.98/3.29 Auto_denials: (non-Horn, no changes).
% 2.98/3.29
% 2.98/3.29 Term ordering decisions:
% 2.98/3.29 Function symbol KB weights: c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f1=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1.
% 2.98/3.29
% 2.98/3.29 ============================== end of process initial clauses ========
% 2.98/3.29
% 2.98/3.29 ============================== CLAUSES FOR SEARCH ====================
% 2.98/3.29
% 2.98/3.29 ============================== end of clauses for search =============
% 2.98/3.29
% 2.98/3.29 ============================== SEARCH ================================
% 2.98/3.29
% 2.98/3.29 % Starting search at 0.19 seconds.
% 2.98/3.29
% 2.98/3.29 ============================== PROOF =================================
% 2.98/3.29 % SZS status Theorem
% 2.98/3.29 % SZS output start Refutation
% 2.98/3.29
% 2.98/3.29 % Proof 1 at 2.19 (+ 0.03) seconds.
% 2.98/3.29 % Length of proof is 66.
% 2.98/3.29 % Level of proof is 7.
% 2.98/3.29 % Maximum clause weight is 29.000.
% 2.98/3.29 % Given clauses 345.
% 2.98/3.29
% 2.98/3.29 1 (exists Y24 all X19 (-r1(X19) & X19 != Y24 | r1(X19) & X19 = Y24)) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 2 (all X11 exists Y21 all X12 (-r2(X11,X12) & X12 != Y21 | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 3 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & X15 = Y22)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 4 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & X18 != Y23 | r4(X16,X17,X18) & X18 = Y23)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 5 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 6 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y3 = Y2)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 8 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & Y9 = X4)) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 9 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption].
% 2.98/3.29 12 -(exists Y1 ((exists Y2 ((exists Y4 (r2(Y4,Y2) & (exists Y7 (r1(Y7) & r2(Y7,Y4))))) & (exists Y5 (r4(Y5,Y2,Y1) & (exists Y8 (r1(Y8) & r2(Y8,Y5))))))) & (exists Y3 (Y1 = Y3 & (exists Y6 (r2(Y6,Y3) & (exists Y9 (r1(Y9) & r2(Y9,Y6))))))))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.98/3.29 13 -r3(A,B,C) | C = f2(A,B) # label(axiom_3) # label(axiom). [clausify(3)].
% 2.98/3.29 14 r3(A,B,f7(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 15 r3(A,f13(A),f12(A)) # label(axiom_4a) # label(axiom). [clausify(8)].
% 2.98/3.29 16 r3(A,f6(A,B),f5(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 17 r3(f11(A,B),A,f8(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 19 -r2(A,B) | -r1(C) | -r2(C,A) | -r4(D,B,E) | -r1(F) | -r2(F,D) | E != V6 | -r2(V7,V6) | -r1(V8) | -r2(V8,V7) # label(onetimestwoeqtwo) # label(negated_conjecture). [clausify(12)].
% 2.98/3.29 20 r4(A,B,f11(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 21 r4(A,f15(A),f14(A)) # label(axiom_5a) # label(axiom). [clausify(9)].
% 2.98/3.29 22 r4(A,f10(A,B),f9(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 23 -r4(A,B,C) | C = f3(A,B) # label(axiom_4) # label(axiom). [clausify(4)].
% 2.98/3.29 24 A != f3(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(4)].
% 2.98/3.29 25 r1(f13(A)) # label(axiom_4a) # label(axiom). [clausify(8)].
% 2.98/3.29 26 r1(f15(A)) # label(axiom_5a) # label(axiom). [clausify(9)].
% 2.98/3.29 27 r1(f16(A)) # label(axiom_5a) # label(axiom). [clausify(9)].
% 2.98/3.29 28 f12(A) = A # label(axiom_4a) # label(axiom). [clausify(8)].
% 2.98/3.29 29 r2(A,f6(B,A)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 30 r2(A,f10(B,A)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 31 f16(A) = f14(A) # label(axiom_5a) # label(axiom). [clausify(9)].
% 2.98/3.29 32 f5(A,B) = f4(A,B) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 33 r2(f7(A,B),f4(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 2.98/3.29 34 f9(A,B) = f8(A,B) # label(axiom_2a) # label(axiom). [clausify(6)].
% 2.98/3.29 40 -r1(A) | A = c1 # label(axiom_1) # label(axiom). [clausify(1)].
% 2.98/3.29 41 -r1(A) | c1 = A. [copy(40),flip(b)].
% 2.98/3.29 44 -r2(A,B) | B = f1(A) # label(axiom_2) # label(axiom). [clausify(2)].
% 2.98/3.29 45 -r2(A,B) | f1(A) = B. [copy(44),flip(b)].
% 2.98/3.29 49 f7(A,B) = f2(A,B). [resolve(13,a,14,a)].
% 2.98/3.29 50 f12(A) = f2(A,f13(A)). [resolve(13,a,15,a)].
% 2.98/3.29 51 f2(A,f13(A)) = A. [copy(50),rewrite([28(1)]),flip(a)].
% 2.98/3.29 52 f5(A,B) = f2(A,f6(A,B)). [resolve(13,a,16,a)].
% 2.98/3.29 53 f2(A,f6(A,B)) = f4(A,B). [copy(52),rewrite([32(1)]),flip(a)].
% 2.98/3.29 54 f8(A,B) = f2(f11(A,B),A). [resolve(13,a,17,a)].
% 2.98/3.29 59 f11(A,B) = f3(A,B). [resolve(23,a,20,a)].
% 2.98/3.29 60 f14(A) = f3(A,f15(A)). [resolve(23,a,21,a)].
% 2.98/3.29 61 f9(A,B) = f3(A,f10(A,B)). [resolve(23,a,22,a)].
% 2.98/3.29 62 f3(A,f10(A,B)) = f2(f3(A,B),A). [copy(61),rewrite([34(1),54(1),59(1)]),flip(a)].
% 2.98/3.29 63 A != f3(B,C) | -r2(D,C) | -r1(E) | -r2(E,D) | -r1(F) | -r2(F,B) | A != V6 | -r2(V7,V6) | -r1(V8) | -r2(V8,V7). [resolve(24,b,19,d)].
% 2.98/3.29 64 f3(A,B) != C | -r2(D,B) | -r1(E) | -r2(E,D) | -r1(F) | -r2(F,A) | C != V6 | -r2(V7,V6) | -r1(V8) | -r2(V8,V7). [copy(63),flip(a)].
% 2.98/3.29 65 r1(f3(A,f15(A))). [back_rewrite(27),rewrite([31(1),60(1)])].
% 2.98/3.29 66 r2(f2(A,B),f4(A,B)). [back_rewrite(33),rewrite([49(1)])].
% 2.98/3.29 104 f3(A,B) != C | -r2(D,B) | -r1(E) | -r2(E,D) | -r1(F) | -r2(F,A) | C != V6 | -r2(V7,V6) | -r2(E,V7). [factor(64,c,i)].
% 2.98/3.29 237 f3(A,B) != C | -r2(A,B) | -r1(D) | -r2(D,A) | C != E | -r2(F,E) | -r2(D,F). [factor(104,d,f),merge(e)].
% 2.98/3.29 454 f15(A) = c1. [resolve(41,a,26,a),flip(a)].
% 2.98/3.29 455 f13(A) = c1. [resolve(41,a,25,a),flip(a)].
% 2.98/3.29 460 r1(f3(A,c1)). [back_rewrite(65),rewrite([454(1)])].
% 2.98/3.29 462 r1(c1). [back_rewrite(26),rewrite([454(1)])].
% 2.98/3.29 463 f2(A,c1) = A. [back_rewrite(51),rewrite([455(1)])].
% 2.98/3.29 467 f10(A,B) = f1(B). [resolve(45,a,30,a),flip(a)].
% 2.98/3.29 468 f6(A,B) = f1(B). [resolve(45,a,29,a),flip(a)].
% 2.98/3.29 522 f2(f3(A,B),A) = f3(A,f1(B)). [back_rewrite(62),rewrite([467(1)]),flip(a)].
% 2.98/3.29 523 r2(A,f1(A)). [back_rewrite(30),rewrite([467(1)])].
% 2.98/3.29 524 f2(A,f1(B)) = f4(A,B). [back_rewrite(53),rewrite([468(1)])].
% 2.98/3.29 3150 f3(A,c1) = c1. [resolve(460,a,41,a),flip(a)].
% 2.98/3.29 3728 r2(A,f4(A,c1)). [para(463(a,1),66(a,1))].
% 2.98/3.29 4265 f4(A,c1) = f1(A). [resolve(3728,a,45,a),flip(a)].
% 2.98/3.29 4488 -r2(c1,f3(f1(c1),f1(c1))). [ur(237,a,522,a(flip),b,523,a,c,462,a,d,523,a,e,524,a,f,66,a),rewrite([463(8)])].
% 2.98/3.29 4491 f3(A,f1(c1)) = f2(c1,A). [para(3150(a,1),522(a,1,1)),flip(a)].
% 2.98/3.29 4494 $F. [back_rewrite(4488),rewrite([4491(6),524(5),4265(4)]),unit_del(a,523)].
% 2.98/3.29
% 2.98/3.29 % SZS output end Refutation
% 2.98/3.29 ============================== end of proof ==========================
% 2.98/3.29
% 2.98/3.29 ============================== STATISTICS ============================
% 2.98/3.29
% 2.98/3.29 Given=345. Generated=32268. Kept=4460. proofs=1.
% 2.98/3.29 Usable=334. Sos=3154. Demods=25. Limbo=3, Disabled=1012. Hints=0.
% 2.98/3.29 Megabytes=3.23.
% 2.98/3.29 User_CPU=2.19, System_CPU=0.03, Wall_clock=2.
% 2.98/3.29
% 2.98/3.29 ============================== end of statistics =====================
% 2.98/3.29
% 2.98/3.29 ============================== end of search =========================
% 2.98/3.29
% 2.98/3.29 THEOREM PROVED
% 2.98/3.29 % SZS status Theorem
% 2.98/3.29
% 2.98/3.29 Exiting with 1 proof.
% 2.98/3.29
% 2.98/3.29 Process 2471 exit (max_proofs) Thu Jun 2 10:12:02 2022
% 2.98/3.29 Prover9 interrupted
%------------------------------------------------------------------------------