TSTP Solution File: NLP155-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP155-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:07:20 EDT 2022
% Result : Unknown 0.73s 1.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP155-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 10:47:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.68/0.98 ============================== Prover9 ===============================
% 0.68/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.98 Process 14296 was started by sandbox on n019.cluster.edu,
% 0.68/0.98 Fri Jul 1 10:47:39 2022
% 0.68/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14143_n019.cluster.edu".
% 0.68/0.98 ============================== end of head ===========================
% 0.68/0.98
% 0.68/0.98 ============================== INPUT =================================
% 0.68/0.98
% 0.68/0.98 % Reading from file /tmp/Prover9_14143_n019.cluster.edu
% 0.68/0.98
% 0.68/0.98 set(prolog_style_variables).
% 0.68/0.98 set(auto2).
% 0.68/0.98 % set(auto2) -> set(auto).
% 0.68/0.98 % set(auto) -> set(auto_inference).
% 0.68/0.98 % set(auto) -> set(auto_setup).
% 0.68/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.98 % set(auto) -> set(auto_limits).
% 0.68/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.98 % set(auto) -> set(auto_denials).
% 0.68/0.98 % set(auto) -> set(auto_process).
% 0.68/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.98 % set(auto2) -> assign(stats, some).
% 0.68/0.98 % set(auto2) -> clear(echo_input).
% 0.68/0.98 % set(auto2) -> set(quiet).
% 0.68/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.98 % set(auto2) -> clear(print_given).
% 0.68/0.98 assign(lrs_ticks,-1).
% 0.68/0.98 assign(sos_limit,10000).
% 0.68/0.98 assign(order,kbo).
% 0.68/0.98 set(lex_order_vars).
% 0.68/0.98 clear(print_given).
% 0.68/0.98
% 0.68/0.98 % formulas(sos). % not echoed (88 formulas)
% 0.68/0.98
% 0.68/0.98 ============================== end of input ==========================
% 0.68/0.98
% 0.68/0.98 % From the command line: assign(max_seconds, 300).
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.98
% 0.68/0.98 % Formulas that are not ordinary clauses:
% 0.68/0.98
% 0.68/0.98 ============================== end of process non-clausal formulas ===
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.98
% 0.68/0.98 ============================== PREDICATE ELIMINATION =================
% 0.68/0.98 1 -agent(A,B,C) | -old(A,C) | -dirty(A,C) | -white(A,C) | -chevy(A,C) | -barrel(A,B) | -present(A,B) | -event(A,B) | -hollywood_placename(A,D) | -placename(A,D) | -in(A,B,E) | -city(A,E) | -of(A,D,E) | -street(A,F) | -lonely(A,F) | -down(A,B,F) | -ssSkP0(V6,A) | -two(A,V6) | -group(A,V6) | -young(A,skf5(A,V7)) | -fellow(A,skf5(A,V7)) | -actual_world(A) # label(clause88) # label(negated_conjecture). [assumption].
% 0.68/0.98 2 actual_world(skc6) # label(clause68) # label(negated_conjecture). [assumption].
% 0.68/0.98 Derived: -agent(skc6,A,B) | -old(skc6,B) | -dirty(skc6,B) | -white(skc6,B) | -chevy(skc6,B) | -barrel(skc6,A) | -present(skc6,A) | -event(skc6,A) | -hollywood_placename(skc6,C) | -placename(skc6,C) | -in(skc6,A,D) | -city(skc6,D) | -of(skc6,C,D) | -street(skc6,E) | -lonely(skc6,E) | -down(skc6,A,E) | -ssSkP0(F,skc6) | -two(skc6,F) | -group(skc6,F) | -young(skc6,skf5(skc6,V6)) | -fellow(skc6,skf5(skc6,V6)). [resolve(1,v,2,a)].
% 0.68/0.98 3 -agent(A,B,C) | -old(A,C) | -dirty(A,C) | -white(A,C) | -chevy(A,C) | -barrel(A,B) | -present(A,B) | -event(A,B) | -hollywood_placename(A,D) | -placename(A,D) | -in(A,B,E) | -city(A,E) | -of(A,D,E) | -street(A,F) | -lonely(A,F) | -down(A,B,F) | -ssSkP0(V6,A) | -two(A,V6) | -group(A,V6) | -actual_world(A) | member(A,skf5(A,V6),V6) # label(clause87) # label(negated_conjecture). [assumption].
% 0.68/0.98 Derived: -agent(skc6,A,B) | -old(skc6,B) | -dirty(skc6,B) | -white(skc6,B) | -chevy(skc6,B) | -barrel(skc6,A) | -present(skc6,A) | -event(skc6,A) | -hollywood_placename(skc6,C) | -placename(skc6,C) | -in(skc6,A,D) | -city(skc6,D) | -of(skc6,C,D) | -street(skc6,E) | -lonely(skc6,E) | -down(skc6,A,E) | -ssSkP0(F,skc6) | -two(skc6,F) | -group(skc6,F) | member(skc6,skf5(skc6,F),F). [resolve(3,t,2,a)].
% 0.68/0.98 4 -man(A,B) | male(A,B) # label(clause14) # label(axiom). [assumption].
% 0.68/0.98 5 -male(A,B) | -unisex(A,B) # label(clause52) # label(axiom). [assumption].
% 0.68/0.98 Derived: -man(A,B) | -unisex(A,B). [resolve(4,b,5,a)].
% 0.68/0.98 6 -abstraction(A,B) | general(A,B) # label(clause43) # label(axiom). [assumption].
% 0.68/0.98 7 -general(A,B) | -specific(A,B) # label(clause53) # label(axiom). [assumption].
% 0.68/0.98 Derived: -abstraction(A,B) | -specific(A,B). [resolve(6,b,7,a)].
% 0.68/0.98 8 -set(A,B) | multiple(A,B) # label(clause16) # label(axiom). [assumption].
% 0.68/0.98 9 -multiple(A,B) | -singleton(A,B) # label(clause54) # label(axiom). [assumption].
% 0.68/0.98 Derived: -set(A,B) | -singleton(A,B). [resolve(8,b,9,a)].
% 0.68/0.98 10 -organism(A,B) | living(A,B) # label(clause11) # label(axiom). [assumption].
% 0.68/0.98 11 -living(A,B) | -nonliving(A,B) # label(clause55) # label(axiom). [assumption].
% 0.68/0.98 Derived: -organism(A,B) | -nonliving(A,B). [resolve(10,b,11,a)].
% 0.68/0.98 12 -human_person(A,B) | human(A,B) # label(clause12) # label(axiom). [assumption].
% 0.68/0.98 13 -human(A,B) | -nonhuman(A,B) # label(clause56) # label(axiom). [assumption].
% 0.68/0.98 Derived: -human_person(A,B) | -nonhuman(A,B). [resolve(12,b,13,a)].
% 0.68/0.98 14 -eventuality(A,B) | nonexistent(A,B) # label(clause21) # label(axiom). [assumption].
% 0.68/0.98 15 -nonexistent(A,B) | -existent(A,B) # label(clause57) # label(axiom). [assumption].
% 0.68/0.98 Derived: -eventuality(A,B) | -existent(A,B). [resolve(14,b,15,a)].
% 0.68/0.98 16 -object(A,B) | nonliving(A,B) # label(clause33) # label(axiom). [assumption].
% 0.68/0.98 17 -nonliving(A,B) | -animate(A,B) # label(clause58) # label(axiom). [assumption].
% 0.68/0.98 Derived: -object(A,B) | -animate(A,B). [resolve(16,b,17,a)].
% 0.68/0.98 18 -organism(A,B) | -nonliving(A,B). [resolve(10,b,11,a)].
% 0.68/0.98 Derived: -organism(A,B) | -object(A,B). [resolve(18,b,16,b)].
% 0.68/0.98 19 -man(A,B) | human_person(A,B) # label(clause3) # label(axiom). [assumption].
% 0.68/0.98 20 -fellow(A,B) | man(A,B) # label(clause2) # label(axiom). [assumption].
% 0.68/0.98 Derived: human_person(A,B) | -fellow(A,B). [resolve(19,a,20,b)].
% 0.68/0.98 21 -man(A,B) | -unisex(A,B). [resolve(4,b,5,a)].
% 0.68/0.98 Derived: -unisex(A,B) | -fellow(A,B). [resolve(21,a,20,b)].
% 0.68/0.98 22 human_person(A,B) | -fellow(A,B). [resolve(19,a,20,b)].
% 0.68/0.98 23 -human_person(A,B) | organism(A,B) # label(clause4) # label(axiom). [assumption].
% 0.68/0.98 24 -human_person(A,B) | animate(A,B) # label(clause13) # label(axiom). [assumption].
% 0.68/0.98 25 -human_person(A,B) | -nonhuman(A,B). [resolve(12,b,13,a)].
% 0.68/0.98 Derived: -fellow(A,B) | organism(A,B). [resolve(22,a,23,a)].
% 0.68/0.98 Derived: -fellow(A,B) | animate(A,B). [resolve(22,a,24,a)].
% 0.68/0.98 Derived: -fellow(A,B) | -nonhuman(A,B). [resolve(22,a,25,a)].
% 0.68/0.98 26 -fellow(A,B) | organism(A,B). [resolve(22,a,23,a)].
% 0.68/0.98 27 -organism(A,B) | entity(A,B) # label(clause5) # label(axiom). [assumption].
% 0.68/0.98 28 -organism(A,B) | impartial(A,B) # label(clause10) # label(axiom). [assumption].
% 0.68/0.98 29 -organism(A,B) | -object(A,B). [resolve(18,b,16,b)].
% 0.68/0.98 Derived: -fellow(A,B) | entity(A,B). [resolve(26,b,27,a)].
% 0.68/0.98 Derived: -fellow(A,B) | impartial(A,B). [resolve(26,b,28,a)].
% 0.68/0.98 Derived: -fellow(A,B) | -object(A,B). [resolve(26,b,29,a)].
% 0.68/0.98 30 -object(A,B) | entity(A,B) # label(clause32) # label(axiom). [assumption].
% 0.68/0.98 31 -entity(A,B) | thing(A,B) # label(clause6) # label(axiom). [assumption].
% 0.68/0.98 32 -entity(A,B) | specific(A,B) # label(clause8) # label(axiom). [assumption].
% 0.68/0.98 33 -entity(A,B) | existent(A,B) # label(clause9) # label(axiom). [assumption].
% 0.68/0.98 Derived: -object(A,B) | thing(A,B). [resolve(30,b,31,a)].
% 0.68/0.98 Derived: -object(A,B) | specific(A,B). [resolve(30,b,32,a)].
% 0.68/0.98 Derived: -object(A,B) | existent(A,B). [resolve(30,b,33,a)].
% 0.68/0.98 34 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause67) # label(axiom). [assumption].
% 0.68/0.98 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -object(A,D). [resolve(34,e,30,b)].
% 0.68/0.98 35 -fellow(A,B) | entity(A,B). [resolve(26,b,27,a)].
% 0.68/0.98 Derived: -fellow(A,B) | thing(A,B). [resolve(35,b,31,a)].
% 0.68/0.98 Derived: -fellow(A,B) | specific(A,B). [resolve(35,b,32,a)].
% 0.68/0.98 Derived: -fellow(A,B) | existent(A,B). [resolve(35,b,33,a)].
% 0.68/0.98 Derived: -fellow(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(35,b,34,e)].
% 0.68/0.98 36 -eventuality(A,B) | thing(A,B) # label(clause19) # label(axiom). [assumption].
% 0.68/0.99 37 -thing(A,B) | singleton(A,B) # label(clause7) # label(axiom). [assumption].
% 0.68/0.99 Derived: -eventuality(A,B) | singleton(A,B). [resolve(36,b,37,a)].
% 0.68/0.99 38 -abstraction(A,B) | thing(A,B) # label(clause41) # label(axiom). [assumption].
% 0.68/0.99 Derived: -abstraction(A,B) | singleton(A,B). [resolve(38,b,37,a)].
% 0.68/0.99 39 -object(A,B) | thing(A,B). [resolve(30,b,31,a)].
% 0.68/0.99 Derived: -object(A,B) | singleton(A,B). [resolve(39,b,37,a)].
% 0.68/0.99 40 -fellow(A,B) | thing(A,B). [resolve(35,b,31,a)].
% 0.68/0.99 Derived: -fellow(A,B) | singleton(A,B). [resolve(40,b,37,a)].
% 0.68/0.99 41 -set(A,B) | -singleton(A,B). [resolve(8,b,9,a)].
% 0.68/0.99 42 -group(A,B) | set(A,B) # label(clause15) # label(axiom). [assumption].
% 0.68/0.99 Derived: -singleton(A,B) | -group(A,B). [resolve(41,a,42,b)].
% 0.68/0.99 43 -event(A,B) | eventuality(A,B) # label(clause24) # label(axiom). [assumption].
% 0.68/0.99 44 -eventuality(A,B) | specific(A,B) # label(clause20) # label(axiom). [assumption].
% 0.68/0.99 45 -eventuality(A,B) | unisex(A,B) # label(clause22) # label(axiom). [assumption].
% 0.68/0.99 Derived: -event(A,B) | specific(A,B). [resolve(43,b,44,a)].
% 0.68/0.99 Derived: -event(A,B) | unisex(A,B). [resolve(43,b,45,a)].
% 0.68/0.99 46 -eventuality(A,B) | -existent(A,B). [resolve(14,b,15,a)].
% 0.68/0.99 Derived: -existent(A,B) | -event(A,B). [resolve(46,a,43,b)].
% 0.68/0.99 47 -eventuality(A,B) | singleton(A,B). [resolve(36,b,37,a)].
% 0.68/0.99 Derived: singleton(A,B) | -event(A,B). [resolve(47,a,43,b)].
% 0.68/0.99 48 -car(A,B) | vehicle(A,B) # label(clause27) # label(axiom). [assumption].
% 0.68/0.99 49 -chevy(A,B) | car(A,B) # label(clause26) # label(axiom). [assumption].
% 0.68/0.99 Derived: vehicle(A,B) | -chevy(A,B). [resolve(48,a,49,b)].
% 0.68/0.99 50 vehicle(A,B) | -chevy(A,B). [resolve(48,a,49,b)].
% 0.68/0.99 51 -vehicle(A,B) | transport(A,B) # label(clause28) # label(axiom). [assumption].
% 0.68/0.99 Derived: -chevy(A,B) | transport(A,B). [resolve(50,a,51,a)].
% 0.68/0.99 52 -chevy(A,B) | transport(A,B). [resolve(50,a,51,a)].
% 0.68/0.99 53 -transport(A,B) | instrumentality(A,B) # label(clause29) # label(axiom). [assumption].
% 0.68/0.99 Derived: -chevy(A,B) | instrumentality(A,B). [resolve(52,b,53,a)].
% 0.68/0.99 54 -furniture(A,B) | instrumentality(A,B) # label(clause50) # label(axiom). [assumption].
% 0.68/0.99 55 -instrumentality(A,B) | artifact(A,B) # label(clause30) # label(axiom). [assumption].
% 0.68/0.99 Derived: -furniture(A,B) | artifact(A,B). [resolve(54,b,55,a)].
% 0.68/0.99 56 -chevy(A,B) | instrumentality(A,B). [resolve(52,b,53,a)].
% 0.68/0.99 Derived: -chevy(A,B) | artifact(A,B). [resolve(56,b,55,a)].
% 0.68/0.99 57 -way(A,B) | artifact(A,B) # label(clause37) # label(axiom). [assumption].
% 0.68/0.99 58 -artifact(A,B) | object(A,B) # label(clause31) # label(axiom). [assumption].
% 0.68/0.99 Derived: -way(A,B) | object(A,B). [resolve(57,b,58,a)].
% 0.68/0.99 59 -furniture(A,B) | artifact(A,B). [resolve(54,b,55,a)].
% 0.68/0.99 Derived: -furniture(A,B) | object(A,B). [resolve(59,b,58,a)].
% 0.68/0.99 60 -chevy(A,B) | artifact(A,B). [resolve(56,b,55,a)].
% 0.68/0.99 Derived: -chevy(A,B) | object(A,B). [resolve(60,b,58,a)].
% 0.68/0.99 61 -location(A,B) | object(A,B) # label(clause47) # label(axiom). [assumption].
% 0.68/0.99 62 -object(A,B) | impartial(A,B) # label(clause34) # label(axiom). [assumption].
% 0.68/0.99 63 -object(A,B) | unisex(A,B) # label(clause35) # label(axiom). [assumption].
% 0.68/0.99 Derived: -location(A,B) | impartial(A,B). [resolve(61,b,62,a)].
% 0.68/0.99 Derived: -location(A,B) | unisex(A,B). [resolve(61,b,63,a)].
% 0.68/0.99 64 -object(A,B) | -animate(A,B). [resolve(16,b,17,a)].
% 0.68/0.99 Derived: -animate(A,B) | -location(A,B). [resolve(64,a,61,b)].
% 0.68/0.99 65 -fellow(A,B) | -object(A,B). [resolve(26,b,29,a)].
% 0.68/0.99 Derived: -fellow(A,B) | -location(A,B). [resolve(65,b,61,b)].
% 0.68/0.99 66 -object(A,B) | specific(A,B). [resolve(30,b,32,a)].
% 0.68/0.99 Derived: specific(A,B) | -location(A,B). [resolve(66,a,61,b)].
% 0.68/0.99 67 -object(A,B) | existent(A,B). [resolve(30,b,33,a)].
% 0.68/0.99 Derived: existent(A,B) | -location(A,B). [resolve(67,a,61,b)].
% 0.68/0.99 68 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -object(A,D). [resolve(34,e,30,b)].
% 0.68/0.99 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -location(A,D). [resolve(68,f,61,b)].
% 0.68/0.99 69 -object(A,B) | singleton(A,B). [resolve(39,b,37,a)].
% 0.68/0.99 Derived: singleton(A,B) | -location(A,B). [resolve(69,a,61,b)].
% 0.68/0.99 70 -way(A,B) | object(A,B). [resolve(57,b,58,a)].
% 0.68/0.99 Derived: -way(A,B) | impartial(A,B). [resolve(70,b,62,a)].
% 0.68/0.99 Derived: -way(A,B) | unisex(A,B). [resolve(70,b,63,a)].
% 0.68/0.99 Derived: -way(A,B) | -animate(A,B). [resolve(70,b,64,a)].
% 0.68/0.99 Derived: -way(A,B) | -fellow(A,B). [resolve(70,b,65,b)].
% 0.68/0.99 Derived: -way(A,B) | specific(A,B). [resolve(70,b,66,a)].
% 0.68/0.99 Derived: -way(A,B) | existent(A,B). [resolve(70,b,67,a)].
% 0.68/0.99 Derived: -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(70,b,68,f)].
% 0.68/0.99 Derived: -way(A,B) | singleton(A,B). [resolve(70,b,69,a)].
% 0.68/0.99 71 -furniture(A,B) | object(A,B). [resolve(59,b,58,a)].
% 0.68/0.99 Derived: -furniture(A,B) | impartial(A,B). [resolve(71,b,62,a)].
% 0.68/0.99 Derived: -furniture(A,B) | unisex(A,B). [resolve(71,b,63,a)].
% 0.68/0.99 Derived: -furniture(A,B) | -animate(A,B). [resolve(71,b,64,a)].
% 0.68/0.99 Derived: -furniture(A,B) | -fellow(A,B). [resolve(71,b,65,b)].
% 0.68/0.99 Derived: -furniture(A,B) | specific(A,B). [resolve(71,b,66,a)].
% 0.68/0.99 Derived: -furniture(A,B) | existent(A,B). [resolve(71,b,67,a)].
% 0.68/0.99 Derived: -furniture(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(71,b,68,f)].
% 0.68/0.99 Derived: -furniture(A,B) | singleton(A,B). [resolve(71,b,69,a)].
% 0.68/0.99 72 -chevy(A,B) | object(A,B). [resolve(60,b,58,a)].
% 0.68/0.99 Derived: -chevy(A,B) | impartial(A,B). [resolve(72,b,62,a)].
% 0.68/0.99 Derived: -chevy(A,B) | unisex(A,B). [resolve(72,b,63,a)].
% 0.68/0.99 Derived: -chevy(A,B) | -animate(A,B). [resolve(72,b,64,a)].
% 0.68/0.99 Derived: -chevy(A,B) | -fellow(A,B). [resolve(72,b,65,b)].
% 0.68/0.99 Derived: -chevy(A,B) | specific(A,B). [resolve(72,b,66,a)].
% 0.68/0.99 Derived: -chevy(A,B) | existent(A,B). [resolve(72,b,67,a)].
% 0.68/0.99 Derived: -chevy(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(72,b,68,f)].
% 0.68/0.99 Derived: -chevy(A,B) | singleton(A,B). [resolve(72,b,69,a)].
% 0.68/0.99 73 -way(A,B) | impartial(A,B). [resolve(70,b,62,a)].
% 0.68/0.99 74 -street(A,B) | way(A,B) # label(clause36) # label(axiom). [assumption].
% 0.68/0.99 Derived: impartial(A,B) | -street(A,B). [resolve(73,a,74,b)].
% 0.68/0.99 75 -way(A,B) | unisex(A,B). [resolve(70,b,63,a)].
% 0.68/0.99 Derived: unisex(A,B) | -street(A,B). [resolve(75,a,74,b)].
% 0.68/0.99 76 -way(A,B) | -animate(A,B). [resolve(70,b,64,a)].
% 0.68/0.99 Derived: -animate(A,B) | -street(A,B). [resolve(76,a,74,b)].
% 0.68/0.99 77 -way(A,B) | -fellow(A,B). [resolve(70,b,65,b)].
% 0.68/0.99 Derived: -fellow(A,B) | -street(A,B). [resolve(77,a,74,b)].
% 0.68/0.99 78 -way(A,B) | specific(A,B). [resolve(70,b,66,a)].
% 0.68/0.99 Derived: specific(A,B) | -street(A,B). [resolve(78,a,74,b)].
% 0.68/0.99 79 -way(A,B) | existent(A,B). [resolve(70,b,67,a)].
% 0.68/0.99 Derived: existent(A,B) | -street(A,B). [resolve(79,a,74,b)].
% 0.68/0.99 80 -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(70,b,68,f)].
% 0.68/0.99 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -street(A,D). [resolve(80,a,74,b)].
% 0.68/0.99 81 -way(A,B) | singleton(A,B). [resolve(70,b,69,a)].
% 0.68/0.99 Derived: singleton(A,B) | -street(A,B). [resolve(81,a,74,b)].
% 0.68/0.99 82 -relname(A,B) | relation(A,B) # label(clause39) # label(axiom). [assumption].
% 0.68/0.99 83 -placename(A,B) | relname(A,B) # label(clause38) # label(axiom). [assumption].
% 0.68/0.99 Derived: relation(A,B) | -placename(A,B). [resolve(82,a,83,b)].
% 0.68/0.99 84 relation(A,B) | -placename(A,B). [resolve(82,a,83,b)].
% 0.68/0.99 85 -relation(A,B) | abstraction(A,B) # label(clause40) # label(axiom). [assumption].
% 0.68/0.99 Derived: -placename(A,B) | abstraction(A,B). [resolve(84,a,85,a)].
% 0.68/0.99 86 -placename(A,B) | abstraction(A,B). [resolve(84,a,85,a)].
% 0.68/0.99 87 -abstraction(A,B) | nonhuman(A,B) # label(clause42) # label(axiom). [assumption].
% 0.68/0.99 88 -abstraction(A,B) | unisex(A,B) # label(clause44) # label(axiom). [assumption].
% 0.68/0.99 89 -abstraction(A,B) | -specific(A,B). [resolve(6,b,7,a)].
% 0.68/0.99 90 -abstraction(A,B) | singleton(A,B). [resolve(38,b,37,a)].
% 0.68/0.99 Derived: -placename(A,B) | nonhuman(A,B). [resolve(86,b,87,a)].
% 0.68/0.99 Derived: -placename(A,B) | unisex(A,B). [resolve(86,b,88,a)].
% 0.68/0.99 Derived: -placename(A,B) | -specific(A,B). [resolve(86,b,89,a)].
% 0.68/0.99 Derived: -placename(A,B) | singleton(A,B). [resolve(86,b,90,a)].
% 0.68/0.99 91 -location(A,B) | impartial(A,B). [resolve(61,b,62,a)].
% 0.68/0.99 92 -city(A,B) | location(A,B) # label(clause46) # label(axiom). [assumption].
% 0.68/0.99 Derived: impartial(A,B) | -city(A,B). [resolve(91,a,92,b)].
% 0.68/1.00 93 -location(A,B) | unisex(A,B). [resolve(61,b,63,a)].
% 0.68/1.00 Derived: unisex(A,B) | -city(A,B). [resolve(93,a,92,b)].
% 0.68/1.00 94 -animate(A,B) | -location(A,B). [resolve(64,a,61,b)].
% 0.68/1.00 Derived: -animate(A,B) | -city(A,B). [resolve(94,b,92,b)].
% 0.68/1.00 95 -fellow(A,B) | -location(A,B). [resolve(65,b,61,b)].
% 0.68/1.00 Derived: -fellow(A,B) | -city(A,B). [resolve(95,b,92,b)].
% 0.68/1.00 96 specific(A,B) | -location(A,B). [resolve(66,a,61,b)].
% 0.68/1.00 Derived: specific(A,B) | -city(A,B). [resolve(96,b,92,b)].
% 0.68/1.00 97 existent(A,B) | -location(A,B). [resolve(67,a,61,b)].
% 0.68/1.00 Derived: existent(A,B) | -city(A,B). [resolve(97,b,92,b)].
% 0.68/1.00 98 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -location(A,D). [resolve(68,f,61,b)].
% 0.68/1.00 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -city(A,D). [resolve(98,f,92,b)].
% 0.68/1.00 99 singleton(A,B) | -location(A,B). [resolve(69,a,61,b)].
% 0.68/1.00 Derived: singleton(A,B) | -city(A,B). [resolve(99,b,92,b)].
% 0.68/1.00 100 -event(A,B) | unisex(A,B). [resolve(43,b,45,a)].
% 0.68/1.00 101 -unisex(A,B) | -fellow(A,B). [resolve(21,a,20,b)].
% 0.68/1.00 Derived: -event(A,B) | -fellow(A,B). [resolve(100,b,101,a)].
% 0.68/1.00 102 -furniture(A,B) | unisex(A,B). [resolve(71,b,63,a)].
% 0.68/1.00 103 -chevy(A,B) | unisex(A,B). [resolve(72,b,63,a)].
% 0.68/1.00 104 unisex(A,B) | -street(A,B). [resolve(75,a,74,b)].
% 0.68/1.00 105 -placename(A,B) | unisex(A,B). [resolve(86,b,88,a)].
% 0.68/1.00 Derived: -placename(A,B) | -fellow(A,B). [resolve(105,b,101,a)].
% 0.68/1.00 106 unisex(A,B) | -city(A,B). [resolve(93,a,92,b)].
% 0.68/1.00 107 -furniture(A,B) | -animate(A,B). [resolve(71,b,64,a)].
% 0.68/1.00 108 -fellow(A,B) | animate(A,B). [resolve(22,a,24,a)].
% 0.68/1.00 109 -chevy(A,B) | -animate(A,B). [resolve(72,b,64,a)].
% 0.68/1.00 110 -animate(A,B) | -street(A,B). [resolve(76,a,74,b)].
% 0.68/1.00 111 -animate(A,B) | -city(A,B). [resolve(94,b,92,b)].
% 0.68/1.00 112 -placename(A,B) | nonhuman(A,B). [resolve(86,b,87,a)].
% 0.68/1.00 113 -fellow(A,B) | -nonhuman(A,B). [resolve(22,a,25,a)].
% 0.68/1.00 114 -placename(A,B) | -specific(A,B). [resolve(86,b,89,a)].
% 0.68/1.00 115 -fellow(A,B) | specific(A,B). [resolve(35,b,32,a)].
% 0.68/1.00 116 -event(A,B) | specific(A,B). [resolve(43,b,44,a)].
% 0.68/1.00 117 -furniture(A,B) | specific(A,B). [resolve(71,b,66,a)].
% 0.68/1.00 118 -chevy(A,B) | specific(A,B). [resolve(72,b,66,a)].
% 0.68/1.00 119 specific(A,B) | -street(A,B). [resolve(78,a,74,b)].
% 0.68/1.00 Derived: -placename(A,B) | -event(A,B). [resolve(114,b,116,b)].
% 0.68/1.00 Derived: -placename(A,B) | -furniture(A,B). [resolve(114,b,117,b)].
% 0.68/1.00 Derived: -placename(A,B) | -chevy(A,B). [resolve(114,b,118,b)].
% 0.68/1.00 Derived: -placename(A,B) | -street(A,B). [resolve(114,b,119,a)].
% 0.68/1.00 120 specific(A,B) | -city(A,B). [resolve(96,b,92,b)].
% 0.68/1.00 Derived: -city(A,B) | -placename(A,B). [resolve(120,a,114,b)].
% 0.68/1.00 121 -existent(A,B) | -event(A,B). [resolve(46,a,43,b)].
% 0.68/1.00 122 -fellow(A,B) | existent(A,B). [resolve(35,b,33,a)].
% 0.68/1.00 123 -furniture(A,B) | existent(A,B). [resolve(71,b,67,a)].
% 0.68/1.00 Derived: -furniture(A,B) | -event(A,B). [resolve(123,b,121,a)].
% 0.68/1.00 124 -chevy(A,B) | existent(A,B). [resolve(72,b,67,a)].
% 0.68/1.00 Derived: -chevy(A,B) | -event(A,B). [resolve(124,b,121,a)].
% 0.68/1.00 125 existent(A,B) | -street(A,B). [resolve(79,a,74,b)].
% 0.68/1.00 Derived: -street(A,B) | -event(A,B). [resolve(125,a,121,a)].
% 0.68/1.00 126 existent(A,B) | -city(A,B). [resolve(97,b,92,b)].
% 0.68/1.00 Derived: -city(A,B) | -event(A,B). [resolve(126,a,121,a)].
% 0.68/1.00 127 -singleton(A,B) | -group(A,B). [resolve(41,a,42,b)].
% 0.68/1.00 128 -fellow(A,B) | singleton(A,B). [resolve(40,b,37,a)].
% 0.68/1.00 Derived: -group(A,B) | -fellow(A,B). [resolve(127,a,128,b)].
% 0.68/1.00 129 singleton(A,B) | -event(A,B). [resolve(47,a,43,b)].
% 0.68/1.00 Derived: -event(A,B) | -group(A,B). [resolve(129,a,127,a)].
% 0.68/1.00 130 -furniture(A,B) | singleton(A,B). [resolve(71,b,69,a)].
% 0.68/1.00 Derived: -furniture(A,B) | -group(A,B). [resolve(130,b,127,a)].
% 0.68/1.00 131 -chevy(A,B) | singleton(A,B). [resolve(72,b,69,a)].
% 0.68/1.00 Derived: -chevy(A,B) | -group(A,B). [resolve(131,b,127,a)].
% 0.68/1.00 132 singleton(A,B) | -street(A,B). [resolve(81,a,74,b)].
% 0.68/1.00 Derived: -street(A,B) | -group(A,B). [resolve(132,a,127,a)].
% 0.68/1.00 133 -placename(A,B) | singleton(A,B). [resolve(86,b,90,a)].
% 0.68/1.00 Derived: -placename(A,B) | -group(A,B). [resolve(133,b,127,a)].
% 0.68/1.00 134 singleton(A,B) | -city(A,B). [resolve(99,b,92,b)].
% 0.68/1.00 Derived: -city(A,B) | -group(A,B). [resolve(134,a,127,a)].
% 0.68/1.00
% 0.68/1.00 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials: (non-Horn, no changes).
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01 Function symbol KB weights: skc6=1. skc7=1. skc11=1. skc10=1. skc8=1. skc9=1. skf10=1. skf12=1. skf5=1. skf8=1. skf13=1.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.04 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== STATISTICS ============================
% 0.73/1.01
% 0.73/1.01 Given=107. Generated=141. Kept=110. proofs=0.
% 0.73/1.01 Usable=99. Sos=0. Demods=0. Limbo=0, Disabled=214. Hints=0.
% 0.73/1.01 Megabytes=0.23.
% 0.73/1.01 User_CPU=0.05, System_CPU=0.01, Wall_clock=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of statistics =====================
% 0.73/1.01
% 0.73/1.01 ============================== end of search =========================
% 0.73/1.01
% 0.73/1.01 SEARCH FAILED
% 0.73/1.01
% 0.73/1.01 Exiting with failure.
% 0.73/1.01
% 0.73/1.01 Process 14296 exit (sos_empty) Fri Jul 1 10:47:39 2022
% 0.73/1.01 Prover9 interrupted
%------------------------------------------------------------------------------