TSTP Solution File: NLP018+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP018+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:37 EDT 2022
% Result : Unknown 0.41s 1.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP018+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 13:01:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 8019 was started by sandbox2 on n015.cluster.edu,
% 0.41/1.00 Fri Jul 1 13:01:13 2022
% 0.41/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7866_n015.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_7866_n015.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (43 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 1 (all U (fellow(U) -> man(U))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 2 (all U (man(U) -> human(U))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 3 (all U (human(U) -> organism(U))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 4 (all U (organism(U) -> entity(U))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 5 (all U (organism(U) -> -object(U))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 6 (all U (front(U) -> nonhuman(U))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 7 (all U (seat(U) -> furniture(U))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 8 (all U (furniture(U) -> instrumentality(U))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 9 (all U (furniture(U) -> -transport(U))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 10 (all U (street(U) -> way(U))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 11 (all U (way(U) -> artifact(U))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 12 (all U (way(U) -> -instrumentality(U))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 13 (all U (chevy(U) -> car(U))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 14 (all U (car(U) -> vehicle(U))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 15 (all U (vehicle(U) -> transport(U))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 16 (all U (transport(U) -> instrumentality(U))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 17 (all U (instrumentality(U) -> artifact(U))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 18 (all U (artifact(U) -> object(U))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 19 (all U (artifact(U) -> -location(U))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 20 (all U (event(U) -> eventuality(U))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 21 (all U (hollywood(U) -> city(U))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 22 (all U (city(U) -> location(U))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 23 (all U (location(U) -> object(U))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 24 (all U (object(U) -> entity(U))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 25 (all U (old(U) -> -new(U))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 26 (all U (eventuality(U) -> -entity(U))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 27 (all U (abstraction(U) -> -entity(U))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 28 (all U (abstraction(U) -> -eventuality(U))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 29 (all U (male(U) -> -female(U))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 30 (all U (man(U) -> -woman(U))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 31 (all U (man(U) -> male(U))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 32 (all U (male(U) -> human(U))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 33 (all U (female(U) -> human(U))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 34 (all U (woman(U) -> female(U))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 35 (all U (drs(U) <-> proposition(U))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 36 (all U (nonhuman(U) -> entity(U))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 37 (all U (human(U) -> -nonhuman(U))) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 38 (all U all V all W (have(U,V,W) & human(V) <-> owner(V) & of(V,W))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 39 (all U all V all W (have(U,V,W) & nonhuman(V) & nonhuman(W) -> partof(W,V))) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 40 (all U all V all W (event(U) & have(U,V,W) -> of(V,W))) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 41 (all U all V (of(V,U) -> (exists W (event(W) & have(W,U,V))))) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 42 (all U all V all W (partof(U,V) & partof(U,W) -> V = W)) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 43 --(exists U exists V exists W exists X exists Y exists Z exists X1 exists X2 exists X3 (hollywood(U) & city(U) & event(V) & chevy(W) & car(W) & white(W) & dirty(W) & old(W) & street(X) & way(X) & lonely(X) & barrel(V,W) & down(V,X) & in(V,U) & seat(X1) & furniture(X1) & front(X1) & Y != Z & fellow(Y) & man(Y) & young(Y) & fellow(Z) & man(Z) & young(Z) & Y = X2 & in(X2,X1) & Z = X3 & in(X3,X1))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.00
% 0.41/1.00 ============================== end of process non-clausal formulas ===
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.00
% 0.41/1.00 ============================== PREDICATE ELIMINATION =================
% 0.41/1.00 44 -hollywood(A) | city(A) # label(ax21) # label(axiom). [clausify(21)].
% 0.41/1.00 45 hollywood(c1) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.00 Derived: city(c1). [resolve(44,a,45,a)].
% 0.41/1.00 46 -city(A) | location(A) # label(ax22) # label(axiom). [clausify(22)].
% 0.41/1.00 47 city(c1) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.00 Derived: location(c1). [resolve(46,a,47,a)].
% 0.41/1.00 48 city(c1). [resolve(44,a,45,a)].
% 0.41/1.00 49 -event(A) | eventuality(A) # label(ax20) # label(axiom). [clausify(20)].
% 0.41/1.00 50 event(c2) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.00 Derived: eventuality(c2). [resolve(49,a,50,a)].
% 0.41/1.00 51 -of(A,B) | event(f1(B,A)) # label(ax41) # label(axiom). [clausify(41)].
% 0.41/1.00 Derived: -of(A,B) | eventuality(f1(B,A)). [resolve(51,b,49,a)].
% 0.41/1.00 52 -event(A) | -have(A,B,C) | of(B,C) # label(ax40) # label(axiom). [clausify(40)].
% 0.41/1.00 Derived: -have(c2,A,B) | of(A,B). [resolve(52,a,50,a)].
% 0.41/1.00 Derived: -have(f1(A,B),C,D) | of(C,D) | -of(B,A). [resolve(52,a,51,b)].
% 0.41/1.01 53 -chevy(A) | car(A) # label(ax13) # label(axiom). [clausify(13)].
% 0.41/1.01 54 chevy(c3) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: car(c3). [resolve(53,a,54,a)].
% 0.41/1.01 55 -car(A) | vehicle(A) # label(ax14) # label(axiom). [clausify(14)].
% 0.41/1.01 56 car(c3) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: vehicle(c3). [resolve(55,a,56,a)].
% 0.41/1.01 57 car(c3). [resolve(53,a,54,a)].
% 0.41/1.01 58 -old(A) | -new(A) # label(ax25) # label(axiom). [clausify(25)].
% 0.41/1.01 59 old(c3) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: -new(c3). [resolve(58,a,59,a)].
% 0.41/1.01 60 -street(A) | way(A) # label(ax10) # label(axiom). [clausify(10)].
% 0.41/1.01 61 street(c4) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: way(c4). [resolve(60,a,61,a)].
% 0.41/1.01 62 -way(A) | -instrumentality(A) # label(ax12) # label(axiom). [clausify(12)].
% 0.41/1.01 63 way(c4) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: -instrumentality(c4). [resolve(62,a,63,a)].
% 0.41/1.01 64 -way(A) | artifact(A) # label(ax11) # label(axiom). [clausify(11)].
% 0.41/1.01 Derived: artifact(c4). [resolve(64,a,63,a)].
% 0.41/1.01 65 way(c4). [resolve(60,a,61,a)].
% 0.41/1.01 66 -seat(A) | furniture(A) # label(ax7) # label(axiom). [clausify(7)].
% 0.41/1.01 67 seat(c7) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: furniture(c7). [resolve(66,a,67,a)].
% 0.41/1.01 68 -furniture(A) | -transport(A) # label(ax9) # label(axiom). [clausify(9)].
% 0.41/1.01 69 furniture(c7) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: -transport(c7). [resolve(68,a,69,a)].
% 0.41/1.01 70 -furniture(A) | instrumentality(A) # label(ax8) # label(axiom). [clausify(8)].
% 0.41/1.01 Derived: instrumentality(c7). [resolve(70,a,69,a)].
% 0.41/1.01 71 furniture(c7). [resolve(66,a,67,a)].
% 0.41/1.01 72 -front(A) | nonhuman(A) # label(ax6) # label(axiom). [clausify(6)].
% 0.41/1.01 73 front(c7) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: nonhuman(c7). [resolve(72,a,73,a)].
% 0.41/1.01 74 -fellow(A) | man(A) # label(ax1) # label(axiom). [clausify(1)].
% 0.41/1.01 75 fellow(c5) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 76 fellow(c6) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: man(c5). [resolve(74,a,75,a)].
% 0.41/1.01 Derived: man(c6). [resolve(74,a,76,a)].
% 0.41/1.01 77 -man(A) | -woman(A) # label(ax30) # label(axiom). [clausify(30)].
% 0.41/1.01 78 man(c5) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 79 man(c6) # label(co1) # label(negated_conjecture). [clausify(43)].
% 0.41/1.01 Derived: -woman(c5). [resolve(77,a,78,a)].
% 0.41/1.01 Derived: -woman(c6). [resolve(77,a,79,a)].
% 0.41/1.01 80 -man(A) | human(A) # label(ax2) # label(axiom). [clausify(2)].
% 0.41/1.01 Derived: human(c5). [resolve(80,a,78,a)].
% 0.41/1.01 Derived: human(c6). [resolve(80,a,79,a)].
% 0.41/1.01 81 -man(A) | male(A) # label(ax31) # label(axiom). [clausify(31)].
% 0.41/1.01 Derived: male(c5). [resolve(81,a,78,a)].
% 0.41/1.01 Derived: male(c6). [resolve(81,a,79,a)].
% 0.41/1.01 82 man(c5). [resolve(74,a,75,a)].
% 0.41/1.01 83 man(c6). [resolve(74,a,76,a)].
% 0.41/1.01 84 -human(A) | organism(A) # label(ax3) # label(axiom). [clausify(3)].
% 0.41/1.01 85 -organism(A) | -object(A) # label(ax5) # label(axiom). [clausify(5)].
% 0.41/1.01 Derived: -human(A) | -object(A). [resolve(84,b,85,a)].
% 0.41/1.01 86 -organism(A) | entity(A) # label(ax4) # label(axiom). [clausify(4)].
% 0.41/1.01 Derived: entity(A) | -human(A). [resolve(86,a,84,b)].
% 0.41/1.01 87 -instrumentality(A) | artifact(A) # label(ax17) # label(axiom). [clausify(17)].
% 0.41/1.01 88 -artifact(A) | -location(A) # label(ax19) # label(axiom). [clausify(19)].
% 0.41/1.01 Derived: -instrumentality(A) | -location(A). [resolve(87,b,88,a)].
% 0.41/1.01 89 -artifact(A) | object(A) # label(ax18) # label(axiom). [clausify(18)].
% 0.41/1.01 Derived: object(A) | -instrumentality(A). [resolve(89,a,87,b)].
% 0.41/1.01 90 artifact(c4). [resolve(64,a,63,a)].
% 0.41/1.01 Derived: -location(c4). [resolve(90,a,88,a)].
% 0.41/1.01 Derived: object(c4). [resolve(90,a,89,a)].
% 0.41/1.01 91 eventuality(c2). [resolve(49,a,50,a)].
% 0.41/1.01 92 -eventuality(A) | -entity(A) # label(ax26) # label(axiom). [clausify(26)].
% 0.41/1.01 93 -abstraction(A) | -eventuality(A) # label(ax28) # label(axiom). [clausify(28)].
% 0.41/1.01 Derived: -entity(c2). [resolve(91,a,92,a)].
% 0.41/1.01 Derived: -abstraction(c2). [resolve(91,a,93,b)].
% 0.41/1.01 94 -of(A,B) | eventuality(f1(B,A)). [resolve(51,b,49,a)
% 0.41/1.01 WARNING: denials share constants (see output).
% 0.41/1.01
% 0.41/1.01 ].
% 0.41/1.01 Derived: -of(A,B) | -entity(f1(B,A)). [resolve(94,b,92,a)].
% 0.41/1.01 Derived: -of(A,B) | -abstraction(f1(B,A)). [resolve(94,b,93,b)].
% 0.41/1.01 95 male(c5). [resolve(81,a,78,a)].
% 0.41/1.01 96 -male(A) | -female(A) # label(ax29) # label(axiom). [clausify(29)].
% 0.41/1.01 97 -male(A) | human(A) # label(ax32) # label(axiom). [clausify(32)].
% 0.41/1.01 Derived: -female(c5). [resolve(95,a,96,a)].
% 0.41/1.01 Derived: human(c5). [resolve(95,a,97,a)].
% 0.41/1.01 98 male(c6). [resolve(81,a,79,a)].
% 0.41/1.01 Derived: -female(c6). [resolve(98,a,96,a)].
% 0.41/1.01 Derived: human(c6). [resolve(98,a,97,a)].
% 0.41/1.01 99 -female(A) | human(A) # label(ax33) # label(axiom). [clausify(33)].
% 0.41/1.01 100 -human(A) | -nonhuman(A) # label(ax37) # label(axiom). [clausify(37)].
% 0.41/1.01 Derived: -female(A) | -nonhuman(A). [resolve(99,b,100,a)].
% 0.41/1.01 101 human(A) | -owner(A) | -of(A,B) # label(ax38) # label(axiom). [clausify(38)].
% 0.41/1.01 Derived: -owner(A) | -of(A,B) | -nonhuman(A). [resolve(101,a,100,a)].
% 0.41/1.01 102 -have(A,B,C) | -human(B) | owner(B) # label(ax38) # label(axiom). [clausify(38)].
% 0.41/1.01 Derived: -have(A,B,C) | owner(B) | -female(B). [resolve(102,b,99,b)].
% 0.41/1.01 103 -have(A,B,C) | -human(B) | of(B,C) # label(ax38) # label(axiom). [clausify(38)].
% 0.41/1.01 Derived: -have(A,B,C) | of(B,C) | -female(B). [resolve(103,b,99,b)].
% 0.41/1.01 Derived: -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(103,b,101,a)].
% 0.41/1.01 104 human(c5). [resolve(80,a,78,a)].
% 0.41/1.01 Derived: -nonhuman(c5). [resolve(104,a,100,a)].
% 0.41/1.01 Derived: -have(A,c5,B) | owner(c5). [resolve(104,a,102,b)].
% 0.41/1.01 Derived: -have(A,c5,B) | of(c5,B). [resolve(104,a,103,b)].
% 0.41/1.01 105 human(c6). [resolve(80,a,79,a)].
% 0.41/1.01 Derived: -nonhuman(c6). [resolve(105,a,100,a)].
% 0.41/1.01 Derived: -have(A,c6,B) | owner(c6). [resolve(105,a,102,b)].
% 0.41/1.01 Derived: -have(A,c6,B) | of(c6,B). [resolve(105,a,103,b)].
% 0.41/1.01 106 -human(A) | -object(A). [resolve(84,b,85,a)].
% 0.41/1.01 Derived: -object(A) | -female(A). [resolve(106,a,99,b)].
% 0.41/1.01 Derived: -object(A) | -owner(A) | -of(A,B). [resolve(106,a,101,a)].
% 0.41/1.01 Derived: -object(c5). [resolve(106,a,104,a)].
% 0.41/1.01 Derived: -object(c6). [resolve(106,a,105,a)].
% 0.41/1.01 107 entity(A) | -human(A). [resolve(86,a,84,b)].
% 0.41/1.01 Derived: entity(A) | -female(A). [resolve(107,b,99,b)].
% 0.41/1.01 Derived: entity(A) | -owner(A) | -of(A,B). [resolve(107,b,101,a)].
% 0.41/1.01 Derived: entity(c5). [resolve(107,b,104,a)].
% 0.41/1.01 Derived: entity(c6). [resolve(107,b,105,a)].
% 0.41/1.01 108 human(c5). [resolve(95,a,97,a)].
% 0.41/1.01 109 human(c6). [resolve(98,a,97,a)].
% 0.41/1.01 110 vehicle(c3). [resolve(55,a,56,a)].
% 0.41/1.01 111 -vehicle(A) | transport(A) # label(ax15) # label(axiom). [clausify(15)].
% 0.41/1.01 Derived: transport(c3). [resolve(110,a,111,a)].
% 0.41/1.01 112 drs(A) | -proposition(A) # label(ax35) # label(axiom). [clausify(35)].
% 0.41/1.01 113 -drs(A) | proposition(A) # label(ax35) # label(axiom). [clausify(35)].
% 0.41/1.01 114 -have(A,B,C) | owner(B) | -female(B). [resolve(102,b,99,b)].
% 0.41/1.01 115 have(A,B,C) | -owner(B) | -of(B,C) # label(ax38) # label(axiom). [clausify(38)].
% 0.41/1.01 116 -owner(A) | -of(A,B) | -nonhuman(A). [resolve(101,a,100,a)].
% 0.41/1.01 Derived: -have(A,B,C) | -female(B) | have(D,B,E) | -of(B,E). [resolve(114,b,115,b)].
% 0.41/1.01 Derived: -have(A,B,C) | -female(B) | -of(B,D) | -nonhuman(B). [resolve(114,b,116,a)].
% 0.41/1.01 117 -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(103,b,101,a)].
% 0.41/1.01 Derived: -have(A,B,C) | of(B,C) | -of(B,D) | -have(E,B,F) | -female(B). [resolve(117,c,114,b)].
% 0.41/1.01 118 -have(A,c5,B) | owner(c5). [resolve(104,a,102,b)].
% 0.41/1.01 Derived: -have(A,c5,B) | have(C,c5,D) | -of(c5,D). [resolve(118,b,115,b)].
% 0.41/1.01 Derived: -have(A,c5,B) | -of(c5,C) | -nonhuman(c5). [resolve(118,b,116,a)].
% 0.41/1.01 119 -have(A,c6,B) | owner(c6). [resolve(105,a,102,b)].
% 0.41/1.01 Derived: -have(A,c6,B) | have(C,c6,D) | -of(c6,D). [resolve(119,b,115,b)].
% 0.41/1.01 Derived: -have(A,c6,B) | -of(c6,C) | -nonhuman(c6). [resolve(119,b,116,a)].
% 0.41/1.01 120 -object(A) | -owner(A) | -of(A,B). [resolve(106,a,101,a)].
% 0.41/1.01 Derived: -object(A) | -of(A,B) | -have(C,A,D) | -female(A). [resolve(120,b,114,b)].
% 0.41/1.01 121 entity(A) | -owner(A) | -of(A,B). [resolve(107,b,101,a)].
% 0.41/1.01 Derived: entity(A) | -of(A,B) | -have(C,A,D) | -female(A). [resolve(121,b,114,b)].
% 0.41/1.01
% 0.41/1.01 ============================== end predicate elimination =============
% 0.41/1.01
% 0.41/1.01 Auto_denials:
% 0.41/1.01 % copying label co1 to answer in negative clause
% 0.41/1.01 % copying label ax27 to answer in negative clause
% 0.41/1.01 % assign(max_proofs, 25). % (Horn set with more than one neg. clause)
% 0.41/1.01
% 0.41/1.01 WARNING, because some of the denials share constants,
% 0.41/1.01 some of the denials or their descendents may be subsumed,
% 0.41/1.01 preventing the target number of proofs from being found.
% 0.41/1.01 The shared constants are: c2, c4, c6, c5.
% 0.41/1.01
% 0.41/1.01 Term ordering decisions:
% 0.41/1.01 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. f1=1.
% 0.41/1.01
% 0.41/1.01 ============================== end of process initial clauses ========
% 0.41/1.01
% 0.41/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.01
% 0.41/1.01 ============================== end of clauses for search =============
% 0.41/1.01
% 0.41/1.01 ============================== SEARCH ================================
% 0.41/1.01
% 0.41/1.01 % Starting search at 0.02 seconds.
% 0.41/1.01
% 0.41/1.01 ============================== STATISTICS ============================
% 0.41/1.01
% 0.41/1.01 Given=88. Generated=100. Kept=88. proofs=0.
% 0.41/1.01 Usable=88. Sos=0. Demods=2. Limbo=0, Disabled=142. Hints=0.
% 0.41/1.01 Megabytes=0.15.
% 0.41/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.41/1.01
% 0.41/1.01 ============================== end of statistics =====================
% 0.41/1.02
% 0.41/1.02 ============================== end of search =========================
% 0.41/1.02
% 0.41/1.02 SEARCH FAILED
% 0.41/1.02
% 0.41/1.02 Exiting with failure.
% 0.41/1.02
% 0.41/1.02 Process 8019 exit (sos_empty) Fri Jul 1 13:01:13 2022
% 0.41/1.02 Prover9 interrupted
%------------------------------------------------------------------------------