TSTP Solution File: GRP247-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP247-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:19 EDT 2022
% Result : Unsatisfiable 1.65s 1.93s
% Output : Refutation 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP247-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 07:52:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.65/1.93 ============================== Prover9 ===============================
% 1.65/1.93 Prover9 (32) version 2009-11A, November 2009.
% 1.65/1.93 Process 6336 was started by sandbox on n006.cluster.edu,
% 1.65/1.93 Tue Jun 14 07:52:42 2022
% 1.65/1.93 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6182_n006.cluster.edu".
% 1.65/1.93 ============================== end of head ===========================
% 1.65/1.93
% 1.65/1.93 ============================== INPUT =================================
% 1.65/1.93
% 1.65/1.93 % Reading from file /tmp/Prover9_6182_n006.cluster.edu
% 1.65/1.93
% 1.65/1.93 set(prolog_style_variables).
% 1.65/1.93 set(auto2).
% 1.65/1.93 % set(auto2) -> set(auto).
% 1.65/1.93 % set(auto) -> set(auto_inference).
% 1.65/1.93 % set(auto) -> set(auto_setup).
% 1.65/1.93 % set(auto_setup) -> set(predicate_elim).
% 1.65/1.93 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.65/1.93 % set(auto) -> set(auto_limits).
% 1.65/1.93 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.65/1.93 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.65/1.93 % set(auto) -> set(auto_denials).
% 1.65/1.93 % set(auto) -> set(auto_process).
% 1.65/1.93 % set(auto2) -> assign(new_constants, 1).
% 1.65/1.93 % set(auto2) -> assign(fold_denial_max, 3).
% 1.65/1.93 % set(auto2) -> assign(max_weight, "200.000").
% 1.65/1.93 % set(auto2) -> assign(max_hours, 1).
% 1.65/1.93 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.65/1.93 % set(auto2) -> assign(max_seconds, 0).
% 1.65/1.93 % set(auto2) -> assign(max_minutes, 5).
% 1.65/1.93 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.65/1.93 % set(auto2) -> set(sort_initial_sos).
% 1.65/1.93 % set(auto2) -> assign(sos_limit, -1).
% 1.65/1.93 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.65/1.93 % set(auto2) -> assign(max_megs, 400).
% 1.65/1.93 % set(auto2) -> assign(stats, some).
% 1.65/1.93 % set(auto2) -> clear(echo_input).
% 1.65/1.93 % set(auto2) -> set(quiet).
% 1.65/1.93 % set(auto2) -> clear(print_initial_clauses).
% 1.65/1.93 % set(auto2) -> clear(print_given).
% 1.65/1.93 assign(lrs_ticks,-1).
% 1.65/1.93 assign(sos_limit,10000).
% 1.65/1.93 assign(order,kbo).
% 1.65/1.93 set(lex_order_vars).
% 1.65/1.93 clear(print_given).
% 1.65/1.93
% 1.65/1.93 % formulas(sos). % not echoed (40 formulas)
% 1.65/1.93
% 1.65/1.93 ============================== end of input ==========================
% 1.65/1.93
% 1.65/1.93 % From the command line: assign(max_seconds, 300).
% 1.65/1.93
% 1.65/1.93 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.65/1.93
% 1.65/1.93 % Formulas that are not ordinary clauses:
% 1.65/1.93
% 1.65/1.93 ============================== end of process non-clausal formulas ===
% 1.65/1.93
% 1.65/1.93 ============================== PROCESS INITIAL CLAUSES ===============
% 1.65/1.93
% 1.65/1.93 ============================== PREDICATE ELIMINATION =================
% 1.65/1.93
% 1.65/1.93 ============================== end predicate elimination =============
% 1.65/1.93
% 1.65/1.93 Auto_denials: (non-Horn, no changes).
% 1.65/1.93
% 1.65/1.93 Term ordering decisions:
% 1.65/1.93
% 1.65/1.93 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.65/1.93 Function symbol KB weights: sk_c9=1. sk_c8=1. sk_c7=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 1.65/1.93
% 1.65/1.93 ============================== end of process initial clauses ========
% 1.65/1.93
% 1.65/1.93 ============================== CLAUSES FOR SEARCH ====================
% 1.65/1.93
% 1.65/1.93 ============================== end of clauses for search =============
% 1.65/1.93
% 1.65/1.93 ============================== SEARCH ================================
% 1.65/1.93
% 1.65/1.93 % Starting search at 0.02 seconds.
% 1.65/1.93
% 1.65/1.93 Low Water (keep): wt=37.000, iters=3674
% 1.65/1.93
% 1.65/1.93 Low Water (keep): wt=33.000, iters=3576
% 1.65/1.93
% 1.65/1.93 Low Water (keep): wt=30.000, iters=3438
% 1.65/1.93
% 1.65/1.93 Low Water (keep): wt=29.000, iters=3422
% 1.65/1.93
% 1.65/1.93 Low Water (keep): wt=28.000, iters=3390
% 1.65/1.93
% 1.65/1.93 ============================== PROOF =================================
% 1.65/1.93 % SZS status Unsatisfiable
% 1.65/1.93 % SZS output start Refutation
% 1.65/1.93
% 1.65/1.93 % Proof 1 at 0.91 (+ 0.02) seconds.
% 1.65/1.93 % Length of proof is 80.
% 1.65/1.93 % Level of proof is 19.
% 1.65/1.93 % Maximum clause weight is 54.000.
% 1.65/1.93 % Given clauses 364.
% 1.65/1.93
% 1.65/1.93 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.65/1.93 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.65/1.93 3 inverse(sk_c1) = sk_c9 | inverse(sk_c4) = sk_c9 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.65/1.93 7 inverse(sk_c2) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.65/1.93 11 inverse(sk_c3) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 1.65/1.93 12 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c4) = sk_c9 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.65/1.93 15 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.65/1.93 19 multiply(sk_c2,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.65/1.93 22 inverse(sk_c2) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.65/1.93 26 inverse(sk_c3) = sk_c9 | multiply(sk_c6,sk_c8) = sk_c9 # label(prove_this_30) # label(negated_conjecture). [assumption].
% 1.65/1.93 29 multiply(sk_c3,sk_c7) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_35) # label(negated_conjecture). [assumption].
% 1.65/1.93 30 multiply(sk_c1,sk_c9) = sk_c8 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.65/1.93 34 multiply(sk_c2,sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.65/1.93 38 multiply(sk_c3,sk_c7) = sk_c9 | multiply(sk_c6,sk_c8) = sk_c9 # label(prove_this_36) # label(negated_conjecture). [assumption].
% 1.65/1.93 39 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.65/1.93 40 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c7) != sk_c9 | multiply(D,sk_c9) != sk_c8 | inverse(D) != sk_c9 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8 | inverse(F) != sk_c9 | multiply(F,sk_c8) != sk_c9 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 1.65/1.93 41 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c7) != sk_c9 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8 | inverse(E) != sk_c9 | multiply(E,sk_c8) != sk_c9. [factor(40,a,g),merge(g)].
% 1.65/1.93 45 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c7) != sk_c9 | inverse(D) != sk_c9 | multiply(D,sk_c8) != sk_c9. [factor(41,c,g),merge(g)].
% 1.65/1.93 56 inverse(sk_c2) = sk_c8 | multiply(sk_c8,sk_c5) = identity. [para(7(b,1),2(a,1,1))].
% 1.65/1.93 61 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),39(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.65/1.93 76 inverse(sk_c5) = sk_c8 | multiply(sk_c2,multiply(sk_c8,A)) = multiply(sk_c7,A). [para(19(a,1),39(a,1,1)),flip(b)].
% 1.65/1.93 82 inverse(sk_c2) = sk_c8 | multiply(sk_c5,multiply(sk_c8,A)) = multiply(sk_c7,A). [para(22(b,1),39(a,1,1)),flip(b)].
% 1.65/1.93 96 inverse(sk_c6) = sk_c9 | multiply(sk_c3,multiply(sk_c7,A)) = multiply(sk_c9,A). [para(29(a,1),39(a,1,1)),flip(b)].
% 1.65/1.93 147 identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c7) != sk_c9 | inverse(C) != sk_c9 | multiply(C,sk_c8) != sk_c9. [para(2(a,1),45(a,1))].
% 1.65/1.93 259 identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c7) != sk_c9 | multiply(inverse(sk_c9),sk_c8) != sk_c9. [factor(147,b,g)].
% 1.65/1.93 260 identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c7) != sk_c9 | multiply(B,sk_c8) != sk_c9. [factor(147,e,g)].
% 1.65/1.93 414 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),61(a,1,2))].
% 1.65/1.93 452 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(61(a,1),61(a,1,2))].
% 1.65/1.93 453 multiply(A,identity) = A. [back_rewrite(414),rewrite([452(4)])].
% 1.65/1.93 458 inverse(identity) = identity. [para(453(a,1),2(a,1))].
% 1.65/1.93 518 inverse(sk_c2) = sk_c8 | inverse(sk_c8) = sk_c5. [para(56(b,1),61(a,1,2)),rewrite([453(8)])].
% 1.65/1.93 539 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c2) = identity. [para(518(a,1),2(a,1,1))].
% 1.65/1.93 596 multiply(A,inverse(A)) = identity. [para(452(a,1),2(a,1))].
% 1.65/1.93 622 inverse(inverse(A)) = A. [para(452(a,1),453(a,1)),rewrite([453(2)]),flip(a)].
% 1.65/1.93 645 identity != sk_c8 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c7) != sk_c9 | multiply(B,sk_c8) != sk_c9. [back_rewrite(260),rewrite([622(6)]),xx(b)].
% 1.65/1.93 646 identity != sk_c8 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c7) != sk_c9 | multiply(inverse(sk_c9),sk_c8) != sk_c9. [back_rewrite(259),rewrite([622(6)]),xx(b)].
% 1.65/1.93 659 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c9) = identity. [para(3(b,1),596(a,1,2))].
% 1.65/1.93 1625 inverse(sk_c1) = sk_c9 | identity = sk_c8. [para(659(b,1),15(b,1)),merge(b)].
% 1.65/1.93 1678 identity != sk_c8 | sk_c7 != sk_c8 | inverse(A) != sk_c9 | multiply(A,sk_c7) != sk_c9 | multiply(A,sk_c8) != sk_c9. [para(1(a,1),645(b,1)),rewrite([458(8)]),flip(b),merge(c)].
% 1.65/1.93 1692 identity != sk_c8 | sk_c7 != sk_c8 | inverse(multiply(A,B)) != sk_c9 | multiply(A,multiply(B,sk_c7)) != sk_c9 | multiply(A,multiply(B,sk_c8)) != sk_c9. [para(39(a,1),1678(d,1)),rewrite([39(18)])].
% 1.65/1.93 1712 identity = sk_c8 | multiply(sk_c1,sk_c9) = identity. [para(1625(a,1),596(a,1,2))].
% 1.65/1.93 1723 identity = sk_c8 | inverse(sk_c4) = sk_c9. [para(1712(b,1),12(a,1)),merge(b)].
% 1.65/1.93 1924 identity = sk_c8 | multiply(sk_c4,sk_c9) = identity. [para(1723(b,1),596(a,1,2))].
% 1.65/1.93 2145 identity != sk_c8 | sk_c7 != sk_c8 | inverse(multiply(A,inverse(sk_c7))) != sk_c9 | sk_c9 != A | multiply(A,multiply(inverse(sk_c7),sk_c8)) != sk_c9. [para(2(a,1),1692(d,1,2)),rewrite([453(14)]),flip(d)].
% 1.65/1.93 2225 inverse(sk_c5) = sk_c8 | multiply(sk_c7,inverse(sk_c8)) = sk_c2. [para(596(a,1),76(b,1,2)),rewrite([453(7)]),flip(b)].
% 1.65/1.93 2423 identity != sk_c8 | identity != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c7) != sk_c9 | multiply(inverse(sk_c9),sk_c8) != sk_c9. [para(2(a,1),646(b,1)),rewrite([622(9)]),xx(c)].
% 1.65/1.93 2451 identity = sk_c8 | multiply(sk_c1,sk_c9) = sk_c8. [para(1924(b,1),30(b,1)),merge(c)].
% 1.65/1.93 3013 inverse(sk_c2) = sk_c8 | multiply(sk_c7,inverse(sk_c8)) = sk_c5. [para(596(a,1),82(b,1,2)),rewrite([453(7)]),flip(b)].
% 1.65/1.93 4489 identity = sk_c8. [para(2451(b,1),1712(b,1)),flip(c),merge(b),merge(c)].
% 1.65/1.93 5485 sk_c7 != sk_c8 | inverse(A) != sk_c9 | multiply(A,sk_c7) != sk_c9 | multiply(inverse(sk_c9),sk_c8) != sk_c9. [back_rewrite(2423),rewrite([4489(1),4489(4)]),flip(b),xx(a)].
% 1.65/1.93 5668 sk_c7 != sk_c8 | inverse(multiply(A,inverse(sk_c7))) != sk_c9 | sk_c9 != A | multiply(A,multiply(inverse(sk_c7),sk_c8)) != sk_c9. [back_rewrite(2145),rewrite([4489(1)]),xx(a)].
% 1.65/1.93 6613 multiply(A,inverse(A)) = sk_c8. [back_rewrite(596),rewrite([4489(3)])].
% 1.65/1.93 6636 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c2) = sk_c8. [back_rewrite(539),rewrite([4489(8)])].
% 1.65/1.93 6680 inverse(sk_c8) = sk_c8. [back_rewrite(458),rewrite([4489(1),4489(3)])].
% 1.65/1.93 6681 multiply(A,sk_c8) = A. [back_rewrite(453),rewrite([4489(1)])].
% 1.65/1.93 6692 multiply(sk_c8,A) = A. [back_rewrite(1),rewrite([4489(1)])].
% 1.65/1.93 6734 sk_c5 = sk_c8 | sk_c2 = sk_c8. [back_rewrite(6636),rewrite([6680(2),6692(6)]),flip(a)].
% 1.65/1.93 6876 inverse(sk_c2) = sk_c8 | sk_c5 = sk_c7. [back_rewrite(3013),rewrite([6680(7),6681(7)]),flip(b)].
% 1.65/1.93 6882 inverse(sk_c5) = sk_c8 | sk_c2 = sk_c7. [back_rewrite(2225),rewrite([6680(7),6681(7)]),flip(b)].
% 1.65/1.93 7214 sk_c7 != sk_c8 | inverse(multiply(A,inverse(sk_c7))) != sk_c9 | sk_c9 != A | multiply(A,inverse(sk_c7)) != sk_c9. [back_rewrite(5668),rewrite([6681(15)])].
% 1.65/1.93 7252 sk_c7 != sk_c8 | inverse(A) != sk_c9 | multiply(A,sk_c7) != sk_c9 | inverse(sk_c9) != sk_c9. [back_rewrite(5485),rewrite([6681(14)])].
% 1.65/1.93 7682 multiply(sk_c3,sk_c7) = sk_c9 | sk_c6 = sk_c9. [back_rewrite(38),rewrite([6681(8)])].
% 1.65/1.93 7685 sk_c2 = sk_c7 | sk_c5 = sk_c7. [back_rewrite(34),rewrite([6681(3),6681(6)])].
% 1.65/1.93 7689 inverse(sk_c3) = sk_c9 | sk_c6 = sk_c9. [back_rewrite(26),rewrite([6681(7)])].
% 1.65/1.93 7973 sk_c7 != sk_c8 | inverse(sk_c9) != sk_c9 | multiply(sk_c9,sk_c7) != sk_c9. [factor(7252,b,d)].
% 1.65/1.93 8124 sk_c5 = sk_c7 | sk_c2 = sk_c8. [para(6876(a,1),622(a,1,1)),rewrite([6680(5)]),flip(b)].
% 1.65/1.93 8131 sk_c2 = sk_c8 | sk_c7 = sk_c8. [para(8124(a,1),6734(a,1)),merge(c)].
% 1.65/1.93 8149 sk_c2 = sk_c7 | sk_c5 = sk_c8. [para(6882(a,1),622(a,1,1)),rewrite([6680(5)]),flip(b)].
% 1.65/1.93 8151 sk_c2 = sk_c7 | sk_c7 = sk_c8. [para(8149(b,1),7685(b,1)),flip(c),merge(b)].
% 1.65/1.93 8158 inverse(sk_c6) = sk_c9 | multiply(sk_c9,inverse(sk_c7)) = sk_c3. [para(6613(a,1),96(b,1,2)),rewrite([6681(7)]),flip(b)].
% 1.65/1.93 8220 sk_c7 = sk_c8. [para(8151(a,1),8131(a,1)),merge(b),merge(c)].
% 1.65/1.93 8275 inverse(sk_c6) = sk_c9 | sk_c3 = sk_c9. [back_rewrite(8158),rewrite([8220(6),6680(7),6681(7)]),flip(b)].
% 1.65/1.93 8348 inverse(sk_c9) != sk_c9. [back_rewrite(7973),rewrite([8220(1),8220(9),6681(10)]),xx(a),xx(c)].
% 1.65/1.93 8548 sk_c3 = sk_c9 | sk_c6 = sk_c9. [back_rewrite(7682),rewrite([8220(2),6681(3)])].
% 1.65/1.93 8673 inverse(A) != sk_c9 | sk_c9 != A. [back_rewrite(7214),rewrite([8220(1),8220(4),6680(5),6681(5),8220(9),6680(10),6681(10)]),flip(d),xx(a),merge(c)].
% 1.65/1.93 8906 sk_c6 != sk_c9 | inverse(sk_c3) = sk_c9. [resolve(8673,a,11,b),flip(a)].
% 1.65/1.93 8934 sk_c6 = sk_c9 | inverse(sk_c9) = sk_c3. [para(7689(a,1),622(a,1,1))].
% 1.65/1.93 8944 sk_c3 = sk_c9. [para(8548(b,1),8275(a,1,1)),merge(c),unit_del(b,8348)].
% 1.65/1.93 8947 sk_c6 = sk_c9. [back_rewrite(8934),rewrite([8944(6)]),unit_del(b,8348)].
% 1.65/1.93 8957 $F. [back_rewrite(8906),rewrite([8947(1),8944(4)]),xx(a),unit_del(a,8348)].
% 1.65/1.93
% 1.65/1.93 % SZS output end Refutation
% 1.65/1.93 ============================== end of proof ==========================
% 1.65/1.93
% 1.65/1.93 ============================== STATISTICS ============================
% 1.65/1.93
% 1.65/1.93 Given=364. Generated=17146. Kept=8956. proofs=1.
% 1.65/1.93 Usable=65. Sos=230. Demods=22. Limbo=13, Disabled=8688. Hints=0.
% 1.65/1.93 Megabytes=7.63.
% 1.65/1.93 User_CPU=0.91, System_CPU=0.02, Wall_clock=1.
% 1.65/1.93
% 1.65/1.93 ============================== end of statistics =====================
% 1.65/1.93
% 1.65/1.93 ============================== end of search =========================
% 1.65/1.93
% 1.65/1.93 THEOREM PROVED
% 1.65/1.93 % SZS status Unsatisfiable
% 1.65/1.93
% 1.65/1.93 Exiting with 1 proof.
% 1.65/1.93
% 1.65/1.93 Process 6336 exit (max_proofs) Tue Jun 14 07:52:43 2022
% 1.65/1.93 Prover9 interrupted
%------------------------------------------------------------------------------