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