TSTP Solution File: GRP363-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP363-1 : TPTP v8.1.0. Released v2.5.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 : Sat Jul 16 11:18:46 EDT 2022
% Result : Unsatisfiable 1.27s 1.55s
% Output : Refutation 1.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP363-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n025.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 : Tue Jun 14 04:43:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.27/1.55 ============================== Prover9 ===============================
% 1.27/1.55 Prover9 (32) version 2009-11A, November 2009.
% 1.27/1.55 Process 2686 was started by sandbox2 on n025.cluster.edu,
% 1.27/1.55 Tue Jun 14 04:43:25 2022
% 1.27/1.55 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2532_n025.cluster.edu".
% 1.27/1.55 ============================== end of head ===========================
% 1.27/1.55
% 1.27/1.55 ============================== INPUT =================================
% 1.27/1.55
% 1.27/1.55 % Reading from file /tmp/Prover9_2532_n025.cluster.edu
% 1.27/1.55
% 1.27/1.55 set(prolog_style_variables).
% 1.27/1.55 set(auto2).
% 1.27/1.55 % set(auto2) -> set(auto).
% 1.27/1.55 % set(auto) -> set(auto_inference).
% 1.27/1.55 % set(auto) -> set(auto_setup).
% 1.27/1.55 % set(auto_setup) -> set(predicate_elim).
% 1.27/1.55 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.27/1.55 % set(auto) -> set(auto_limits).
% 1.27/1.55 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.27/1.55 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.27/1.55 % set(auto) -> set(auto_denials).
% 1.27/1.55 % set(auto) -> set(auto_process).
% 1.27/1.55 % set(auto2) -> assign(new_constants, 1).
% 1.27/1.55 % set(auto2) -> assign(fold_denial_max, 3).
% 1.27/1.55 % set(auto2) -> assign(max_weight, "200.000").
% 1.27/1.55 % set(auto2) -> assign(max_hours, 1).
% 1.27/1.55 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.27/1.55 % set(auto2) -> assign(max_seconds, 0).
% 1.27/1.55 % set(auto2) -> assign(max_minutes, 5).
% 1.27/1.55 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.27/1.55 % set(auto2) -> set(sort_initial_sos).
% 1.27/1.55 % set(auto2) -> assign(sos_limit, -1).
% 1.27/1.55 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.27/1.55 % set(auto2) -> assign(max_megs, 400).
% 1.27/1.55 % set(auto2) -> assign(stats, some).
% 1.27/1.55 % set(auto2) -> clear(echo_input).
% 1.27/1.55 % set(auto2) -> set(quiet).
% 1.27/1.55 % set(auto2) -> clear(print_initial_clauses).
% 1.27/1.55 % set(auto2) -> clear(print_given).
% 1.27/1.55 assign(lrs_ticks,-1).
% 1.27/1.55 assign(sos_limit,10000).
% 1.27/1.55 assign(order,kbo).
% 1.27/1.55 set(lex_order_vars).
% 1.27/1.55 clear(print_given).
% 1.27/1.55
% 1.27/1.55 % formulas(sos). % not echoed (28 formulas)
% 1.27/1.55
% 1.27/1.55 ============================== end of input ==========================
% 1.27/1.55
% 1.27/1.55 % From the command line: assign(max_seconds, 300).
% 1.27/1.55
% 1.27/1.55 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.27/1.55
% 1.27/1.55 % Formulas that are not ordinary clauses:
% 1.27/1.55
% 1.27/1.55 ============================== end of process non-clausal formulas ===
% 1.27/1.55
% 1.27/1.55 ============================== PROCESS INITIAL CLAUSES ===============
% 1.27/1.55
% 1.27/1.55 ============================== PREDICATE ELIMINATION =================
% 1.27/1.55
% 1.27/1.55 ============================== end predicate elimination =============
% 1.27/1.55
% 1.27/1.55 Auto_denials: (non-Horn, no changes).
% 1.27/1.55
% 1.27/1.55 Term ordering decisions:
% 1.27/1.55
% 1.27/1.55 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 1.27/1.55 Function symbol KB weights: sk_c6=1. sk_c7=1. sk_c5=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. identity=1. multiply=1. inverse=0.
% 1.27/1.55
% 1.27/1.55 ============================== end of process initial clauses ========
% 1.27/1.55
% 1.27/1.55 ============================== CLAUSES FOR SEARCH ====================
% 1.27/1.55
% 1.27/1.55 ============================== end of clauses for search =============
% 1.27/1.55
% 1.27/1.55 ============================== SEARCH ================================
% 1.27/1.55
% 1.27/1.55 % Starting search at 0.01 seconds.
% 1.27/1.55
% 1.27/1.55 ============================== PROOF =================================
% 1.27/1.55 % SZS status Unsatisfiable
% 1.27/1.55 % SZS output start Refutation
% 1.27/1.55
% 1.27/1.55 % Proof 1 at 0.56 (+ 0.01) seconds.
% 1.27/1.55 % Length of proof is 91.
% 1.27/1.55 % Level of proof is 25.
% 1.27/1.55 % Maximum clause weight is 47.000.
% 1.27/1.55 % Given clauses 280.
% 1.27/1.55
% 1.27/1.55 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.27/1.55 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.27/1.55 3 inverse(sk_c6) = sk_c5 | inverse(sk_c2) = sk_c6 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.27/1.55 4 inverse(sk_c6) = sk_c5 | inverse(sk_c3) = sk_c7 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 1.27/1.55 6 inverse(sk_c1) = sk_c6 | inverse(sk_c3) = sk_c7 # label(prove_this_24) # label(negated_conjecture). [assumption].
% 1.27/1.55 7 multiply(sk_c6,sk_c5) = sk_c7 | inverse(sk_c2) = sk_c6 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 1.27/1.55 9 inverse(sk_c6) = sk_c5 | multiply(sk_c6,sk_c7) = sk_c5 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.27/1.55 10 inverse(sk_c6) = sk_c5 | multiply(sk_c2,sk_c6) = sk_c7 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.27/1.55 11 inverse(sk_c6) = sk_c5 | multiply(sk_c7,sk_c4) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 1.27/1.55 12 inverse(sk_c6) = sk_c5 | multiply(sk_c3,sk_c7) = sk_c4 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 1.27/1.55 14 multiply(sk_c1,sk_c6) = sk_c5 | inverse(sk_c3) = sk_c7 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 1.27/1.55 17 inverse(sk_c1) = sk_c6 | multiply(sk_c7,sk_c4) = sk_c6 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.27/1.55 18 inverse(sk_c1) = sk_c6 | multiply(sk_c3,sk_c7) = sk_c4 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 1.27/1.55 20 multiply(sk_c6,sk_c5) = sk_c7 | multiply(sk_c2,sk_c6) = sk_c7 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.27/1.55 25 multiply(sk_c1,sk_c6) = sk_c5 | multiply(sk_c7,sk_c4) = sk_c6 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.27/1.55 26 multiply(sk_c1,sk_c6) = sk_c5 | multiply(sk_c3,sk_c7) = sk_c4 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 1.27/1.55 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.27/1.55 28 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c7,C) != sk_c6 | multiply(D,sk_c7) != C | inverse(D) != sk_c7 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 1.27/1.55 32 inverse(sk_c6) = sk_c5 | multiply(sk_c6,sk_c2) = identity. [para(3(b,1),2(a,1,1))].
% 1.27/1.55 33 inverse(sk_c6) = sk_c5 | multiply(sk_c7,sk_c3) = identity. [para(4(b,1),2(a,1,1))].
% 1.27/1.55 35 inverse(sk_c1) = sk_c6 | multiply(sk_c7,sk_c3) = identity. [para(6(b,1),2(a,1,1))].
% 1.27/1.55 36 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.27/1.55 41 inverse(sk_c6) = sk_c5 | multiply(sk_c6,multiply(sk_c7,A)) = multiply(sk_c5,A). [para(9(b,1),27(a,1,1)),flip(b)].
% 1.27/1.55 180 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),36(a,1,2))].
% 1.27/1.55 186 inverse(sk_c6) = sk_c5 | multiply(inverse(sk_c6),sk_c5) = sk_c7. [para(9(b,1),36(a,1,2))].
% 1.27/1.55 188 inverse(sk_c6) = sk_c5 | multiply(inverse(sk_c7),sk_c6) = sk_c4. [para(11(b,1),36(a,1,2))].
% 1.27/1.55 191 inverse(sk_c3) = sk_c7 | multiply(inverse(sk_c1),sk_c5) = sk_c6. [para(14(a,1),36(a,1,2))].
% 1.27/1.55 194 inverse(sk_c1) = sk_c6 | multiply(inverse(sk_c7),sk_c6) = sk_c4. [para(17(b,1),36(a,1,2))].
% 1.27/1.55 205 inverse(sk_c6) = sk_c5 | multiply(inverse(sk_c6),identity) = sk_c2. [para(32(b,1),36(a,1,2))].
% 1.27/1.55 206 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(36(a,1),36(a,1,2))].
% 1.27/1.55 207 multiply(A,identity) = A. [back_rewrite(180),rewrite([206(4)])].
% 1.27/1.55 208 inverse(sk_c6) = sk_c5 | inverse(sk_c6) = sk_c2. [back_rewrite(205),rewrite([207(8)])].
% 1.27/1.55 212 inverse(identity) = identity. [para(207(a,1),2(a,1))].
% 1.27/1.55 233 inverse(sk_c6) = sk_c5 | multiply(sk_c2,sk_c6) = identity. [para(208(b,1),2(a,1,1))].
% 1.27/1.55 236 inverse(sk_c6) = sk_c5 | inverse(sk_c7) = sk_c3. [para(33(b,1),36(a,1,2)),rewrite([207(8)])].
% 1.27/1.55 256 inverse(sk_c1) = sk_c6 | inverse(sk_c7) = sk_c3. [para(35(b,1),36(a,1,2)),rewrite([207(8)])].
% 1.27/1.55 289 multiply(A,inverse(A)) = identity. [para(206(a,1),2(a,1))].
% 1.27/1.55 302 multiply(A,multiply(inverse(A),B)) = B. [para(206(a,1),36(a,1))].
% 1.27/1.55 303 inverse(inverse(A)) = A. [para(206(a,1),207(a,1)),rewrite([207(2)]),flip(a)].
% 1.27/1.55 334 inverse(sk_c7) = sk_c3 | inverse(sk_c6) = sk_c1. [para(256(a,1),303(a,1,1))].
% 1.27/1.55 358 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | sk_c6 != C | multiply(inverse(sk_c7),C) != multiply(D,sk_c7) | inverse(D) != sk_c7. [para(302(a,1),28(h,1)),flip(h),flip(i)].
% 1.27/1.55 412 inverse(sk_c6) = sk_c5 | identity = sk_c7. [para(233(b,1),10(b,1)),merge(b)].
% 1.27/1.55 417 identity = sk_c7 | multiply(sk_c6,sk_c5) = identity. [para(412(a,1),289(a,1,2))].
% 1.27/1.55 449 identity = sk_c7 | inverse(sk_c2) = sk_c6. [para(417(b,1),7(a,1)),merge(b)].
% 1.27/1.55 456 identity = sk_c7 | multiply(sk_c2,sk_c6) = identity. [para(449(b,1),289(a,1,2))].
% 1.27/1.55 467 inverse(sk_c6) = sk_c5 | multiply(sk_c5,inverse(sk_c7)) = sk_c6. [para(289(a,1),41(b,1,2)),rewrite([207(7)]),flip(b)].
% 1.27/1.55 561 identity = sk_c7 | multiply(sk_c6,sk_c5) = sk_c7. [para(456(b,1),20(b,1)),merge(c)].
% 1.27/1.55 926 identity = sk_c7. [para(561(b,1),417(b,1)),flip(c),merge(b),merge(c)].
% 1.27/1.55 1115 multiply(A,inverse(A)) = sk_c7. [back_rewrite(289),rewrite([926(3)])].
% 1.27/1.55 1123 inverse(sk_c7) = sk_c7. [back_rewrite(212),rewrite([926(1),926(3)])].
% 1.27/1.55 1124 multiply(A,sk_c7) = A. [back_rewrite(207),rewrite([926(1)])].
% 1.27/1.55 1129 multiply(inverse(A),A) = sk_c7. [back_rewrite(2),rewrite([926(3)])].
% 1.27/1.55 1130 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([926(1)])].
% 1.27/1.55 1159 inverse(sk_c6) = sk_c5 | sk_c5 = sk_c6. [back_rewrite(467),rewrite([1123(7),1124(7)])].
% 1.27/1.55 1166 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | sk_c5 != sk_c6 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | sk_c6 != C | C != D | inverse(D) != sk_c7. [back_rewrite(358),rewrite([1124(19),1123(30),1130(30),1124(30)]),flip(e)].
% 1.27/1.55 1169 sk_c3 = sk_c7 | inverse(sk_c6) = sk_c1. [back_rewrite(334),rewrite([1123(2)]),flip(a)].
% 1.27/1.55 1177 inverse(sk_c6) = sk_c5 | sk_c3 = sk_c7. [back_rewrite(236),rewrite([1123(6)]),flip(b)].
% 1.27/1.55 1179 inverse(sk_c1) = sk_c6 | sk_c4 = sk_c6. [back_rewrite(194),rewrite([1123(6),1130(7)]),flip(b)].
% 1.27/1.55 1180 inverse(sk_c6) = sk_c5 | sk_c4 = sk_c6. [back_rewrite(188),rewrite([1123(6),1130(7)]),flip(b)].
% 1.27/1.55 1278 multiply(sk_c1,sk_c6) = sk_c5 | sk_c4 = sk_c3. [back_rewrite(26),rewrite([1124(8)]),flip(b)].
% 1.27/1.55 1282 inverse(sk_c1) = sk_c6 | sk_c4 = sk_c3. [back_rewrite(18),rewrite([1124(7)]),flip(b)].
% 1.27/1.55 1284 inverse(sk_c6) = sk_c5 | sk_c4 = sk_c3. [back_rewrite(12),rewrite([1124(7)]),flip(b)].
% 1.27/1.55 1332 multiply(sk_c1,sk_c6) = sk_c5 | sk_c4 = sk_c6. [back_rewrite(25),rewrite([1130(8)])].
% 1.27/1.55 1337 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | sk_c5 != sk_c6 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c6,sk_c5) != sk_c6. [factor(1166,a,i),rewrite([1123(33)]),flip(h),xx(i)].
% 1.27/1.55 1427 sk_c5 = sk_c6 | inverse(sk_c5) = sk_c6. [para(1159(a,1),303(a,1,1))].
% 1.27/1.55 1436 sk_c3 = sk_c7 | sk_c1 = sk_c5. [para(1177(a,1),1169(b,1)),flip(c),merge(b)].
% 1.27/1.55 1484 sk_c4 = sk_c6 | inverse(sk_c6) = sk_c1. [para(1179(a,1),303(a,1,1))].
% 1.27/1.55 1486 sk_c4 = sk_c6 | multiply(sk_c1,sk_c6) = sk_c7. [para(1179(a,1),1115(a,1,2))].
% 1.27/1.55 1588 sk_c4 = sk_c3 | inverse(sk_c6) = sk_c1. [para(1282(a,1),303(a,1,1))].
% 1.27/1.55 1590 sk_c4 = sk_c3 | multiply(sk_c1,sk_c6) = sk_c7. [para(1282(a,1),1115(a,1,2))].
% 1.27/1.55 1646 sk_c4 = sk_c6 | sk_c1 = sk_c5. [para(1484(b,1),1180(a,1)),merge(c)].
% 1.27/1.55 1740 sk_c4 = sk_c3 | sk_c1 = sk_c5. [para(1588(b,1),1284(a,1)),merge(c)].
% 1.27/1.55 1747 sk_c1 = sk_c5 | sk_c4 = sk_c7. [para(1436(a,1),1740(a,2)),merge(c)].
% 1.27/1.55 1754 sk_c1 = sk_c5 | sk_c7 = sk_c6. [para(1747(b,1),1646(a,1)),merge(c)].
% 1.27/1.55 2085 sk_c7 = sk_c6 | inverse(sk_c3) = sk_c7. [para(1754(a,1),191(b,1,1,1)),rewrite([1129(11)]),merge(c)].
% 1.27/1.55 2138 sk_c7 = sk_c6 | sk_c3 = sk_c7. [para(2085(b,1),303(a,1,1)),rewrite([1123(5)]),flip(b)].
% 1.27/1.55 2616 sk_c4 = sk_c6 | sk_c5 = sk_c7. [para(1486(b,1),1332(a,1)),flip(b),merge(c)].
% 1.27/1.55 2708 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | sk_c5 != sk_c6 | multiply(sk_c6,sk_c5) != sk_c6. [resolve(1337,f,1129,a),rewrite([303(22)]),xx(f)].
% 1.27/1.55 2843 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | multiply(A,multiply(B,sk_c6)) != sk_c5 | inverse(multiply(A,B)) != sk_c6 | sk_c5 != sk_c6 | multiply(sk_c6,sk_c5) != sk_c6. [para(27(a,1),2708(c,1))].
% 1.27/1.55 2850 multiply(sk_c6,sk_c5) != sk_c7 | inverse(sk_c6) != sk_c5 | sk_c5 != A | inverse(multiply(A,inverse(sk_c6))) != sk_c6 | sk_c5 != sk_c6 | multiply(sk_c6,sk_c5) != sk_c6. [para(1129(a,1),2843(c,1,2)),rewrite([1124(11)]),flip(c)].
% 1.27/1.55 2905 sk_c4 = sk_c3 | sk_c5 = sk_c7. [para(1590(b,1),1278(a,1)),flip(b),merge(c)].
% 1.27/1.55 2909 sk_c5 = sk_c7 | sk_c3 = sk_c6. [para(2905(a,1),2616(a,1)),merge(c)].
% 1.27/1.55 2917 sk_c5 = sk_c7 | sk_c7 = sk_c6. [para(2909(b,1),2138(b,1)),flip(c),merge(c)].
% 1.27/1.55 2944 sk_c7 = sk_c6 | sk_c5 = sk_c6. [para(2917(a,1),1427(b,1,1)),rewrite([1123(8)]),merge(c)].
% 1.27/1.55 3167 sk_c7 = sk_c6. [para(2944(b,1),2917(a,1)),flip(b),merge(b),merge(c)].
% 1.27/1.55 3332 multiply(sk_c6,sk_c5) != sk_c6 | inverse(sk_c6) != sk_c5 | sk_c5 != A | inverse(multiply(A,inverse(sk_c6))) != sk_c6 | sk_c5 != sk_c6. [back_rewrite(2850),rewrite([3167(4)]),merge(f)].
% 1.27/1.55 3695 multiply(sk_c6,A) = A. [back_rewrite(1130),rewrite([3167(1)])].
% 1.27/1.55 3699 multiply(A,sk_c6) = A. [back_rewrite(1124),rewrite([3167(1)])].
% 1.27/1.55 3700 inverse(sk_c6) = sk_c6. [back_rewrite(1123),rewrite([3167(1),3167(3)])].
% 1.27/1.55 3712 sk_c5 = sk_c6. [back_rewrite(186),rewrite([3700(2),3700(5),3695(6),3167(5)]),flip(a),merge(b)].
% 1.27/1.55 3764 $F. [factor(3332,c,e),rewrite([3712(2),3699(3),3700(5),3712(5),3712(7),3700(12),3699(12),3700(11)]),xx(a),xx(b),xx(c),xx(d)].
% 1.27/1.55
% 1.27/1.55 % SZS output end Refutation
% 1.27/1.55 ============================== end of proof ==========================
% 1.27/1.55
% 1.27/1.55 ============================== STATISTICS ============================
% 1.27/1.55
% 1.27/1.55 Given=280. Generated=11258. Kept=3763. proofs=1.
% 1.27/1.55 Usable=39. Sos=295. Demods=18. Limbo=432, Disabled=3025. Hints=0.
% 1.27/1.55 Megabytes=3.81.
% 1.27/1.55 User_CPU=0.56, System_CPU=0.01, Wall_clock=0.
% 1.27/1.55
% 1.27/1.55 ============================== end of statistics =====================
% 1.27/1.55
% 1.27/1.55 ============================== end of search =========================
% 1.27/1.55
% 1.27/1.55 THEOREM PROVED
% 1.27/1.55 % SZS status Unsatisfiable
% 1.27/1.55
% 1.27/1.55 Exiting with 1 proof.
% 1.27/1.55
% 1.27/1.55 Process 2686 exit (max_proofs) Tue Jun 14 04:43:25 2022
% 1.27/1.55 Prover9 interrupted
%------------------------------------------------------------------------------