TSTP Solution File: KLE007+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE007+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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 : Sun Jul 17 02:21:39 EDT 2022
% Result : Theorem 0.66s 1.03s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE007+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 13:04:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.66/0.94 ============================== Prover9 ===============================
% 0.66/0.94 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.94 Process 20493 was started by sandbox2 on n004.cluster.edu,
% 0.66/0.94 Thu Jun 16 13:04:09 2022
% 0.66/0.94 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20200_n004.cluster.edu".
% 0.66/0.94 ============================== end of head ===========================
% 0.66/0.94
% 0.66/0.94 ============================== INPUT =================================
% 0.66/0.94
% 0.66/0.94 % Reading from file /tmp/Prover9_20200_n004.cluster.edu
% 0.66/0.94
% 0.66/0.94 set(prolog_style_variables).
% 0.66/0.94 set(auto2).
% 0.66/0.94 % set(auto2) -> set(auto).
% 0.66/0.94 % set(auto) -> set(auto_inference).
% 0.66/0.94 % set(auto) -> set(auto_setup).
% 0.66/0.94 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.94 % set(auto) -> set(auto_limits).
% 0.66/0.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.94 % set(auto) -> set(auto_denials).
% 0.66/0.94 % set(auto) -> set(auto_process).
% 0.66/0.94 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.94 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.94 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.94 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.94 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.94 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.94 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.94 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.94 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.94 % set(auto2) -> assign(stats, some).
% 0.66/0.94 % set(auto2) -> clear(echo_input).
% 0.66/0.94 % set(auto2) -> set(quiet).
% 0.66/0.94 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.94 % set(auto2) -> clear(print_given).
% 0.66/0.94 assign(lrs_ticks,-1).
% 0.66/0.94 assign(sos_limit,10000).
% 0.66/0.94 assign(order,kbo).
% 0.66/0.94 set(lex_order_vars).
% 0.66/0.94 clear(print_given).
% 0.66/0.94
% 0.66/0.94 % formulas(sos). % not echoed (19 formulas)
% 0.66/0.94
% 0.66/0.94 ============================== end of input ==========================
% 0.66/0.94
% 0.66/0.94 % From the command line: assign(max_seconds, 300).
% 0.66/0.94
% 0.66/0.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.94
% 0.66/0.94 % Formulas that are not ordinary clauses:
% 0.66/0.94 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.66/0.94 14 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 17 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 18 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 19 -(all X0 all X1 (test(X1) & test(X0) -> leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) & leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.66/1.03
% 0.66/1.03 ============================== end of process non-clausal formulas ===
% 0.66/1.03
% 0.66/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/1.03
% 0.66/1.03 ============================== PREDICATE ELIMINATION =================
% 0.66/1.03 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.66/1.03 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.66/1.03 22 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 Derived: multiplication(A,f1(A)) = zero | -test(A). [resolve(22,a,20,b)].
% 0.66/1.03 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 Derived: multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.66/1.03 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 Derived: addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.66/1.03 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.66/1.03 Derived: -test(A) | c(A) != B | test(B). [resolve(25,c,21,b)].
% 0.66/1.03 Derived: -test(A) | c(A) != B | multiplication(B,A) = zero. [resolve(25,c,22,a)].
% 0.66/1.03 Derived: -test(A) | c(A) != B | multiplication(A,B) = zero. [resolve(25,c,23,a)].
% 0.66/1.03 Derived: -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.66/1.03 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.66/1.03 Derived: -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.66/1.03 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.66/1.03 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | -test(B) | c(B) = A. [resolve(27,a,26,c)].
% 0.66/1.03
% 0.66/1.03 ============================== end predicate elimination =============
% 0.66/1.03
% 0.66/1.03 Auto_denials: (non-Horn, no changes).
% 0.66/1.03
% 0.66/1.03 Term ordering decisions:
% 0.66/1.03 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. multiplication=1. addition=1. c=1. f1=1.
% 0.66/1.03
% 0.66/1.03 ============================== end of process initial clauses ========
% 0.66/1.03
% 0.66/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.66/1.03
% 0.66/1.03 ============================== end of clauses for search =============
% 0.66/1.03
% 0.66/1.03 ============================== SEARCH ================================
% 0.66/1.03
% 0.66/1.03 % Starting search at 0.01 seconds.
% 0.66/1.03
% 0.66/1.03 ============================== PROOF =================================
% 0.66/1.03 % SZS status Theorem
% 0.66/1.03 % SZS output start Refutation
% 0.66/1.03
% 0.66/1.03 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.66/1.03 % Length of proof is 70.
% 0.66/1.03 % Level of proof is 12.
% 0.66/1.03 % Maximum clause weight is 22.000.
% 0.66/1.03 % Given clauses 184.
% 0.66/1.03
% 0.66/1.03 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 14 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 17 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 18 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 0.66/1.03 19 -(all X0 all X1 (test(X1) & test(X0) -> leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))) & leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.66/1.03 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.66/1.03 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.66/1.03 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.66/1.03 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.66/1.03 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.66/1.03 28 test(c2) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.66/1.03 29 test(c1) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.66/1.03 30 addition(A,zero) = A # label(additive_identity) # label(axiom). [clausify(3)].
% 0.66/1.03 31 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(4)].
% 0.66/1.03 32 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 0.66/1.03 33 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 0.66/1.03 34 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom). [clausify(10)].
% 0.66/1.03 37 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 0.66/1.03 41 multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) # label(right_distributivity) # label(axiom). [clausify(8)].
% 0.66/1.03 42 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)). [copy(41),flip(a)].
% 0.66/1.03 43 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 0.66/1.03 44 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(43),flip(a)].
% 0.66/1.03 45 -leq(one,addition(multiplication(addition(c1,c(c1)),c2),multiplication(addition(c1,c(c1)),c(c2)))) | -leq(addition(multiplication(addition(c1,c(c1)),c2),multiplication(addition(c1,c(c1)),c(c2))),one) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.66/1.03 46 -leq(one,multiplication(addition(c1,c(c1)),addition(c2,c(c2)))) | -leq(multiplication(addition(c1,c(c1)),addition(c2,c(c2))),one). [copy(45),rewrite([42(15),42(25)])].
% 0.66/1.03 48 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 0.66/1.03 49 -test(A) | -test(B) | c(addition(A,B)) = multiplication(c(A),c(B)) # label(test_deMorgan1) # label(axiom). [clausify(17)].
% 0.66/1.03 50 -test(A) | -test(B) | multiplication(c(A),c(B)) = c(addition(A,B)). [copy(49),flip(c)].
% 0.66/1.03 51 -test(A) | -test(B) | c(multiplication(A,B)) = addition(c(A),c(B)) # label(test_deMorgan2) # label(axiom). [clausify(18)].
% 0.66/1.03 52 -test(A) | -test(B) | addition(c(A),c(B)) = c(multiplication(A,B)). [copy(51),flip(c)].
% 0.66/1.03 54 multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.66/1.03 55 addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.66/1.03 59 -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.66/1.03 60 -test(A) | c(A) != B | addition(A,B) = one. [copy(59),rewrite([37(4)])].
% 0.66/1.03 61 -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.66/1.03 62 multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.66/1.03 64 -test(A) | multiplication(c(A),c(A)) = c(A). [factor(50,a,b),rewrite([31(5)])].
% 0.66/1.03 74 leq(A,A). [resolve(48,b,31,a)].
% 0.66/1.03 85 -test(A) | addition(c(A),c(c1)) = c(multiplication(c1,A)). [resolve(52,a,29,a),rewrite([37(5)])].
% 0.66/1.03 86 -test(A) | addition(c(A),c(c2)) = c(multiplication(c2,A)). [resolve(52,a,28,a),rewrite([37(5)])].
% 0.66/1.03 109 c(c1) != A | addition(A,c1) = one. [resolve(60,a,29,a),rewrite([37(5)])].
% 0.66/1.03 110 c(c2) != A | addition(A,c2) = one. [resolve(60,a,28,a),rewrite([37(5)])].
% 0.66/1.03 114 test(one). [resolve(62,c,30,a),rewrite([34(3),32(6)]),xx(a),xx(b)].
% 0.66/1.03 127 multiplication(c(c1),c(c1)) = c(c1). [resolve(64,a,29,a)].
% 0.66/1.03 128 multiplication(c(c2),c(c2)) = c(c2). [resolve(64,a,28,a)].
% 0.66/1.03 140 addition(one,f1(one)) = one. [resolve(114,a,55,b)].
% 0.66/1.03 141 f1(one) = zero. [resolve(114,a,54,b),rewrite([32(4)])].
% 0.66/1.03 145 addition(zero,one) = one. [back_rewrite(140),rewrite([141(3),37(3)])].
% 0.66/1.03 146 -test(zero) | c(zero) = one. [para(141(a,1),61(a,1)),rewrite([141(4)]),unit_del(c,114)].
% 0.66/1.03 151 test(zero). [resolve(145,a,62,c),rewrite([32(3),34(6)]),xx(a),xx(b)].
% 0.66/1.03 153 c(zero) = one. [back_unit_del(146),unit_del(a,151)].
% 0.66/1.03 536 addition(one,c(c1)) = one. [resolve(85,a,151,a),rewrite([153(2),34(7),153(6)])].
% 0.66/1.03 540 addition(A,multiplication(c(c1),A)) = A. [para(536(a,1),44(a,2,1)),rewrite([33(2),33(6)])].
% 0.66/1.03 558 addition(one,c(c2)) = one. [resolve(86,a,151,a),rewrite([153(2),34(7),153(6)])].
% 0.66/1.03 562 addition(A,multiplication(c(c2),A)) = A. [para(558(a,1),44(a,2,1)),rewrite([33(2),33(6)])].
% 0.66/1.03 1013 addition(c1,c(c1)) = one. [resolve(109,a,540,a(flip)),rewrite([127(7),31(5),37(4)])].
% 0.66/1.03 1019 -leq(one,addition(c2,c(c2))) | -leq(addition(c2,c(c2)),one). [back_rewrite(46),rewrite([1013(5),33(7),1013(10),33(12)])].
% 0.66/1.03 1042 addition(c2,c(c2)) = one. [resolve(110,a,562,a(flip)),rewrite([128(7),31(5),37(4)])].
% 0.66/1.03 1044 $F. [back_rewrite(1019),rewrite([1042(5),1042(7)]),merge(b),unit_del(a,74)].
% 0.66/1.03
% 0.66/1.03 % SZS output end Refutation
% 0.66/1.03 ============================== end of proof ==========================
% 0.66/1.03
% 0.66/1.03 ============================== STATISTICS ============================
% 0.66/1.03
% 0.66/1.03 Given=184. Generated=3085. Kept=1009. proofs=1.
% 0.66/1.03 Usable=169. Sos=662. Demods=368. Limbo=2, Disabled=213. Hints=0.
% 0.66/1.03 Megabytes=0.99.
% 0.66/1.03 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.66/1.03
% 0.66/1.03 ============================== end of statistics =====================
% 0.66/1.03
% 0.66/1.03 ============================== end of search =========================
% 0.66/1.03
% 0.66/1.03 THEOREM PROVED
% 0.66/1.03 % SZS status Theorem
% 0.66/1.03
% 0.66/1.03 Exiting with 1 proof.
% 0.66/1.03
% 0.66/1.03 Process 20493 exit (max_proofs) Thu Jun 16 13:04:09 2022
% 0.66/1.03 Prover9 interrupted
%------------------------------------------------------------------------------