TSTP Solution File: SYN530-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN530-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:42 EDT 2022
% Result : Unknown 0.74s 1.05s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN530-1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 18:12:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/1.01 ============================== Prover9 ===============================
% 0.41/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.01 Process 3367 was started by sandbox on n005.cluster.edu,
% 0.41/1.01 Mon Jul 11 18:12:22 2022
% 0.41/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2996_n005.cluster.edu".
% 0.41/1.01 ============================== end of head ===========================
% 0.41/1.01
% 0.41/1.01 ============================== INPUT =================================
% 0.41/1.01
% 0.41/1.01 % Reading from file /tmp/Prover9_2996_n005.cluster.edu
% 0.41/1.01
% 0.41/1.01 set(prolog_style_variables).
% 0.41/1.01 set(auto2).
% 0.41/1.01 % set(auto2) -> set(auto).
% 0.41/1.01 % set(auto) -> set(auto_inference).
% 0.41/1.01 % set(auto) -> set(auto_setup).
% 0.41/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.01 % set(auto) -> set(auto_limits).
% 0.41/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.01 % set(auto) -> set(auto_denials).
% 0.41/1.01 % set(auto) -> set(auto_process).
% 0.41/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.01 % set(auto2) -> assign(stats, some).
% 0.41/1.01 % set(auto2) -> clear(echo_input).
% 0.41/1.01 % set(auto2) -> set(quiet).
% 0.41/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.01 % set(auto2) -> clear(print_given).
% 0.41/1.01 assign(lrs_ticks,-1).
% 0.41/1.01 assign(sos_limit,10000).
% 0.41/1.01 assign(order,kbo).
% 0.41/1.01 set(lex_order_vars).
% 0.41/1.01 clear(print_given).
% 0.41/1.01
% 0.41/1.01 % formulas(sos). % not echoed (95 formulas)
% 0.41/1.01
% 0.41/1.01 ============================== end of input ==========================
% 0.41/1.01
% 0.41/1.01 % From the command line: assign(max_seconds, 300).
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.01
% 0.41/1.01 % Formulas that are not ordinary clauses:
% 0.41/1.01
% 0.41/1.01 ============================== end of process non-clausal formulas ===
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.01
% 0.41/1.01 ============================== PREDICATE ELIMINATION =================
% 0.41/1.01 1 -c1_1(a377) | -c2_0 # label(clause33) # label(negated_conjecture). [assumption].
% 0.41/1.01 2 c1_1(a382) | ssSkC2 # label(clause10) # label(negated_conjecture). [assumption].
% 0.41/1.01 3 -c1_1(a361) | -c1_0 | -c5_0 # label(clause55) # label(negated_conjecture). [assumption].
% 0.41/1.01 4 -ssSkC0 | -c5_1(A) | -c1_1(A) | -ndr1_0 | -c3_1(a359) # label(clause72) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -ssSkC0 | -c5_1(a382) | -ndr1_0 | -c3_1(a359) | ssSkC2. [resolve(4,c,2,a)].
% 0.41/1.01 5 -ssSkC0 | -c5_1(A) | -c1_1(A) | -ndr1_0 | -c5_1(a359) # label(clause73) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -ssSkC0 | -c5_1(a382) | -ndr1_0 | -c5_1(a359) | ssSkC2. [resolve(5,c,2,a)].
% 0.41/1.01 6 -ssSkC2 | c1_1(a383) | c4_0 # label(clause18) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -ssSkC2 | c4_0 | -ssSkC0 | -c5_1(a383) | -ndr1_0 | -c3_1(a359). [resolve(6,b,4,c)].
% 0.41/1.01 Derived: -ssSkC2 | c4_0 | -ssSkC0 | -c5_1(a383) | -ndr1_0 | -c5_1(a359). [resolve(6,b,5,c)].
% 0.41/1.01 7 -c1_1(A) | -ndr1_0 | c5_1(A) | c4_1(A) | c4_1(a369) | c3_0 # label(clause67) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -ndr1_0 | c5_1(a382) | c4_1(a382) | c4_1(a369) | c3_0 | ssSkC2. [resolve(7,a,2,a)].
% 0.41/1.01 Derived: -ndr1_0 | c5_1(a383) | c4_1(a383) | c4_1(a369) | c3_0 | -ssSkC2 | c4_0. [resolve(7,a,6,b)].
% 0.41/1.01 8 -c1_1(A) | -ndr1_0 | -c3_1(a369) | c5_1(A) | c4_1(A) | c3_0 # label(clause78) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -ndr1_0 | -c3_1(a369) | c5_1(a382) | c4_1(a382) | c3_0 | ssSkC2. [resolve(8,a,2,a)].
% 0.41/1.01 Derived: -ndr1_0 | -c3_1(a369) | c5_1(a383) | c4_1(a383) | c3_0 | -ssSkC2 | c4_0. [resolve(8,a,6,b)].
% 0.41/1.01 9 -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_2(A,a376) | c1_1(A) # label(clause88) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c3_2(a377,A) | -ndr1_1(a377) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a377,A) | c1_2(a377,a376) | -c2_0. [resolve(9,h,1,a)].
% 0.41/1.01 Derived: -c3_2(a361,A) | -ndr1_1(a361) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a361,A) | c1_2(a361,a376) | -c1_0 | -c5_0. [resolve(9,h,3,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_2(A,a376) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c3_1(a359). [resolve(9,h,4,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_2(A,a376) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c5_1(a359). [resolve(9,h,5,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_2(A,a376) | -ndr1_0 | c5_1(A) | c4_1(A) | c4_1(a369) | c3_0. [resolve(9,h,7,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_2(A,a376) | -ndr1_0 | -c3_1(a369) | c5_1(A) | c4_1(A) | c3_0. [resolve(9,h,8,a)].
% 0.41/1.01 10 -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c3_2(A,a376) | c1_1(A) # label(clause89) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c3_2(a377,A) | -ndr1_1(a377) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a377,A) | c3_2(a377,a376) | -c2_0. [resolve(10,h,1,a)].
% 0.41/1.01 Derived: -c3_2(a361,A) | -ndr1_1(a361) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a361,A) | c3_2(a361,a376) | -c1_0 | -c5_0. [resolve(10,h,3,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c3_2(A,a376) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c3_1(a359). [resolve(10,h,4,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c3_2(A,a376) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c5_1(a359). [resolve(10,h,5,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c3_2(A,a376) | -ndr1_0 | c5_1(A) | c4_1(A) | c4_1(a369) | c3_0. [resolve(10,h,7,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c3_2(A,a376) | -ndr1_0 | -c3_1(a369) | c5_1(A) | c4_1(A) | c3_0. [resolve(10,h,8,a)].
% 0.41/1.01 11 -c3_2(A,B) | -ndr1_1(A) | -c4_2(A,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | c1_1(A) # label(clause93) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c3_2(a377,A) | -ndr1_1(a377) | -c4_2(a377,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a377,A) | -c2_0. [resolve(11,h,1,a)].
% 0.41/1.01 Derived: -c3_2(a361,A) | -ndr1_1(a361) | -c4_2(a361,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(a361,A) | -c1_0 | -c5_0. [resolve(11,h,3,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -c4_2(A,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c3_1(a359). [resolve(11,h,4,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -c4_2(A,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | -ssSkC0 | -c5_1(A) | -ndr1_0 | -c5_1(a359). [resolve(11,h,5,c)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -c4_2(A,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | -ndr1_0 | c5_1(A) | c4_1(A) | c4_1(a369) | c3_0. [resolve(11,h,7,a)].
% 0.41/1.01 Derived: -c3_2(A,B) | -ndr1_1(A) | -c4_2(A,a376) | -ndr1_0 | -c2_0 | -c4_0 | c1_2(A,B) | -ndr1_0 | -c3_1(a369) | c5_1(A) | c4_1(A) | c3_0. [resolve(11,h,8,a)].
% 0.41/1.01 12 -ssSkP2(A) | -c3_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 # label(clause74) # label(negated_conjecture). [assumption].
% 0.41/1.01 13 ndr1_1(A) | ssSkP2(A) # label(clause12) # label(negated_conjecture). [assumption].
% 0.41/1.01 14 c2_2(A,a380) | ssSkP2(A) # label(clause24) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c3_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 | ndr1_1(A). [resolve(12,a,13,b)].
% 0.41/1.01 Derived: -c3_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 | c2_2(A,a380). [resolve(12,a,14,b)].
% 0.41/1.01 15 -ssSkP2(A) | -c2_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 # label(clause75) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c2_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 | ndr1_1(A). [resolve(15,a,13,b)].
% 0.41/1.01 Derived: -c2_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0 | c2_2(A,a380). [resolve(15,a,14,b)].
% 0.41/1.01 16 -c5_2(A,a380) | ssSkP2(A) # label(clause39) # label(negated_conjecture). [assumption].
% 0.41/1.01 Derived: -c5_2(A,a380) | -c3_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0. [resolve(16,b,12,a)].
% 0.41/1.01 Derived: -c5_2(A,a380) | -c2_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0. [resolve(16,b,15,a)].
% 0.41/1.01 17 -c3_2(A,a380) | ssSkP2(A) # label(clause40) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -c3_2(A,a380) | -c3_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0. [resolve(17,b,12,a)].
% 0.74/1.03 Derived: -c3_2(A,a380) | -c2_2(A,a381) | -c2_1(A) | -ndr1_0 | -c1_0. [resolve(17,b,15,a)].
% 0.74/1.03 18 -ssSkP2(A) | -c2_1(A) | -ndr1_0 | -c1_0 | ndr1_1(A) # label(clause61) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -c2_1(A) | -ndr1_0 | -c1_0 | ndr1_1(A) | ndr1_1(A). [resolve(18,a,13,b)].
% 0.74/1.03 19 -ssSkP2(A) | -c2_1(A) | -ndr1_0 | -c1_0 | c4_2(A,a381) # label(clause65) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -c2_1(A) | -ndr1_0 | -c1_0 | c4_2(A,a381) | c2_2(A,a380). [resolve(19,a,14,b)].
% 0.74/1.03 Derived: -c2_1(A) | -ndr1_0 | -c1_0 | c4_2(A,a381) | -c5_2(A,a380). [resolve(19,a,16,b)].
% 0.74/1.03 Derived: -c2_1(A) | -ndr1_0 | -c1_0 | c4_2(A,a381) | -c3_2(A,a380). [resolve(19,a,17,b)].
% 0.74/1.03 20 -ssSkP1(A) | -ndr1_0 | -c1_0 | -c5_0 | ndr1_1(A) | c5_1(A) # label(clause66) # label(negated_conjecture). [assumption].
% 0.74/1.03 21 ndr1_1(A) | ssSkP1(A) # label(clause13) # label(negated_conjecture). [assumption].
% 0.74/1.03 22 c3_2(A,a374) | ssSkP1(A) # label(clause25) # label(negated_conjecture). [assumption].
% 0.74/1.03 23 c5_2(A,a374) | ssSkP1(A) # label(clause26) # label(negated_conjecture). [assumption].
% 0.74/1.03 24 -c1_2(A,a374) | ssSkP1(A) # label(clause41) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | ndr1_1(A) | c5_1(A) | ndr1_1(A). [resolve(20,a,21,b)].
% 0.74/1.03 25 -ssSkP1(A) | -ndr1_0 | -c1_0 | -c5_0 | c4_2(A,a375) | c5_1(A) # label(clause76) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c4_2(A,a375) | c5_1(A) | c3_2(A,a374). [resolve(25,a,22,b)].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c4_2(A,a375) | c5_1(A) | c5_2(A,a374). [resolve(25,a,23,b)].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c4_2(A,a375) | c5_1(A) | -c1_2(A,a374). [resolve(25,a,24,b)].
% 0.74/1.03 26 -ssSkP1(A) | -ndr1_0 | -c1_0 | -c5_0 | c1_2(A,a375) | c5_1(A) # label(clause77) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c1_2(A,a375) | c5_1(A) | c3_2(A,a374). [resolve(26,a,22,b)].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c1_2(A,a375) | c5_1(A) | c5_2(A,a374). [resolve(26,a,23,b)].
% 0.74/1.03 Derived: -ndr1_0 | -c1_0 | -c5_0 | c1_2(A,a375) | c5_1(A) | -c1_2(A,a374). [resolve(26,a,24,b)].
% 0.74/1.03 27 -ssSkP0(A) | -ssSkC1 | -c2_1(A) | -ndr1_0 | ndr1_1(A) | c5_0 # label(clause64) # label(negated_conjecture). [assumption].
% 0.74/1.03 28 ndr1_1(A) | ssSkP0(A) # label(clause14) # label(negated_conjecture). [assumption].
% 0.74/1.03 29 -c2_2(A,a366) | ssSkP0(A) # label(clause42) # label(negated_conjecture). [assumption].
% 0.74/1.03 30 -c1_2(A,a366) | ssSkP0(A) # label(clause43) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ssSkC1 | -c2_1(A) | -ndr1_0 | ndr1_1(A) | c5_0 | ndr1_1(A). [resolve(27,a,28,b)].
% 0.74/1.03 31 -ssSkP0(A) | -ssSkC1 | -c2_1(A) | -ndr1_0 | c3_2(A,a367) | c5_0 # label(clause70) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ssSkC1 | -c2_1(A) | -ndr1_0 | c3_2(A,a367) | c5_0 | -c2_2(A,a366). [resolve(31,a,29,b)].
% 0.74/1.03 Derived: -ssSkC1 | -c2_1(A) | -ndr1_0 | c3_2(A,a367) | c5_0 | -c1_2(A,a366). [resolve(31,a,30,b)].
% 0.74/1.03 32 -ssSkP0(A) | -ssSkC1 | -c2_1(A) | -ndr1_0 | c2_2(A,a367) | c5_0 # label(clause71) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ssSkC1 | -c2_1(A) | -ndr1_0 | c2_2(A,a367) | c5_0 | -c2_2(A,a366). [resolve(32,a,29,b)].
% 0.74/1.03 Derived: -ssSkC1 | -c2_1(A) | -ndr1_0 | c2_2(A,a367) | c5_0 | -c1_2(A,a366). [resolve(32,a,30,b)].
% 0.74/1.03 33 -ssSkP0(A) | -ssSkC1 | -c4_2(A,a367) | -c2_1(A) | -ndr1_0 | c5_0 # label(clause79) # label(negated_conjecture). [assumption].
% 0.74/1.03 Derived: -ssSkC1 | -c4_2(A,a367) | -c2_1(A) | -ndr1_0 | c5_0 | -c2_2(A,a366). [resolve(33,a,29,b)].
% 0.74/1.03 Derived: -ssSkC1 | -c4_2(A,a367) | -c2_1(A) | -ndr1_0 | c5_0 | -c1_2(A,a366). [resolve(33,a,30,b)].
% 0.74/1.03
% 0.74/1.03 ============================== end predicate elimination =============
% 0.74/1.03
% 0.74/1.03 Auto_denials: (non-Horn, no changes).
% 0.74/1.03
% 0.74/1.03 Term ordering decisions:
% 0.74/1.03 Function symbol KB weights: a376=1. a361=1. a377=1. a359=1. a369=1. a371=1. a383=1. a363=1. a382=1. a374=1. a375=1. a378=1. a357=1. a358=1. a364=1. a368=1. a370=1. a372=1. a379=1. a360=1. a365=1. a373=1. a384=1. a385=1. a362=1. a386=1.
% 0.74/1.03
% 0.74/1.03 ============================== end of process initial clauses ========
% 0.74/1.05
% 0.74/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.05
% 0.74/1.05 ============================== end of clauses for search =============
% 0.74/1.05
% 0.74/1.05 ============================== SEARCH ================================
% 0.74/1.05
% 0.74/1.05 % Starting search at 0.04 seconds.
% 0.74/1.05
% 0.74/1.05 ============================== STATISTICS ============================
% 0.74/1.05
% 0.74/1.05 Given=211. Generated=323. Kept=227. proofs=0.
% 0.74/1.05 Usable=120. Sos=0. Demods=0. Limbo=0, Disabled=254. Hints=0.
% 0.74/1.05 Megabytes=0.42.
% 0.74/1.05 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.74/1.05
% 0.74/1.05 ============================== end of statistics =====================
% 0.74/1.05
% 0.74/1.05 ============================== end of search =========================
% 0.74/1.05
% 0.74/1.05 SEARCH FAILED
% 0.74/1.05
% 0.74/1.05 Exiting with failure.
% 0.74/1.05
% 0.74/1.05 Process 3367 exit (sos_empty) Mon Jul 11 18:12:22 2022
% 0.74/1.05 Prover9 interrupted
%------------------------------------------------------------------------------