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