TSTP Solution File: SYO607+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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 19:17:33 EDT 2022
% Result : Theorem 0.81s 1.08s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 8 20:07:21 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 31745 was started by sandbox2 on n015.cluster.edu,
% 0.69/0.98 Fri Jul 8 20:07:22 2022
% 0.69/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31591_n015.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_31591_n015.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (5 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98 1 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> g_true(X_2,X_1) & -g_false(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 2 (all X_2 all X_1 (g_both(X_2,X_1) <-> g_true(X_2,X_1) & g_false(X_2,X_1))) # label(both_g) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 3 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> g_false(X_2,X_1) & -g_true(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 4 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_both(X_2,X_1) | g_false_only(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause). [assumption].
% 0.69/0.98 5 -((exists A (g_false_only(a,A) & (exists B g_false_only(A,B)))) | (exists A all B g_true_only(A,B)) | (exists A ((g_both(a,A) | (exists B g_both(A,B)) & -(exists B g_false_only(A,B))) & -g_true_only(a,A) & -(all B g_true_only(A,B)))) & -(exists A (g_false_only(a,A) & (exists B g_false_only(A,B)))) & (exists A ((exists B g_both(A,B)) & -(exists B g_false_only(A,B)))) & -(exists A all B g_true_only(A,B))) # label(nc6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98 6 -g_both(A,B) | g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.69/0.98 7 -g_true_only(A,B) | -g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.69/0.98 Derived: -g_both(A,B) | -g_true_only(A,B). [resolve(6,b,7,b)].
% 0.69/0.98 8 -g_false_only(A,B) | g_false(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.69/0.98 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(8,b,7,b)].
% 0.69/0.98 9 g_true_only(A,B) | -g_true(A,B) | g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.69/0.98 10 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.69/0.98 Derived: g_both(A,B) | -g_true(A,B) | -g_false_only(A,B). [resolve(10,c,8,b)].
% 0.81/1.08 Derived: g_both(A,B) | -g_true(A,B) | g_true_only(A,B) | -g_true(A,B). [resolve(10,c,9,c)].
% 0.81/1.08 11 g_false_only(A,B) | -g_false(A,B) | g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.81/1.08 Derived: g_false_only(A,B) | g_true(A,B) | -g_both(A,B). [resolve(11,b,6,b)].
% 0.81/1.08
% 0.81/1.08 ============================== end predicate elimination =============
% 0.81/1.08
% 0.81/1.08 Auto_denials: (non-Horn, no changes).
% 0.81/1.08
% 0.81/1.08 Term ordering decisions:
% 0.81/1.08 Function symbol KB weights: a=1. c1=1. c2=1. c3=1. f1=1. f2=1. f3=1.
% 0.81/1.08
% 0.81/1.08 ============================== end of process initial clauses ========
% 0.81/1.08
% 0.81/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.08
% 0.81/1.08 ============================== end of clauses for search =============
% 0.81/1.08
% 0.81/1.08 ============================== SEARCH ================================
% 0.81/1.08
% 0.81/1.08 % Starting search at 0.01 seconds.
% 0.81/1.08
% 0.81/1.08 ============================== PROOF =================================
% 0.81/1.08 % SZS status Theorem
% 0.81/1.08 % SZS output start Refutation
% 0.81/1.08
% 0.81/1.08 % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.81/1.08 % Length of proof is 67.
% 0.81/1.08 % Level of proof is 33.
% 0.81/1.08 % Maximum clause weight is 26.000.
% 0.81/1.08 % Given clauses 213.
% 0.81/1.08
% 0.81/1.08 1 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> g_true(X_2,X_1) & -g_false(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 2 (all X_2 all X_1 (g_both(X_2,X_1) <-> g_true(X_2,X_1) & g_false(X_2,X_1))) # label(both_g) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 3 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> g_false(X_2,X_1) & -g_true(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 4 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_both(X_2,X_1) | g_false_only(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 5 -((exists A (g_false_only(a,A) & (exists B g_false_only(A,B)))) | (exists A all B g_true_only(A,B)) | (exists A ((g_both(a,A) | (exists B g_both(A,B)) & -(exists B g_false_only(A,B))) & -g_true_only(a,A) & -(all B g_true_only(A,B)))) & -(exists A (g_false_only(a,A) & (exists B g_false_only(A,B)))) & (exists A ((exists B g_both(A,B)) & -(exists B g_false_only(A,B)))) & -(exists A all B g_true_only(A,B))) # label(nc6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.08 7 -g_true_only(A,B) | -g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.81/1.08 8 -g_false_only(A,B) | g_false(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.81/1.08 12 g_true_only(A,B) | g_both(A,B) | g_false_only(A,B) # label(exhaustion_g) # label(axiom). [clausify(4)].
% 0.81/1.08 13 -g_true_only(A,f1(A)) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 14 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.81/1.08 15 -g_false_only(a,A) | -g_false_only(A,B) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 17 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.81/1.08 18 -g_both(a,A) | g_true_only(a,A) | g_true_only(A,B) | g_false_only(a,c1) | -g_both(C,D) | g_false_only(C,f3(C)) | g_true_only(c3,E) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 19 -g_both(a,A) | g_true_only(a,A) | g_true_only(A,B) | g_false_only(c1,c2) | -g_both(C,D) | g_false_only(C,f3(C)) | g_true_only(c3,E) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 20 -g_both(A,B) | g_false_only(A,f2(A)) | g_true_only(a,A) | g_true_only(A,C) | g_false_only(a,c1) | -g_both(D,E) | g_false_only(D,f3(D)) | g_true_only(c3,F) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 21 -g_both(A,B) | g_false_only(A,f2(A)) | g_true_only(a,A) | g_true_only(A,C) | g_false_only(c1,c2) | -g_both(D,E) | g_false_only(D,f3(D)) | g_true_only(c3,F) # label(nc6) # label(negated_conjecture). [clausify(5)].
% 0.81/1.08 23 -g_false_only(A,B) | -g_true_only(A,B). [resolve(8,b,7,b)].
% 0.81/1.08 27 -g_both(a,A) | g_true_only(a,A) | g_true_only(A,B) | g_false_only(a,c1) | g_false_only(a,f3(a)) | g_true_only(c3,C). [factor(18,a,e)].
% 0.81/1.08 30 -g_both(a,A) | g_true_only(a,A) | g_true_only(A,B) | g_false_only(c1,c2) | g_false_only(a,f3(a)) | g_true_only(c3,C). [factor(19,a,e)].
% 0.81/1.08 33 -g_both(A,B) | g_false_only(A,f2(A)) | g_true_only(a,A) | g_true_only(A,C) | g_false_only(a,c1) | g_false_only(A,f3(A)) | g_true_only(c3,D). [factor(20,a,f)].
% 0.81/1.08 36 -g_both(A,B) | g_false_only(A,f2(A)) | g_true_only(a,A) | g_true_only(A,C) | g_false_only(c1,c2) | g_false_only(A,f3(A)) | g_true_only(c3,D). [factor(21,a,f)].
% 0.81/1.08 47 -g_false_only(A,B) | g_true_only(a,A) | g_both(a,A). [resolve(15,a,12,c)].
% 0.81/1.08 50 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_both(A,B). [resolve(47,a,12,c)].
% 0.81/1.08 75 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_true_only(A,C) | g_false_only(c1,c2) | g_false_only(A,f3(A)) | g_true_only(c3,D). [resolve(50,d,36,a),merge(e)].
% 0.81/1.08 78 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_true_only(A,C) | g_false_only(a,c1) | g_false_only(A,f3(A)) | g_true_only(c3,D). [resolve(50,d,33,a),merge(e)].
% 0.81/1.08 99 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_false_only(c1,c2) | g_false_only(A,f3(A)) | g_true_only(c3,C). [factor(75,c,e)].
% 0.81/1.08 101 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_false_only(a,c1) | g_false_only(A,f3(A)) | g_true_only(c3,C). [factor(78,c,e)].
% 0.81/1.08 308 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_false_only(c1,c2) | g_true_only(c3,C). [resolve(99,f,47,a),merge(g),merge(h)].
% 0.81/1.08 332 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(A,f2(A)) | g_false_only(a,c1) | g_true_only(c3,C). [resolve(101,f,47,a),merge(g),merge(h)].
% 0.81/1.08 403 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(c1,c2) | g_true_only(c3,C). [resolve(308,d,47,a),merge(f),merge(g)].
% 0.81/1.08 406 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_true_only(c3,C) | -g_false_only(a,c1). [resolve(403,d,15,b)].
% 0.81/1.08 486 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_false_only(a,c1) | g_true_only(c3,C). [resolve(332,d,47,a),merge(f),merge(g)].
% 0.81/1.08 488 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true_only(a,D) | g_both(a,D) | g_true_only(D,E) | g_true_only(c3,F). [resolve(486,d,406,e)].
% 0.81/1.08 494 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true_only(c3,D). [factor(488,c,g),merge(e),merge(f)].
% 0.81/1.08 497 g_true_only(a,A) | g_both(a,A) | g_true_only(A,B) | g_true_only(c3,C). [factor(494,d,e)].
% 0.81/1.08 519 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true_only(A,D) | g_false_only(c1,c2) | g_false_only(a,f3(a)) | g_true_only(c3,E). [resolve(497,b,30,a),merge(d)].
% 0.81/1.08 520 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true_only(A,D) | g_false_only(a,c1) | g_false_only(a,f3(a)) | g_true_only(c3,E). [resolve(497,b,27,a),merge(d)].
% 0.81/1.08 523 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true(a,A). [resolve(497,b,17,a)].
% 0.81/1.08 532 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(c1,c2) | g_false_only(a,f3(a)) | g_true_only(c3,D). [factor(519,b,d)].
% 0.81/1.08 534 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(a,c1) | g_false_only(a,f3(a)) | g_true_only(c3,D). [factor(520,b,d)].
% 0.81/1.08 548 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(c1,c2) | g_false_only(a,f3(a)). [factor(532,c,f)].
% 0.81/1.08 549 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(a,c1) | g_false_only(a,f3(a)). [factor(534,c,f)].
% 0.81/1.08 554 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | -g_false_only(a,A). [resolve(523,d,14,b)].
% 0.81/1.08 560 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(c1,c2) | g_true_only(a,f3(a)) | g_true_only(f3(a),D) | g_true_only(c3,E). [resolve(548,e,554,d)].
% 0.81/1.08 565 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_false_only(c1,c2) | g_true_only(c3,C). [factor(560,b,f),merge(e)].
% 0.81/1.08 568 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_false_only(c1,c2). [factor(565,c,e)].
% 0.81/1.08 575 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | -g_false_only(a,c1). [resolve(568,d,15,b)].
% 0.81/1.08 576 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(a,c1) | g_true_only(a,f3(a)) | g_true_only(f3(a),D) | g_true_only(c3,E). [resolve(549,e,554,d)].
% 0.81/1.08 578 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(a,c1) | -g_true_only(a,f3(a)). [resolve(549,e,23,a)].
% 0.81/1.08 581 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_false_only(a,c1) | g_true_only(c3,C). [factor(576,b,f),merge(e)].
% 0.81/1.08 584 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_false_only(a,c1). [factor(581,c,e)].
% 0.81/1.08 585 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_true_only(f3(a),C) | g_true_only(c3,D). [resolve(584,d,575,d),merge(d)].
% 0.81/1.08 590 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B) | g_true_only(c3,C). [factor(585,b,d)].
% 0.81/1.08 593 g_true_only(a,f3(a)) | g_true_only(f3(a),A) | g_true_only(c3,B). [factor(590,c,d)].
% 0.81/1.08 598 g_true_only(a,f3(a)) | g_true_only(c3,A). [resolve(593,b,13,a)].
% 0.81/1.08 607 g_true_only(a,f3(a)). [resolve(598,b,13,a)].
% 0.81/1.08 610 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_false_only(a,c1). [back_unit_del(578),unit_del(e,607)].
% 0.81/1.08 635 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | g_true_only(a,c1) | g_true_only(c1,D) | g_true_only(c3,E). [resolve(610,d,554,d)].
% 0.81/1.08 638 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C) | -g_true_only(a,c1). [resolve(610,d,23,a)].
% 0.81/1.08 641 g_true_only(a,c1) | g_true_only(c1,A) | g_true_only(c3,B) | g_true_only(c3,C). [factor(635,b,e),merge(d)].
% 0.81/1.08 648 g_true_only(a,c1) | g_true_only(c1,A) | g_true_only(c3,B). [factor(641,c,d)].
% 0.81/1.08 653 g_true_only(a,c1) | g_true_only(c3,A). [resolve(648,b,13,a)].
% 0.81/1.08 660 g_true_only(a,c1). [resolve(653,b,13,a)].
% 0.81/1.08 661 g_true_only(a,A) | g_true_only(A,B) | g_true_only(c3,C). [back_unit_del(638),unit_del(d,660)].
% 0.81/1.08 668 g_true_only(a,A) | g_true_only(c3,B). [resolve(661,b,13,a)].
% 0.81/1.08 672 g_true_only(c3,A). [resolve(668,a,13,a)].
% 0.81/1.08 673 $F. [resolve(672,a,13,a)].
% 0.81/1.08
% 0.81/1.08 % SZS output end Refutation
% 0.81/1.08 ============================== end of proof ==========================
% 0.81/1.08
% 0.81/1.08 ============================== STATISTICS ============================
% 0.81/1.08
% 0.81/1.08 Given=213. Generated=2494. Kept=660. proofs=1.
% 0.81/1.08 Usable=31. Sos=3. Demods=0. Limbo=1, Disabled=645. Hints=0.
% 0.81/1.08 Megabytes=0.50.
% 0.81/1.08 User_CPU=0.11, System_CPU=0.01, Wall_clock=0.
% 0.81/1.08
% 0.81/1.08 ============================== end of statistics =====================
% 0.81/1.08
% 0.81/1.08 ============================== end of search =========================
% 0.81/1.08
% 0.81/1.08 THEOREM PROVED
% 0.81/1.08 % SZS status Theorem
% 0.81/1.08
% 0.81/1.08 Exiting with 1 proof.
% 0.81/1.08
% 0.81/1.08 Process 31745 exit (max_proofs) Fri Jul 8 20:07:22 2022
% 0.81/1.08 Prover9 interrupted
%------------------------------------------------------------------------------