TSTP Solution File: NLP124+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP124+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:07:00 EDT 2022
% Result : Unknown 0.78s 1.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP124+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n008.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 : Fri Jul 1 07:18:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.03 ============================== Prover9 ===============================
% 0.46/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.03 Process 5059 was started by sandbox on n008.cluster.edu,
% 0.46/1.03 Fri Jul 1 07:18:53 2022
% 0.46/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4715_n008.cluster.edu".
% 0.46/1.03 ============================== end of head ===========================
% 0.46/1.03
% 0.46/1.03 ============================== INPUT =================================
% 0.46/1.03
% 0.46/1.03 % Reading from file /tmp/Prover9_4715_n008.cluster.edu
% 0.46/1.03
% 0.46/1.03 set(prolog_style_variables).
% 0.46/1.03 set(auto2).
% 0.46/1.03 % set(auto2) -> set(auto).
% 0.46/1.03 % set(auto) -> set(auto_inference).
% 0.46/1.03 % set(auto) -> set(auto_setup).
% 0.46/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.03 % set(auto) -> set(auto_limits).
% 0.46/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.03 % set(auto) -> set(auto_denials).
% 0.46/1.03 % set(auto) -> set(auto_process).
% 0.46/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.03 % set(auto2) -> assign(stats, some).
% 0.46/1.03 % set(auto2) -> clear(echo_input).
% 0.46/1.03 % set(auto2) -> set(quiet).
% 0.46/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.03 % set(auto2) -> clear(print_given).
% 0.46/1.03 assign(lrs_ticks,-1).
% 0.46/1.03 assign(sos_limit,10000).
% 0.46/1.03 assign(order,kbo).
% 0.46/1.03 set(lex_order_vars).
% 0.46/1.03 clear(print_given).
% 0.46/1.03
% 0.46/1.03 % formulas(sos). % not echoed (36 formulas)
% 0.46/1.03
% 0.46/1.03 ============================== end of input ==========================
% 0.46/1.03
% 0.46/1.03 % From the command line: assign(max_seconds, 300).
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.03
% 0.46/1.03 % Formulas that are not ordinary clauses:
% 0.46/1.03 1 (all U all V (instrumentality(U,V) -> artifact(U,V))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 2 (all U all V (transport(U,V) -> instrumentality(U,V))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 3 (all U all V (vehicle(U,V) -> transport(U,V))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 4 (all U all V (car(U,V) -> vehicle(U,V))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 5 (all U all V (chevy(U,V) -> car(U,V))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 6 (all U all V (location(U,V) -> object(U,V))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 7 (all U all V (city(U,V) -> location(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 8 (all U all V (hollywood_placename(U,V) -> placename(U,V))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 9 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 10 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 11 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 12 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 13 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 14 (all U all V (relname(U,V) -> relation(U,V))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 15 (all U all V (placename(U,V) -> relname(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 16 (all U all V (object(U,V) -> unisex(U,V))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 17 (all U all V (object(U,V) -> impartial(U,V))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 18 (all U all V (object(U,V) -> nonliving(U,V))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 19 (all U all V (entity(U,V) -> existent(U,V))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 20 (all U all V (entity(U,V) -> specific(U,V))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 21 (all U all V (entity(U,V) -> thing(U,V))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 22 (all U all V (object(U,V) -> entity(U,V))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 23 (all U all V (artifact(U,V) -> object(U,V))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 24 (all U all V (way(U,V) -> artifact(U,V))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 25 (all U all V (street(U,V) -> way(U,V))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 26 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 27 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 28 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 29 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 30 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 31 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 32 (all U all V (barrel(U,V) -> event(U,V))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 33 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 34 (all U all V (specific(U,V) -> -general(U,V))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 35 (all U all V all W (entity(U,V) & placename(U,W) & of(U,W,V) -> -(exists X (placename(U,X) & X != W & of(U,X,V))))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.03 36 --(exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z (of(U,W,V) & city(U,V) & hollywood_placename(U,W) & placename(U,W) & street(U,X) & lonely(U,X) & chevy(U,Y) & white(U,Y) & dirty(U,Y) & old(U,Y) & event(U,Z) & agent(U,Z,Y) & present(U,Z) & barrel(U,Z) & down(U,Z,X) & in(U,Z,V))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.03
% 0.78/1.03 ============================== end of process non-clausal formulas ===
% 0.78/1.03
% 0.78/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.03
% 0.78/1.03 ============================== PREDICATE ELIMINATION =================
% 0.78/1.03 37 -city(A,B) | location(A,B) # label(ax7) # label(axiom). [clausify(7)].
% 0.78/1.03 38 city(c1,c2) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: location(c1,c2). [resolve(37,a,38,a)].
% 0.78/1.03 39 -hollywood_placename(A,B) | placename(A,B) # label(ax8) # label(axiom). [clausify(8)].
% 0.78/1.03 40 hollywood_placename(c1,c3) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: placename(c1,c3). [resolve(39,a,40,a)].
% 0.78/1.03 41 -street(A,B) | way(A,B) # label(ax25) # label(axiom). [clausify(25)].
% 0.78/1.03 42 street(c1,c4) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: way(c1,c4). [resolve(41,a,42,a)].
% 0.78/1.03 43 -chevy(A,B) | car(A,B) # label(ax5) # label(axiom). [clausify(5)].
% 0.78/1.03 44 chevy(c1,c5) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: car(c1,c5). [resolve(43,a,44,a)].
% 0.78/1.03 45 -event(A,B) | eventuality(A,B) # label(ax31) # label(axiom). [clausify(31)].
% 0.78/1.03 46 event(c1,c6) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: eventuality(c1,c6). [resolve(45,a,46,a)].
% 0.78/1.03 47 -barrel(A,B) | event(A,B) # label(ax32) # label(axiom). [clausify(32)].
% 0.78/1.03 Derived: -barrel(A,B) | eventuality(A,B). [resolve(47,b,45,a)].
% 0.78/1.03 48 -barrel(A,B) | eventuality(A,B). [resolve(47,b,45,a)].
% 0.78/1.03 49 barrel(c1,c6) # label(co1) # label(negated_conjecture). [clausify(36)].
% 0.78/1.03 Derived: eventuality(c1,c6). [resolve(48,a,49,a)].
% 0.78/1.03 50 -entity(A,B) | existent(A,B) # label(ax19) # label(axiom). [clausify(19)].
% 0.78/1.03 51 -existent(A,B) | -nonexistent(A,B) # label(ax33) # label(axiom). [clausify(33)].
% 0.78/1.03 Derived: -entity(A,B) | -nonexistent(A,B). [resolve(50,b,51,a)].
% 0.78/1.03 52 -entity(A,B) | specific(A,B) # label(ax20) # label(axiom). [clausify(20)].
% 0.78/1.03 53 -specific(A,B) | -general(A,B) # label(ax34) # label(axiom). [clausify(34)].
% 0.78/1.03 Derived: -entity(A,B) | -general(A,B). [resolve(52,b,53,a)].
% 0.78/1.03 54 -eventuality(A,B) | specific(A,B) # label(ax28) # label(axiom). [clausify(28)].
% 0.78/1.03 Derived: -eventuality(A,B) | -general(A,B). [resolve(54,b,53,a)].
% 0.78/1.03 55 -transport(A,B) | instrumentality(A,B) # label(ax2) # label(axiom). [clausify(2)].
% 0.78/1.03 56 -instrumentality(A,B) | artifact(A,B) # label(ax1) # label(axiom). [clausify(1)].
% 0.78/1.03 Derived: -transport(A,B) | artifact(A,B). [resolve(55,b,56,a)].
% 0.78/1.03 57 -car(A,B) | vehicle(A,B) # label(ax4) # label(axiom). [clausify(4)].
% 0.78/1.03 58 -vehicle(A,B) | transport(A,B) # label(ax3) # label(axiom). [clausify(3)].
% 0.78/1.03 Derived: -car(A,B) | transport(A,B). [resolve(57,b,58,a)].
% 0.78/1.03 59 location(c1,c2). [resolve(37,a,38,a)].
% 0.78/1.03 60 -location(A,B) | object(A,B) # label(ax6) # label(axiom). [clausify(6)].
% 0.78/1.03 Derived: object(c1,c2). [resolve(59,a,60,a)].
% 0.78/1.03 61 -relation(A,B) | abstraction(A,B) # label(ax13) # label(axiom). [clausify(13)].
% 0.78/1.03 62 -abstraction(A,B) | unisex(A,B) # label(ax9) # label(axiom). [clausify(9)].
% 0.78/1.03 63 -abstraction(A,B) | general(A,B) # label(ax10) # label(axiom). [clausify(10)].
% 0.78/1.03 64 -abstraction(A,B) | nonhuman(A,B) # label(ax11) # label(axiom). [clausify(11)].
% 0.78/1.03 65 -abstraction(A,B) | thing(A,B) # label(ax12) # label(axiom). [clausify(12)].
% 0.78/1.03 Derived: -relation(A,B) | unisex(A,B). [resolve(61,b,62,a)].
% 0.78/1.03 Derived: -relation(A,B) | general(A,B). [resolve(61,b,63,a)].
% 0.78/1.03 Derived: -relation(A,B) | nonhuman(A,B). [resolve(61,b,64,a)].
% 0.78/1.03 Derived: -relation(A,B) | thing(A,B). [resolve(61,b,65,a)].
% 0.78/1.03 66 -placename(A,B) | relname(A,B) # label(ax15) # label(axiom). [clausify(15)].
% 0.78/1.03 67 -relname(A,B) | relation(A,B) # label(ax14) # label(axiom). [clausify(14)].
% 0.78/1.03 Derived: -placename(A,B) | relation(A,B). [resolve(66,b,67,a)].
% 0.78/1.03 68 -artifact(A,B) | object(A,B) # label(ax23) # label(axiom). [clausify(23)].
% 0.78/1.03 69 -object(A,B) | unisex(A,B) # label(ax16) # label(axiom). [clausify(16)].
% 0.78/1.03 70 -object(A,B) | impartial(A,B) # label(ax17) # label(axiom). [clausify(17)].
% 0.78/1.03 71 -object(A,B) | nonliving(A,B) # label(ax18) # label(axiom). [clausify(18)].
% 0.78/1.03 72 -object(A,B) | entity(A,B) # label(ax22) # label(axiom). [clausify(22)].
% 0.78/1.03 Derived: -artifact(A,B) | unisex(A,B). [resolve(68,b,69,a)].
% 0.78/1.03 Derived: -artifact(A,B) | impartial(A,B). [resolve(68,b,70,a)].
% 0.78/1.03 Derived: -artifact(A,B) | nonliving(A,B). [resolve(68,b,71,a)].
% 0.78/1.03 Derived: -artifact(A,B) | entity(A,B). [resolve(68,b,72,a)].
% 0.78/1.03 73 object(c1,c2). [resolve(59,a,60,a)].
% 0.78/1.03 Derived: unisex(c1,c2). [resolve(73,a,69,a)].
% 0.78/1.03 Derived: impartial(c1,c2). [resolve(73,a,70,a)].
% 0.78/1.03 Derived: nonliving(c1,c2). [resolve(73,a,71,a)].
% 0.78/1.03 Derived: entity(c1,c2). [resolve(73,a,72,a)].
% 0.78/1.03 74 -artifact(A,B) | entity(A,B). [resolve(68,b,72,a)].
% 0.78/1.03 75 -entity(A,B) | thing(A,B) # label(ax21) # label(axiom). [clausify(21)].
% 0.78/1.03 76 -entity(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B) # label(ax35) # label(axiom). [clausify(35)].
% 0.78/1.03 77 -entity(A,B) | -nonexistent(A,B). [resolve(50,b,51,a)].
% 0.78/1.03 78 -entity(A,B) | -general(A,B). [resolve(52,b,53,a)].
% 0.78/1.03 Derived: -artifact(A,B) | thing(A,B). [resolve(74,b,75,a)].
% 0.78/1.03 Derived: -artifact(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B). [resolve(74,b,76,a)].
% 0.78/1.03 Derived: -artifact(A,B) | -nonexistent(A,B). [resolve(74,b,77,a)].
% 0.78/1.03 Derived: -artifact(A,B) | -general(A,B). [resolve(74,b,78,a)].
% 0.78/1.03 79 entity(c1,c2). [resolve(73,a,72,a)].
% 0.78/1.03 Derived: thing(c1,c2). [resolve(79,a,75,a)].
% 0.78/1.03 Derived: -placename(c1,A) | -of(c1,A,c2) | -placename(c1,B) | B = A | -of(c1,B,c2). [resolve(79,a,76,a)].
% 0.78/1.03 Derived: -nonexistent(c1,c2). [resolve(79,a,77,a)].
% 0.78/1.03 Derived: -general(c1,c2). [resolve(79,a,78,a)].
% 0.78/1.03 80 way(c1,c4). [resolve(41,a,42,a)].
% 0.78/1.03 81 -way(A,B) | artifact(A,B) # label(ax24) # label(axiom). [clausify(24)].
% 0.78/1.03 Derived: artifact(c1,c4). [resolve(80,a,81,a)]
% 0.78/1.03 WARNING: denials share constants (see output).
% 0.78/1.03
% 0.78/1.03 .
% 0.78/1.03 82 eventuality(c1,c6). [resolve(45,a,46,a)].
% 0.78/1.03 83 -eventuality(A,B) | unisex(A,B) # label(ax26) # label(axiom). [clausify(26)].
% 0.78/1.03 84 -eventuality(A,B) | nonexistent(A,B) # label(ax27) # label(axiom). [clausify(27)].
% 0.78/1.03 85 -eventuality(A,B) | thing(A,B) # label(ax30) # label(axiom). [clausify(30)].
% 0.78/1.03 Derived: unisex(c1,c6). [resolve(82,a,83,a)].
% 0.78/1.03 Derived: nonexistent(c1,c6). [resolve(82,a,84,a)].
% 0.78/1.03 Derived: thing(c1,c6). [resolve(82,a,85,a)].
% 0.78/1.03 86 eventuality(c1,c6). [resolve(48,a,49,a)].
% 0.78/1.03 87 -eventuality(A,B) | -general(A,B). [resolve(54,b,53,a)].
% 0.78/1.03 Derived: -general(c1,c6). [resolve(87,a,82,a)].
% 0.78/1.03 88 -relation(A,B) | thing(A,B). [resolve(61,b,65,a)].
% 0.78/1.03 89 -thing(A,B) | singleton(A,B) # label(ax29) # label(axiom). [clausify(29)].
% 0.78/1.03 Derived: -relation(A,B) | singleton(A,B). [resolve(88,b,89,a)].
% 0.78/1.03 90 -artifact(A,B) | thing(A,B). [resolve(74,b,75,a)].
% 0.78/1.03 Derived: -artifact(A,B) | singleton(A,B). [resolve(90,b,89,a)].
% 0.78/1.03 91 thing(c1,c2). [resolve(79,a,75,a)].
% 0.78/1.03 Derived: singleton(c1,c2). [resolve(91,a,89,a)].
% 0.78/1.03 92 thing(c1,c6). [resolve(82,a,85,a)].
% 0.78/1.03 Derived: singleton(c1,c6). [resolve(92,a,89,a)].
% 0.78/1.03 93 -car(A,B) | transport(A,B). [resolve(57,b,58,a)].
% 0.78/1.03 94 car(c1,c5). [resolve(43,a,44,a)].
% 0.78/1.03 Derived: transport(c1,c5). [resolve(93,a,94,a)].
% 0.78/1.03 95 transport(c1,c5). [resolve(93,a,94,a)].
% 0.78/1.03 96 -transport(A,B) | artifact(A,B). [resolve(55,b,56,a)].
% 0.78/1.03 Derived: artifact(c1,c5). [resolve(95,a,96,a)].
% 0.78/1.03 97 -placename(A,B) | relation(A,B). [resolve(66,b,67,a)].
% 0.78/1.03 98 -relation(A,B) | unisex(A,B). [resolve(61,b,62,a)].
% 0.78/1.03 99 -relation(A,B) | general(A,B). [resolve(61,b,63,a)].
% 0.78/1.03 100 -relation(A,B) | nonhuman(A,B). [resolve(61,b,64,a)].
% 0.78/1.03 Derived: -placename(A,B) | unisex(A,B). [resolve(97,b,98,a)].
% 0.78/1.03 Derived: -placename(A,B) | general(A,B). [resolve(97,b,99,a)].
% 0.78/1.03 Derived: -placename(A,B) | nonhuman(A,B). [resolve(97,b,100,a)].
% 0.78/1.03 101 -relation(A,B) | singleton(A,B). [resolve(88,b,89,a)].
% 0.78/1.03 Derived: singleton(A,B) | -placename(A,B). [resolve(101,a,97,b)].
% 0.78/1.03 102 artifact(c1,c4). [resolve(80,a,81,a)].
% 0.78/1.03 103 -artifact(A,B) | unisex(A,B). [resolve(68,b,69,a)].
% 0.78/1.03 104 -artifact(A,B) | impartial(A,B). [resolve(68,b,70,a)].
% 0.78/1.03 105 -artifact(A,B) | nonliving(A,B). [resolve(68,b,71,a)].
% 0.78/1.03 106 -artifact(A,B) | -placename(A,C) | -of(A,C,B) | -placename(A,D) | D = C | -of(A,D,B). [resolve(74,b,76,a)].
% 0.78/1.03 107 -artifact(A,B) | -nonexistent(A,B). [resolve(74,b,77,a)].
% 0.78/1.03 108 -artifact(A,B) | -general(A,B). [resolve(74,b,78,a)].
% 0.78/1.03 Derived: unisex(c1,c4). [resolve(102,a,103,a)].
% 0.78/1.03 Derived: impartial(c1,c4). [resolve(102,a,104,a)].
% 0.78/1.03 Derived: nonliving(c1,c4). [resolve(102,a,105,a)].
% 0.78/1.03 Derived: -placename(c1,A) | -of(c1,A,c4) | -placename(c1,B) | B = A | -of(c1,B,c4). [resolve(102,a,106,a)].
% 0.78/1.03 Derived: -nonexistent(c1,c4). [resolve(102,a,107,a)].
% 0.78/1.03 Derived: -general(c1,c4). [resolve(102,a,108,a)].
% 0.78/1.03 109 -artifact(A,B) | singleton(A,B). [resolve(90,b,89,a)].
% 0.78/1.03 Derived: singleton(c1,c4). [resolve(109,a,102,a)].
% 0.78/1.03 110 artifact(c1,c5). [resolve(95,a,96,a)].
% 0.78/1.03 Derived: unisex(c1,c5). [resolve(110,a,103,a)].
% 0.78/1.03 Derived: impartial(c1,c5). [resolve(110,a,104,a)].
% 0.78/1.03 Derived: nonliving(c1,c5). [resolve(110,a,105,a)].
% 0.78/1.03 Derived: -placename(c1,A) | -of(c1,A,c5) | -placename(c1,B) | B = A | -of(c1,B,c5). [resolve(110,a,106,a)].
% 0.78/1.03 Derived: -nonexistent(c1,c5). [resolve(110,a,107,a)].
% 0.78/1.03 Derived: -general(c1,c5). [resolve(110,a,108,a)].
% 0.78/1.03 Derived: singleton(c1,c5). [resolve(110,a,109,a)].
% 0.78/1.03
% 0.78/1.03 ============================== end predicate elimination =============
% 0.78/1.03
% 0.78/1.03 Auto_denials:
% 0.78/1.03 % assign(max_proofs, 7). % (Horn set with more than one neg. clause)
% 0.78/1.03
% 0.78/1.03 WARNING, because some of the denials share constants,
% 0.78/1.03 some of the denials or their descendents may be subsumed,
% 0.78/1.03 preventing the target number of proofs from being found.
% 0.78/1.03 The shared constants are: c5, c4, c2, c1.
% 0.78/1.03
% 0.78/1.03 Term ordering decisions:
% 0.78/1.03 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1.
% 0.78/1.03
% 0.78/1.03 ============================== end of process initial clauses ========
% 0.78/1.03
% 0.78/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.03
% 0.78/1.03 ============================== end of clauses for search =============
% 0.78/1.03
% 0.78/1.03 ============================== SEARCH ================================
% 0.78/1.03
% 0.78/1.03 % Starting search at 0.02 seconds.
% 0.78/1.03
% 0.78/1.03 ============================== STATISTICS ============================
% 0.78/1.03
% 0.78/1.03 Given=19. Generated=21. Kept=19. proofs=0.
% 0.78/1.03 Usable=19. Sos=0. Demods=0. Limbo=0, Disabled=115. Hints=0.
% 0.78/1.03 Megabytes=0.10.
% 0.78/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.78/1.03
% 0.78/1.03 ============================== end of statistics =====================
% 0.78/1.03
% 0.78/1.03 ============================== end of search =========================
% 0.78/1.03
% 0.78/1.03 SEARCH FAILED
% 0.78/1.03
% 0.78/1.03 Exiting with failure.
% 0.78/1.03
% 0.78/1.03 Process 5059 exit (sos_empty) Fri Jul 1 07:18:53 2022
% 0.78/1.03 Prover9 interrupted
%------------------------------------------------------------------------------