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