TSTP Solution File: GRP298-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP298-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : Sat Jul 16 11:18:32 EDT 2022
% Result : Unsatisfiable 1.26s 1.53s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP298-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 05:04:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.26/1.53 ============================== Prover9 ===============================
% 1.26/1.53 Prover9 (32) version 2009-11A, November 2009.
% 1.26/1.53 Process 28278 was started by sandbox on n024.cluster.edu,
% 1.26/1.53 Tue Jun 14 05:04:04 2022
% 1.26/1.53 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28123_n024.cluster.edu".
% 1.26/1.53 ============================== end of head ===========================
% 1.26/1.53
% 1.26/1.53 ============================== INPUT =================================
% 1.26/1.53
% 1.26/1.53 % Reading from file /tmp/Prover9_28123_n024.cluster.edu
% 1.26/1.53
% 1.26/1.53 set(prolog_style_variables).
% 1.26/1.53 set(auto2).
% 1.26/1.53 % set(auto2) -> set(auto).
% 1.26/1.53 % set(auto) -> set(auto_inference).
% 1.26/1.53 % set(auto) -> set(auto_setup).
% 1.26/1.53 % set(auto_setup) -> set(predicate_elim).
% 1.26/1.53 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.26/1.53 % set(auto) -> set(auto_limits).
% 1.26/1.53 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.26/1.53 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.26/1.53 % set(auto) -> set(auto_denials).
% 1.26/1.53 % set(auto) -> set(auto_process).
% 1.26/1.53 % set(auto2) -> assign(new_constants, 1).
% 1.26/1.53 % set(auto2) -> assign(fold_denial_max, 3).
% 1.26/1.53 % set(auto2) -> assign(max_weight, "200.000").
% 1.26/1.53 % set(auto2) -> assign(max_hours, 1).
% 1.26/1.53 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.26/1.53 % set(auto2) -> assign(max_seconds, 0).
% 1.26/1.53 % set(auto2) -> assign(max_minutes, 5).
% 1.26/1.53 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.26/1.53 % set(auto2) -> set(sort_initial_sos).
% 1.26/1.53 % set(auto2) -> assign(sos_limit, -1).
% 1.26/1.53 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.26/1.53 % set(auto2) -> assign(max_megs, 400).
% 1.26/1.53 % set(auto2) -> assign(stats, some).
% 1.26/1.53 % set(auto2) -> clear(echo_input).
% 1.26/1.53 % set(auto2) -> set(quiet).
% 1.26/1.53 % set(auto2) -> clear(print_initial_clauses).
% 1.26/1.53 % set(auto2) -> clear(print_given).
% 1.26/1.53 assign(lrs_ticks,-1).
% 1.26/1.53 assign(sos_limit,10000).
% 1.26/1.53 assign(order,kbo).
% 1.26/1.53 set(lex_order_vars).
% 1.26/1.53 clear(print_given).
% 1.26/1.53
% 1.26/1.53 % formulas(sos). % not echoed (36 formulas)
% 1.26/1.53
% 1.26/1.53 ============================== end of input ==========================
% 1.26/1.53
% 1.26/1.53 % From the command line: assign(max_seconds, 300).
% 1.26/1.53
% 1.26/1.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.26/1.53
% 1.26/1.53 % Formulas that are not ordinary clauses:
% 1.26/1.53
% 1.26/1.53 ============================== end of process non-clausal formulas ===
% 1.26/1.53
% 1.26/1.53 ============================== PROCESS INITIAL CLAUSES ===============
% 1.26/1.53
% 1.26/1.53 ============================== PREDICATE ELIMINATION =================
% 1.26/1.53
% 1.26/1.53 ============================== end predicate elimination =============
% 1.26/1.53
% 1.26/1.53 Auto_denials: (non-Horn, no changes).
% 1.26/1.53
% 1.26/1.53 Term ordering decisions:
% 1.26/1.53
% 1.26/1.53 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.26/1.53 Function symbol KB weights: sk_c8=1. sk_c7=1. sk_c6=1. sk_c1=1. sk_c5=1. sk_c2=1. sk_c3=1. sk_c4=1. identity=1. multiply=1. inverse=0.
% 1.26/1.53
% 1.26/1.53 ============================== end of process initial clauses ========
% 1.26/1.53
% 1.26/1.53 ============================== CLAUSES FOR SEARCH ====================
% 1.26/1.53
% 1.26/1.53 ============================== end of clauses for search =============
% 1.26/1.53
% 1.26/1.53 ============================== SEARCH ================================
% 1.26/1.53
% 1.26/1.53 % Starting search at 0.02 seconds.
% 1.26/1.53
% 1.26/1.53 ============================== PROOF =================================
% 1.26/1.53 % SZS status Unsatisfiable
% 1.26/1.53 % SZS output start Refutation
% 1.26/1.53
% 1.26/1.53 % Proof 1 at 0.54 (+ 0.01) seconds.
% 1.26/1.53 % Length of proof is 76.
% 1.26/1.53 % Level of proof is 23.
% 1.26/1.53 % Maximum clause weight is 56.000.
% 1.26/1.53 % Given clauses 225.
% 1.26/1.53
% 1.26/1.53 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.26/1.53 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.26/1.53 5 inverse(sk_c1) = sk_c8 | inverse(sk_c4) = sk_c5 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 1.26/1.53 7 multiply(sk_c8,sk_c7) = sk_c6 | inverse(sk_c3) = sk_c8 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.26/1.53 9 multiply(sk_c1,sk_c8) = sk_c7 | inverse(sk_c2) = sk_c8 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 1.26/1.53 14 inverse(sk_c1) = sk_c8 | multiply(sk_c3,sk_c7) = sk_c8 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.26/1.53 15 inverse(sk_c1) = sk_c8 | multiply(sk_c4,sk_c5) = sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.26/1.53 18 multiply(sk_c6,sk_c8) = sk_c7 | inverse(sk_c3) = sk_c8 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 1.26/1.53 21 multiply(sk_c8,sk_c7) = sk_c6 | multiply(sk_c8,sk_c6) = sk_c7 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 1.26/1.53 22 multiply(sk_c8,sk_c7) = sk_c6 | multiply(sk_c3,sk_c7) = sk_c8 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.26/1.53 25 multiply(sk_c1,sk_c8) = sk_c7 | multiply(sk_c2,sk_c8) = sk_c7 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.26/1.53 31 multiply(sk_c6,sk_c8) = sk_c7 | multiply(sk_c8,sk_c6) = sk_c7 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.26/1.53 35 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.26/1.53 36 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | multiply(D,E) != sk_c7 | inverse(D) != E | multiply(E,sk_c6) != sk_c7 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 1.26/1.53 38 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(B) != sk_c8 | multiply(B,sk_c7) != sk_c8 | multiply(C,D) != sk_c7 | inverse(C) != D | multiply(D,sk_c6) != sk_c7. [factor(36,b,e),merge(e)].
% 1.26/1.53 42 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(B) != sk_c8 | multiply(B,sk_c7) != sk_c8. [factor(38,b,h),merge(h),merge(i)].
% 1.26/1.53 50 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c4) = identity. [para(5(b,1),2(a,1,1))].
% 1.26/1.53 51 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),35(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.26/1.53 54 inverse(sk_c3) = sk_c8 | multiply(sk_c8,multiply(sk_c7,A)) = multiply(sk_c6,A). [para(7(a,1),35(a,1,1)),flip(b)].
% 1.26/1.53 122 multiply(sk_c8,sk_c7) != sk_c6 | identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8. [para(2(a,1),42(b,1))].
% 1.26/1.53 127 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,multiply(B,sk_c8)) != sk_c7 | inverse(multiply(A,B)) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8. [para(35(a,1),42(b,1))].
% 1.26/1.53 151 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,multiply(B,sk_c8)) != sk_c7 | inverse(multiply(A,B)) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | multiply(A,multiply(B,sk_c7)) != sk_c8. [factor(127,c,f),rewrite([35(27)])].
% 1.26/1.53 168 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),51(a,1,2))].
% 1.26/1.53 183 inverse(sk_c3) = sk_c8 | multiply(inverse(sk_c6),sk_c7) = sk_c8. [para(18(a,1),51(a,1,2))].
% 1.26/1.53 186 multiply(sk_c8,sk_c7) = sk_c6 | multiply(inverse(sk_c8),sk_c7) = sk_c6. [para(21(b,1),51(a,1,2))].
% 1.26/1.53 202 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(51(a,1),51(a,1,2))].
% 1.26/1.53 203 multiply(A,identity) = A. [back_rewrite(168),rewrite([202(4)])].
% 1.26/1.53 206 inverse(identity) = identity. [para(203(a,1),2(a,1))].
% 1.26/1.53 224 multiply(sk_c8,sk_c7) != sk_c6 | identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(A,B)) != sk_c8 | multiply(A,multiply(B,sk_c7)) != sk_c8. [para(35(a,1),122(g,1))].
% 1.26/1.53 246 inverse(sk_c1) = sk_c8 | inverse(sk_c5) = sk_c4. [para(50(b,1),51(a,1,2)),rewrite([203(8)])].
% 1.26/1.53 247 inverse(sk_c1) = sk_c8 | multiply(sk_c4,sk_c5) = identity. [para(246(b,1),2(a,1,1))].
% 1.26/1.53 249 multiply(A,inverse(A)) = identity. [para(202(a,1),2(a,1))].
% 1.26/1.53 258 inverse(inverse(A)) = A. [para(202(a,1),203(a,1)),rewrite([203(2)]),flip(a)].
% 1.26/1.53 266 multiply(sk_c8,sk_c7) != sk_c6 | identity != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(A,B)) != sk_c8 | multiply(A,multiply(B,sk_c7)) != sk_c8. [back_rewrite(224),rewrite([258(11)]),xx(c)].
% 1.26/1.53 279 multiply(sk_c8,sk_c7) != sk_c6 | identity != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(A,inverse(sk_c7))) != sk_c8 | sk_c8 != A. [para(2(a,1),266(f,1,2)),rewrite([203(26)]),flip(f)].
% 1.26/1.53 362 inverse(sk_c3) = sk_c8 | multiply(sk_c6,inverse(sk_c7)) = sk_c8. [para(249(a,1),54(b,1,2)),rewrite([203(7)]),flip(b)].
% 1.26/1.53 457 multiply(sk_c8,sk_c7) != sk_c6 | multiply(A,multiply(inverse(sk_c7),sk_c8)) != sk_c7 | inverse(multiply(A,inverse(sk_c7))) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | sk_c8 != A. [para(2(a,1),151(f,1,2)),rewrite([203(30)]),flip(f)].
% 1.26/1.53 467 multiply(sk_c8,sk_c7) != sk_c6 | identity != sk_c7 | inverse(multiply(inverse(multiply(inverse(sk_c7),sk_c8)),inverse(sk_c7))) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(inverse(sk_c7),sk_c8)) != sk_c8. [para(2(a,1),457(b,1)),flip(f)].
% 1.26/1.53 472 inverse(sk_c1) = sk_c8 | identity = sk_c7. [para(247(b,1),15(b,1)),merge(b)].
% 1.26/1.53 479 identity = sk_c7 | multiply(sk_c1,sk_c8) = identity. [para(472(a,1),249(a,1,2))].
% 1.26/1.53 592 identity = sk_c7 | inverse(sk_c2) = sk_c8. [para(479(b,1),9(a,1)),merge(b)].
% 1.26/1.53 602 identity = sk_c7 | multiply(sk_c2,sk_c8) = identity. [para(592(b,1),249(a,1,2))].
% 1.26/1.53 1038 identity = sk_c7 | multiply(sk_c1,sk_c8) = sk_c7. [para(602(b,1),25(b,1)),merge(c)].
% 1.26/1.53 2209 identity = sk_c7. [para(1038(b,1),479(b,1)),flip(c),merge(b),merge(c)].
% 1.26/1.53 2881 multiply(sk_c8,sk_c7) != sk_c6 | inverse(multiply(inverse(multiply(inverse(sk_c7),sk_c8)),inverse(sk_c7))) != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(inverse(sk_c7),sk_c8)) != sk_c8. [back_rewrite(467),rewrite([2209(6)]),xx(b)].
% 1.26/1.53 3000 multiply(sk_c8,sk_c7) != sk_c6 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(multiply(A,inverse(sk_c7))) != sk_c8 | sk_c8 != A. [back_rewrite(279),rewrite([2209(6)]),xx(b)].
% 1.26/1.53 3022 inverse(sk_c7) = sk_c7. [back_rewrite(206),rewrite([2209(1),2209(3)])].
% 1.26/1.53 3023 multiply(A,sk_c7) = A. [back_rewrite(203),rewrite([2209(1)])].
% 1.26/1.53 3028 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([2209(1)])].
% 1.26/1.53 3045 sk_c6 != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(A) != sk_c8 | sk_c8 != A. [back_rewrite(3000),rewrite([3023(3),3022(15),3023(15)]),flip(a)].
% 1.26/1.53 3052 sk_c6 != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | inverse(sk_c8) != sk_c8. [back_rewrite(2881),rewrite([3023(3),3022(5),3028(6),3022(7),3023(7),258(6),3022(18),3028(19)]),flip(a),xx(b)].
% 1.26/1.53 3115 inverse(sk_c3) = sk_c8 | sk_c6 = sk_c8. [back_rewrite(362),rewrite([3022(7),3023(7)])].
% 1.26/1.53 3324 sk_c6 = sk_c8 | inverse(sk_c8) = sk_c6. [back_rewrite(186),rewrite([3023(3),3023(7)]),flip(a)].
% 1.26/1.53 3326 inverse(sk_c3) = sk_c8 | inverse(sk_c6) = sk_c8. [back_rewrite(183),rewrite([3023(8)])].
% 1.26/1.53 3367 sk_c6 = sk_c8 | sk_c3 = sk_c8. [back_rewrite(22),rewrite([3023(3),3023(6)]),flip(a)].
% 1.26/1.53 3370 inverse(sk_c1) = sk_c8 | sk_c3 = sk_c8. [back_rewrite(14),rewrite([3023(7)])].
% 1.26/1.53 3437 sk_c6 = sk_c8 | inverse(sk_c8) = sk_c3. [para(3115(a,1),258(a,1,1))].
% 1.26/1.53 3462 sk_c3 = sk_c8 | sk_c6 != sk_c8 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(sk_c8,sk_c6) != sk_c7 | sk_c1 != sk_c8. [resolve(3370,a,3045,d),flip(e)].
% 1.26/1.53 3464 sk_c3 = sk_c8 | inverse(sk_c8) = sk_c1. [para(3370(a,1),258(a,1,1))].
% 1.26/1.53 3470 sk_c6 = sk_c8 | sk_c3 = sk_c6. [para(3437(b,1),3324(b,1)),merge(b)].
% 1.26/1.53 3471 sk_c6 = sk_c8. [para(3470(b,1),3367(b,1)),merge(b),merge(c)].
% 1.26/1.53 3472 sk_c3 = sk_c8 | multiply(sk_c8,sk_c8) != sk_c7 | sk_c1 != sk_c8. [back_rewrite(3462),rewrite([3471(4),3471(7),3471(13)]),xx(b),merge(c)].
% 1.26/1.53 3518 inverse(sk_c3) = sk_c8 | inverse(sk_c8) = sk_c8. [back_rewrite(3326),rewrite([3471(5)])].
% 1.26/1.53 3671 multiply(sk_c8,sk_c8) != sk_c7 | inverse(sk_c8) != sk_c8. [back_rewrite(3052),rewrite([3471(1),3471(4),3471(10)]),xx(a),merge(b)].
% 1.26/1.53 3673 multiply(sk_c8,sk_c8) != sk_c7 | inverse(A) != sk_c8 | sk_c8 != A. [back_rewrite(3045),rewrite([3471(1),3471(4),3471(10)]),xx(a),merge(b)].
% 1.26/1.53 3678 multiply(sk_c8,sk_c8) = sk_c7. [back_rewrite(31),rewrite([3471(1),3471(7)]),merge(b)].
% 1.26/1.53 3682 inverse(A) != sk_c8 | sk_c8 != A. [back_rewrite(3673),rewrite([3678(3)]),xx(a)].
% 1.26/1.53 3684 inverse(sk_c8) != sk_c8. [back_rewrite(3671),rewrite([3678(3)]),xx(a)].
% 1.26/1.53 3814 sk_c3 = sk_c8 | sk_c1 != sk_c8. [back_rewrite(3472),rewrite([3678(6)]),xx(b)].
% 1.26/1.53 3816 inverse(sk_c3) = sk_c8. [back_unit_del(3518),unit_del(b,3684)].
% 1.26/1.53 3831 sk_c3 != sk_c8. [resolve(3816,a,3682,a),flip(a)].
% 1.26/1.53 3833 inverse(sk_c8) = sk_c3. [para(3816(a,1),258(a,1,1))].
% 1.26/1.53 3837 sk_c1 != sk_c8. [back_unit_del(3814),unit_del(a,3831)].
% 1.26/1.53 3840 sk_c3 = sk_c1. [back_unit_del(3464),rewrite([3833(5)]),unit_del(a,3831)].
% 1.26/1.53 3842 inverse(sk_c8) = sk_c1. [back_rewrite(3833),rewrite([3840(3)])].
% 1.26/1.53 3852 $F. [para(3678(a,1),51(a,1,2)),rewrite([3842(2),3023(3)]),unit_del(a,3837)].
% 1.26/1.53
% 1.26/1.53 % SZS output end Refutation
% 1.26/1.53 ============================== end of proof ==========================
% 1.26/1.53
% 1.26/1.53 ============================== STATISTICS ============================
% 1.26/1.53
% 1.26/1.53 Given=225. Generated=7666. Kept=3851. proofs=1.
% 1.26/1.53 Usable=23. Sos=14. Demods=33. Limbo=1, Disabled=3849. Hints=0.
% 1.26/1.53 Megabytes=4.31.
% 1.26/1.53 User_CPU=0.54, System_CPU=0.01, Wall_clock=0.
% 1.26/1.53
% 1.26/1.53 ============================== end of statistics =====================
% 1.26/1.53
% 1.26/1.53 ============================== end of search =========================
% 1.26/1.53
% 1.26/1.53 THEOREM PROVED
% 1.26/1.53 % SZS status Unsatisfiable
% 1.26/1.53
% 1.26/1.53 Exiting with 1 proof.
% 1.26/1.53
% 1.26/1.53 Process 28278 exit (max_proofs) Tue Jun 14 05:04:04 2022
% 1.26/1.53 Prover9 interrupted
%------------------------------------------------------------------------------