TSTP Solution File: NLP104+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : NLP104+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n004.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:48 EDT 2022

% Result   : Unknown 0.41s 0.99s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NLP104+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 : n004.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 23:02:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/0.98  ============================== Prover9 ===============================
% 0.41/0.98  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.98  Process 20172 was started by sandbox on n004.cluster.edu,
% 0.41/0.98  Thu Jun 30 23:02:08 2022
% 0.41/0.98  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20018_n004.cluster.edu".
% 0.41/0.98  ============================== end of head ===========================
% 0.41/0.98  
% 0.41/0.98  ============================== INPUT =================================
% 0.41/0.98  
% 0.41/0.98  % Reading from file /tmp/Prover9_20018_n004.cluster.edu
% 0.41/0.98  
% 0.41/0.98  set(prolog_style_variables).
% 0.41/0.98  set(auto2).
% 0.41/0.98      % set(auto2) -> set(auto).
% 0.41/0.98      % set(auto) -> set(auto_inference).
% 0.41/0.98      % set(auto) -> set(auto_setup).
% 0.41/0.98      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.98      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.98      % set(auto) -> set(auto_limits).
% 0.41/0.98      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.98      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.98      % set(auto) -> set(auto_denials).
% 0.41/0.98      % set(auto) -> set(auto_process).
% 0.41/0.98      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.98      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.98      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.98      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.98      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.98      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.98      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.98      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.98      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.98      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.98      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.98      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.98      % set(auto2) -> assign(stats, some).
% 0.41/0.98      % set(auto2) -> clear(echo_input).
% 0.41/0.98      % set(auto2) -> set(quiet).
% 0.41/0.98      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.98      % set(auto2) -> clear(print_given).
% 0.41/0.98  assign(lrs_ticks,-1).
% 0.41/0.98  assign(sos_limit,10000).
% 0.41/0.98  assign(order,kbo).
% 0.41/0.98  set(lex_order_vars).
% 0.41/0.98  clear(print_given).
% 0.41/0.98  
% 0.41/0.98  % formulas(sos).  % not echoed (35 formulas)
% 0.41/0.98  
% 0.41/0.98  ============================== end of input ==========================
% 0.41/0.98  
% 0.41/0.98  % From the command line: assign(max_seconds, 300).
% 0.41/0.98  
% 0.41/0.98  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.98  
% 0.41/0.98  % Formulas that are not ordinary clauses:
% 0.41/0.98  1 (all U all V (artifact(U,V) -> object(U,V))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  2 (all U all V (building(U,V) -> artifact(U,V))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  3 (all U all V (restaurant(U,V) -> building(U,V))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  4 (all U all V (customer(U,V) -> human_person(U,V))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  5 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  6 (all U all V (human_person(U,V) -> human(U,V))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  7 (all U all V (organism(U,V) -> living(U,V))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  8 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax8) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  9 (all U all V (organism(U,V) -> entity(U,V))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  10 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  11 (all U all V (object(U,V) -> unisex(U,V))) # label(ax11) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  12 (all U all V (object(U,V) -> impartial(U,V))) # label(ax12) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  13 (all U all V (object(U,V) -> nonliving(U,V))) # label(ax13) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  14 (all U all V (entity(U,V) -> existent(U,V))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  15 (all U all V (entity(U,V) -> specific(U,V))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  16 (all U all V (entity(U,V) -> thing(U,V))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  17 (all U all V (object(U,V) -> entity(U,V))) # label(ax17) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  18 (all U all V (substance_matter(U,V) -> object(U,V))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  19 (all U all V (food(U,V) -> substance_matter(U,V))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  20 (all U all V (beverage(U,V) -> food(U,V))) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  21 (all U all V (coffee(U,V) -> beverage(U,V))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  22 (all U all V (drink(U,V) -> event(U,V))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  23 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  24 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  25 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  26 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  27 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax27) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  28 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  29 (all U all V (see(U,V) -> event(U,V))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  30 (all U all V (animate(U,V) -> -nonliving(U,V))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  31 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  32 (all U all V (nonliving(U,V) -> -living(U,V))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.98  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.41/0.98  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.41/0.98  35 --(exists U (actual_world(U) & (all V all W (customer(U,V) & restaurant(U,W) & in(U,V,W) -> (exists X exists Y exists Z exists X1 (coffee(U,X) & human_person(U,Y) & event(U,Z) & agent(U,Z,Y) & patient(U,Z,X) & past(U,Z) & nonreflexive(U,Z) & drink(U,Z) & event(U,X1) & agent(U,X1,V) & patient(U,X1,Y) & past(U,X1) & nonreflexive(U,X1) & see(U,X1))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.41/0.98  
% 0.41/0.98  ============================== end of process non-clausal formulas ===
% 0.41/0.98  
% 0.41/0.98  ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98  
% 0.41/0.98  ============================== PREDICATE ELIMINATION =================
% 0.41/0.98  36 -human_person(A,B) | animate(A,B) # label(ax5) # label(axiom).  [clausify(5)].
% 0.41/0.98  37 -animate(A,B) | -nonliving(A,B) # label(ax30) # label(axiom).  [clausify(30)].
% 0.41/0.98  Derived: -human_person(A,B) | -nonliving(A,B).  [resolve(36,b,37,a)].
% 0.41/0.98  38 -entity(A,B) | existent(A,B) # label(ax14) # label(axiom).  [clausify(14)].
% 0.41/0.98  39 -existent(A,B) | -nonexistent(A,B) # label(ax31) # label(axiom).  [clausify(31)].
% 0.41/0.98  Derived: -entity(A,B) | -nonexistent(A,B).  [resolve(38,b,39,a)].
% 0.41/0.98  40 -object(A,B) | nonliving(A,B) # label(ax13) # label(axiom).  [clausify(13)].
% 0.41/0.98  41 -nonliving(A,B) | -living(A,B) # label(ax32) # label(axiom).  [clausify(32)].
% 0.41/0.98  Derived: -object(A,B) | -living(A,B).  [resolve(40,b,41,a)].
% 0.41/0.98  42 -human_person(A,B) | -nonliving(A,B).  [resolve(36,b,37,a)].
% 0.41/0.98  Derived: -human_person(A,B) | -object(A,B).  [resolve(42,b,40,b)].
% 0.41/0.98  43 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | nonreflexive(c1,f3(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.98  44 -nonreflexive(A,B) | -agent(A,B,C) | -patient(A,B,D) | D != C # label(ax34) # label(axiom).  [clausify(34)].
% 0.41/0.98  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | -agent(c1,f3(A,B),C) | -patient(c1,f3(A,B),D) | D != C.  [resolve(43,d,44,a)].
% 0.41/0.98  45 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | nonreflexive(c1,f4(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.98  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | -agent(c1,f4(A,B),C) | -patient(c1,f4(A,B),D) | D != C.  [resolve(45,d,44,a)].
% 0.41/0.98  46 -building(A,B) | artifact(A,B) # label(ax2) # label(axiom).  [clausify(2)].
% 0.41/0.98  47 -artifact(A,B) | object(A,B) # label(ax1) # label(axiom).  [clausify(1)].
% 0.41/0.98  Derived: -building(A,B) | object(A,B).  [resolve(46,b,47,a)].
% 0.41/0.98  48 -building(A,B) | object(A,B).  [resolve(46,b,47,a)].
% 0.41/0.98  49 -restaurant(A,B) | building(A,B) # label(ax3) # label(axiom).  [clausify(3)].
% 0.41/0.98  Derived: object(A,B) | -restaurant(A,B).  [resolve(48,a,49,b)].
% 0.41/0.98  50 -human_person(A,B) | human(A,B) # label(ax6) # label(axiom).  [clausify(6)].
% 0.41/0.98  51 -customer(A,B) | human_person(A,B) # label(ax4) # label(axiom).  [clausify(4)].
% 0.41/0.98  Derived: human(A,B) | -customer(A,B).  [resolve(50,a,51,b)].
% 0.41/0.98  52 -human_person(A,B) | organism(A,B) # label(ax10) # label(axiom).  [clausify(10)].
% 0.41/0.98  Derived: organism(A,B) | -customer(A,B).  [resolve(52,a,51,b)].
% 0.41/0.98  53 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | human_person(c1,f2(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.98  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | human(c1,f2(A,B)).  [resolve(53,d,50,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | organism(c1,f2(A,B)).  [resolve(53,d,52,a)].
% 0.41/0.99  54 -human_person(A,B) | -object(A,B).  [resolve(42,b,40,b)].
% 0.41/0.99  Derived: -object(A,B) | -customer(A,B).  [resolve(54,a,51,b)].
% 0.41/0.99  Derived: -object(c1,f2(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(54,a,53,d)].
% 0.41/0.99  55 organism(A,B) | -customer(A,B).  [resolve(52,a,51,b)].
% 0.41/0.99  56 -organism(A,B) | living(A,B) # label(ax7) # label(axiom).  [clausify(7)].
% 0.41/0.99  57 -organism(A,B) | impartial(A,B) # label(ax8) # label(axiom).  [clausify(8)].
% 0.41/0.99  58 -organism(A,B) | entity(A,B) # label(ax9) # label(axiom).  [clausify(9)].
% 0.41/0.99  Derived: -customer(A,B) | living(A,B).  [resolve(55,a,56,a)].
% 0.41/0.99  Derived: -customer(A,B) | impartial(A,B).  [resolve(55,a,57,a)].
% 0.41/0.99  Derived: -customer(A,B) | entity(A,B).  [resolve(55,a,58,a)].
% 0.41/0.99  59 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | organism(c1,f2(A,B)).  [resolve(53,d,52,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | living(c1,f2(A,B)).  [resolve(59,d,56,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | impartial(c1,f2(A,B)).  [resolve(59,d,57,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | entity(c1,f2(A,B)).  [resolve(59,d,58,a)].
% 0.41/0.99  60 -object(A,B) | entity(A,B) # label(ax17) # label(axiom).  [clausify(17)].
% 0.41/0.99  61 -entity(A,B) | specific(A,B) # label(ax15) # label(axiom).  [clausify(15)].
% 0.41/0.99  62 -entity(A,B) | thing(A,B) # label(ax16) # label(axiom).  [clausify(16)].
% 0.41/0.99  Derived: -object(A,B) | specific(A,B).  [resolve(60,b,61,a)].
% 0.41/0.99  Derived: -object(A,B) | thing(A,B).  [resolve(60,b,62,a)].
% 0.41/0.99  63 -entity(A,B) | -nonexistent(A,B).  [resolve(38,b,39,a)].
% 0.41/0.99  Derived: -nonexistent(A,B) | -object(A,B).  [resolve(63,a,60,b)].
% 0.41/0.99  64 -customer(A,B) | entity(A,B).  [resolve(55,a,58,a)].
% 0.41/0.99  Derived: -customer(A,B) | specific(A,B).  [resolve(64,b,61,a)].
% 0.41/0.99  Derived: -customer(A,B) | thing(A,B).  [resolve(64,b,62,a)].
% 0.41/0.99  Derived: -customer(A,B) | -nonexistent(A,B).  [resolve(64,b,63,a)].
% 0.41/0.99  65 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | entity(c1,f2(A,B)).  [resolve(59,d,58,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | specific(c1,f2(A,B)).  [resolve(65,d,61,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | thing(c1,f2(A,B)).  [resolve(65,d,62,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | -nonexistent(c1,f2(A,B)).  [resolve(65,d,63,a)].
% 0.41/0.99  66 -food(A,B) | substance_matter(A,B) # label(ax19) # label(axiom).  [clausify(19)].
% 0.41/0.99  67 -substance_matter(A,B) | object(A,B) # label(ax18) # label(axiom).  [clausify(18)].
% 0.41/0.99  Derived: -food(A,B) | object(A,B).  [resolve(66,b,67,a)].
% 0.41/0.99  68 -coffee(A,B) | beverage(A,B) # label(ax21) # label(axiom).  [clausify(21)].
% 0.41/0.99  69 -beverage(A,B) | food(A,B) # label(ax20) # label(axiom).  [clausify(20)].
% 0.41/0.99  Derived: -coffee(A,B) | food(A,B).  [resolve(68,b,69,a)].
% 0.41/0.99  70 -drink(A,B) | -agent(A,B,C) | -patient(A,B,D) | beverage(A,D) # label(ax33) # label(axiom).  [clausify(33)].
% 0.41/0.99  Derived: -drink(A,B) | -agent(A,B,C) | -patient(A,B,D) | food(A,D).  [resolve(70,d,69,a)].
% 0.41/0.99  71 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | drink(c1,f3(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.99  72 -drink(A,B) | event(A,B) # label(ax22) # label(axiom).  [clausify(22)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f3(A,B)).  [resolve(71,d,72,a)].
% 0.41/0.99  73 -drink(A,B) | -agent(A,B,C) | -patient(A,B,D) | food(A,D).  [resolve(70,d,69,a)].
% 0.41/0.99  Derived: -agent(c1,f3(A,B),C) | -patient(c1,f3(A,B),D) | food(c1,D) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(73,a,71,d)].
% 0.41/0.99  74 -event(A,B) | eventuality(A,B) # label(ax28) # label(axiom).  [clausify(28)].
% 0.41/0.99  75 -eventuality(A,B) | nonexistent(A,B) # label(ax24) # label(axiom).  [clausify(24)].
% 0.41/0.99  76 -eventuality(A,B) | specific(A,B) # label(ax25) # label(axiom).  [clausify(25)].
% 0.41/0.99  77 -eventuality(A,B) | thing(A,B) # label(ax27) # label(axiom).  [clausify(27)].
% 0.41/0.99  Derived: -event(A,B) | nonexistent(A,B).  [resolve(74,b,75,a)].
% 0.41/0.99  Derived: -event(A,B) | specific(A,B).  [resolve(74,b,76,a)].
% 0.41/0.99  Derived: -event(A,B) | thing(A,B).  [resolve(74,b,77,a)].
% 0.41/0.99  78 -object(A,B) | thing(A,B).  [resolve(60,b,62,a)].
% 0.41/0.99  79 -thing(A,B) | singleton(A,B) # label(ax26) # label(axiom).  [clausify(26)].
% 0.41/0.99  Derived: -object(A,B) | singleton(A,B).  [resolve(78,b,79,a)].
% 0.41/0.99  80 -customer(A,B) | thing(A,B).  [resolve(64,b,62,a)].
% 0.41/0.99  Derived: -customer(A,B) | singleton(A,B).  [resolve(80,b,79,a)].
% 0.41/0.99  81 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | thing(c1,f2(A,B)).  [resolve(65,d,62,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | singleton(c1,f2(A,B)).  [resolve(81,d,79,a)].
% 0.41/0.99  82 -event(A,B) | thing(A,B).  [resolve(74,b,77,a)].
% 0.41/0.99  Derived: -event(A,B) | singleton(A,B).  [resolve(82,b,79,a)].
% 0.41/0.99  83 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | see(c1,f4(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.99  84 -see(A,B) | event(A,B) # label(ax29) # label(axiom).  [clausify(29)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f4(A,B)).  [resolve(83,d,84,a)].
% 0.41/0.99  85 -coffee(A,B) | food(A,B).  [resolve(68,b,69,a)].
% 0.41/0.99  86 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | coffee(c1,f1(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.99  Derived: food(c1,f1(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(85,a,86,d)].
% 0.41/0.99  87 -event(A,B) | nonexistent(A,B).  [resolve(74,b,75,a)].
% 0.41/0.99  88 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f3(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.99  89 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f4(A,B)) # label(co1) # label(negated_conjecture).  [clausify(35)].
% 0.41/0.99  90 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f3(A,B)).  [resolve(71,d,72,a)].
% 0.41/0.99  Derived: nonexistent(c1,f3(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(87,a,88,d)].
% 0.41/0.99  Derived: nonexistent(c1,f4(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(87,a,89,d)].
% 0.41/0.99  91 -event(A,B) | specific(A,B).  [resolve(74,b,76,a)].
% 0.41/0.99  Derived: specific(c1,f3(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(91,a,88,d)].
% 0.41/0.99  Derived: specific(c1,f4(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(91,a,89,d)].
% 0.41/0.99  92 -event(A,B) | singleton(A,B).  [resolve(82,b,79,a)].
% 0.41/0.99  Derived: singleton(c1,f3(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(92,a,88,d)].
% 0.41/0.99  Derived: singleton(c1,f4(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(92,a,89,d)].
% 0.41/0.99  93 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | event(c1,f4(A,B)).  [resolve(83,d,84,a)].
% 0.41/0.99  94 -customer(A,B) | living(A,B).  [resolve(55,a,56,a)].
% 0.41/0.99  95 -object(A,B) | -living(A,B).  [resolve(40,b,41,a)].
% 0.41/0.99  Derived: -customer(A,B) | -object(A,B).  [resolve(94,b,95,b)].
% 0.41/0.99  96 -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | living(c1,f2(A,B)).  [resolve(59,d,56,a)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | -object(c1,f2(A,B)).  [resolve(96,d,95,b)].
% 0.41/0.99  97 -agent(c1,f3(A,B),C) | -patient(c1,f3(A,B),D) | food(c1,D) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(73,a,71,d)].
% 0.41/0.99  98 -food(A,B) | object(
% 0.41/0.99  WARNING: denials share constants (see output).
% 0.41/0.99  
% 0.41/0.99  A,B).  [resolve(66,b,67,a)].
% 0.41/0.99  Derived: -agent(c1,f3(A,B),C) | -patient(c1,f3(A,B),D) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | object(c1,D).  [resolve(97,c,98,a)].
% 0.41/0.99  99 food(c1,f1(A,B)) | -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B).  [resolve(85,a,86,d)].
% 0.41/0.99  Derived: -customer(c1,A) | -restaurant(c1,B) | -in(c1,A,B) | object(c1,f1(A,B)).  [resolve(99,a,98,a)].
% 0.41/0.99  
% 0.41/0.99  ============================== end predicate elimination =============
% 0.41/0.99  
% 0.41/0.99  Auto_denials:
% 0.41/0.99    % assign(max_proofs, 9).  % (Horn set with more than one neg. clause)
% 0.41/0.99  
% 0.41/0.99  WARNING, because some of the denials share constants,
% 0.41/0.99  some of the denials or their descendents may be subsumed,
% 0.41/0.99  preventing the target number of proofs from being found.
% 0.41/0.99  The shared constants are:  c1.
% 0.41/0.99  
% 0.41/0.99  Term ordering decisions:
% 0.41/0.99  Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1.
% 0.41/0.99  
% 0.41/0.99  ============================== end of process initial clauses ========
% 0.41/0.99  
% 0.41/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.99  
% 0.41/0.99  ============================== end of clauses for search =============
% 0.41/0.99  
% 0.41/0.99  ============================== SEARCH ================================
% 0.41/0.99  
% 0.41/0.99  % Starting search at 0.02 seconds.
% 0.41/0.99  
% 0.41/0.99  ============================== STATISTICS ============================
% 0.41/0.99  
% 0.41/0.99  Given=47. Generated=65. Kept=49. proofs=0.
% 0.41/0.99  Usable=44. Sos=0. Demods=0. Limbo=0, Disabled=107. Hints=0.
% 0.41/0.99  Megabytes=0.16.
% 0.41/0.99  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/0.99  
% 0.41/0.99  ============================== end of statistics =====================
% 0.41/0.99  
% 0.41/0.99  ============================== end of search =========================
% 0.41/0.99  
% 0.41/0.99  SEARCH FAILED
% 0.41/0.99  
% 0.41/0.99  Exiting with failure.
% 0.41/0.99  
% 0.41/0.99  Process 20172 exit (sos_empty) Thu Jun 30 23:02:08 2022
% 0.41/0.99  Prover9 interrupted
%------------------------------------------------------------------------------