TSTP Solution File: SYN549+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 21 11:21:00 EDT 2022
% Result : Theorem 1.01s 1.21s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0.
% 0.09/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Mon Jul 11 19:29:57 EDT 2022
% 0.16/0.31 % CPUTime :
% 1.01/1.21 ============================== Prover9 ===============================
% 1.01/1.21 Prover9 (32) version 2009-11A, November 2009.
% 1.01/1.21 Process 5637 was started by sandbox2 on n020.cluster.edu,
% 1.01/1.21 Mon Jul 11 19:29:58 2022
% 1.01/1.21 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5484_n020.cluster.edu".
% 1.01/1.21 ============================== end of head ===========================
% 1.01/1.21
% 1.01/1.21 ============================== INPUT =================================
% 1.01/1.21
% 1.01/1.21 % Reading from file /tmp/Prover9_5484_n020.cluster.edu
% 1.01/1.21
% 1.01/1.21 set(prolog_style_variables).
% 1.01/1.21 set(auto2).
% 1.01/1.21 % set(auto2) -> set(auto).
% 1.01/1.21 % set(auto) -> set(auto_inference).
% 1.01/1.21 % set(auto) -> set(auto_setup).
% 1.01/1.21 % set(auto_setup) -> set(predicate_elim).
% 1.01/1.21 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.01/1.21 % set(auto) -> set(auto_limits).
% 1.01/1.21 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.01/1.21 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.01/1.21 % set(auto) -> set(auto_denials).
% 1.01/1.21 % set(auto) -> set(auto_process).
% 1.01/1.21 % set(auto2) -> assign(new_constants, 1).
% 1.01/1.21 % set(auto2) -> assign(fold_denial_max, 3).
% 1.01/1.21 % set(auto2) -> assign(max_weight, "200.000").
% 1.01/1.21 % set(auto2) -> assign(max_hours, 1).
% 1.01/1.21 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.01/1.21 % set(auto2) -> assign(max_seconds, 0).
% 1.01/1.21 % set(auto2) -> assign(max_minutes, 5).
% 1.01/1.21 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.01/1.21 % set(auto2) -> set(sort_initial_sos).
% 1.01/1.21 % set(auto2) -> assign(sos_limit, -1).
% 1.01/1.21 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.01/1.21 % set(auto2) -> assign(max_megs, 400).
% 1.01/1.21 % set(auto2) -> assign(stats, some).
% 1.01/1.21 % set(auto2) -> clear(echo_input).
% 1.01/1.21 % set(auto2) -> set(quiet).
% 1.01/1.21 % set(auto2) -> clear(print_initial_clauses).
% 1.01/1.21 % set(auto2) -> clear(print_given).
% 1.01/1.21 assign(lrs_ticks,-1).
% 1.01/1.21 assign(sos_limit,10000).
% 1.01/1.21 assign(order,kbo).
% 1.01/1.21 set(lex_order_vars).
% 1.01/1.21 clear(print_given).
% 1.01/1.21
% 1.01/1.21 % formulas(sos). % not echoed (3 formulas)
% 1.01/1.21
% 1.01/1.21 ============================== end of input ==========================
% 1.01/1.21
% 1.01/1.21 % From the command line: assign(max_seconds, 300).
% 1.01/1.21
% 1.01/1.21 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.01/1.21
% 1.01/1.21 % Formulas that are not ordinary clauses:
% 1.01/1.21 1 (all X reachable(X,X)) # label(reflexivity_of_reachable) # label(axiom) # label(non_clause). [assumption].
% 1.01/1.21 2 (all X all Y all Z (reachable(X,Y) & reachable(Y,Z) -> reachable(X,Z))) # label(transitivity_of_reachable) # label(axiom) # label(non_clause). [assumption].
% 1.01/1.21 3 -(exists X (reachable(initial_world,X) & (all Y (reachable(X,Y) -> ((exists Z (reachable(Y,Z) & (p(Z) | (exists V (reachable(Z,V) & q(V)))))) <-> (exists W (reachable(Y,W) & p(W))) | (exists W (reachable(Y,W) & q(W)))))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.01/1.21
% 1.01/1.21 ============================== end of process non-clausal formulas ===
% 1.01/1.21
% 1.01/1.21 ============================== PROCESS INITIAL CLAUSES ===============
% 1.01/1.21
% 1.01/1.21 ============================== PREDICATE ELIMINATION =================
% 1.01/1.21
% 1.01/1.21 ============================== end predicate elimination =============
% 1.01/1.21
% 1.01/1.21 Auto_denials: (non-Horn, no changes).
% 1.01/1.21
% 1.01/1.21 Term ordering decisions:
% 1.01/1.21 Function symbol KB weights: initial_world=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 1.01/1.21
% 1.01/1.21 ============================== end of process initial clauses ========
% 1.01/1.21
% 1.01/1.21 ============================== CLAUSES FOR SEARCH ====================
% 1.01/1.21
% 1.01/1.21 ============================== end of clauses for search =============
% 1.01/1.21
% 1.01/1.21 ============================== SEARCH ================================
% 1.01/1.21
% 1.01/1.21 % Starting search at 0.01 seconds.
% 1.01/1.21
% 1.01/1.21 ============================== PROOF =================================
% 1.01/1.21 % SZS status Theorem
% 1.01/1.21 % SZS output start Refutation
% 1.01/1.21
% 1.01/1.21 % Proof 1 at 0.29 (+ 0.01) seconds.
% 1.01/1.21 % Length of proof is 83.
% 1.01/1.21 % Level of proof is 35.
% 1.01/1.21 % Maximum clause weight is 21.000.
% 1.01/1.21 % Given clauses 973.
% 1.01/1.21
% 1.01/1.21 1 (all X reachable(X,X)) # label(reflexivity_of_reachable) # label(axiom) # label(non_clause). [assumption].
% 1.01/1.21 2 (all X all Y all Z (reachable(X,Y) & reachable(Y,Z) -> reachable(X,Z))) # label(transitivity_of_reachable) # label(axiom) # label(non_clause). [assumption].
% 1.01/1.21 3 -(exists X (reachable(initial_world,X) & (all Y (reachable(X,Y) -> ((exists Z (reachable(Y,Z) & (p(Z) | (exists V (reachable(Z,V) & q(V)))))) <-> (exists W (reachable(Y,W) & p(W))) | (exists W (reachable(Y,W) & q(W)))))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.01/1.21 4 reachable(A,A) # label(reflexivity_of_reachable) # label(axiom). [clausify(1)].
% 1.01/1.21 5 -reachable(initial_world,A) | -reachable(f1(A),B) | -p(B) | -reachable(f1(A),C) | -p(C) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 8 -reachable(initial_world,A) | -reachable(f1(A),B) | -reachable(B,C) | -q(C) | -reachable(f1(A),D) | -q(D) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 10 -reachable(A,B) | -reachable(B,C) | reachable(A,C) # label(transitivity_of_reachable) # label(axiom). [clausify(2)].
% 1.01/1.21 11 -reachable(initial_world,A) | reachable(f1(A),f2(A)) | p(f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 12 -reachable(initial_world,A) | p(f2(A)) | q(f3(A)) | p(f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 13 -reachable(initial_world,A) | reachable(f1(A),f2(A)) | reachable(f1(A),f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 14 -reachable(initial_world,A) | reachable(f1(A),f2(A)) | p(f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 15 -reachable(initial_world,A) | p(f2(A)) | reachable(f2(A),f3(A)) | p(f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 16 -reachable(initial_world,A) | p(f2(A)) | q(f3(A)) | reachable(f1(A),f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 17 -reachable(initial_world,A) | p(f2(A)) | q(f3(A)) | p(f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 18 -reachable(initial_world,A) | reachable(f1(A),f2(A)) | reachable(f1(A),f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 19 -reachable(initial_world,A) | p(f2(A)) | reachable(f2(A),f3(A)) | reachable(f1(A),f4(A)) | q(f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 20 -reachable(initial_world,A) | p(f2(A)) | reachable(f2(A),f3(A)) | p(f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 21 -reachable(initial_world,A) | p(f2(A)) | q(f3(A)) | reachable(f1(A),f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 22 -reachable(initial_world,A) | p(f2(A)) | reachable(f2(A),f3(A)) | reachable(f1(A),f4(A)) | reachable(f1(A),f5(A)) # label(prove_this) # label(negated_conjecture). [clausify(3)].
% 1.01/1.21 23 -reachable(initial_world,A) | -reachable(f1(A),B) | -p(B). [factor(5,b,d),merge(d)].
% 1.01/1.21 27 -reachable(initial_world,A) | -reachable(f1(A),B) | -q(B). [factor(8,c,e),merge(e),unit_del(b,4)].
% 1.01/1.21 30 reachable(f1(initial_world),f2(initial_world)) | p(f4(initial_world)) | q(f5(initial_world)). [resolve(11,a,4,a)].
% 1.01/1.21 31 p(f2(initial_world)) | q(f3(initial_world)) | p(f4(initial_world)) | q(f5(initial_world)). [resolve(12,a,4,a)].
% 1.01/1.21 32 reachable(f1(initial_world),f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | q(f5(initial_world)). [resolve(13,a,4,a)].
% 1.01/1.21 33 reachable(f1(initial_world),f2(initial_world)) | p(f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(14,a,4,a)].
% 1.01/1.21 34 p(f2(initial_world)) | reachable(f2(initial_world),f3(initial_world)) | p(f4(initial_world)) | q(f5(initial_world)). [resolve(15,a,4,a)].
% 1.01/1.21 35 p(f2(initial_world)) | q(f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | q(f5(initial_world)). [resolve(16,a,4,a)].
% 1.01/1.21 36 p(f2(initial_world)) | q(f3(initial_world)) | p(f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(17,a,4,a)].
% 1.01/1.21 37 reachable(f1(initial_world),f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(18,a,4,a)].
% 1.01/1.21 38 p(f2(initial_world)) | reachable(f2(initial_world),f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | q(f5(initial_world)). [resolve(19,a,4,a)].
% 1.01/1.21 39 p(f2(initial_world)) | reachable(f2(initial_world),f3(initial_world)) | p(f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(20,a,4,a)].
% 1.01/1.21 40 p(f2(initial_world)) | q(f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(21,a,4,a)].
% 1.01/1.21 41 p(f2(initial_world)) | reachable(f2(initial_world),f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(22,a,4,a)].
% 1.01/1.21 84 p(f4(initial_world)) | q(f5(initial_world)) | -p(f2(initial_world)). [resolve(30,a,23,b),unit_del(c,4)].
% 1.01/1.21 86 p(f4(initial_world)) | q(f5(initial_world)) | -reachable(f2(initial_world),A) | reachable(f1(initial_world),A). [resolve(30,a,10,a)].
% 1.01/1.21 112 reachable(f1(initial_world),f2(initial_world)) | q(f5(initial_world)) | -p(f4(initial_world)). [resolve(32,b,23,b),unit_del(c,4)].
% 1.01/1.21 134 reachable(f1(initial_world),f2(initial_world)) | p(f4(initial_world)) | -q(f5(initial_world)). [resolve(33,c,27,b),unit_del(c,4)].
% 1.01/1.21 166 p(f2(initial_world)) | q(f3(initial_world)) | q(f5(initial_world)) | -p(f4(initial_world)). [resolve(35,c,23,b),unit_del(d,4)].
% 1.01/1.21 173 p(f2(initial_world)) | q(f3(initial_world)) | p(f4(initial_world)) | -q(f5(initial_world)). [resolve(36,d,27,b),unit_del(d,4)].
% 1.01/1.21 179 reachable(f1(initial_world),f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | -q(f5(initial_world)). [resolve(37,c,27,b),unit_del(c,4)].
% 1.01/1.21 190 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | q(f5(initial_world)) | -reachable(A,f2(initial_world)) | reachable(A,f3(initial_world)). [resolve(38,b,10,b)].
% 1.01/1.21 220 p(f2(initial_world)) | q(f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | -q(f5(initial_world)). [resolve(40,d,27,b),unit_del(d,4)].
% 1.01/1.21 247 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)) | -reachable(A,f2(initial_world)) | reachable(A,f3(initial_world)). [resolve(41,b,10,b)].
% 1.01/1.21 280 p(f2(initial_world)) | q(f3(initial_world)) | p(f4(initial_world)). [resolve(173,d,31,d),merge(d),merge(e),merge(f)].
% 1.01/1.21 381 p(f4(initial_world)) | q(f5(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | p(f2(initial_world)). [resolve(86,c,34,b),merge(e),merge(f)].
% 1.01/1.21 578 p(f4(initial_world)) | q(f5(initial_world)) | p(f2(initial_world)) | -q(f3(initial_world)). [resolve(381,c,27,b),unit_del(d,4)].
% 1.01/1.21 590 p(f4(initial_world)) | q(f5(initial_world)) | p(f2(initial_world)). [resolve(578,d,280,b),merge(d),merge(e)].
% 1.01/1.21 592 p(f4(initial_world)) | p(f2(initial_world)) | reachable(f1(initial_world),f2(initial_world)). [resolve(590,b,134,c),merge(d)].
% 1.01/1.21 596 p(f4(initial_world)) | p(f2(initial_world)) | -reachable(f2(initial_world),A) | reachable(f1(initial_world),A). [resolve(592,c,10,a)].
% 1.01/1.21 660 p(f4(initial_world)) | p(f2(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | reachable(f1(initial_world),f5(initial_world)). [resolve(596,c,39,b),merge(d),merge(e)].
% 1.01/1.21 1227 p(f4(initial_world)) | p(f2(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | -q(f5(initial_world)). [resolve(660,d,27,b),unit_del(d,4)].
% 1.01/1.21 1234 p(f4(initial_world)) | p(f2(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(1227,d,590,b),merge(d),merge(e)].
% 1.01/1.21 1236 p(f4(initial_world)) | p(f2(initial_world)) | -q(f3(initial_world)). [resolve(1234,c,27,b),unit_del(c,4)].
% 1.01/1.21 1240 p(f4(initial_world)) | p(f2(initial_world)). [resolve(1236,c,280,b),merge(c),merge(d)].
% 1.01/1.21 1243 p(f2(initial_world)) | q(f3(initial_world)) | q(f5(initial_world)). [resolve(1240,a,166,d),merge(b)].
% 1.01/1.21 1244 p(f2(initial_world)) | reachable(f1(initial_world),f2(initial_world)) | q(f5(initial_world)). [resolve(1240,a,112,c)].
% 1.01/1.21 1245 p(f2(initial_world)) | q(f3(initial_world)) | reachable(f1(initial_world),f4(initial_world)). [resolve(1243,c,220,d),merge(c),merge(d)].
% 1.01/1.21 1286 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | q(f5(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(190,d,1244,b),merge(e),merge(f)].
% 1.01/1.21 1289 p(f2(initial_world)) | q(f3(initial_world)) | -p(f4(initial_world)). [resolve(1245,c,23,b),unit_del(c,4)].
% 1.01/1.21 1292 p(f2(initial_world)) | q(f3(initial_world)). [resolve(1289,c,1240,a),merge(c)].
% 1.01/1.21 1662 p(f2(initial_world)) | q(f5(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | -p(f4(initial_world)). [resolve(1286,b,23,b),unit_del(d,4)].
% 1.01/1.21 1666 p(f2(initial_world)) | q(f5(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(1662,d,1240,a),merge(d)].
% 1.01/1.21 1668 p(f2(initial_world)) | q(f5(initial_world)) | -q(f3(initial_world)). [resolve(1666,c,27,b),unit_del(c,4)].
% 1.01/1.21 1672 p(f2(initial_world)) | q(f5(initial_world)). [resolve(1668,c,1292,b),merge(c)].
% 1.01/1.21 1673 p(f2(initial_world)) | reachable(f1(initial_world),f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)). [resolve(1672,b,179,c)].
% 1.01/1.21 1676 p(f2(initial_world)) | reachable(f1(initial_world),f2(initial_world)) | -p(f4(initial_world)). [resolve(1673,c,23,b),unit_del(c,4)].
% 1.01/1.21 1680 p(f2(initial_world)) | reachable(f1(initial_world),f2(initial_world)). [resolve(1676,c,1240,a),merge(c)].
% 1.01/1.21 1681 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f5(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(1680,b,247,d),merge(b)].
% 1.01/1.21 2647 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | -q(f5(initial_world)). [resolve(1681,c,27,b),unit_del(d,4)].
% 1.01/1.21 2653 p(f2(initial_world)) | reachable(f1(initial_world),f4(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(2647,d,1672,b),merge(d)].
% 1.01/1.21 2656 p(f2(initial_world)) | reachable(f1(initial_world),f3(initial_world)) | -p(f4(initial_world)). [resolve(2653,b,23,b),unit_del(c,4)].
% 1.01/1.21 2662 p(f2(initial_world)) | reachable(f1(initial_world),f3(initial_world)). [resolve(2656,c,1240,a),merge(c)].
% 1.01/1.21 2668 p(f2(initial_world)) | -q(f3(initial_world)). [resolve(2662,b,27,b),unit_del(b,4)].
% 1.01/1.21 2672 p(f2(initial_world)). [resolve(2668,b,1292,b),merge(b)].
% 1.01/1.21 2676 p(f4(initial_world)) | q(f5(initial_world)). [back_unit_del(84),unit_del(c,2672)].
% 1.01/1.21 2691 -reachable(f1(initial_world),f2(initial_world)). [ur(23,a,4,a,c,2672,a)].
% 1.01/1.21 2714 reachable(f1(initial_world),f4(initial_world)) | -q(f5(initial_world)). [back_unit_del(179),unit_del(a,2691)].
% 1.01/1.21 2720 p(f4(initial_world)) | -q(f5(initial_world)). [back_unit_del(134),unit_del(a,2691)].
% 1.01/1.21 2724 q(f5(initial_world)) | -p(f4(initial_world)). [back_unit_del(112),unit_del(a,2691)].
% 1.01/1.21 2729 p(f4(initial_world)). [resolve(2720,b,2676,b),merge(b)].
% 1.01/1.21 2730 q(f5(initial_world)). [back_unit_del(2724),unit_del(b,2729)].
% 1.01/1.21 2732 reachable(f1(initial_world),f4(initial_world)). [back_unit_del(2714),unit_del(b,2730)].
% 1.01/1.21 2761 $F. [ur(23,a,4,a,c,2729,a),unit_del(a,2732)].
% 1.01/1.21
% 1.01/1.21 % SZS output end Refutation
% 1.01/1.21 ============================== end of proof ==========================
% 1.01/1.21
% 1.01/1.21 ============================== STATISTICS ============================
% 1.01/1.21
% 1.01/1.21 Given=973. Generated=4209. Kept=2757. proofs=1.
% 1.01/1.21 Usable=397. Sos=712. Demods=0. Limbo=8, Disabled=1659. Hints=0.
% 1.01/1.21 Megabytes=3.07.
% 1.01/1.21 User_CPU=0.29, System_CPU=0.01, Wall_clock=0.
% 1.01/1.21
% 1.01/1.21 ============================== end of statistics =====================
% 1.01/1.21
% 1.01/1.21 ============================== end of search =========================
% 1.01/1.21
% 1.01/1.21 THEOREM PROVED
% 1.01/1.21 % SZS status Theorem
% 1.01/1.21
% 1.01/1.21 Exiting with 1 proof.
% 1.01/1.21
% 1.01/1.21 Process 5637 exit (max_proofs) Mon Jul 11 19:29:58 2022
% 1.01/1.21 Prover9 interrupted
%------------------------------------------------------------------------------