TSTP Solution File: NLP108-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP108-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:50 EDT 2022
% Result : Unknown 0.45s 1.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP108-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 30 18:34:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 31869 was started by sandbox2 on n004.cluster.edu,
% 0.45/1.01 Thu Jun 30 18:34:23 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31480_n004.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_31480_n004.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (50 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 1 -coffee(A,B) | beverage(A,B) # label(clause9) # label(axiom). [assumption].
% 0.45/1.01 2 coffee(skc5,skc10) # label(clause36) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: beverage(skc5,skc10). [resolve(1,a,2,a)].
% 0.45/1.01 3 -restaurant(A,B) | building(A,B) # label(clause27) # label(axiom). [assumption].
% 0.45/1.01 4 restaurant(skc5,skc8) # label(clause37) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: building(skc5,skc8). [resolve(3,a,4,a)].
% 0.45/1.01 5 -human_person(A,B) | organism(A,B) # label(clause20) # label(axiom). [assumption].
% 0.45/1.01 6 human_person(skc5,skc7) # label(clause38) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: organism(skc5,skc7). [resolve(5,a,6,a)].
% 0.45/1.01 7 -human_person(A,B) | human(A,B) # label(clause24) # label(axiom). [assumption].
% 0.45/1.01 Derived: human(skc5,skc7). [resolve(7,a,6,a)].
% 0.45/1.01 8 -human_person(A,B) | animate(A,B) # label(clause25) # label(axiom). [assumption].
% 0.45/1.01 Derived: animate(skc5,skc7). [resolve(8,a,6,a)].
% 0.45/1.01 9 -customer(A,B) | human_person(A,B) # label(clause26) # label(axiom). [assumption].
% 0.45/1.01 Derived: -customer(A,B) | organism(A,B). [resolve(9,b,5,a)].
% 0.45/1.01 Derived: -customer(A,B) | human(A,B). [resolve(9,b,7,a)].
% 0.45/1.01 Derived: -customer(A,B) | animate(A,B). [resolve(9,b,8,a)].
% 0.45/1.01 10 -drink(A,B) | event(A,B) # label(clause8) # label(axiom). [assumption].
% 0.45/1.01 11 drink(skc5,skc6) # label(clause39) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: event(skc5,skc6). [resolve(10,a,11,a)].
% 0.45/1.01 12 -drink(A,B) | -patient(A,B,C) | -agent(A,B,D) | beverage(A,C) # label(clause34) # label(axiom). [assumption].
% 0.45/1.01 Derived: -patient(skc5,skc6,A) | -agent(skc5,skc6,B) | beverage(skc5,A). [resolve(12,a,11,a)].
% 0.45/1.01 13 -nonreflexive(A,B) | -patient(A,B,C) | -agent(A,B,C) # label(clause33) # label(axiom). [assumption].
% 0.45/1.01 14 nonreflexive(skc5,skc6) # label(clause40) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -patient(skc5,skc6,A) | -agent(skc5,skc6,A). [resolve(13,a,14,a)].
% 0.45/1.01 15 -in(skc5,A,skc8) | -customer(skc5,A) | nonreflexive(skc5,skf1(B)) # label(clause46) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | -patient(skc5,skf1(B),C) | -agent(skc5,skf1(B),C). [resolve(15,c,13,a)].
% 0.45/1.01 16 -event(A,B) | eventuality(A,B) # label(clause2) # label(axiom). [assumption].
% 0.45/1.01 17 event(skc5,skc6) # label(clause42) # label(negated_conjecture). [assumption].
% 0.45/1.01 18 -see(A,B) | event(A,B) # label(clause1) # label(axiom). [assumption].
% 0.45/1.01 Derived: eventuality(skc5,skc6). [resolve(16,a,17,a)].
% 0.45/1.01 Derived: eventuality(A,B) | -see(A,B). [resolve(16,a,18,b)].
% 0.45/1.01 19 -in(skc5,A,skc8) | -customer(skc5,A) | event(skc5,skf1(B)) # label(clause48) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | eventuality(skc5,skf1(B)). [resolve(19,c,16,a)].
% 0.45/1.01 20 event(skc5,skc6). [resolve(10,a,11,a)].
% 0.45/1.01 21 -patient(skc5,skc6,A) | -agent(skc5,skc6,B) | beverage(skc5,A). [resolve(12,a,11,a)].
% 0.45/1.01 22 agent(skc5,skc6,skc7) # label(clause43) # label(negated_conjecture). [assumption].
% 0.45/1.01 23 -in(skc5,A,skc8) | -customer(skc5,A) | agent(skc5,skf1(A),A) # label(clause50) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -patient(skc5,skc6,A) | beverage(skc5,A). [resolve(21,b,22,a)].
% 0.45/1.01 24 -patient(skc5,skc6,A) | -agent(skc5,skc6,A). [resolve(13,a,14,a)].
% 0.45/1.01 Derived: -patient(skc5,skc6,skc7). [resolve(24,b,22,a)].
% 0.45/1.01 25 -in(skc5,A,skc8) | -customer(skc5,A) | -patient(skc5,skf1(B),C) | -agent(skc5,skf1(B),C). [resolve(15,c,13,a)].
% 0.45/1.01 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | -patient(skc5,skf1(B),B) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(25,d,23,c)].
% 0.45/1.01 26 -patient(skc5,skc6,A) | beverage(skc5,A). [resolve(21,b,22,a)].
% 0.45/1.01 27 patient(skc5,skc6,skc10) # label(clause44) # label(negated_conjecture). [assumption].
% 0.45/1.01 28 -in(skc5,A,skc8) | -customer(skc5,A) | patient(skc5,skf1(B),skc7) # label(clause49) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: beverage(skc5,skc10). [resolve(26,a,27,a)].
% 0.45/1.01 29 -patient(skc5,skc6,skc7). [resolve(24,b,22,a)].
% 0.45/1.01 30 -in(skc5,A,skc8) | -customer(skc5,A) | -patient(skc5,skf1(B),B) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(25,d,23,c)].
% 0.45/1.01 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | -in(skc5,skc7,skc8) | -customer(skc5,skc7) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(30,c,28,c)].
% 0.45/1.01 31 -organism(A,B) | living(A,B) # label(clause23) # label(axiom). [assumption].
% 0.45/1.01 32 -living(A,B) | -nonliving(A,B) # label(clause30) # label(axiom). [assumption].
% 0.45/1.01 Derived: -organism(A,B) | -nonliving(A,B). [resolve(31,b,32,a)].
% 0.45/1.01 33 -eventuality(A,B) | nonexistent(A,B) # label(clause6) # label(axiom). [assumption].
% 0.45/1.01 34 -nonexistent(A,B) | -existent(A,B) # label(clause31) # label(axiom). [assumption].
% 0.45/1.01 Derived: -eventuality(A,B) | -existent(A,B). [resolve(33,b,34,a)].
% 0.45/1.01 35 -object(A,B) | nonliving(A,B) # label(clause17) # label(axiom). [assumption].
% 0.45/1.01 36 -nonliving(A,B) | -animate(A,B) # label(clause32) # label(axiom). [assumption].
% 0.45/1.01 Derived: -object(A,B) | -animate(A,B). [resolve(35,b,36,a)].
% 0.45/1.01 37 -organism(A,B) | -nonliving(A,B). [resolve(31,b,32,a)].
% 0.45/1.01 Derived: -organism(A,B) | -object(A,B). [resolve(37,b,35,b)].
% 0.45/1.01 38 eventuality(skc5,skc6). [resolve(16,a,17,a)].
% 0.45/1.01 39 -eventuality(A,B) | thing(A,B) # label(clause3) # label(axiom). [assumption].
% 0.45/1.01 40 -eventuality(A,B) | specific(A,B) # label(clause5) # label(axiom). [assumption].
% 0.45/1.01 41 -eventuality(A,B) | unisex(A,B) # label(clause7) # label(axiom). [assumption].
% 0.45/1.01 Derived: thing(skc5,skc6). [resolve(38,a,39,a)].
% 0.45/1.01 Derived: specific(skc5,skc6). [resolve(38,a,40,a)].
% 0.45/1.01 Derived: unisex(skc5,skc6). [resolve(38,a,41,a)].
% 0.45/1.01 42 eventuality(A,B) | -see(A,B). [resolve(16,a,18,b)].
% 0.45/1.01 Derived: -see(A,B) | thing(A,B). [resolve(42,a,39,a)].
% 0.45/1.01 Derived: -see(A,B) | specific(A,B). [resolve(42,a,40,a)].
% 0.45/1.01 Derived: -see(A,B) | unisex(A,B). [resolve(42,a,41,a)].
% 0.45/1.01 43 -in(skc5,A,skc8) | -customer(skc5,A) | eventuality(skc5,skf1(B)). [resolve(19,c,16,a)].
% 0.45/1.01 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | thing(skc5,skf1(B)). [resolve(43,c,39,a)].
% 0.45/1.02 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | specific(skc5,skf1(B)). [resolve(43,c,40,a)].
% 0.45/1.02 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | unisex(skc5,skf1(B)). [resolve(43,c,41,a)].
% 0.45/1.02 44 -eventuality(A,B) | -existent(A,B). [resolve(33,b,34,a)].
% 0.45/1.02 Derived: -existent(skc5,skc6). [resolve(44,a,38,a)].
% 0.45/1.02 Derived: -existent(A,B) | -see(A,B). [resolve(44,a,42,a)].
% 0.45/1.02 Derived: -existent(skc5,skf1(A)) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(44,a,43,c)].
% 0.45/1.02 45 -entity(A,B) | thing(A,B) # label(clause14) # label(axiom). [assumption].
% 0.45/1.02 46 -thing(A,B) | singleton(A,B) # label(clause4) # label(axiom). [assumption].
% 0.45/1.02 Derived: -entity(A,B) | singleton(A,B). [resolve(45,b,46,a)].
% 0.45/1.02 47 thing(skc5,skc6). [resolve(38,a,39,a)].
% 0.45/1.02 Derived: singleton(skc5,skc6). [resolve(47,a,46,a)].
% 0.45/1.02 48 -see(A,B) | thing(A,B). [resolve(42,a,39,a)].
% 0.45/1.02 Derived: -see(A,B) | singleton(A,B). [resolve(48,b,46,a)].
% 0.45/1.02 49 -in(skc5,A,skc8) | -customer(skc5,A) | thing(skc5,skf1(B)). [resolve(43,c,39,a)].
% 0.45/1.02 Derived: -in(skc5,A,skc8) | -customer(skc5,A) | singleton(skc5,skf1(B)). [resolve(49,c,46,a)].
% 0.45/1.02 50 beverage(skc5,skc10). [resolve(1,a,2,a)].
% 0.45/1.02 51 -beverage(A,B) | food(A,B) # label(clause10) # label(axiom). [assumption].
% 0.45/1.02 Derived: food(skc5,skc10). [resolve(50,a,51,a)].
% 0.45/1.02 52 beverage(skc5,skc10). [resolve(26,a,27,a)].
% 0.45/1.02 53 food(skc5,skc10). [resolve(50,a,51,a)].
% 0.45/1.02 54 -food(A,B) | substance_matter(A,B) # label(clause11) # label(axiom). [assumption].
% 0.45/1.02 Derived: substance_matter(skc5,skc10). [resolve(53,a,54,a)].
% 0.45/1.02 55 substance_matter(skc5,skc10). [resolve(53,a,54,a)].
% 0.45/1.02 56 -substance_matter(A,B) | object(A,B) # label(clause12) # label(axiom). [assumption].
% 0.45/1.02 Derived: object(skc5,skc10). [resolve(55,a,56,a)].
% 0.45/1.02 57 -artifact(A,B) | object(A,B) # label(clause29) # label(axiom). [assumption].
% 0.45/1.02 58 -object(A,B) | entity(A,B) # label(clause13) # label(axiom). [assumption].
% 0.45/1.02 59 -object(A,B) | impartial(A,B) # label(clause18) # label(axiom). [assumption].
% 0.45/1.02 60 -object(A,B) | unisex(A,B) # label(clause19) # label(axiom). [assumption].
% 0.45/1.02 Derived: -artifact(A,B) | entity(A,B). [resolve(57,b,58,a)].
% 0.45/1.02 Derived: -artifact(A,B) | impartial(A,B). [resolve(57,b,59,a)].
% 0.45/1.02 Derived: -artifact(A,B) | unisex(A,B). [resolve(57,b,60,a)].
% 0.45/1.02 61 -object(A,B) | -animate(A,B). [resolve(35,b,36,a)].
% 0.45/1.02 Derived: -animate(A,B) | -artifact(A,B). [resolve(61,a,57,b)].
% 0.45/1.02 62 -organism(A,B) | -object(A,B). [resolve(37,b,35,b)].
% 0.45/1.02 Derived: -organism(A,B) | -artifact(A,B). [resolve(62,b,57,b)].
% 0.45/1.02 63 object(skc5,skc10). [resolve(55,a,56,a)].
% 0.45/1.02 Derived: entity(skc5,skc10). [resolve(63,a,58,a)].
% 0.45/1.02 Derived: impartial(skc5,skc10). [resolve(63,a,59,a)].
% 0.45/1.02 Derived: unisex(skc5,skc10). [resolve(63,a,60,a)].
% 0.45/1.02 Derived: -animate(skc5,skc10). [resolve(63,a,61,a)].
% 0.45/1.02 Derived: -organism(skc5,skc10). [resolve(63,a,62,b)].
% 0.45/1.02 64 -organism(A,B) | entity(A,B) # label(clause21) # label(axiom). [assumption].
% 0.45/1.02 65 -entity(A,B) | specific(A,B) # label(clause15) # label(axiom). [assumption].
% 0.45/1.02 66 -entity(A,B) | existent(A,B) # label(clause16) # label(axiom). [assumption].
% 0.45/1.02 Derived: -organism(A,B) | specific(A,B). [resolve(64,b,65,a)].
% 0.45/1.02 Derived: -organism(A,B) | existent(A,B). [resolve(64,b,66,a)].
% 0.45/1.02 67 -entity(A,B) | singleton(A,B). [resolve(45,b,46,a)].
% 0.45/1.02 Derived: singleton(A,B) | -organism(A,B). [resolve(67,a,64,b)].
% 0.45/1.02 68 -artifact(A,B) | entity(A,B). [resolve(57,b,58,a)].
% 0.45/1.02 Derived: -artifact(A,B) | specific(A,B). [resolve(68,b,65,a)].
% 0.45/1.02 Derived: -artifact(A,B) | existent(A,B). [resolve(68,b,66,a)].
% 0.45/1.02 Derived: -artifact(A,B) | singleton(A,B). [resolve(68,b,67,a)].
% 0.45/1.02 69 entity(skc5,skc10). [resolve(63,a,58,a)].
% 0.45/1.02 Derived: specific(skc5,skc10). [resolve(69,a,65,a)].
% 0.45/1.02 Derived: existent(skc5,skc10). [resolve(69,a,66,a)].
% 0.45/1.02 Derived: singleton(skc5,skc10). [resolve(69,a,67,a)].
% 0.45/1.02 70 organism(skc5,skc7). [resolve(5,a,6,a)].
% 0.45/1.02 71 -organism(A,B) | impartial(A,B) # label(clause22) # label(axiom). [assumption].
% 0.45/1.02 Derived: impartial(skc5,skc7). [resolve(70,a,71,a)].
% 0.45/1.02 72 -customer(A,B) | organism(A,B). [resolve(9,b,5,a)].
% 0.45/1.02 Derived: -customer(A,B) | impartial(A,B). [resolve(72,b,71,a)].
% 0.45/1.02 73 -organism(A,B) | -artifact(A,B). [resolve(
% 0.45/1.02 WARNING: denials share constants (see output).
% 0.45/1.02
% 0.45/1.02 62,b,57,b)].
% 0.45/1.02 Derived: -artifact(skc5,skc7). [resolve(73,a,70,a)].
% 0.45/1.02 Derived: -artifact(A,B) | -customer(A,B). [resolve(73,a,72,b)].
% 0.45/1.02 74 -organism(skc5,skc10). [resolve(63,a,62,b)].
% 0.45/1.02 Derived: -customer(skc5,skc10). [resolve(74,a,72,b)].
% 0.45/1.02 75 -organism(A,B) | specific(A,B). [resolve(64,b,65,a)].
% 0.45/1.02 Derived: specific(skc5,skc7). [resolve(75,a,70,a)].
% 0.45/1.02 Derived: specific(A,B) | -customer(A,B). [resolve(75,a,72,b)].
% 0.45/1.02 76 -organism(A,B) | existent(A,B). [resolve(64,b,66,a)].
% 0.45/1.02 Derived: existent(skc5,skc7). [resolve(76,a,70,a)].
% 0.45/1.02 Derived: existent(A,B) | -customer(A,B). [resolve(76,a,72,b)].
% 0.45/1.02 77 singleton(A,B) | -organism(A,B). [resolve(67,a,64,b)].
% 0.45/1.02 Derived: singleton(skc5,skc7). [resolve(77,b,70,a)].
% 0.45/1.02 Derived: singleton(A,B) | -customer(A,B). [resolve(77,b,72,b)].
% 0.45/1.02 78 building(skc5,skc8). [resolve(3,a,4,a)].
% 0.45/1.02 79 -building(A,B) | artifact(A,B) # label(clause28) # label(axiom). [assumption].
% 0.45/1.02 Derived: artifact(skc5,skc8). [resolve(78,a,79,a)].
% 0.45/1.02 80 -see(A,B) | specific(A,B). [resolve(42,a,40,a)].
% 0.45/1.02 81 -in(skc5,A,skc8) | -customer(skc5,A) | see(skc5,skf1(B)) # label(clause45) # label(negated_conjecture). [assumption].
% 0.45/1.02 82 -see(A,B) | unisex(A,B). [resolve(42,a,41,a)].
% 0.45/1.02 83 -existent(A,B) | -see(A,B). [resolve(44,a,42,a)].
% 0.45/1.02 84 -see(A,B) | singleton(A,B). [resolve(48,b,46,a)].
% 0.45/1.02 85 -animate(A,B) | -artifact(A,B). [resolve(61,a,57,b)].
% 0.45/1.02 86 animate(skc5,skc7). [resolve(8,a,6,a)].
% 0.45/1.02 87 -customer(A,B) | animate(A,B). [resolve(9,b,8,a)].
% 0.45/1.02 88 -animate(skc5,skc10). [resolve(63,a,61,a)].
% 0.45/1.02 89 -artifact(A,B) | existent(A,B). [resolve(68,b,66,a)].
% 0.45/1.02 90 -existent(skc5,skc6). [resolve(44,a,38,a)].
% 0.45/1.02 91 -existent(skc5,skf1(A)) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(44,a,43,c)].
% 0.45/1.02 Derived: -artifact(skc5,skc6). [resolve(89,b,90,a)].
% 0.45/1.02 Derived: -artifact(skc5,skf1(A)) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(89,b,91,a)].
% 0.45/1.02 92 existent(skc5,skc10). [resolve(69,a,66,a)].
% 0.45/1.02 93 existent(skc5,skc7). [resolve(76,a,70,a)].
% 0.45/1.02 94 existent(A,B) | -customer(A,B). [resolve(76,a,72,b)].
% 0.45/1.02 Derived: -customer(skc5,skc6). [resolve(94,a,90,a)].
% 0.45/1.02 Derived: -customer(skc5,skf1(A)) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(94,a,91,a)].
% 0.45/1.02 95 artifact(skc5,skc8). [resolve(78,a,79,a)].
% 0.45/1.02 96 -artifact(A,B) | impartial(A,B). [resolve(57,b,59,a)].
% 0.45/1.02 97 -artifact(skc5,skc7). [resolve(73,a,70,a)].
% 0.45/1.02 98 -artifact(A,B) | -customer(A,B). [resolve(73,a,72,b)].
% 0.45/1.02 Derived: impartial(skc5,skc8). [resolve(95,a,96,a)].
% 0.45/1.02 Derived: -customer(skc5,skc8). [resolve(95,a,98,a)].
% 0.45/1.02 99 -artifact(skc5,skc6). [resolve(89,b,90,a)].
% 0.45/1.02 100 -artifact(skc5,skf1(A)) | -in(skc5,B,skc8) | -customer(skc5,B). [resolve(89,b,91,a)].
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials:
% 0.45/1.02 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.45/1.02
% 0.45/1.02 WARNING, because some of the denials share constants,
% 0.45/1.02 some of the denials or their descendents may be subsumed,
% 0.45/1.02 preventing the target number of proofs from being found.
% 0.45/1.02 The shared constants are: skc8, skc5.
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02
% 0.45/1.02 % Assigning unary symbol skf1 kb_weight 0 and highest precedence (8).
% 0.45/1.02 Function symbol KB weights: skc10=1. skc5=1. skc6=1. skc7=1. skc8=1. skf1=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.02 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== STATISTICS ============================
% 0.45/1.02
% 0.45/1.02 Given=5. Generated=5. Kept=5. proofs=0.
% 0.45/1.02 Usable=5. Sos=0. Demods=0. Limbo=0, Disabled=130. Hints=0.
% 0.45/1.02 Megabytes=0.06.
% 0.45/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of statistics =====================
% 0.45/1.02
% 0.45/1.02 ============================== end of search =========================
% 0.45/1.02
% 0.45/1.02 SEARCH FAILED
% 0.45/1.02
% 0.45/1.02 Exiting with failure.
% 0.45/1.02
% 0.45/1.02 Process 31869 exit (sos_empty) Thu Jun 30 18:34:23 2022
% 0.45/1.02 Prover9 interrupted
%------------------------------------------------------------------------------