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