TSTP Solution File: BOO017-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:02 EDT 2022
% Result : Unsatisfiable 6.04s 6.31s
% Output : Refutation 6.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n018.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 : Wed Jun 1 21:28:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 4.23/4.50 ============================== Prover9 ===============================
% 4.23/4.50 Prover9 (32) version 2009-11A, November 2009.
% 4.23/4.50 Process 14303 was started by sandbox on n018.cluster.edu,
% 4.23/4.50 Wed Jun 1 21:28:15 2022
% 4.23/4.50 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14150_n018.cluster.edu".
% 4.23/4.50 ============================== end of head ===========================
% 4.23/4.50
% 4.23/4.50 ============================== INPUT =================================
% 4.23/4.50
% 4.23/4.50 % Reading from file /tmp/Prover9_14150_n018.cluster.edu
% 4.23/4.50
% 4.23/4.50 set(prolog_style_variables).
% 4.23/4.50 set(auto2).
% 4.23/4.50 % set(auto2) -> set(auto).
% 4.23/4.50 % set(auto) -> set(auto_inference).
% 4.23/4.50 % set(auto) -> set(auto_setup).
% 4.23/4.50 % set(auto_setup) -> set(predicate_elim).
% 4.23/4.50 % set(auto_setup) -> assign(eq_defs, unfold).
% 4.23/4.50 % set(auto) -> set(auto_limits).
% 4.23/4.50 % set(auto_limits) -> assign(max_weight, "100.000").
% 4.23/4.50 % set(auto_limits) -> assign(sos_limit, 20000).
% 4.23/4.50 % set(auto) -> set(auto_denials).
% 4.23/4.50 % set(auto) -> set(auto_process).
% 4.23/4.50 % set(auto2) -> assign(new_constants, 1).
% 4.23/4.50 % set(auto2) -> assign(fold_denial_max, 3).
% 4.23/4.50 % set(auto2) -> assign(max_weight, "200.000").
% 4.23/4.50 % set(auto2) -> assign(max_hours, 1).
% 4.23/4.50 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 4.23/4.50 % set(auto2) -> assign(max_seconds, 0).
% 4.23/4.50 % set(auto2) -> assign(max_minutes, 5).
% 4.23/4.50 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 4.23/4.50 % set(auto2) -> set(sort_initial_sos).
% 4.23/4.50 % set(auto2) -> assign(sos_limit, -1).
% 4.23/4.50 % set(auto2) -> assign(lrs_ticks, 3000).
% 4.23/4.50 % set(auto2) -> assign(max_megs, 400).
% 4.23/4.50 % set(auto2) -> assign(stats, some).
% 4.23/4.50 % set(auto2) -> clear(echo_input).
% 4.23/4.50 % set(auto2) -> set(quiet).
% 4.23/4.50 % set(auto2) -> clear(print_initial_clauses).
% 4.23/4.50 % set(auto2) -> clear(print_given).
% 4.23/4.50 assign(lrs_ticks,-1).
% 4.23/4.50 assign(sos_limit,10000).
% 4.23/4.50 assign(order,kbo).
% 4.23/4.50 set(lex_order_vars).
% 4.23/4.50 clear(print_given).
% 4.23/4.50
% 4.23/4.50 % formulas(sos). % not echoed (26 formulas)
% 4.23/4.50
% 4.23/4.50 ============================== end of input ==========================
% 4.23/4.50
% 4.23/4.50 % From the command line: assign(max_seconds, 300).
% 4.23/4.50
% 4.23/4.50 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 4.23/4.50
% 4.23/4.50 % Formulas that are not ordinary clauses:
% 4.23/4.50
% 4.23/4.50 ============================== end of process non-clausal formulas ===
% 4.23/4.50
% 4.23/4.50 ============================== PROCESS INITIAL CLAUSES ===============
% 4.23/4.50
% 4.23/4.50 ============================== PREDICATE ELIMINATION =================
% 4.23/4.50
% 4.23/4.50 ============================== end predicate elimination =============
% 4.23/4.50
% 4.23/4.50 Auto_denials:
% 4.23/4.50 % copying label prove_product to answer in negative clause
% 4.23/4.50
% 4.23/4.50 Term ordering decisions:
% 4.23/4.50
% 4.23/4.50 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 4.23/4.50 Function symbol KB weights: true=1. additive_identity=1. multiplicative_identity=1. x=1. y=1. z=1. add=1. multiply=1. sum=1. product=1. ifeq=1. ifeq2=1. inverse=0.
% 4.23/4.50
% 4.23/4.50 ============================== end of process initial clauses ========
% 4.23/4.50
% 4.23/4.50 ============================== CLAUSES FOR SEARCH ====================
% 4.23/4.50
% 4.23/4.50 ============================== end of clauses for search =============
% 4.23/4.50
% 4.23/4.50 ============================== SEARCH ================================
% 4.23/4.50
% 4.23/4.50 % Starting search at 0.01 seconds.
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=46.000, iters=3355
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=41.000, iters=3493
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=37.000, iters=3406
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=34.000, iters=3335
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=33.000, iters=3387
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=32.000, iters=3359
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=31.000, iters=3401
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=30.000, iters=3336
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=29.000, iters=3446
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=28.000, iters=3336
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=27.000, iters=3351
% 4.23/4.50
% 4.23/4.50 Low Water (keep): wt=26.000, iters=3365
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5711, wt=55.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5712, wt=51.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=6495, wt=50.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5871, wt=49.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5882, wt=48.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5346, wt=47.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=6491, wt=46.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5894, wt=45.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5904, wt=44.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5867, wt=43.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=6588, wt=42.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5811, wt=41.000
% 4.23/4.50
% 4.23/4.50 Low Water (displace): id=5837, wt=40.000
% 6.04/6.31
% 6.04/6.31 Low Water (displace): id=5866, wt=39.000
% 6.04/6.31
% 6.04/6.31 Low Water (displace): id=6597, wt=38.000
% 6.04/6.31
% 6.04/6.31 Low Water (displace): id=5973, wt=37.000
% 6.04/6.31
% 6.04/6.31 Low Water (displace): id=12473, wt=24.000
% 6.04/6.31
% 6.04/6.31 Low Water (displace): id=12482, wt=22.000
% 6.04/6.31
% 6.04/6.31 ============================== PROOF =================================
% 6.04/6.31 % SZS status Unsatisfiable
% 6.04/6.31 % SZS output start Refutation
% 6.04/6.31
% 6.04/6.31 % Proof 1 at 5.27 (+ 0.04) seconds: prove_product.
% 6.04/6.31 % Length of proof is 77.
% 6.04/6.31 % Level of proof is 20.
% 6.04/6.31 % Maximum clause weight is 61.000.
% 6.04/6.31 % Given clauses 1144.
% 6.04/6.31
% 6.04/6.31 1 sum(additive_identity,A,A) = true # label(additive_identity1) # label(axiom). [assumption].
% 6.04/6.31 2 sum(A,additive_identity,A) = true # label(additive_identity2) # label(axiom). [assumption].
% 6.04/6.31 3 product(multiplicative_identity,A,A) = true # label(multiplicative_identity1) # label(axiom). [assumption].
% 6.04/6.31 4 product(A,multiplicative_identity,A) = true # label(multiplicative_identity2) # label(axiom). [assumption].
% 6.04/6.31 5 sum(x,y,z) = true # label(x_plus_y) # label(hypothesis). [assumption].
% 6.04/6.31 6 true = sum(x,y,z). [copy(5),flip(a)].
% 6.04/6.31 7 ifeq2(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 6.04/6.31 8 ifeq(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom). [assumption].
% 6.04/6.31 9 sum(inverse(A),A,multiplicative_identity) = true # label(additive_inverse1) # label(axiom). [assumption].
% 6.04/6.31 10 sum(inverse(A),A,multiplicative_identity) = sum(x,y,z). [copy(9),rewrite([6(4)])].
% 6.04/6.31 17 sum(A,B,add(A,B)) = true # label(closure_of_addition) # label(axiom). [assumption].
% 6.04/6.31 18 sum(A,B,add(A,B)) = sum(x,y,z). [copy(17),rewrite([6(3)])].
% 6.04/6.31 19 product(A,B,multiply(A,B)) = true # label(closure_of_multiplication) # label(axiom). [assumption].
% 6.04/6.31 20 product(A,B,multiply(A,B)) = sum(x,y,z). [copy(19),rewrite([6(3)])].
% 6.04/6.31 21 ifeq(sum(A,B,C),true,sum(B,A,C),true) = true # label(commutativity_of_addition) # label(axiom). [assumption].
% 6.04/6.31 22 ifeq(sum(A,B,C),sum(x,y,z),sum(B,A,C),sum(x,y,z)) = sum(x,y,z). [copy(21),rewrite([6(2),6(7),6(12)])].
% 6.04/6.31 23 ifeq(product(A,B,C),true,product(B,A,C),true) = true # label(commutativity_of_multiplication) # label(axiom). [assumption].
% 6.04/6.31 24 ifeq(product(A,B,C),sum(x,y,z),product(B,A,C),sum(x,y,z)) = sum(x,y,z). [copy(23),rewrite([6(2),6(7),6(12)])].
% 6.04/6.31 25 ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C # label(addition_is_well_defined) # label(axiom). [assumption].
% 6.04/6.31 26 ifeq2(sum(A,B,C),sum(x,y,z),ifeq2(sum(A,B,D),sum(x,y,z),D,C),C) = C. [copy(25),rewrite([6(2),6(7)])].
% 6.04/6.31 27 ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 6.04/6.31 28 ifeq2(product(A,B,C),sum(x,y,z),ifeq2(product(A,B,D),sum(x,y,z),D,C),C) = C. [copy(27),rewrite([6(2),6(7)])].
% 6.04/6.31 33 ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,B,V6),true,ifeq(sum(F,D,A),true,sum(V6,E,C),true),true),true),true) = true # label(distributivity3) # label(axiom). [assumption].
% 6.04/6.31 34 ifeq(product(A,B,C),sum(x,y,z),ifeq(product(D,B,E),sum(x,y,z),ifeq(product(F,B,V6),sum(x,y,z),ifeq(sum(F,D,A),sum(x,y,z),sum(V6,E,C),sum(x,y,z)),sum(x,y,z)),sum(x,y,z)),sum(x,y,z)) = sum(x,y,z). [copy(33),rewrite([6(2),6(7),6(12),6(17),6(22),6(27),6(32),6(37),6(42)])].
% 6.04/6.31 43 ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(E,V6,B),true,ifeq(sum(D,V6,A),true,sum(F,V6,C),true),true),true),true) = true # label(distributivity8) # label(axiom). [assumption].
% 6.04/6.31 44 ifeq(product(A,B,C),sum(x,y,z),ifeq(product(D,E,F),sum(x,y,z),ifeq(sum(E,V6,B),sum(x,y,z),ifeq(sum(D,V6,A),sum(x,y,z),sum(F,V6,C),sum(x,y,z)),sum(x,y,z)),sum(x,y,z)),sum(x,y,z)) = sum(x,y,z). [copy(43),rewrite([6(2),6(7),6(12),6(17),6(22),6(27),6(32),6(37),6(42)])].
% 6.04/6.31 45 product(x,z,x) != true # label(prove_product) # label(negated_conjecture) # answer(prove_product). [assumption].
% 6.04/6.31 46 product(x,z,x) != sum(x,y,z) # answer(prove_product). [copy(45),rewrite([6(5)])].
% 6.04/6.31 47 product(A,multiplicative_identity,A) = sum(x,y,z). [back_rewrite(4),rewrite([6(3)])].
% 6.04/6.31 48 product(multiplicative_identity,A,A) = sum(x,y,z). [back_rewrite(3),rewrite([6(3)])].
% 6.04/6.31 49 sum(x,y,z) = sum(A,additive_identity,A). [back_rewrite(2),rewrite([6(3)]),flip(a)].
% 6.04/6.31 50 sum(x,y,z) = sum(additive_identity,A,A). [back_rewrite(1),rewrite([6(3)]),flip(a)].
% 6.04/6.31 51 sum(inverse(A),A,multiplicative_identity) = sum(inverse(B),B,multiplicative_identity). [para(10(a,2),10(a,2))].
% 6.04/6.31 52 sum(inverse(A),A,multiplicative_identity) = c_0. [new_symbol(51)].
% 6.04/6.31 53 sum(x,y,z) = c_0. [back_rewrite(10),rewrite([52(3)]),flip(a)].
% 6.04/6.31 54 sum(additive_identity,A,A) = c_0. [back_rewrite(50),rewrite([53(4)]),flip(a)].
% 6.04/6.31 55 sum(A,additive_identity,A) = c_0. [back_rewrite(49),rewrite([53(4)]),flip(a)].
% 6.04/6.31 56 product(multiplicative_identity,A,A) = c_0. [back_rewrite(48),rewrite([53(6)])].
% 6.04/6.31 57 product(A,multiplicative_identity,A) = c_0. [back_rewrite(47),rewrite([53(6)])].
% 6.04/6.31 58 product(x,z,x) != c_0 # answer(prove_product). [back_rewrite(46),rewrite([53(8)])].
% 6.04/6.31 59 ifeq(product(A,B,C),c_0,ifeq(product(D,E,F),c_0,ifeq(sum(E,V6,B),c_0,ifeq(sum(D,V6,A),c_0,sum(F,V6,C),c_0),c_0),c_0),c_0) = c_0. [back_rewrite(44),rewrite([53(5),53(7),53(9),53(11),53(13),53(15),53(17),53(19),53(21)])].
% 6.04/6.31 64 ifeq(product(A,B,C),c_0,ifeq(product(D,B,E),c_0,ifeq(product(F,B,V6),c_0,ifeq(sum(F,D,A),c_0,sum(V6,E,C),c_0),c_0),c_0),c_0) = c_0. [back_rewrite(34),rewrite([53(5),53(7),53(9),53(11),53(13),53(15),53(17),53(19),53(21)])].
% 6.04/6.31 67 ifeq2(product(A,B,C),c_0,ifeq2(product(A,B,D),c_0,D,C),C) = C. [back_rewrite(28),rewrite([53(5),53(7)])].
% 6.04/6.31 68 ifeq2(sum(A,B,C),c_0,ifeq2(sum(A,B,D),c_0,D,C),C) = C. [back_rewrite(26),rewrite([53(5),53(7)])].
% 6.04/6.31 69 ifeq(product(A,B,C),c_0,product(B,A,C),c_0) = c_0. [back_rewrite(24),rewrite([53(5),53(7),53(9)])].
% 6.04/6.31 70 ifeq(sum(A,B,C),c_0,sum(B,A,C),c_0) = c_0. [back_rewrite(22),rewrite([53(5),53(7),53(9)])].
% 6.04/6.31 71 product(A,B,multiply(A,B)) = c_0. [back_rewrite(20),rewrite([53(6)])].
% 6.04/6.31 72 sum(A,B,add(A,B)) = c_0. [back_rewrite(18),rewrite([53(6)])].
% 6.04/6.31 83 ifeq(product(A,B,C),c_0,ifeq(product(D,additive_identity,E),c_0,ifeq(sum(D,B,A),c_0,sum(E,B,C),c_0),c_0),c_0) = c_0. [para(54(a,1),59(a,1,3,3,1)),rewrite([8(14)])].
% 6.04/6.31 89 ifeq(product(A,B,C),c_0,ifeq(sum(B,D,E),c_0,ifeq(sum(A,D,multiplicative_identity),c_0,sum(C,D,E),c_0),c_0),c_0) = c_0. [para(56(a,1),59(a,1,1)),rewrite([8(18)])].
% 6.04/6.31 105 product(A,B,multiply(B,A)) = c_0. [para(71(a,1),69(a,1,1)),rewrite([8(6)])].
% 6.04/6.31 138 sum(y,x,z) = c_0. [para(53(a,1),70(a,1,1)),rewrite([8(8)])].
% 6.04/6.31 140 sum(A,B,add(B,A)) = c_0. [para(72(a,1),70(a,1,1)),rewrite([8(6)])].
% 6.04/6.31 162 ifeq2(product(A,B,C),c_0,multiply(A,B),C) = C. [para(71(a,1),67(a,1,3,1)),rewrite([7(6)])].
% 6.04/6.31 285 ifeq(product(A,B,C),c_0,ifeq(product(D,B,E),c_0,ifeq(sum(D,A,multiplicative_identity),c_0,sum(E,C,B),c_0),c_0),c_0) = c_0. [para(56(a,1),64(a,1,1)),rewrite([8(18)])].
% 6.04/6.31 312 multiply(A,B) = multiply(B,A). [para(105(a,1),162(a,1,1)),rewrite([7(5)])].
% 6.04/6.31 344 ifeq2(sum(inverse(A),A,B),c_0,B,multiplicative_identity) = multiplicative_identity. [para(52(a,1),68(a,1,1)),rewrite([7(9)])].
% 6.04/6.31 348 ifeq2(sum(additive_identity,A,B),c_0,B,A) = A. [para(54(a,1),68(a,1,1)),rewrite([7(7)])].
% 6.04/6.31 350 ifeq2(sum(A,additive_identity,B),c_0,B,A) = A. [para(55(a,1),68(a,1,1)),rewrite([7(7)])].
% 6.04/6.31 355 ifeq2(sum(A,B,C),c_0,add(A,B),C) = C. [para(72(a,1),68(a,1,3,1)),rewrite([7(6)])].
% 6.04/6.31 492 add(A,B) = add(B,A). [para(140(a,1),355(a,1,1)),rewrite([7(5)])].
% 6.04/6.31 524 ifeq(product(z,x,A),c_0,ifeq(product(y,additive_identity,B),c_0,sum(B,x,A),c_0),c_0) = c_0. [para(138(a,1),83(a,1,3,3,1)),rewrite([8(14)])].
% 6.04/6.31 676 ifeq(sum(multiplicative_identity,A,B),c_0,ifeq(sum(C,A,multiplicative_identity),c_0,sum(C,A,B),c_0),c_0) = c_0. [para(57(a,1),89(a,1,1)),rewrite([8(15)])].
% 6.04/6.31 8726 ifeq(product(y,additive_identity,A),c_0,sum(A,x,multiply(x,z)),c_0) = c_0. [para(71(a,1),524(a,1,1)),rewrite([312(10),8(15)])].
% 6.04/6.31 11161 ifeq(product(A,B,C),c_0,ifeq(sum(A,multiplicative_identity,multiplicative_identity),c_0,sum(C,B,B),c_0),c_0) = c_0. [para(56(a,1),285(a,1,1)),rewrite([8(15)])].
% 6.04/6.31 12587 ifeq(sum(multiplicative_identity,A,B),c_0,sum(inverse(A),A,B),c_0) = c_0. [para(52(a,1),676(a,1,3,1)),rewrite([8(9)])].
% 6.04/6.31 12620 sum(inverse(A),A,add(A,multiplicative_identity)) = c_0. [para(72(a,1),12587(a,1,1)),rewrite([492(5),8(8)])].
% 6.04/6.31 12693 add(A,multiplicative_identity) = multiplicative_identity. [para(12620(a,1),344(a,1,1)),rewrite([7(6)])].
% 6.04/6.31 13002 sum(A,multiplicative_identity,multiplicative_identity) = c_0. [para(12693(a,1),72(a,1,3))].
% 6.04/6.31 13005 ifeq(product(A,B,C),c_0,sum(C,B,B),c_0) = c_0. [back_rewrite(11161),rewrite([13002(5),8(7)])].
% 6.04/6.31 13644 sum(multiply(A,B),B,B) = c_0. [para(71(a,1),13005(a,1,1)),rewrite([8(6)])].
% 6.04/6.31 13657 multiply(A,additive_identity) = additive_identity. [para(13644(a,1),350(a,1,1)),rewrite([7(6)]),flip(a)].
% 6.04/6.31 14968 product(A,additive_identity,additive_identity) = c_0. [para(13657(a,1),71(a,1,3))].
% 6.04/6.31 15107 sum(additive_identity,x,multiply(x,z)) = c_0. [para(14968(a,1),8726(a,1,1)),rewrite([8(10)])].
% 6.04/6.31 16411 multiply(x,z) = x. [para(15107(a,1),348(a,1,1)),rewrite([7(7)])].
% 6.04/6.31 16686 product(x,z,x) = c_0. [para(16411(a,1),71(a,1,3))].
% 6.04/6.31 16687 $F # answer(prove_product). [resolve(16686,a,58,a)].
% 6.04/6.31
% 6.04/6.31 % SZS output end Refutation
% 6.04/6.31 ============================== end of proof ==========================
% 6.04/6.31
% 6.04/6.31 ============================== STATISTICS ============================
% 6.04/6.31
% 6.04/6.31 Given=1144. Generated=72625. Kept=16666. proofs=1.
% 6.04/6.31 Usable=373. Sos=4808. Demods=5180. Limbo=0, Disabled=11510. Hints=0.
% 6.04/6.31 Megabytes=18.56.
% 6.04/6.31 User_CPU=5.27, System_CPU=0.04, Wall_clock=5.
% 6.04/6.31
% 6.04/6.31 ============================== end of statistics =====================
% 6.04/6.31
% 6.04/6.31 ============================== end of search =========================
% 6.04/6.31
% 6.04/6.31 THEOREM PROVED
% 6.04/6.31 % SZS status Unsatisfiable
% 6.04/6.31
% 6.04/6.31 Exiting with 1 proof.
% 6.04/6.31
% 6.04/6.31 Process 14303 exit (max_proofs) Wed Jun 1 21:28:20 2022
% 6.04/6.31 Prover9 interrupted
%------------------------------------------------------------------------------