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