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