TSTP Solution File: NLP020-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP020-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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 : Mon Jul 18 05:05:39 EDT 2022
% Result : Unknown 0.45s 1.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP020-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 30 22:53:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 12308 was started by sandbox2 on n013.cluster.edu,
% 0.45/1.03 Thu Jun 30 22:54:00 2022
% 0.45/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12155_n013.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_12155_n013.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (68 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 1 -city(A) | location(A) # label(clause11) # label(axiom). [assumption].
% 0.45/1.03 2 city(skc11) # label(clause48) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: location(skc11). [resolve(1,a,2,a)].
% 0.45/1.03 3 -hollywood(A) | city(A) # label(clause12) # label(axiom). [assumption].
% 0.45/1.03 Derived: -hollywood(A) | location(A). [resolve(3,b,1,a)].
% 0.45/1.03 4 -hollywood(A) | location(A). [resolve(3,b,1,a)].
% 0.45/1.03 5 hollywood(skc11) # label(clause49) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: location(skc11). [resolve(4,a,5,a)].
% 0.45/1.03 6 -event(A) | eventuality(A) # label(clause13) # label(axiom). [assumption].
% 0.45/1.03 7 event(skc10) # label(clause50) # label(negated_conjecture). [assumption].
% 0.45/1.03 8 event(skf1(A,B)) # label(clause1) # label(axiom). [assumption].
% 0.45/1.03 Derived: eventuality(skc10). [resolve(6,a,7,a)].
% 0.45/1.03 Derived: eventuality(skf1(A,B)). [resolve(6,a,8,a)].
% 0.45/1.03 9 -have(A,B,C) | -event(A) | of(B,C) # label(clause44) # label(axiom). [assumption].
% 0.45/1.03 Derived: -have(skc10,A,B) | of(A,B). [resolve(9,b,7,a)].
% 0.45/1.03 Derived: -have(skf1(A,B),C,D) | of(C,D). [resolve(9,b,8,a)].
% 0.45/1.03 10 -instrumentality(A) | -way(A) # label(clause37) # label(axiom). [assumption].
% 0.45/1.03 11 way(skc9) # label(clause52) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -instrumentality(skc9). [resolve(10,b,11,a)].
% 0.45/1.03 12 -way(A) | artifact(A) # label(clause20) # label(axiom). [assumption].
% 0.45/1.03 Derived: artifact(skc9). [resolve(12,a,11,a)].
% 0.45/1.03 13 -street(A) | way(A) # label(clause21) # label(axiom). [assumption].
% 0.45/1.03 Derived: -street(A) | -instrumentality(A). [resolve(13,b,10,b)].
% 0.45/1.03 Derived: -street(A) | artifact(A). [resolve(13,b,12,a)].
% 0.45/1.03 14 -street(A) | -instrumentality(A). [resolve(13,b,10,b)].
% 0.45/1.03 15 street(skc9) # label(clause53) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -instrumentality(skc9). [resolve(14,a,15,a)].
% 0.45/1.03 16 -street(A) | artifact(A). [resolve(13,b,12,a)].
% 0.45/1.03 Derived: artifact(skc9). [resolve(16,a,15,a)].
% 0.45/1.03 17 -seat(A) | furniture(A) # label(clause23) # label(axiom). [assumption].
% 0.45/1.03 18 seat(skc7) # label(clause54) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: furniture(skc7). [resolve(17,a,18,a)].
% 0.45/1.03 19 -transport(A) | -furniture(A) # label(clause38) # label(axiom). [assumption].
% 0.45/1.03 20 furniture(skc7) # label(clause55) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -transport(skc7). [resolve(19,b,20,a)].
% 0.45/1.03 21 -furniture(A) | instrumentality(A) # label(clause22) # label(axiom). [assumption].
% 0.45/1.03 Derived: instrumentality(skc7). [resolve(21,a,20,a)].
% 0.45/1.03 22 furniture(skc7). [resolve(17,a,18,a)].
% 0.45/1.03 23 -front(A) | nonhuman(A) # label(clause24) # label(axiom). [assumption].
% 0.45/1.03 24 front(skc7) # label(clause56) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: nonhuman(skc7). [resolve(23,a,24,a)].
% 0.45/1.03 25 -woman(A) | -man(A) # label(clause30) # label(axiom). [assumption].
% 0.45/1.03 26 man(skc6) # label(clause58) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -woman(skc6). [resolve(25,b,26,a)].
% 0.45/1.03 27 -man(A) | male(A) # label(clause8) # label(axiom). [assumption].
% 0.45/1.03 Derived: male(skc6). [resolve(27,a,26,a)].
% 0.45/1.03 28 -man(A) | human(A) # label(clause27) # label(axiom). [assumption].
% 0.45/1.03 Derived: human(skc6). [resolve(28,a,26,a)].
% 0.45/1.03 29 -fellow(A) | man(A) # label(clause28) # label(axiom). [assumption].
% 0.45/1.03 Derived: -fellow(A) | -woman(A). [resolve(29,b,25,b)].
% 0.45/1.03 Derived: -fellow(A) | male(A). [resolve(29,b,27,a)].
% 0.45/1.03 Derived: -fellow(A) | human(A). [resolve(29,b,28,a)].
% 0.45/1.03 30 -fellow(A) | -woman(A). [resolve(29,b,25,b)].
% 0.45/1.03 31 fellow(skc6) # label(clause59) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -woman(skc6). [resolve(30,a,31,a)].
% 0.45/1.03 32 -fellow(A) | male(A). [resolve(29,b,27,a)].
% 0.45/1.03 Derived: male(skc6). [resolve(32,a,31,a)].
% 0.45/1.03 33 -fellow(A) | human(A). [resolve(29,b,28,a)].
% 0.45/1.03 Derived: human(skc6). [resolve(33,a,31,a)].
% 0.45/1.03 34 -chevy(A) | car(A) # label(clause19) # label(axiom). [assumption].
% 0.45/1.03 35 chevy(skc8) # label(clause60) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: car(skc8). [resolve(34,a,35,a)].
% 0.45/1.03 36 -car(A) | vehicle(A) # label(clause18) # label(axiom). [assumption].
% 0.45/1.03 37 car(skc8) # label(clause61) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: vehicle(skc8). [resolve(36,a,37,a)].
% 0.45/1.03 38 car(skc8). [resolve(34,a,35,a)].
% 0.45/1.03 39 -new(A) | -old(A) # label(clause35) # label(axiom). [assumption].
% 0.45/1.03 40 old(skc8) # label(clause64) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: -new(skc8). [resolve(39,b,40,a)].
% 0.45/1.03 41 -female(A) | human(A) # label(clause6) # label(axiom). [assumption].
% 0.45/1.03 42 -nonhuman(A) | -human(A) # label(clause29) # label(axiom). [assumption].
% 0.45/1.03 Derived: -female(A) | -nonhuman(A). [resolve(41,b,42,b)].
% 0.45/1.03 43 -male(A) | human(A) # label(clause7) # label(axiom). [assumption].
% 0.45/1.03 Derived: -male(A) | -nonhuman(A). [resolve(43,b,42,b)].
% 0.45/1.03 44 -human(A) | organism(A) # label(clause26) # label(axiom). [assumption].
% 0.45/1.03 Derived: organism(A) | -female(A). [resolve(44,a,41,b)].
% 0.45/1.03 Derived: organism(A) | -male(A). [resolve(44,a,43,b)].
% 0.45/1.03 45 -owner(A) | -of(A,B) | human(A) # label(clause40) # label(axiom). [assumption].
% 0.45/1.03 Derived: -owner(A) | -of(A,B) | -nonhuman(A). [resolve(45,c,42,b)].
% 0.45/1.03 Derived: -owner(A) | -of(A,B) | organism(A). [resolve(45,c,44,a)].
% 0.45/1.03 46 -human(A) | -have(B,A,C) | owner(A) # label(clause42) # label(axiom). [assumption].
% 0.45/1.03 Derived: -have(A,B,C) | owner(B) | -female(B). [resolve(46,a,41,b)].
% 0.45/1.03 Derived: -have(A,B,C) | owner(B) | -male(B). [resolve(46,a,43,b)].
% 0.45/1.03 47 -human(A) | -have(B,A,C) | of(A,C) # label(clause45) # label(axiom). [assumption].
% 0.45/1.03 Derived: -have(A,B,C) | of(B,C) | -female(B). [resolve(47,a,41,b)].
% 0.45/1.03 Derived: -have(A,B,C) | of(B,C) | -male(B). [resolve(47,a,43,b)].
% 0.45/1.03 Derived: -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(47,a,45,c)].
% 0.45/1.03 48 human(skc6). [resolve(28,a,26,a)].
% 0.45/1.03 Derived: -nonhuman(skc6). [resolve(48,a,42,b)].
% 0.45/1.03 Derived: organism(skc6). [resolve(48,a,44,a)].
% 0.45/1.03 Derived: -have(A,skc6,B) | owner(skc6). [resolve(48,a,46,a)].
% 0.45/1.03 Derived: -have(A,skc6,B) | of(skc6,B). [resolve(48,a,47,a)].
% 0.45/1.03 49 human(skc6). [resolve(33,a,31,a)].
% 0.45/1.03 50 -woman(A) | female(A) # label(clause5) # label(axiom). [assumption].
% 0.45/1.03 51 -female(A) | -male(A) # label(clause31) # label(axiom). [assumption].
% 0.45/1.03 Derived: -woman(A) | -male(A). [resolve(50,b,51,a)].
% 0.45/1.03 52 -female(A) | -nonhuman(A). [resolve(41,b,42,b)].
% 0.45/1.03 Derived: -nonhuman(A) | -woman(A). [resolve(52,a,50,b)].
% 0.45/1.03 53 organism(A) | -female(A). [resolve(44,a,41,b)].
% 0.45/1.03 Derived: organism(A) | -woman(A). [resolve(53,b,50,b)].
% 0.45/1.03 54 -have(A,B,C) | owner(B) | -female(B). [resolve(46,a,41,b)].
% 0.45/1.03 Derived: -have(A,B,C) | owner(B) | -woman(B). [resolve(54,c,50,b)].
% 0.45/1.03 55 -have(A,B,C) | of(B,C) | -female(B). [resolve(47,a,41,b)].
% 0.45/1.03 Derived: -have(A,B,C) | of(B,C) | -woman(B). [resolve(55,c,50,b)].
% 0.45/1.03 56 eventuality(skc10). [resolve(6,a,7,a)].
% 0.45/1.03 57 -eventuality(A) | -abstraction(A) # label(clause32) # label(axiom). [assumption].
% 0.45/1.03 58 -entity(A) | -eventuality(A) # label(clause34) # label(axiom). [assumption].
% 0.45/1.03 Derived: -abstraction(skc10). [resolve(56,a,57,a)].
% 0.45/1.03 Derived: -entity(skc10). [resolve(56,a,58,b)].
% 0.45/1.03 59 eventuality(skf1(A,B)). [resolve(6,a,8,a)].
% 0.45/1.03 Derived: -abstraction(skf1(A,B)). [resolve(59,a,57,a)].
% 0.45/1.03 Derived: -entity(skf1(A,B)). [resolve(59,a,58,b)].
% 0.45/1.03 60 location(skc11). [resolve(1,a,2,a)].
% 0.45/1.03 61 -location(A) | -artifact(A) # label(clause36) # label(axiom). [assumption].
% 0.45/1.03 62 -location(A) | object(A) # label(clause10) # label(axiom). [assumption].
% 0.45/1.03 Derived: -artifact(skc11). [resolve(60,a,61,a)].
% 0.45/1.03 Derived: object(skc11). [resolve(60,a,62,a)].
% 0.45/1.03 63 location(skc11). [resolve(4,a,5,a)].
% 0.45/1.03 64 -artifact(A) | object(A) # label(clause14) # label(axiom). [assumption].
% 0.45/1.03 65 -object(A) | -organism(A) # label(clause39) # label(axiom). [assumption].
% 0.45/1.03 66 -object(A) | entity(A) # label(clause9) # label(axiom). [assumption].
% 0.45/1.03 Derived: -artifact(A) | -organism(A). [resolve(64,b,65,a)].
% 0.45/1.03 Derived: -artifact(A) | entity(A). [resolve(64,b,66,a)].
% 0.45/1.03 67 object(skc11). [resolve(60,a,62,a)].
% 0.45/1.03 Derived: -organism(skc11). [resolve(67,a,65,a)].
% 0.45/1.03 Derived: entity(skc11). [resolve(67,a,66,a)].
% 0.45/1.03 68 -proposition(A) | drs(A) # label(clause4) # label(axiom). [assumption].
% 0.45/1.03 69 -drs(A) | proposition(A) # label(clause3) # label(axiom). [assumption].
% 0.45/1.03 70 vehicle(skc8). [resolve(36,a,37,a)].
% 0.45/1.03 71 -vehicle(A) | transport(A) # label(clause17) # label(axiom). [assumption].
% 0.45/1.03 Derived: transport(skc8). [resolve(70,a,71,a)].
% 0.45/1.03 72 -have(A,B,C) | owner(B) | -male(B). [resolve(46,a,43,b)].
% 0.45/1.03 73 -owner(A) | -of(A,B) | have(C,A,B) # label(clause46) # label(axiom). [assumption].
% 0.45/1.03 74 -owner(A) | -of(A,B) | -nonhuman(A). [resolve(45,c,42,b)].
% 0.45/1.03 75 -owner(A) | -of(A,B) | organism(A). [resolve(45,c,44,a)].
% 0.45/1.03 Derived: -have(A,B,C) | -male(B) | -of(B,D) | have(E,B,D). [resolve(72,b,73,a)].
% 0.45/1.03 Derived: -have(A,B,C) | -male(B) | -of(B,D) | -nonhuman(B). [resolve(72,b,74,a)].
% 0.45/1.03 Derived: -have(A,B,C) | -male(B) | -of(B,D) | organism(B). [resolve(72,b,75,a)].
% 0.45/1.03 76 -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(47,a,45,c)].
% 0.45/1.03 Derived: -have(A,B,C) | of(B,C) | -of(B,D) | -have(E,B,F) | -male(B). [resolve(76,c,72,b)].
% 0.45/1.03 77 -have(A,skc6,B) | owner(skc6). [resolve(48,a,46,a)].
% 0.45/1.03 Derived: -have(A,skc6,B) | -of(skc6,C) | have(D,skc6,C). [resolve(77,b,73,a)].
% 0.45/1.03 Derived: -have(A,skc6,B) | -of(skc6,C) | -nonhuman(skc6). [resolve(77,b,74,a)].
% 0.45/1.03 Derived: -have(A,skc6,B) | -of(skc6,C) | organism(skc6). [resolve(77,b,75,a)].
% 0.45/1.03 78 -have(A,B,C) | owner(B) | -woman(B). [resolve(54,c,50,b)].
% 0.45/1.03 Derived: -have(A,B,C) | -woman(B) | -of(B,D) | have(E,B,D). [resolve(78,b,73,a)].
% 0.45/1.03 Derived: -have(A,B,C) | -woman(B) | -of(B,D) | -nonhuman(B). [resolve(78,b,74,a)].
% 0.45/1.03 Derived: -have(A,B,C) | -woman(B) | -of(B,D) | organism(B). [resolve(78,b,75,a)].
% 0.45/1.03 79 -male(A) | -nonhuman(A). [resolve(43,b,42,b)].
% 0.45/1.03 80 male(skc6). [resolve(27,a,26,a)].
% 0.45/1.03 81 male(skc6). [resolve(32,a,31,a)].
% 0.45/1.03 82 organism(A) | -male(A). [resolve(44,a,43,b)].
% 0.45/1.03 83 -have(A,B,C) | of(B,C) | -male(B). [resolve(47,a,43,b)].
% 0.45/1.03 84 -woman(A) | -male(A). [resolve(50,b,51,a)].
% 0.45/1.03 Derived: -woman(skc6). [resolve(84,b,80,a)].
% 0.45/1.03 85 -have(A,B,C) | -male(B) | -of(B,D) | have(E,B,D). [resolve(72,b,73,a)].
% 0.45/1.03 86 -have(A,B,C) | -male(B) | -of(B,D) | -nonhuman(B). [re
% 0.45/1.03 WARNING: denials share constants (see output).
% 0.45/1.03
% 0.45/1.04 solve(72,b,74,a)].
% 0.45/1.04 87 -have(A,B,C) | -male(B) | -of(B,D) | organism(B). [resolve(72,b,75,a)].
% 0.45/1.04 88 -have(A,B,C) | of(B,C) | -of(B,D) | -have(E,B,F) | -male(B). [resolve(76,c,72,b)].
% 0.45/1.04 Derived: -have(A,skc6,B) | of(skc6,B) | -of(skc6,C) | -have(D,skc6,E). [resolve(88,e,80,a)].
% 0.45/1.04
% 0.45/1.04 ============================== end predicate elimination =============
% 0.45/1.04
% 0.45/1.04 Auto_denials:
% 0.45/1.04 % copying label clause33 to answer in negative clause
% 0.45/1.04 % assign(max_proofs, 19). % (Horn set with more than one neg. clause)
% 0.45/1.04
% 0.45/1.04 WARNING, because some of the denials share constants,
% 0.45/1.04 some of the denials or their descendents may be subsumed,
% 0.45/1.04 preventing the target number of proofs from being found.
% 0.45/1.04 The shared constants are: skc11, skc10, skc6, skc9.
% 0.45/1.04
% 0.45/1.04 Term ordering decisions:
% 0.45/1.04 Function symbol KB weights: skc6=1. skc7=1. skc9=1. skc10=1. skc11=1. skc8=1. skf1=1.
% 0.45/1.04
% 0.45/1.04 ============================== end of process initial clauses ========
% 0.45/1.04
% 0.45/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.04
% 0.45/1.04 ============================== end of clauses for search =============
% 0.45/1.04
% 0.45/1.04 ============================== SEARCH ================================
% 0.45/1.04
% 0.45/1.04 % Starting search at 0.02 seconds.
% 0.45/1.04
% 0.45/1.04 ============================== STATISTICS ============================
% 0.45/1.04
% 0.45/1.04 Given=72. Generated=83. Kept=72. proofs=0.
% 0.45/1.04 Usable=72. Sos=0. Demods=0. Limbo=0, Disabled=140. Hints=0.
% 0.45/1.04 Megabytes=0.10.
% 0.45/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.04
% 0.45/1.04 ============================== end of statistics =====================
% 0.45/1.04
% 0.45/1.04 ============================== end of search =========================
% 0.45/1.04
% 0.45/1.04 SEARCH FAILED
% 0.45/1.04
% 0.45/1.04 Exiting with failure.
% 0.45/1.04
% 0.45/1.04 Process 12308 exit (sos_empty) Thu Jun 30 22:54:00 2022
% 0.45/1.04 Prover9 interrupted
%------------------------------------------------------------------------------