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