TSTP Solution File: LAT238-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT238-1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 06:26:19 EDT 2022
% Result : Unsatisfiable 10.92s 11.23s
% Output : Refutation 10.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LAT238-1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 30 16:25:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.92/11.23 ============================== Prover9 ===============================
% 10.92/11.23 Prover9 (32) version 2009-11A, November 2009.
% 10.92/11.23 Process 25343 was started by sandbox on n021.cluster.edu,
% 10.92/11.23 Thu Jun 30 16:25:59 2022
% 10.92/11.23 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25177_n021.cluster.edu".
% 10.92/11.23 ============================== end of head ===========================
% 10.92/11.23
% 10.92/11.23 ============================== INPUT =================================
% 10.92/11.23
% 10.92/11.23 % Reading from file /tmp/Prover9_25177_n021.cluster.edu
% 10.92/11.23
% 10.92/11.23 set(prolog_style_variables).
% 10.92/11.23 set(auto2).
% 10.92/11.23 % set(auto2) -> set(auto).
% 10.92/11.23 % set(auto) -> set(auto_inference).
% 10.92/11.23 % set(auto) -> set(auto_setup).
% 10.92/11.23 % set(auto_setup) -> set(predicate_elim).
% 10.92/11.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 10.92/11.23 % set(auto) -> set(auto_limits).
% 10.92/11.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 10.92/11.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 10.92/11.23 % set(auto) -> set(auto_denials).
% 10.92/11.23 % set(auto) -> set(auto_process).
% 10.92/11.23 % set(auto2) -> assign(new_constants, 1).
% 10.92/11.23 % set(auto2) -> assign(fold_denial_max, 3).
% 10.92/11.23 % set(auto2) -> assign(max_weight, "200.000").
% 10.92/11.23 % set(auto2) -> assign(max_hours, 1).
% 10.92/11.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 10.92/11.23 % set(auto2) -> assign(max_seconds, 0).
% 10.92/11.23 % set(auto2) -> assign(max_minutes, 5).
% 10.92/11.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 10.92/11.23 % set(auto2) -> set(sort_initial_sos).
% 10.92/11.23 % set(auto2) -> assign(sos_limit, -1).
% 10.92/11.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 10.92/11.23 % set(auto2) -> assign(max_megs, 400).
% 10.92/11.23 % set(auto2) -> assign(stats, some).
% 10.92/11.23 % set(auto2) -> clear(echo_input).
% 10.92/11.23 % set(auto2) -> set(quiet).
% 10.92/11.23 % set(auto2) -> clear(print_initial_clauses).
% 10.92/11.23 % set(auto2) -> clear(print_given).
% 10.92/11.23 assign(lrs_ticks,-1).
% 10.92/11.23 assign(sos_limit,10000).
% 10.92/11.23 assign(order,kbo).
% 10.92/11.23 set(lex_order_vars).
% 10.92/11.23 clear(print_given).
% 10.92/11.23
% 10.92/11.23 % formulas(sos). % not echoed (14 formulas)
% 10.92/11.23
% 10.92/11.23 ============================== end of input ==========================
% 10.92/11.23
% 10.92/11.23 % From the command line: assign(max_seconds, 300).
% 10.92/11.23
% 10.92/11.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 10.92/11.23
% 10.92/11.23 % Formulas that are not ordinary clauses:
% 10.92/11.23
% 10.92/11.23 ============================== end of process non-clausal formulas ===
% 10.92/11.23
% 10.92/11.23 ============================== PROCESS INITIAL CLAUSES ===============
% 10.92/11.23
% 10.92/11.23 ============================== PREDICATE ELIMINATION =================
% 10.92/11.23
% 10.92/11.23 ============================== end predicate elimination =============
% 10.92/11.23
% 10.92/11.23 Auto_denials:
% 10.92/11.23 % copying label prove_distributivity to answer in negative clause
% 10.92/11.23
% 10.92/11.23 Term ordering decisions:
% 10.92/11.23
% 10.92/11.23 % Assigning unary symbol complement kb_weight 0 and highest precedence (8).
% 10.92/11.23 Function symbol KB weights: a=1. one=1. zero=1. b=1. meet=1. join=1. complement=0.
% 10.92/11.23
% 10.92/11.23 ============================== end of process initial clauses ========
% 10.92/11.23
% 10.92/11.23 ============================== CLAUSES FOR SEARCH ====================
% 10.92/11.23
% 10.92/11.23 ============================== end of clauses for search =============
% 10.92/11.23
% 10.92/11.23 ============================== SEARCH ================================
% 10.92/11.23
% 10.92/11.23 % Starting search at 0.01 seconds.
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=185.000, iters=3467
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=151.000, iters=3356
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=133.000, iters=3463
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=127.000, iters=3414
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=119.000, iters=3361
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=117.000, iters=3351
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=115.000, iters=3373
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=111.000, iters=3344
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=109.000, iters=3336
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=103.000, iters=3436
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=101.000, iters=3423
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=97.000, iters=3377
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=95.000, iters=3353
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=94.000, iters=3333
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=87.000, iters=3370
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=81.000, iters=3396
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=77.000, iters=3351
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=56.000, iters=4519
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=51.000, iters=4006
% 10.92/11.23
% 10.92/11.23 Low Water (keep): wt=47.000, iters=3506
% 10.92/11.23
% 10.92/11.23 ============================== PROOF =================================
% 10.92/11.23 % SZS status Unsatisfiable
% 10.92/11.23 % SZS output start Refutation
% 10.92/11.23
% 10.92/11.23 % Proof 1 at 10.04 (+ 0.06) seconds: prove_distributivity.
% 10.92/11.23 % Length of proof is 87.
% 10.92/11.23 % Level of proof is 24.
% 10.92/11.23 % Maximum clause weight is 29.000.
% 10.92/11.23 % Given clauses 331.
% 10.92/11.23
% 10.92/11.23 1 meet(A,A) = A # label(idempotence_of_meet) # label(axiom). [assumption].
% 10.92/11.23 2 join(A,A) = A # label(idempotence_of_join) # label(axiom). [assumption].
% 10.92/11.23 3 meet(b,a) = a # label(prove_distributivity_hypothesis) # label(hypothesis). [assumption].
% 10.92/11.23 4 join(A,complement(A)) = one # label(complement_join) # label(axiom). [assumption].
% 10.92/11.23 5 meet(A,complement(A)) = zero # label(complement_meet) # label(axiom). [assumption].
% 10.92/11.23 6 meet(A,join(A,B)) = A # label(absorption1) # label(axiom). [assumption].
% 10.92/11.23 7 join(A,meet(A,B)) = A # label(absorption2) # label(axiom). [assumption].
% 10.92/11.23 8 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 10.92/11.23 9 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 10.92/11.23 10 meet(meet(A,B),C) = meet(A,meet(B,C)) # label(associativity_of_meet) # label(axiom). [assumption].
% 10.92/11.23 11 meet(A,meet(B,C)) = meet(C,meet(A,B)). [copy(10),rewrite([8(2)]),flip(a)].
% 10.92/11.23 12 join(join(A,B),C) = join(A,join(B,C)) # label(associativity_of_join) # label(axiom). [assumption].
% 10.92/11.23 13 join(A,join(B,C)) = join(C,join(A,B)). [copy(12),rewrite([9(2)]),flip(a)].
% 10.92/11.23 14 meet(A,join(B,meet(C,join(A,D)))) = meet(A,join(B,meet(C,join(B,join(D,meet(A,C)))))) # label(equation_H42) # label(axiom). [assumption].
% 10.92/11.23 15 meet(A,join(B,meet(C,join(B,join(D,meet(A,C)))))) = meet(A,join(B,meet(C,join(A,D)))). [copy(14),flip(a)].
% 10.92/11.23 16 join(complement(b),complement(a)) != complement(a) # label(prove_distributivity) # label(negated_conjecture) # answer(prove_distributivity). [assumption].
% 10.92/11.23 17 join(complement(a),complement(b)) != complement(a) # answer(prove_distributivity). [copy(16),rewrite([9(5)])].
% 10.92/11.23 18 meet(A,B) != zero | join(A,B) != one | complement(A) = B # label(meet_join_complement) # label(axiom). [assumption].
% 10.92/11.23 19 meet(a,b) = a. [back_rewrite(3),rewrite([8(3)])].
% 10.92/11.23 20 meet(A,one) = A. [para(4(a,1),6(a,1,2))].
% 10.92/11.23 21 join(A,zero) = A. [para(5(a,1),7(a,1,2))].
% 10.92/11.23 22 meet(A,meet(A,B)) = meet(A,B). [para(11(a,1),1(a,1)),rewrite([8(1),8(2),11(2,R),1(1),8(3)])].
% 10.92/11.23 23 meet(A,meet(B,complement(A))) = meet(B,zero). [para(5(a,1),11(a,2,2)),rewrite([8(2)])].
% 10.92/11.23 24 meet(A,meet(B,join(A,C))) = meet(A,B). [para(6(a,1),11(a,2,2)),rewrite([8(2),8(4)])].
% 10.92/11.23 26 join(A,join(B,complement(A))) = join(B,one). [para(4(a,1),13(a,2,2)),rewrite([9(2)])].
% 10.92/11.23 27 join(A,join(B,meet(A,C))) = join(A,B). [para(7(a,1),13(a,2,2)),rewrite([9(2),9(4)])].
% 10.92/11.23 29 meet(A,join(B,meet(C,join(B,meet(A,C))))) = meet(A,join(B,meet(A,C))). [para(2(a,1),15(a,1,2,2,2,2)),rewrite([7(7),8(6)])].
% 10.92/11.23 30 meet(A,join(join(B,meet(A,C)),meet(C,join(B,meet(A,C))))) = meet(A,join(B,join(meet(A,C),meet(C,join(A,B))))). [para(2(a,1),15(a,1,2,2,2)),rewrite([9(12),13(12),9(11),13(12,R),9(11)])].
% 10.92/11.23 31 meet(A,join(B,meet(C,join(A,B)))) = meet(A,join(B,meet(A,C))). [para(2(a,1),15(a,2,2,2,2)),rewrite([7(2),9(1),8(5)])].
% 10.92/11.23 32 meet(A,join(meet(B,join(A,C)),meet(B,join(C,join(meet(A,B),meet(B,join(A,C))))))) = meet(A,B). [para(2(a,1),15(a,2,2)),rewrite([13(7),9(6),13(7,R),9(6),24(13)])].
% 10.92/11.23 33 meet(A,join(B,meet(complement(A),join(B,C)))) = meet(A,join(B,meet(complement(A),join(A,C)))). [para(5(a,1),15(a,1,2,2,2,2,2)),rewrite([21(3)])].
% 10.92/11.23 34 meet(A,join(B,meet(join(A,C),join(A,join(B,D))))) = meet(A,join(B,meet(join(A,C),join(A,D)))). [para(6(a,1),15(a,1,2,2,2,2,2)),rewrite([9(2),13(3,R),9(2)])].
% 10.92/11.23 35 meet(A,join(B,meet(C,join(B,join(D,meet(C,A)))))) = meet(A,join(B,meet(C,join(D,A)))). [para(15(a,1),8(a,2)),rewrite([8(1),8(6),9(7)])].
% 10.92/11.23 42 meet(A,join(B,meet(one,join(A,join(B,C))))) = meet(A,join(B,meet(one,join(A,C)))). [para(20(a,1),15(a,1,2,2,2,2,2)),rewrite([9(2),13(3,R),9(2)])].
% 10.92/11.23 43 meet(A,zero) != zero | one != A | complement(A) = zero. [para(21(a,1),18(b,1)),flip(b)].
% 10.92/11.23 44 meet(A,zero) = zero. [para(5(a,1),22(a,1,2)),rewrite([5(4)])].
% 10.92/11.23 46 one != A | complement(A) = zero. [back_rewrite(43),rewrite([44(2)]),xx(a)].
% 10.92/11.23 47 meet(A,meet(B,complement(A))) = zero. [back_rewrite(23),rewrite([44(5)])].
% 10.92/11.23 48 complement(one) = zero. [hyper(18,a,44,a,b,21,a)].
% 10.92/11.23 52 meet(a,meet(b,join(A,a))) = a. [para(19(a,1),24(a,2)),rewrite([9(4)])].
% 10.92/11.23 53 complement(join(A,one)) = zero. [hyper(46,a,7,a(flip)),rewrite([8(3),20(3),9(2)])].
% 10.92/11.23 55 join(A,one) = one. [para(53(a,1),4(a,1,2)),rewrite([9(4),13(4),9(3),21(3),9(2)])].
% 10.92/11.23 56 join(A,join(B,complement(A))) = one. [back_rewrite(26),rewrite([55(5)])].
% 10.92/11.23 57 complement(zero) = one. [hyper(18,a,20,a,b,55,a)].
% 10.92/11.23 75 meet(A,join(B,meet(A,B))) = meet(A,B). [para(6(a,1),29(a,1,2,2)),rewrite([2(1)]),flip(a)].
% 10.92/11.23 76 meet(A,join(B,meet(C,join(B,meet(C,A))))) = meet(A,join(B,meet(C,A))). [para(29(a,1),8(a,2)),rewrite([8(1),8(5),8(6)])].
% 10.92/11.23 95 meet(A,join(zero,meet(B,complement(A)))) = zero. [para(47(a,1),75(a,1,2,2)),rewrite([9(4),47(8)])].
% 10.92/11.23 99 meet(A,join(zero,complement(A))) = zero. [para(1(a,1),95(a,1,2,2))].
% 10.92/11.23 103 join(zero,complement(A)) = complement(A). [hyper(18,a,99,a,b,56,a),flip(a)].
% 10.92/11.23 129 meet(zero,complement(A)) = zero. [para(103(a,1),6(a,1,2))].
% 10.92/11.23 145 meet(A,join(complement(A),meet(A,B))) = meet(A,join(B,complement(A))). [para(4(a,1),31(a,1,2,2,2)),rewrite([20(3),9(2)]),flip(a)].
% 10.92/11.23 162 meet(zero,join(complement(A),meet(B,complement(A)))) = zero. [para(103(a,1),31(a,1,2,2,2)),rewrite([8(10),44(10),21(10),129(9)])].
% 10.92/11.23 260 meet(one,join(A,meet(zero,join(A,B)))) = A. [para(48(a,1),33(a,1,2,2,1)),rewrite([48(9),9(10),55(10),8(10),44(10),21(9),8(8),20(8)])].
% 10.92/11.23 310 meet(A,join(B,meet(zero,join(B,C)))) = meet(A,B). [para(260(a,1),11(a,1,2)),rewrite([20(7),8(6)]),flip(a)].
% 10.92/11.23 314 meet(one,complement(A)) = complement(A). [para(162(a,1),260(a,1,2,2)),rewrite([21(4)])].
% 10.92/11.23 318 join(one,complement(A)) = one. [para(314(a,1),7(a,1,2))].
% 10.92/11.23 384 meet(one,join(A,meet(B,join(A,join(B,C))))) = meet(one,join(A,B)). [para(20(a,1),35(a,1,2,2,2,2,2)),rewrite([9(2),55(9),20(9)])].
% 10.92/11.23 492 join(A,meet(zero,join(A,B))) = A. [para(310(a,1),1(a,1)),rewrite([8(5),6(5)]),flip(a)].
% 10.92/11.23 521 join(zero,meet(A,B)) = meet(A,B). [para(32(a,1),492(a,1,2)),rewrite([9(2),21(2),8(3),44(3),9(3),9(5),21(5)])].
% 10.92/11.23 631 meet(A,meet(B,join(C,meet(A,B)))) = meet(A,B). [para(521(a,1),15(a,1,2)),rewrite([13(4,R),9(3),521(3),521(8),24(7)])].
% 10.92/11.23 794 meet(A,complement(join(A,B))) = zero. [para(33(a,1),631(a,1,2)),rewrite([9(7),13(7,R),2(6),8(7),5(7),21(5),8(4),6(4),8(3),8(7),5(7)])].
% 10.92/11.23 934 meet(A,join(B,meet(one,join(A,complement(B))))) = A. [para(4(a,1),42(a,1,2,2,2,2)),rewrite([55(3),1(3),55(2),20(2)]),flip(a)].
% 10.92/11.23 969 meet(A,join(B,meet(one,join(A,C)))) = A. [para(934(a,1),34(a,2,2,2)),rewrite([9(5),13(5),9(4),4(4),55(4),1(4),55(3),55(3),8(3),13(7,R),9(6),6(8)])].
% 10.92/11.23 995 meet(A,meet(B,join(C,meet(one,join(A,D))))) = meet(A,B). [para(969(a,1),11(a,2,2)),rewrite([8(5),8(7)])].
% 10.92/11.23 997 meet(join(A,B),join(C,meet(one,join(A,B)))) = join(A,B). [para(30(a,1),969(a,1,2,2)),rewrite([8(2),20(2),8(4),20(4),9(4),55(4),20(4),2(3),8(8),20(8)])].
% 10.92/11.23 1604 meet(a,join(complement(a),meet(b,join(A,a)))) = a. [para(52(a,1),145(a,1,2,2)),rewrite([9(5),4(5),20(3),9(9)]),flip(a)].
% 10.92/11.23 1643 meet(A,join(complement(A),complement(join(A,B)))) = zero. [para(794(a,1),145(a,1,2,2)),rewrite([21(3),5(2),9(5)]),flip(a)].
% 10.92/11.23 1848 meet(a,join(complement(a),meet(one,b))) = a. [para(1604(a,1),15(a,2)),rewrite([19(10),2(9),9(8),4(8),8(6)])].
% 10.92/11.23 1865 meet(complement(a),join(a,meet(one,b))) = meet(b,complement(a)). [para(1848(a,1),31(a,1,2,2)),rewrite([9(7),8(17),5(17),9(15),521(15),11(14),8(13),314(13)])].
% 10.92/11.23 1934 meet(complement(A),join(B,meet(A,B))) = meet(B,complement(A)). [para(5(a,1),76(a,1,2,2,2,2)),rewrite([21(3),5(7),21(7),8(6)])].
% 10.92/11.23 4100 meet(zero,meet(complement(A),join(B,C))) = zero. [para(129(a,1),995(a,2)),rewrite([9(5),21(5),8(4),20(4)])].
% 10.92/11.23 4173 meet(zero,meet(b,complement(a))) = zero. [para(1865(a,1),4100(a,1,2))].
% 10.92/11.23 4175 meet(zero,b) = zero. [para(4173(a,1),11(a,1)),rewrite([11(7),8(6),129(6),8(4)]),flip(a)].
% 10.92/11.23 4292 meet(one,join(zero,b)) = meet(one,b). [para(4175(a,1),1934(a,1,2,2)),rewrite([57(2),9(4),57(8),8(8)])].
% 10.92/11.23 4295 meet(A,join(zero,b)) = meet(A,meet(one,b)). [para(4292(a,1),11(a,1,2)),rewrite([20(9),8(8)]),flip(a)].
% 10.92/11.23 4994 join(zero,b) = meet(one,b). [para(4295(a,1),1(a,1)),rewrite([8(7),4295(7),1(7)]),flip(a)].
% 10.92/11.23 4995 meet(A,meet(one,b)) = meet(A,b). [para(11(a,1),4295(a,2)),rewrite([4994(3),20(7),8(6)])].
% 10.92/11.23 5327 meet(one,b) = b. [para(4995(a,1),1(a,1)),rewrite([8(5),4995(5),1(3)]),flip(a)].
% 10.92/11.23 7652 meet(one,join(A,B)) = join(A,B). [para(2(a,1),997(a,1,2)),rewrite([11(5,R),1(4)])].
% 10.92/11.23 7859 join(A,meet(B,join(A,join(B,C)))) = join(A,B). [back_rewrite(384),rewrite([7652(6),7652(7)])].
% 10.92/11.23 8555 join(A,meet(meet(A,B),join(A,C))) = A. [para(7(a,1),7859(a,2)),rewrite([9(3),27(4)])].
% 10.92/11.23 8654 meet(A,join(B,meet(A,meet(B,C)))) = meet(A,B). [para(8555(a,1),29(a,1,2)),flip(a)].
% 10.92/11.23 11612 join(b,meet(A,b)) = b. [para(5327(a,1),8654(a,2)),rewrite([8(5),11(6,R),8(5),5327(5),7652(6)])].
% 10.92/11.23 11678 join(a,b) = b. [para(19(a,1),11612(a,1,2)),rewrite([9(3)])].
% 10.92/11.23 11794 meet(a,join(complement(a),complement(b))) = zero. [para(11678(a,1),1643(a,1,2,2,1))].
% 10.92/11.23 12010 join(a,join(complement(a),complement(b))) != one # answer(prove_distributivity). [ur(18,a,11794,a,c,17,a(flip))].
% 10.92/11.23 12057 $F # answer(prove_distributivity). [para(13(a,1),12010(a,1)),rewrite([4(6),9(4),318(4)]),xx(a)].
% 10.92/11.23
% 10.92/11.23 % SZS output end Refutation
% 10.92/11.23 ============================== end of proof ==========================
% 10.92/11.23
% 10.92/11.23 ============================== STATISTICS ============================
% 10.92/11.23
% 10.92/11.23 Given=331. Generated=61011. Kept=12052. proofs=1.
% 10.92/11.23 Usable=211. Sos=6544. Demods=6049. Limbo=0, Disabled=5311. Hints=0.
% 10.92/11.23 Megabytes=28.72.
% 10.92/11.23 User_CPU=10.04, System_CPU=0.06, Wall_clock=10.
% 10.92/11.23
% 10.92/11.23 ============================== end of statistics =====================
% 10.92/11.23
% 10.92/11.23 ============================== end of search =========================
% 10.92/11.23
% 10.92/11.23 THEOREM PROVED
% 10.92/11.23 % SZS status Unsatisfiable
% 10.92/11.23
% 10.92/11.23 Exiting with 1 proof.
% 10.92/11.23
% 10.92/11.23 Process 25343 exit (max_proofs) Thu Jun 30 16:26:09 2022
% 10.92/11.23 Prover9 interrupted
%------------------------------------------------------------------------------