TSTP Solution File: SYN515-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN515-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:20:30 EDT 2022
% Result : Unknown 0.73s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN515-1 : TPTP v8.1.0. Released v2.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 19:37:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.70/0.98 ============================== Prover9 ===============================
% 0.70/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.98 Process 27665 was started by sandbox on n003.cluster.edu,
% 0.70/0.98 Mon Jul 11 19:37:16 2022
% 0.70/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27511_n003.cluster.edu".
% 0.70/0.98 ============================== end of head ===========================
% 0.70/0.98
% 0.70/0.98 ============================== INPUT =================================
% 0.70/0.98
% 0.70/0.98 % Reading from file /tmp/Prover9_27511_n003.cluster.edu
% 0.70/0.98
% 0.70/0.98 set(prolog_style_variables).
% 0.70/0.98 set(auto2).
% 0.70/0.98 % set(auto2) -> set(auto).
% 0.70/0.98 % set(auto) -> set(auto_inference).
% 0.70/0.98 % set(auto) -> set(auto_setup).
% 0.70/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.70/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.98 % set(auto) -> set(auto_limits).
% 0.70/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.98 % set(auto) -> set(auto_denials).
% 0.70/0.98 % set(auto) -> set(auto_process).
% 0.70/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.70/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.70/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.70/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.70/0.98 % set(auto2) -> assign(stats, some).
% 0.70/0.98 % set(auto2) -> clear(echo_input).
% 0.70/0.98 % set(auto2) -> set(quiet).
% 0.70/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.98 % set(auto2) -> clear(print_given).
% 0.70/0.98 assign(lrs_ticks,-1).
% 0.70/0.98 assign(sos_limit,10000).
% 0.70/0.98 assign(order,kbo).
% 0.70/0.98 set(lex_order_vars).
% 0.70/0.98 clear(print_given).
% 0.70/0.98
% 0.70/0.98 % formulas(sos). % not echoed (89 formulas)
% 0.70/0.98
% 0.70/0.98 ============================== end of input ==========================
% 0.70/0.98
% 0.70/0.98 % From the command line: assign(max_seconds, 300).
% 0.70/0.98
% 0.70/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.98
% 0.70/0.98 % Formulas that are not ordinary clauses:
% 0.70/0.98
% 0.70/0.98 ============================== end of process non-clausal formulas ===
% 0.70/0.98
% 0.70/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.98
% 0.70/0.98 ============================== PREDICATE ELIMINATION =================
% 0.70/0.98 1 -c4_1(A) | -c3_1(A) | -c2_1(A) | -ndr1_0 | -c2_1(a19) | -c4_0 # label(clause77) # label(negated_conjecture). [assumption].
% 0.70/0.98 2 c4_1(a12) | ssSkC2 # label(clause12) # label(negated_conjecture). [assumption].
% 0.70/0.98 Derived: -c3_1(a12) | -c2_1(a12) | -ndr1_0 | -c2_1(a19) | -c4_0 | ssSkC2. [resolve(1,a,2,a)].
% 0.70/0.98 3 -c4_1(A) | -c3_1(A) | -c2_1(A) | -ndr1_0 | -c4_2(a19,a20) | -c4_0 # label(clause79) # label(negated_conjecture). [assumption].
% 0.70/0.98 Derived: -c3_1(a12) | -c2_1(a12) | -ndr1_0 | -c4_2(a19,a20) | -c4_0 | ssSkC2. [resolve(3,a,2,a)].
% 0.70/0.98 4 -c4_1(A) | -c3_1(A) | -c2_1(A) | -ndr1_0 | -c3_2(a19,B) | -c4_2(a19,B) | -ndr1_1(a19) | -c4_0 # label(clause84) # label(negated_conjecture). [assumption].
% 0.70/0.98 Derived: -c3_1(a12) | -c2_1(a12) | -ndr1_0 | -c3_2(a19,A) | -c4_2(a19,A) | -ndr1_1(a19) | -c4_0 | ssSkC2. [resolve(4,a,2,a)].
% 0.70/0.98 5 -ssSkC2 | -c4_1(a13) | c4_0 # label(clause33) # label(negated_conjecture). [assumption].
% 0.70/0.98 6 -c1_0 | c4_1(a7) | c2_0 # label(clause37) # label(negated_conjecture). [assumption].
% 0.70/0.98 7 -c4_1(A) | -c3_1(A) | -c2_1(A) | -ndr1_0 | -c4_0 | ndr1_1(a19) # label(clause68) # label(negated_conjecture). [assumption].
% 0.70/0.98 Derived: -c3_1(a12) | -c2_1(a12) | -ndr1_0 | -c4_0 | ndr1_1(a19) | ssSkC2. [resolve(7,a,2,a)].
% 0.70/0.98 Derived: -c3_1(a7) | -c2_1(a7) | -ndr1_0 | -c4_0 | ndr1_1(a19) | -c1_0 | c2_0. [resolve(7,a,6,b)].
% 0.70/0.98 8 -c4_1(A) | -c3_1(A) | -c2_1(A) | -ndr1_0 | -c4_0 | c3_2(a19,a20) # label(clause76) # label(negated_conjecture). [assumption].
% 0.70/0.98 Derived: -c3_1(a12) | -c2_1(a12) | -ndr1_0 | -c4_0 | c3_2(a19,a20) | ssSkC2. [resolve(8,a,2,a)].
% 0.70/0.98 Derived: -c3_1(a7) | -c2_1(a7) | -ndr1_0 | -c4_0 | c3_2(a19,a20) | -c1_0 | c2_0. [resolve(8,a,6,b)].
% 0.70/0.98 9 -c1_1(a7) | -c1_0 | c2_0 # label(clause48) # label(negated_conjecture). [assumption].
% 0.70/0.98 10 c1_1(a8) | ssSkC1 # label(clause15) # label(negated_conjecture). [assumption].
% 0.70/0.99 11 -ssSkC1 | -c4_0 | c1_1(a10) # label(clause36) # label(negated_conjecture). [assumption].
% 0.70/0.99 12 -ssSkP0(A) | -c1_1(A) | -ndr1_0 | -c3_0 | ndr1_1(A) | c5_0 # label(clause58) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkP0(a8) | -ndr1_0 | -c3_0 | ndr1_1(a8) | c5_0 | ssSkC1. [resolve(12,b,10,a)].
% 0.70/0.99 Derived: -ssSkP0(a10) | -ndr1_0 | -c3_0 | ndr1_1(a10) | c5_0 | -ssSkC1 | -c4_0. [resolve(12,b,11,c)].
% 0.70/0.99 13 -ssSkP0(A) | -c1_1(A) | -ndr1_0 | -c3_0 | c3_2(A,a2) | c5_0 # label(clause64) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkP0(a8) | -ndr1_0 | -c3_0 | c3_2(a8,a2) | c5_0 | ssSkC1. [resolve(13,b,10,a)].
% 0.70/0.99 Derived: -ssSkP0(a10) | -ndr1_0 | -c3_0 | c3_2(a10,a2) | c5_0 | -ssSkC1 | -c4_0. [resolve(13,b,11,c)].
% 0.70/0.99 14 -ssSkP0(A) | -c5_2(A,a2) | -c1_1(A) | -ndr1_0 | -c3_0 | c5_0 # label(clause66) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkP0(a8) | -c5_2(a8,a2) | -ndr1_0 | -c3_0 | c5_0 | ssSkC1. [resolve(14,c,10,a)].
% 0.70/0.99 Derived: -ssSkP0(a10) | -c5_2(a10,a2) | -ndr1_0 | -c3_0 | c5_0 | -ssSkC1 | -c4_0. [resolve(14,c,11,c)].
% 0.70/0.99 15 -ssSkC4 | -c4_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c5_0 | c3_2(A,B) | c1_2(A,B) | c2_2(A,a18) | c1_1(A) # label(clause80) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkC4 | -c4_2(a7,A) | -ndr1_1(a7) | -ndr1_0 | -c5_0 | c3_2(a7,A) | c1_2(a7,A) | c2_2(a7,a18) | -c1_0 | c2_0. [resolve(15,i,9,a)].
% 0.70/0.99 16 -ssSkC4 | -c4_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c5_0 | c3_2(A,B) | c1_2(A,B) | c3_2(A,a18) | c1_1(A) # label(clause81) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkC4 | -c4_2(a7,A) | -ndr1_1(a7) | -ndr1_0 | -c5_0 | c3_2(a7,A) | c1_2(a7,A) | c3_2(a7,a18) | -c1_0 | c2_0. [resolve(16,i,9,a)].
% 0.70/0.99 17 -ssSkP2(A) | -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c2_2(A,a23) | ssSkC5 # label(clause72) # label(negated_conjecture). [assumption].
% 0.70/0.99 18 ndr1_1(A) | ssSkP2(A) # label(clause9) # label(negated_conjecture). [assumption].
% 0.70/0.99 19 c4_2(A,a22) | ssSkP2(A) # label(clause22) # label(negated_conjecture). [assumption].
% 0.70/0.99 20 c5_2(A,a22) | ssSkP2(A) # label(clause23) # label(negated_conjecture). [assumption].
% 0.70/0.99 21 c2_2(A,a22) | ssSkP2(A) # label(clause24) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c2_2(A,a23) | ssSkC5 | c4_2(A,a22). [resolve(17,a,19,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c2_2(A,a23) | ssSkC5 | c5_2(A,a22). [resolve(17,a,20,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c2_2(A,a23) | ssSkC5 | c2_2(A,a22). [resolve(17,a,21,b)].
% 0.70/0.99 22 -ssSkP2(A) | -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c4_2(A,a23) | ssSkC5 # label(clause73) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c4_2(A,a23) | ssSkC5 | c4_2(A,a22). [resolve(22,a,19,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c4_2(A,a23) | ssSkC5 | c5_2(A,a22). [resolve(22,a,20,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | c4_2(A,a23) | ssSkC5 | c2_2(A,a22). [resolve(22,a,21,b)].
% 0.70/0.99 23 -ssSkP2(A) | -ndr1_1(A) | -c5_2(A,a23) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | ssSkC5 # label(clause78) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ndr1_1(A) | -c5_2(A,a23) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | ssSkC5 | c4_2(A,a22). [resolve(23,a,19,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -c5_2(A,a23) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | ssSkC5 | c5_2(A,a22). [resolve(23,a,20,b)].
% 0.70/0.99 Derived: -ndr1_1(A) | -c5_2(A,a23) | -ndr1_0 | c5_2(A,B) | c4_2(A,B) | ssSkC5 | c2_2(A,a22). [resolve(23,a,21,b)].
% 0.70/0.99 24 -ssSkP1(A) | -ssSkC0 | -c3_1(A) | -ndr1_0 | ndr1_1(A) | c4_0 # label(clause53) # label(negated_conjecture). [assumption].
% 0.70/0.99 25 ndr1_1(A) | ssSkP1(A) # label(clause16) # label(negated_conjecture). [assumption].
% 0.70/0.99 26 c4_2(A,a5) | ssSkP1(A) # label(clause30) # label(negated_conjecture). [assumption].
% 0.70/0.99 27 -c5_2(A,a5) | ssSkP1(A) # label(clause42) # label(negated_conjecture). [assumption].
% 0.70/0.99 28 -c1_2(A,a5) | ssSkP1(A) # label(clause43) # label(negated_conjecture). [assumption].
% 0.70/0.99 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | ndr1_1(A) | c4_0 | ndr1_1(A). [resolve(24,a,25,b)].
% 0.70/1.00 29 -ssSkP1(A) | -ssSkC0 | -c3_1(A) | -ndr1_0 | c3_2(A,a6) | c4_0 # label(clause56) # label(negated_conjecture). [assumption].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c3_2(A,a6) | c4_0 | c4_2(A,a5). [resolve(29,a,26,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c3_2(A,a6) | c4_0 | -c5_2(A,a5). [resolve(29,a,27,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c3_2(A,a6) | c4_0 | -c1_2(A,a5). [resolve(29,a,28,b)].
% 0.70/1.00 30 -ssSkP1(A) | -ssSkC0 | -c3_1(A) | -ndr1_0 | c2_2(A,a6) | c4_0 # label(clause57) # label(negated_conjecture). [assumption].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c2_2(A,a6) | c4_0 | c4_2(A,a5). [resolve(30,a,26,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c2_2(A,a6) | c4_0 | -c5_2(A,a5). [resolve(30,a,27,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c3_1(A) | -ndr1_0 | c2_2(A,a6) | c4_0 | -c1_2(A,a5). [resolve(30,a,28,b)].
% 0.70/1.00 31 -ssSkP1(A) | -ssSkC0 | -c5_2(A,a6) | -c3_1(A) | -ndr1_0 | c4_0 # label(clause63) # label(negated_conjecture). [assumption].
% 0.70/1.00 Derived: -ssSkC0 | -c5_2(A,a6) | -c3_1(A) | -ndr1_0 | c4_0 | c4_2(A,a5). [resolve(31,a,26,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c5_2(A,a6) | -c3_1(A) | -ndr1_0 | c4_0 | -c5_2(A,a5). [resolve(31,a,27,b)].
% 0.70/1.00 Derived: -ssSkC0 | -c5_2(A,a6) | -c3_1(A) | -ndr1_0 | c4_0 | -c1_2(A,a5). [resolve(31,a,28,b)].
% 0.70/1.00 32 -ssSkP0(a8) | -ndr1_0 | -c3_0 | ndr1_1(a8) | c5_0 | ssSkC1. [resolve(12,b,10,a)].
% 0.70/1.00 33 ndr1_1(A) | ssSkP0(A) # label(clause17) # label(negated_conjecture). [assumption].
% 0.70/1.00 34 c5_2(A,a1) | ssSkP0(A) # label(clause31) # label(negated_conjecture). [assumption].
% 0.70/1.00 35 -c3_2(A,a1) | ssSkP0(A) # label(clause44) # label(negated_conjecture). [assumption].
% 0.70/1.00 36 -c1_2(A,a1) | ssSkP0(A) # label(clause45) # label(negated_conjecture). [assumption].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | ndr1_1(a8) | c5_0 | ssSkC1 | ndr1_1(a8). [resolve(32,a,33,b)].
% 0.70/1.00 37 -ssSkP0(a10) | -ndr1_0 | -c3_0 | ndr1_1(a10) | c5_0 | -ssSkC1 | -c4_0. [resolve(12,b,11,c)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | ndr1_1(a10) | c5_0 | -ssSkC1 | -c4_0 | ndr1_1(a10). [resolve(37,a,33,b)].
% 0.70/1.00 38 -ssSkP0(a8) | -ndr1_0 | -c3_0 | c3_2(a8,a2) | c5_0 | ssSkC1. [resolve(13,b,10,a)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a8,a2) | c5_0 | ssSkC1 | c5_2(a8,a1). [resolve(38,a,34,b)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a8,a2) | c5_0 | ssSkC1 | -c3_2(a8,a1). [resolve(38,a,35,b)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a8,a2) | c5_0 | ssSkC1 | -c1_2(a8,a1). [resolve(38,a,36,b)].
% 0.70/1.00 39 -ssSkP0(a10) | -ndr1_0 | -c3_0 | c3_2(a10,a2) | c5_0 | -ssSkC1 | -c4_0. [resolve(13,b,11,c)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a10,a2) | c5_0 | -ssSkC1 | -c4_0 | c5_2(a10,a1). [resolve(39,a,34,b)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a10,a2) | c5_0 | -ssSkC1 | -c4_0 | -c3_2(a10,a1). [resolve(39,a,35,b)].
% 0.70/1.00 Derived: -ndr1_0 | -c3_0 | c3_2(a10,a2) | c5_0 | -ssSkC1 | -c4_0 | -c1_2(a10,a1). [resolve(39,a,36,b)].
% 0.70/1.00 40 -ssSkP0(a8) | -c5_2(a8,a2) | -ndr1_0 | -c3_0 | c5_0 | ssSkC1. [resolve(14,c,10,a)].
% 0.70/1.00 Derived: -c5_2(a8,a2) | -ndr1_0 | -c3_0 | c5_0 | ssSkC1 | c5_2(a8,a1). [resolve(40,a,34,b)].
% 0.70/1.00 Derived: -c5_2(a8,a2) | -ndr1_0 | -c3_0 | c5_0 | ssSkC1 | -c3_2(a8,a1). [resolve(40,a,35,b)].
% 0.70/1.00 Derived: -c5_2(a8,a2) | -ndr1_0 | -c3_0 | c5_0 | ssSkC1 | -c1_2(a8,a1). [resolve(40,a,36,b)].
% 0.70/1.00 41 -ssSkP0(a10) | -c5_2(a10,a2) | -ndr1_0 | -c3_0 | c5_0 | -ssSkC1 | -c4_0. [resolve(14,c,11,c)].
% 0.70/1.00 Derived: -c5_2(a10,a2) | -ndr1_0 | -c3_0 | c5_0 | -ssSkC1 | -c4_0 | c5_2(a10,a1). [resolve(41,a,34,b)].
% 0.70/1.00 Derived: -c5_2(a10,a2) | -ndr1_0 | -c3_0 | c5_0 | -ssSkC1 | -c4_0 | -c3_2(a10,a1). [resolve(41,a,35,b)].
% 0.70/1.00 Derived: -c5_2(a10,a2) | -ndr1_0 | -c3_0 | c5_0 | -ssSkC1 | -c4_0 | -c1_2(a10,a1). [resolve(41,a,36,b)].
% 0.70/1.00
% 0.70/1.00 ============================== end predicate elimination =============
% 0.70/1.00
% 0.70/1.00 Auto_denials: (non-Horn, no changes).
% 0.70/1.00
% 0.70/1.00 Term ordering decisions:
% 0.70/1.00 Function symbol KB weights: a8=1. a10=1. a7=1. a1=1. a12=1. a2=1. a24=1. a4=1. a19=1. a22=1. a23=1. a5=1. a6=1. a14=1. a13=1. a16=1. a3=1. a26=1. a15=1. a17=1. a20=1. a21=1. a9=1. a11=1. a18=1. a25=1.
% 0.70/1.00
% 0.70/1.00 ============================== end of process initial clauses ========
% 0.70/1.00
% 0.70/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.00
% 0.70/1.00 ============================== end of clauses for search =============
% 0.73/1.03
% 0.73/1.03 ============================== SEARCH ================================
% 0.73/1.03
% 0.73/1.03 % Starting search at 0.03 seconds.
% 0.73/1.03
% 0.73/1.03 ============================== STATISTICS ============================
% 0.73/1.03
% 0.73/1.03 Given=269. Generated=466. Kept=307. proofs=0.
% 0.73/1.03 Usable=197. Sos=0. Demods=0. Limbo=0, Disabled=247. Hints=0.
% 0.73/1.03 Megabytes=0.56.
% 0.73/1.03 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.73/1.03
% 0.73/1.03 ============================== end of statistics =====================
% 0.73/1.03
% 0.73/1.03 ============================== end of search =========================
% 0.73/1.03
% 0.73/1.03 SEARCH FAILED
% 0.73/1.03
% 0.73/1.03 Exiting with failure.
% 0.73/1.03
% 0.73/1.03 Process 27665 exit (sos_empty) Mon Jul 11 19:37:16 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------