TSTP Solution File: BOO023-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO023-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 14 23:48:03 EDT 2022
% Result : Unsatisfiable 1.57s 1.83s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO023-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n019.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 : Wed Jun 1 21:02:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.57/1.83 ============================== Prover9 ===============================
% 1.57/1.83 Prover9 (32) version 2009-11A, November 2009.
% 1.57/1.83 Process 26322 was started by sandbox on n019.cluster.edu,
% 1.57/1.83 Wed Jun 1 21:02:56 2022
% 1.57/1.83 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26168_n019.cluster.edu".
% 1.57/1.83 ============================== end of head ===========================
% 1.57/1.83
% 1.57/1.83 ============================== INPUT =================================
% 1.57/1.83
% 1.57/1.83 % Reading from file /tmp/Prover9_26168_n019.cluster.edu
% 1.57/1.83
% 1.57/1.83 set(prolog_style_variables).
% 1.57/1.83 set(auto2).
% 1.57/1.83 % set(auto2) -> set(auto).
% 1.57/1.83 % set(auto) -> set(auto_inference).
% 1.57/1.83 % set(auto) -> set(auto_setup).
% 1.57/1.83 % set(auto_setup) -> set(predicate_elim).
% 1.57/1.83 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.57/1.83 % set(auto) -> set(auto_limits).
% 1.57/1.83 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.57/1.83 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.57/1.83 % set(auto) -> set(auto_denials).
% 1.57/1.83 % set(auto) -> set(auto_process).
% 1.57/1.83 % set(auto2) -> assign(new_constants, 1).
% 1.57/1.83 % set(auto2) -> assign(fold_denial_max, 3).
% 1.57/1.83 % set(auto2) -> assign(max_weight, "200.000").
% 1.57/1.83 % set(auto2) -> assign(max_hours, 1).
% 1.57/1.83 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.57/1.83 % set(auto2) -> assign(max_seconds, 0).
% 1.57/1.83 % set(auto2) -> assign(max_minutes, 5).
% 1.57/1.83 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.57/1.83 % set(auto2) -> set(sort_initial_sos).
% 1.57/1.83 % set(auto2) -> assign(sos_limit, -1).
% 1.57/1.83 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.57/1.83 % set(auto2) -> assign(max_megs, 400).
% 1.57/1.83 % set(auto2) -> assign(stats, some).
% 1.57/1.83 % set(auto2) -> clear(echo_input).
% 1.57/1.83 % set(auto2) -> set(quiet).
% 1.57/1.83 % set(auto2) -> clear(print_initial_clauses).
% 1.57/1.83 % set(auto2) -> clear(print_given).
% 1.57/1.83 assign(lrs_ticks,-1).
% 1.57/1.83 assign(sos_limit,10000).
% 1.57/1.83 assign(order,kbo).
% 1.57/1.83 set(lex_order_vars).
% 1.57/1.83 clear(print_given).
% 1.57/1.83
% 1.57/1.83 % formulas(sos). % not echoed (8 formulas)
% 1.57/1.83
% 1.57/1.83 ============================== end of input ==========================
% 1.57/1.83
% 1.57/1.83 % From the command line: assign(max_seconds, 300).
% 1.57/1.83
% 1.57/1.83 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.57/1.83
% 1.57/1.83 % Formulas that are not ordinary clauses:
% 1.57/1.83
% 1.57/1.83 ============================== end of process non-clausal formulas ===
% 1.57/1.83
% 1.57/1.83 ============================== PROCESS INITIAL CLAUSES ===============
% 1.57/1.83
% 1.57/1.83 ============================== PREDICATE ELIMINATION =================
% 1.57/1.83
% 1.57/1.83 ============================== end predicate elimination =============
% 1.57/1.83
% 1.57/1.83 Auto_denials:
% 1.57/1.83 % copying label prove_add_multiply_property to answer in negative clause
% 1.57/1.83
% 1.57/1.83 Term ordering decisions:
% 1.57/1.83
% 1.57/1.83 % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 1.57/1.83 Function symbol KB weights: n1=1. a=1. b=1. c=1. multiply=1. add=1. pixley=1. inverse=0.
% 1.57/1.83
% 1.57/1.83 ============================== end of process initial clauses ========
% 1.57/1.83
% 1.57/1.83 ============================== CLAUSES FOR SEARCH ====================
% 1.57/1.83
% 1.57/1.83 ============================== end of clauses for search =============
% 1.57/1.83
% 1.57/1.83 ============================== SEARCH ================================
% 1.57/1.83
% 1.57/1.83 % Starting search at 0.01 seconds.
% 1.57/1.83
% 1.57/1.83 ============================== PROOF =================================
% 1.57/1.83 % SZS status Unsatisfiable
% 1.57/1.83 % SZS output start Refutation
% 1.57/1.83
% 1.57/1.83 % Proof 1 at 0.85 (+ 0.03) seconds: prove_add_multiply_property.
% 1.57/1.83 % Length of proof is 106.
% 1.57/1.83 % Level of proof is 41.
% 1.57/1.83 % Maximum clause weight is 23.000.
% 1.57/1.83 % Given clauses 299.
% 1.57/1.83
% 1.57/1.83 1 add(A,inverse(A)) = n1 # label(additive_inverse) # label(axiom). [assumption].
% 1.57/1.83 2 pixley(A,A,B) = B # label(pixley1) # label(axiom). [assumption].
% 1.57/1.83 3 pixley(A,B,B) = A # label(pixley2) # label(axiom). [assumption].
% 1.57/1.83 4 pixley(A,B,A) = A # label(pixley3) # label(axiom). [assumption].
% 1.57/1.83 5 multiply(add(A,B),B) = B # label(multiply_add) # label(axiom). [assumption].
% 1.57/1.83 6 multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)) # label(multiply_add_property) # label(axiom). [assumption].
% 1.57/1.83 7 add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)). [copy(6),flip(a)].
% 1.57/1.83 8 pixley(A,B,C) = add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))) # label(pixley_defn) # label(axiom). [assumption].
% 1.57/1.83 9 pixley(A,B,C) = add(multiply(A,inverse(B)),multiply(C,add(A,inverse(B)))). [copy(8),rewrite([7(7)])].
% 1.57/1.83 10 add(a,multiply(b,c)) != multiply(add(a,b),add(a,c)) # label(prove_add_multiply_property) # label(negated_conjecture) # answer(prove_add_multiply_property). [assumption].
% 1.57/1.83 11 multiply(add(a,b),add(a,c)) != add(a,multiply(b,c)) # answer(prove_add_multiply_property). [copy(10),flip(a)].
% 1.57/1.83 12 add(multiply(A,inverse(B)),multiply(A,add(A,inverse(B)))) = A. [back_rewrite(4),rewrite([9(1)])].
% 1.57/1.83 13 add(multiply(A,inverse(B)),multiply(B,add(A,inverse(B)))) = A. [back_rewrite(3),rewrite([9(1)])].
% 1.57/1.83 14 add(multiply(A,inverse(A)),multiply(B,n1)) = B. [back_rewrite(2),rewrite([9(1),1(4)])].
% 1.57/1.83 15 multiply(n1,inverse(A)) = inverse(A). [para(1(a,1),5(a,1,1))].
% 1.57/1.83 16 multiply(multiply(A,add(B,C)),multiply(C,A)) = multiply(C,A). [para(7(a,1),5(a,1,1))].
% 1.57/1.83 17 multiply(A,add(add(B,A),C)) = add(A,multiply(C,A)). [para(5(a,1),7(a,1,1)),flip(a)].
% 1.57/1.83 18 multiply(A,add(B,add(C,A))) = add(multiply(B,A),A). [para(5(a,1),7(a,1,2)),flip(a)].
% 1.57/1.83 22 multiply(A,multiply(B,add(A,inverse(B)))) = multiply(B,add(A,inverse(B))). [para(13(a,1),5(a,1,1))].
% 1.57/1.83 24 multiply(A,multiply(A,n1)) = multiply(A,n1). [para(14(a,1),5(a,1,1))].
% 1.57/1.83 25 add(multiply(A,inverse(A)),n1) = add(B,n1). [para(5(a,1),14(a,1,2))].
% 1.57/1.83 26 add(multiply(A,inverse(A)),n1) = c_0. [new_symbol(25)].
% 1.57/1.83 27 add(A,n1) = c_0. [back_rewrite(25),rewrite([26(4)]),flip(a)].
% 1.57/1.83 29 add(multiply(A,inverse(B)),inverse(B)) = multiply(inverse(B),c_0). [para(15(a,1),7(a,1,2)),rewrite([27(7)])].
% 1.57/1.83 30 add(inverse(A),multiply(n1,add(n1,inverse(A)))) = n1. [para(15(a,1),12(a,1,1))].
% 1.57/1.83 31 add(inverse(A),multiply(A,add(n1,inverse(A)))) = n1. [para(15(a,1),13(a,1,1))].
% 1.57/1.83 32 add(inverse(n1),multiply(A,n1)) = A. [para(15(a,1),14(a,1,1))].
% 1.57/1.83 33 multiply(c_0,n1) = n1. [para(27(a,1),5(a,1,1))].
% 1.57/1.83 35 multiply(n1,add(A,c_0)) = c_0. [para(33(a,1),7(a,1,2)),rewrite([27(4)]),flip(a)].
% 1.57/1.83 37 add(multiply(A,add(B,c_0)),c_0) = c_0. [para(35(a,1),7(a,1,2)),rewrite([27(9),5(9)])].
% 1.57/1.83 46 multiply(multiply(inverse(A),c_0),inverse(A)) = inverse(A). [para(15(a,1),16(a,1,2)),rewrite([27(3),15(8)])].
% 1.57/1.83 48 multiply(c_0,c_0) = c_0. [para(35(a,1),16(a,1,2)),rewrite([27(4),5(4),35(7)])].
% 1.57/1.83 50 add(multiply(A,c_0),c_0) = multiply(c_0,add(A,c_0)). [para(48(a,1),7(a,1,2))].
% 1.57/1.83 56 multiply(n1,c_0) = c_0. [para(37(a,1),35(a,1,2))].
% 1.57/1.83 59 multiply(c_0,add(A,c_0)) = c_0. [para(37(a,1),37(a,1,1,2)),rewrite([50(4)])].
% 1.57/1.83 60 add(multiply(A,c_0),c_0) = c_0. [back_rewrite(50),rewrite([59(8)])].
% 1.57/1.83 69 multiply(inverse(A),c_0) = add(inverse(A),inverse(A)). [para(15(a,1),17(a,2,2)),rewrite([27(5)])].
% 1.57/1.83 70 add(A,multiply(n1,A)) = multiply(A,c_0). [para(27(a,1),17(a,1,2)),flip(a)].
% 1.57/1.83 76 add(multiply(A,add(B,add(C,D))),add(multiply(B,D),D)) = multiply(add(B,add(C,D)),add(A,D)). [para(18(a,1),7(a,1,2))].
% 1.57/1.83 81 multiply(multiply(n1,n1),c_0) = c_0. [para(24(a,1),70(a,1,2)),rewrite([7(7),27(4),56(3)]),flip(a)].
% 1.57/1.83 82 add(multiply(n1,A),multiply(B,multiply(n1,A))) = multiply(multiply(n1,A),add(multiply(A,c_0),B)). [para(70(a,1),17(a,1,2,1)),flip(a)].
% 1.57/1.83 83 add(A,multiply(multiply(n1,add(B,A)),A)) = multiply(A,multiply(add(B,A),c_0)). [para(70(a,1),17(a,1,2)),flip(a)].
% 1.57/1.83 84 add(multiply(A,multiply(n1,B)),multiply(n1,B)) = multiply(multiply(n1,B),add(A,multiply(B,c_0))). [para(70(a,1),18(a,1,2,2)),flip(a)].
% 1.57/1.83 86 multiply(c_0,add(A,multiply(n1,n1))) = c_0. [para(81(a,1),7(a,1,2)),rewrite([60(4)]),flip(a)].
% 1.57/1.83 95 c_0 = n1. [para(14(a,1),86(a,1,2)),rewrite([33(3)]),flip(a)].
% 1.57/1.83 98 add(multiply(A,multiply(n1,B)),multiply(n1,B)) = multiply(multiply(n1,B),add(A,multiply(B,n1))). [back_rewrite(84),rewrite([95(9)])].
% 1.57/1.83 99 add(A,multiply(multiply(n1,add(B,A)),A)) = multiply(A,multiply(add(B,A),n1)). [back_rewrite(83),rewrite([95(7)])].
% 1.57/1.83 100 add(multiply(n1,A),multiply(B,multiply(n1,A))) = multiply(multiply(n1,A),add(multiply(A,n1),B)). [back_rewrite(82),rewrite([95(9)])].
% 1.57/1.83 102 add(A,multiply(n1,A)) = multiply(A,n1). [back_rewrite(70),rewrite([95(4)])].
% 1.57/1.83 103 multiply(inverse(A),n1) = add(inverse(A),inverse(A)). [back_rewrite(69),rewrite([95(2)])].
% 1.57/1.83 105 multiply(multiply(inverse(A),n1),inverse(A)) = inverse(A). [back_rewrite(46),rewrite([95(2)])].
% 1.57/1.83 107 add(multiply(A,inverse(B)),inverse(B)) = multiply(inverse(B),n1). [back_rewrite(29),rewrite([95(6)])].
% 1.57/1.83 108 add(A,n1) = n1. [back_rewrite(27),rewrite([95(3)])].
% 1.57/1.83 109 add(add(inverse(A),inverse(A)),multiply(B,n1)) = multiply(n1,add(inverse(A),B)). [para(103(a,1),7(a,1,1))].
% 1.57/1.83 110 add(multiply(A,n1),add(inverse(B),inverse(B))) = multiply(n1,add(A,inverse(B))). [para(103(a,1),7(a,1,2))].
% 1.57/1.83 113 add(multiply(inverse(A),inverse(A)),multiply(inverse(A),n1)) = inverse(A). [para(103(a,2),12(a,1,2,2)),rewrite([24(8)])].
% 1.57/1.83 116 add(inverse(n1),add(inverse(A),inverse(A))) = inverse(A). [para(103(a,1),32(a,1,2))].
% 1.57/1.83 120 multiply(n1,add(n1,inverse(A))) = add(n1,add(inverse(A),inverse(A))). [para(103(a,1),17(a,2,2)),rewrite([108(3)])].
% 1.57/1.83 125 add(inverse(A),multiply(multiply(inverse(A),n1),add(multiply(inverse(A),n1),inverse(A)))) = multiply(inverse(A),n1). [para(105(a,1),12(a,1,1))].
% 1.57/1.83 136 multiply(inverse(A),inverse(A)) = multiply(inverse(A),n1). [para(116(a,1),18(a,1,2)),rewrite([107(9)])].
% 1.57/1.83 138 add(multiply(A,inverse(B)),multiply(inverse(B),n1)) = multiply(inverse(B),add(A,inverse(B))). [para(136(a,1),7(a,1,2))].
% 1.57/1.83 148 multiply(inverse(A),multiply(inverse(A),inverse(A))) = multiply(inverse(A),n1). [para(136(a,2),24(a,1,2))].
% 1.57/1.83 152 add(inverse(A),inverse(A)) = multiply(inverse(A),inverse(A)). [para(136(a,2),102(a,2)),rewrite([15(4)])].
% 1.57/1.83 154 multiply(inverse(A),n1) = inverse(A). [back_rewrite(113),rewrite([138(7),152(4),148(5)])].
% 1.57/1.83 156 multiply(inverse(A),inverse(A)) = inverse(A). [back_rewrite(125),rewrite([154(4),154(5),152(5),148(6),154(4),152(3),154(6)])].
% 1.57/1.83 162 multiply(n1,add(n1,inverse(A))) = add(n1,inverse(A)). [back_rewrite(120),rewrite([152(9),156(9)])].
% 1.57/1.83 164 add(inverse(n1),inverse(A)) = inverse(A). [back_rewrite(116),rewrite([152(5),156(5)])].
% 1.57/1.83 166 add(multiply(A,n1),inverse(B)) = multiply(n1,add(A,inverse(B))). [back_rewrite(110),rewrite([152(5),156(5)])].
% 1.57/1.83 167 add(inverse(A),multiply(B,n1)) = multiply(n1,add(inverse(A),B)). [back_rewrite(109),rewrite([152(3),156(3)])].
% 1.57/1.83 172 add(inverse(A),add(n1,inverse(A))) = n1. [back_rewrite(30),rewrite([162(6)])].
% 1.57/1.83 174 inverse(inverse(n1)) = n1. [para(164(a,1),1(a,1))].
% 1.57/1.83 176 multiply(inverse(A),add(inverse(n1),A)) = inverse(n1). [para(164(a,1),13(a,1,2,2)),rewrite([7(7)])].
% 1.57/1.83 187 multiply(n1,add(A,A)) = A. [para(174(a,1),12(a,1,1,2)),rewrite([174(5),108(4),7(5)])].
% 1.57/1.83 188 multiply(n1,add(A,inverse(n1))) = A. [para(174(a,1),13(a,1,1,2)),rewrite([174(7),108(6),154(6),166(5)])].
% 1.57/1.83 189 multiply(A,inverse(n1)) = inverse(n1). [para(174(a,1),22(a,1,2,2,2)),rewrite([108(4),154(4),174(8),108(7),154(7)])].
% 1.57/1.83 190 multiply(add(A,A),add(n1,B)) = add(A,multiply(B,add(A,A))). [para(187(a,1),7(a,1,1)),flip(a)].
% 1.57/1.83 192 multiply(n1,multiply(A,add(B,B))) = multiply(B,A). [para(7(a,1),187(a,1,2))].
% 1.57/1.83 197 add(inverse(n1),A) = A. [para(189(a,1),13(a,1,1)),rewrite([188(7)])].
% 1.57/1.83 198 multiply(n1,A) = A. [para(189(a,1),14(a,1,1)),rewrite([167(5),197(4)])].
% 1.57/1.83 200 multiply(inverse(A),A) = inverse(n1). [back_rewrite(176),rewrite([197(4)])].
% 1.57/1.83 201 multiply(A,add(B,B)) = multiply(B,A). [back_rewrite(192),rewrite([198(4)])].
% 1.57/1.83 203 multiply(A,n1) = A. [back_rewrite(187),rewrite([201(3)])].
% 1.57/1.83 206 add(A,A) = A. [back_rewrite(102),rewrite([198(2),203(3)])].
% 1.57/1.83 208 add(A,multiply(B,A)) = multiply(A,add(A,B)). [back_rewrite(100),rewrite([198(2),198(2),198(4),203(4)])].
% 1.57/1.83 209 multiply(A,add(B,A)) = A. [back_rewrite(99),rewrite([198(3),5(2),206(1),203(3)]),flip(a)].
% 1.57/1.83 210 add(multiply(A,B),B) = B. [back_rewrite(98),rewrite([198(2),198(3),198(4),203(4),209(4)])].
% 1.57/1.83 212 multiply(A,add(n1,B)) = multiply(A,add(A,B)). [back_rewrite(190),rewrite([206(1),206(4),208(5)])].
% 1.57/1.83 222 multiply(A,B) = multiply(B,A). [back_rewrite(201),rewrite([206(1)])].
% 1.57/1.83 233 add(multiply(A,add(B,add(C,D))),D) = multiply(add(B,add(C,D)),add(A,D)). [back_rewrite(76),rewrite([210(5)])].
% 1.57/1.83 244 add(A,multiply(A,B)) = multiply(A,add(A,B)). [back_rewrite(208),rewrite([222(1)])].
% 1.57/1.83 245 multiply(A,inverse(A)) = inverse(n1). [back_rewrite(200),rewrite([222(2)])].
% 1.57/1.83 250 add(multiply(A,B),multiply(B,C)) = multiply(B,add(A,C)). [back_rewrite(7),rewrite([222(2)])].
% 1.57/1.83 271 add(A,add(B,A)) = add(B,A). [para(209(a,1),210(a,1,1))].
% 1.57/1.83 272 add(n1,inverse(A)) = n1. [back_rewrite(172),rewrite([271(5)])].
% 1.57/1.83 277 add(inverse(A),A) = n1. [back_rewrite(31),rewrite([272(4),203(3)])].
% 1.57/1.83 278 inverse(inverse(A)) = A. [para(277(a,1),13(a,1,2,2)),rewrite([222(4),245(4),203(4),197(3)]),flip(a)].
% 1.57/1.83 284 add(n1,A) = n1. [para(278(a,1),272(a,1,2))].
% 1.57/1.83 290 multiply(A,add(A,B)) = A. [back_rewrite(212),rewrite([284(2),203(2)]),flip(a)].
% 1.57/1.83 296 add(A,multiply(A,B)) = A. [back_rewrite(244),rewrite([290(4)])].
% 1.57/1.83 310 multiply(A,multiply(B,A)) = multiply(B,A). [para(210(a,1),290(a,1,2)),rewrite([222(2)])].
% 1.57/1.83 343 add(multiply(A,add(B,C)),multiply(C,D)) = multiply(add(B,C),add(A,multiply(C,D))). [para(296(a,1),233(a,1,1,2,2)),rewrite([296(6)])].
% 1.57/1.83 606 add(A,multiply(B,add(A,C))) = multiply(add(A,C),add(A,B)). [para(290(a,1),250(a,1,1)),rewrite([222(2)])].
% 1.57/1.83 610 multiply(A,add(B,multiply(A,C))) = multiply(A,add(B,C)). [para(310(a,1),250(a,1,2)),rewrite([222(2),250(3),222(3)]),flip(a)].
% 1.57/1.83 883 multiply(add(A,B),add(A,multiply(B,C))) = add(A,multiply(B,C)). [para(290(a,1),343(a,1,1)),flip(a)].
% 1.57/1.83 3947 multiply(add(A,B),add(A,C)) = add(A,multiply(C,B)). [para(610(a,1),606(a,1,2)),rewrite([606(3),222(7),883(7)])].
% 1.57/1.83 3994 $F # answer(prove_add_multiply_property). [back_rewrite(11),rewrite([3947(7),222(4)]),xx(a)].
% 1.57/1.83
% 1.57/1.83 % SZS output end Refutation
% 1.57/1.83 ============================== end of proof ==========================
% 1.57/1.83
% 1.57/1.83 ============================== STATISTICS ============================
% 1.57/1.83
% 1.57/1.83 Given=299. Generated=44636. Kept=3990. proofs=1.
% 1.57/1.83 Usable=180. Sos=2315. Demods=2540. Limbo=47, Disabled=1456. Hints=0.
% 1.57/1.83 Megabytes=3.75.
% 1.57/1.83 User_CPU=0.85, System_CPU=0.03, Wall_clock=1.
% 1.57/1.83
% 1.57/1.83 ============================== end of statistics =====================
% 1.57/1.83
% 1.57/1.83 ============================== end of search =========================
% 1.57/1.83
% 1.57/1.83 THEOREM PROVED
% 1.57/1.83 % SZS status Unsatisfiable
% 1.57/1.83
% 1.57/1.83 Exiting with 1 proof.
% 1.57/1.83
% 1.57/1.83 Process 26322 exit (max_proofs) Wed Jun 1 21:02:57 2022
% 1.57/1.83 Prover9 interrupted
%------------------------------------------------------------------------------