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