TSTP Solution File: SEV515+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEV515+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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 : Tue Jul 19 18:00:11 EDT 2022
% Result : Theorem 0.72s 1.02s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV515+1 : TPTP v8.1.0. Released v7.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 28 12:09:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.00 ============================== Prover9 ===============================
% 0.72/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.00 Process 22968 was started by sandbox on n009.cluster.edu,
% 0.72/1.00 Tue Jun 28 12:09:23 2022
% 0.72/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22814_n009.cluster.edu".
% 0.72/1.00 ============================== end of head ===========================
% 0.72/1.00
% 0.72/1.00 ============================== INPUT =================================
% 0.72/1.00
% 0.72/1.00 % Reading from file /tmp/Prover9_22814_n009.cluster.edu
% 0.72/1.00
% 0.72/1.00 set(prolog_style_variables).
% 0.72/1.00 set(auto2).
% 0.72/1.00 % set(auto2) -> set(auto).
% 0.72/1.00 % set(auto) -> set(auto_inference).
% 0.72/1.00 % set(auto) -> set(auto_setup).
% 0.72/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.00 % set(auto) -> set(auto_limits).
% 0.72/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.00 % set(auto) -> set(auto_denials).
% 0.72/1.00 % set(auto) -> set(auto_process).
% 0.72/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.00 % set(auto2) -> assign(stats, some).
% 0.72/1.00 % set(auto2) -> clear(echo_input).
% 0.72/1.00 % set(auto2) -> set(quiet).
% 0.72/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.00 % set(auto2) -> clear(print_given).
% 0.72/1.00 assign(lrs_ticks,-1).
% 0.72/1.00 assign(sos_limit,10000).
% 0.72/1.00 assign(order,kbo).
% 0.72/1.00 set(lex_order_vars).
% 0.72/1.00 clear(print_given).
% 0.72/1.00
% 0.72/1.00 % formulas(sos). % not echoed (5 formulas)
% 0.72/1.00
% 0.72/1.00 ============================== end of input ==========================
% 0.72/1.00
% 0.72/1.00 % From the command line: assign(max_seconds, 300).
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.00
% 0.72/1.00 % Formulas that are not ordinary clauses:
% 0.72/1.00 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.72/1.00 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.72/1.00 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.72/1.00 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.72/1.00 5 -((all A exists B (g_true_only(B,A) & (g_both(B,B) | g_true_only(B,B)) | g_both(B,A) & (g_false_only(B,B) | g_true_only(B,B)) | g_false_only(B,A) & (g_false_only(B,B) | g_both(B,B)))) | (exists A ((exists B (g_both(B,A) & g_both(B,B))) & -(exists B (g_true_only(B,A) & (g_both(B,B) | g_true_only(B,B)) | g_both(B,A) & (g_false_only(B,B) | g_true_only(B,B)) | g_false_only(B,A) & (g_false_only(B,B) | g_both(B,B)))))) & -(exists A all B (g_true_only(B,A) & g_false_only(B,B) | g_false_only(B,A) & g_true_only(B,B)))) # label(nc1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.00
% 0.72/1.00 ============================== end of process non-clausal formulas ===
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.00
% 0.72/1.00 ============================== PREDICATE ELIMINATION =================
% 0.72/1.00 6 -g_both(A,B) | g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.72/1.00 7 -g_true_only(A,B) | -g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.72/1.00 Derived: -g_both(A,B) | -g_true_only(A,B). [resolve(6,b,7,b)].
% 0.72/1.00 8 -g_false_only(A,B) | g_false(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.72/1.00 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(8,b,7,b)].
% 0.72/1.00 9 g_true_only(A,B) | -g_true(A,B) | g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.72/1.00 10 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.72/1.02 Derived: g_both(A,B) | -g_true(A,B) | -g_false_only(A,B). [resolve(10,c,8,b)].
% 0.72/1.02 Derived: g_both(A,B) | -g_true(A,B) | g_true_only(A,B) | -g_true(A,B). [resolve(10,c,9,c)].
% 0.72/1.02 11 g_false_only(A,B) | -g_false(A,B) | g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.72/1.02 Derived: g_false_only(A,B) | g_true(A,B) | -g_both(A,B). [resolve(11,b,6,b)].
% 0.72/1.02
% 0.72/1.02 ============================== end predicate elimination =============
% 0.72/1.02
% 0.72/1.02 Auto_denials: (non-Horn, no changes).
% 0.72/1.02
% 0.72/1.02 Term ordering decisions:
% 0.72/1.02
% 0.72/1.02 % Assigning unary symbol f1 kb_weight 0 and highest precedence (7).
% 0.72/1.02 Function symbol KB weights: c1=1. c2=1. f1=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of process initial clauses ========
% 0.72/1.02
% 0.72/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.02
% 0.72/1.02 ============================== end of clauses for search =============
% 0.72/1.02
% 0.72/1.02 ============================== SEARCH ================================
% 0.72/1.02
% 0.72/1.02 % Starting search at 0.02 seconds.
% 0.72/1.02
% 0.72/1.02 ============================== PROOF =================================
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02 % SZS output start Refutation
% 0.72/1.02
% 0.72/1.02 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.72/1.02 % Length of proof is 67.
% 0.72/1.02 % Level of proof is 16.
% 0.72/1.02 % Maximum clause weight is 30.000.
% 0.72/1.02 % Given clauses 95.
% 0.72/1.02
% 0.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 5 -((all A exists B (g_true_only(B,A) & (g_both(B,B) | g_true_only(B,B)) | g_both(B,A) & (g_false_only(B,B) | g_true_only(B,B)) | g_false_only(B,A) & (g_false_only(B,B) | g_both(B,B)))) | (exists A ((exists B (g_both(B,A) & g_both(B,B))) & -(exists B (g_true_only(B,A) & (g_both(B,B) | g_true_only(B,B)) | g_both(B,A) & (g_false_only(B,B) | g_true_only(B,B)) | g_false_only(B,A) & (g_false_only(B,B) | g_both(B,B)))))) & -(exists A all B (g_true_only(B,A) & g_false_only(B,B) | g_false_only(B,A) & g_true_only(B,B)))) # label(nc1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.72/1.02 6 -g_both(A,B) | g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.72/1.02 7 -g_true_only(A,B) | -g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 0.72/1.02 8 -g_false_only(A,B) | g_false(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.72/1.02 12 g_true_only(A,B) | g_both(A,B) | g_false_only(A,B) # label(exhaustion_g) # label(axiom). [clausify(4)].
% 0.72/1.02 13 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 0.72/1.02 14 -g_true_only(A,c1) | -g_both(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 15 -g_true_only(A,c1) | -g_true_only(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 16 -g_both(A,c1) | -g_false_only(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 17 -g_both(A,c1) | -g_true_only(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 18 -g_false_only(A,c1) | -g_false_only(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 19 -g_false_only(A,c1) | -g_both(A,A) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 21 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 0.72/1.02 23 -g_both(A,B) | -g_both(A,A) | g_true_only(f1(B),B) | g_both(f1(B),B) | g_false_only(f1(B),f1(B)) | g_both(f1(B),f1(B)) | g_true_only(C,c2) | g_true_only(C,C) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 24 -g_both(A,B) | -g_both(A,A) | g_true_only(f1(B),B) | g_both(f1(B),B) | g_false_only(f1(B),f1(B)) | g_both(f1(B),f1(B)) | g_false_only(C,C) | g_false_only(C,c2) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 29 -g_both(A,B) | -g_both(A,A) | g_true_only(f1(B),B) | g_false_only(f1(B),f1(B)) | g_true_only(f1(B),f1(B)) | g_false_only(f1(B),B) | g_false_only(C,C) | g_true_only(C,C) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 31 -g_both(A,B) | -g_both(A,A) | g_both(f1(B),f1(B)) | g_true_only(f1(B),f1(B)) | g_both(f1(B),B) | g_false_only(f1(B),B) | g_true_only(C,c2) | g_true_only(C,C) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 32 -g_both(A,B) | -g_both(A,A) | g_both(f1(B),f1(B)) | g_true_only(f1(B),f1(B)) | g_both(f1(B),B) | g_false_only(f1(B),B) | g_false_only(C,C) | g_false_only(C,c2) # label(nc1) # label(negated_conjecture). [clausify(5)].
% 0.72/1.02 34 -g_both(A,B) | -g_true_only(A,B). [resolve(6,b,7,b)].
% 0.72/1.02 35 -g_false_only(A,B) | -g_true_only(A,B). [resolve(8,b,7,b)].
% 0.72/1.02 38 -g_true_only(c1,c1). [factor(15,a,b)].
% 0.72/1.02 39 -g_false_only(c1,c1). [factor(18,a,b)].
% 0.72/1.02 41 -g_both(A,A) | g_true_only(f1(A),A) | g_both(f1(A),A) | g_false_only(f1(A),f1(A)) | g_both(f1(A),f1(A)) | g_true_only(B,c2) | g_true_only(B,B). [factor(23,a,b)].
% 0.72/1.02 43 -g_both(A,A) | g_true_only(f1(A),A) | g_both(f1(A),A) | g_false_only(f1(A),f1(A)) | g_both(f1(A),f1(A)) | g_false_only(B,B) | g_false_only(B,c2). [factor(24,a,b)].
% 0.72/1.02 55 -g_both(A,A) | g_true_only(f1(A),A) | g_false_only(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_false_only(f1(A),A) | g_false_only(B,B) | g_true_only(B,B). [factor(29,a,b)].
% 0.72/1.02 58 -g_both(A,A) | g_both(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_both(f1(A),A) | g_false_only(f1(A),A) | g_true_only(B,c2) | g_true_only(B,B). [factor(31,a,b)].
% 0.72/1.02 61 -g_both(A,A) | g_both(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_both(f1(A),A) | g_false_only(f1(A),A) | g_false_only(B,B) | g_false_only(B,c2). [factor(32,a,b)].
% 0.72/1.02 64 -g_both(A,A) | g_true_only(f1(A),A) | g_both(f1(A),A) | g_false_only(f1(A),f1(A)) | g_both(f1(A),f1(A)) | g_true_only(c2,c2). [factor(41,f,g)].
% 0.72/1.02 66 -g_both(A,A) | g_true_only(f1(A),A) | g_both(f1(A),A) | g_false_only(f1(A),f1(A)) | g_both(f1(A),f1(A)) | g_false_only(c2,c2). [factor(43,f,g)].
% 0.72/1.02 72 -g_both(A,A) | g_true_only(f1(A),A) | g_false_only(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_false_only(f1(A),A). [factor(55,c,f),merge(f)].
% 0.72/1.02 74 -g_both(A,A) | g_both(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_both(f1(A),A) | g_false_only(f1(A),A) | g_true_only(c2,c2). [factor(58,f,g)].
% 0.72/1.02 75 -g_both(A,A) | g_both(f1(A),f1(A)) | g_true_only(f1(A),f1(A)) | g_both(f1(A),A) | g_false_only(f1(A),A) | g_false_only(c2,c2). [factor(61,f,g)].
% 0.72/1.02 76 -g_both(A,A) | g_both(A,c1) | g_false_only(A,c1). [resolve(14,a,12,a)].
% 0.72/1.02 77 -g_true_only(A,A) | g_both(A,c1) | g_false_only(A,c1). [resolve(15,a,12,a)].
% 0.72/1.02 78 -g_true_only(A,c1) | g_both(A,A) | g_false_only(A,A). [resolve(15,b,12,a)].
% 0.72/1.02 81 g_both(c1,c1). [resolve(38,a,12,a),unit_del(b,39)].
% 0.72/1.02 82 g_both(f1(c1),f1(c1)) | g_true_only(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(f1(c1),c1) | g_false_only(c2,c2). [resolve(81,a,75,a)].
% 0.72/1.02 83 g_both(f1(c1),f1(c1)) | g_true_only(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(f1(c1),c1) | g_true_only(c2,c2). [resolve(81,a,74,a)].
% 0.72/1.02 85 g_true_only(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_true_only(f1(c1),f1(c1)) | g_false_only(f1(c1),c1). [resolve(81,a,72,a)].
% 0.72/1.02 86 g_true_only(f1(c1),c1) | g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)) | g_false_only(c2,c2). [resolve(81,a,66,a)].
% 0.72/1.02 88 g_true_only(f1(c1),c1) | g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)) | g_true_only(c2,c2). [resolve(81,a,64,a)].
% 0.72/1.02 116 g_true_only(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_false_only(f1(c1),c1) | -g_both(f1(c1),c1). [resolve(85,c,17,b)].
% 0.72/1.02 117 g_both(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(f1(c1),c1) | g_false_only(c2,c2). [resolve(82,b,77,a),merge(e),merge(f)].
% 0.72/1.02 118 g_both(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(c2,c2) | -g_false_only(f1(c1),f1(c1)). [resolve(117,c,18,a)].
% 0.72/1.02 119 g_both(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(f1(c1),c1) | g_true_only(c2,c2). [resolve(83,b,77,a),merge(e),merge(f)].
% 0.72/1.02 121 g_both(f1(c1),f1(c1)) | g_both(f1(c1),c1) | g_false_only(f1(c1),c1) | -g_false_only(c2,c2). [resolve(119,d,35,b)].
% 0.72/1.02 130 g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)) | g_false_only(c2,c2). [resolve(86,a,78,a),merge(e),merge(f)].
% 0.72/1.02 131 g_both(f1(c1),c1) | g_both(f1(c1),f1(c1)) | g_false_only(c2,c2). [resolve(130,b,118,d),merge(d),merge(e),merge(f)].
% 0.72/1.02 132 g_both(f1(c1),c1) | g_both(f1(c1),f1(c1)) | g_false_only(f1(c1),c1). [resolve(131,c,121,d),merge(c),merge(d)].
% 0.72/1.02 136 g_both(f1(c1),c1) | g_both(f1(c1),f1(c1)) | -g_false_only(f1(c1),f1(c1)). [resolve(132,c,18,a)].
% 0.72/1.02 137 g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)) | g_true_only(c2,c2). [resolve(88,a,78,a),merge(e),merge(f)].
% 0.72/1.02 139 g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)) | -g_false_only(c2,c2). [resolve(137,d,35,b)].
% 0.72/1.02 143 g_both(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_both(f1(c1),f1(c1)). [resolve(139,d,131,c),merge(d),merge(e)].
% 0.72/1.02 144 g_both(f1(c1),c1) | g_both(f1(c1),f1(c1)). [resolve(143,b,136,c),merge(c),merge(d)].
% 0.72/1.02 145 g_both(f1(c1),c1) | g_false_only(f1(c1),c1). [resolve(144,b,76,a),merge(b)].
% 0.72/1.02 177 g_both(f1(c1),c1) | -g_both(f1(c1),f1(c1)). [resolve(145,b,19,a)].
% 0.72/1.02 179 g_both(f1(c1),c1). [resolve(177,b,144,b),merge(b)].
% 0.72/1.02 180 g_true_only(f1(c1),c1) | g_false_only(f1(c1),f1(c1)) | g_false_only(f1(c1),c1). [back_unit_del(116),unit_del(d,179)].
% 0.72/1.02 182 g_true(f1(c1),c1). [resolve(179,a,21,a)].
% 0.72/1.02 183 -g_true_only(f1(c1),c1). [ur(34,a,179,a)].
% 0.72/1.02 185 -g_false_only(f1(c1),f1(c1)). [ur(16,a,179,a)].
% 0.72/1.02 186 g_false_only(f1(c1),c1). [back_unit_del(180),unit_del(a,183),unit_del(b,185)].
% 0.72/1.02 188 $F. [resolve(182,a,13,b),unit_del(a,186)].
% 0.72/1.02
% 0.72/1.02 % SZS output end Refutation
% 0.72/1.02 ============================== end of proof ==========================
% 0.72/1.02
% 0.72/1.02 ============================== STATISTICS ============================
% 0.72/1.02
% 0.72/1.02 Given=95. Generated=409. Kept=175. proofs=1.
% 0.72/1.02 Usable=60. Sos=15. Demods=0. Limbo=0, Disabled=141. Hints=0.
% 0.72/1.02 Megabytes=0.20.
% 0.72/1.02 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.72/1.02
% 0.72/1.02 ============================== end of statistics =====================
% 0.72/1.02
% 0.72/1.02 ============================== end of search =========================
% 0.72/1.02
% 0.72/1.02 THEOREM PROVED
% 0.72/1.02 % SZS status Theorem
% 0.72/1.02
% 0.72/1.02 Exiting with 1 proof.
% 0.72/1.02
% 0.72/1.02 Process 22968 exit (max_proofs) Tue Jun 28 12:09:23 2022
% 0.72/1.02 Prover9 interrupted
%------------------------------------------------------------------------------