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