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