TSTP Solution File: NLP127-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP127-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:03 EDT 2022
% Result : Unknown 0.76s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP127-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 30 19:50:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 26258 was started by sandbox on n008.cluster.edu,
% 0.45/1.02 Thu Jun 30 19:50:08 2022
% 0.45/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26105_n008.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_26105_n008.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (52 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02 1 -chevy(A,B) | car(A,B) # label(clause28) # label(axiom). [assumption].
% 0.45/1.02 2 chevy(skc6,skc11) # label(clause37) # label(negated_conjecture). [assumption].
% 0.45/1.02 Derived: car(skc6,skc11). [resolve(1,a,2,a)].
% 0.45/1.02 3 -city(A,B) | location(A,B) # label(clause26) # label(axiom). [assumption].
% 0.45/1.02 4 city(skc6,skc10) # label(clause38) # label(negated_conjecture). [assumption].
% 0.45/1.02 Derived: location(skc6,skc10). [resolve(3,a,4,a)].
% 0.45/1.02 5 -street(A,B) | way(A,B) # label(clause8) # label(axiom). [assumption].
% 0.45/1.02 6 street(skc6,skc8) # label(clause40) # label(negated_conjecture). [assumption].
% 0.45/1.02 Derived: way(skc6,skc8). [resolve(5,a,6,a)].
% 0.45/1.02 7 -hollywood_placename(A,B) | placename(A,B) # label(clause25) # label(axiom). [assumption].
% 0.45/1.02 8 hollywood_placename(skc6,skc9) # label(clause42) # label(negated_conjecture). [assumption].
% 0.45/1.02 Derived: placename(skc6,skc9). [resolve(7,a,8,a)].
% 0.45/1.02 9 -event(A,B) | eventuality(A,B) # label(clause2) # label(axiom). [assumption].
% 0.45/1.02 10 event(skc6,skc7) # label(clause43) # label(negated_conjecture). [assumption].
% 0.45/1.02 11 -barrel(A,B) | event(A,B) # label(clause1) # label(axiom). [assumption].
% 0.45/1.02 Derived: eventuality(skc6,skc7). [resolve(9,a,10,a)].
% 0.45/1.02 Derived: eventuality(A,B) | -barrel(A,B). [resolve(9,a,11,b)].
% 0.45/1.02 12 eventuality(A,B) | -barrel(A,B). [resolve(9,a,11,b)].
% 0.45/1.02 13 barrel(skc6,skc7) # label(clause45) # label(negated_conjecture). [assumption].
% 0.45/1.02 Derived: eventuality(skc6,skc7). [resolve(12,b,13,a)].
% 0.45/1.02 14 -abstraction(A,B) | general(A,B) # label(clause23) # label(axiom). [assumption].
% 0.45/1.02 15 -general(A,B) | -specific(A,B) # label(clause33) # label(axiom). [assumption].
% 0.45/1.02 Derived: -abstraction(A,B) | -specific(A,B). [resolve(14,b,15,a)].
% 0.45/1.02 16 -eventuality(A,B) | nonexistent(A,B) # label(clause6) # label(axiom). [assumption].
% 0.45/1.02 17 -nonexistent(A,B) | -existent(A,B) # label(clause34) # label(axiom). [assumption].
% 0.76/1.02 Derived: -eventuality(A,B) | -existent(A,B). [resolve(16,b,17,a)].
% 0.76/1.02 18 eventuality(skc6,skc7). [resolve(9,a,10,a)].
% 0.76/1.02 19 -eventuality(A,B) | thing(A,B) # label(clause3) # label(axiom). [assumption].
% 0.76/1.02 20 -eventuality(A,B) | specific(A,B) # label(clause5) # label(axiom). [assumption].
% 0.76/1.02 21 -eventuality(A,B) | unisex(A,B) # label(clause7) # label(axiom). [assumption].
% 0.76/1.02 Derived: thing(skc6,skc7). [resolve(18,a,19,a)].
% 0.76/1.02 Derived: specific(skc6,skc7). [resolve(18,a,20,a)].
% 0.76/1.02 Derived: unisex(skc6,skc7). [resolve(18,a,21,a)].
% 0.76/1.02 22 eventuality(skc6,skc7). [resolve(12,b,13,a)].
% 0.76/1.02 23 -eventuality(A,B) | -existent(A,B). [resolve(16,b,17,a)].
% 0.76/1.02 Derived: -existent(skc6,skc7). [resolve(23,a,18,a)].
% 0.76/1.02 24 -entity(A,B) | thing(A,B) # label(clause12) # label(axiom). [assumption].
% 0.76/1.02 25 -thing(A,B) | singleton(A,B) # label(clause4) # label(axiom). [assumption].
% 0.76/1.02 Derived: -entity(A,B) | singleton(A,B). [resolve(24,b,25,a)].
% 0.76/1.02 26 -abstraction(A,B) | thing(A,B) # label(clause21) # label(axiom). [assumption].
% 0.76/1.02 Derived: -abstraction(A,B) | singleton(A,B). [resolve(26,b,25,a)].
% 0.76/1.02 27 thing(skc6,skc7). [resolve(18,a,19,a)].
% 0.76/1.02 Derived: singleton(skc6,skc7). [resolve(27,a,25,a)].
% 0.76/1.02 28 way(skc6,skc8). [resolve(5,a,6,a)].
% 0.76/1.02 29 -way(A,B) | artifact(A,B) # label(clause9) # label(axiom). [assumption].
% 0.76/1.02 Derived: artifact(skc6,skc8). [resolve(28,a,29,a)].
% 0.76/1.02 30 -instrumentality(A,B) | artifact(A,B) # label(clause32) # label(axiom). [assumption].
% 0.76/1.02 31 -artifact(A,B) | object(A,B) # label(clause10) # label(axiom). [assumption].
% 0.76/1.02 Derived: -instrumentality(A,B) | object(A,B). [resolve(30,b,31,a)].
% 0.76/1.02 32 artifact(skc6,skc8). [resolve(28,a,29,a)].
% 0.76/1.02 Derived: object(skc6,skc8). [resolve(32,a,31,a)].
% 0.76/1.02 33 -location(A,B) | object(A,B) # label(clause27) # label(axiom). [assumption].
% 0.76/1.02 34 -object(A,B) | entity(A,B) # label(clause11) # label(axiom). [assumption].
% 0.76/1.02 35 -object(A,B) | nonliving(A,B) # label(clause15) # label(axiom). [assumption].
% 0.76/1.02 36 -object(A,B) | impartial(A,B) # label(clause16) # label(axiom). [assumption].
% 0.76/1.02 37 -object(A,B) | unisex(A,B) # label(clause17) # label(axiom). [assumption].
% 0.76/1.02 Derived: -location(A,B) | entity(A,B). [resolve(33,b,34,a)].
% 0.76/1.02 Derived: -location(A,B) | nonliving(A,B). [resolve(33,b,35,a)].
% 0.76/1.02 Derived: -location(A,B) | impartial(A,B). [resolve(33,b,36,a)].
% 0.76/1.02 Derived: -location(A,B) | unisex(A,B). [resolve(33,b,37,a)].
% 0.76/1.02 38 -instrumentality(A,B) | object(A,B). [resolve(30,b,31,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | entity(A,B). [resolve(38,b,34,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | nonliving(A,B). [resolve(38,b,35,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | impartial(A,B). [resolve(38,b,36,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | unisex(A,B). [resolve(38,b,37,a)].
% 0.76/1.02 39 object(skc6,skc8). [resolve(32,a,31,a)].
% 0.76/1.02 Derived: entity(skc6,skc8). [resolve(39,a,34,a)].
% 0.76/1.02 Derived: nonliving(skc6,skc8). [resolve(39,a,35,a)].
% 0.76/1.02 Derived: impartial(skc6,skc8). [resolve(39,a,36,a)].
% 0.76/1.02 Derived: unisex(skc6,skc8). [resolve(39,a,37,a)].
% 0.76/1.02 40 -location(A,B) | entity(A,B). [resolve(33,b,34,a)].
% 0.76/1.02 41 -entity(A,B) | specific(A,B) # label(clause13) # label(axiom). [assumption].
% 0.76/1.02 42 -entity(A,B) | existent(A,B) # label(clause14) # label(axiom). [assumption].
% 0.76/1.02 43 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause35) # label(axiom). [assumption].
% 0.76/1.02 44 -entity(A,B) | singleton(A,B). [resolve(24,b,25,a)].
% 0.76/1.02 Derived: -location(A,B) | specific(A,B). [resolve(40,b,41,a)].
% 0.76/1.02 Derived: -location(A,B) | existent(A,B). [resolve(40,b,42,a)].
% 0.76/1.02 Derived: -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(40,b,43,e)].
% 0.76/1.02 Derived: -location(A,B) | singleton(A,B). [resolve(40,b,44,a)].
% 0.76/1.02 45 -instrumentality(A,B) | entity(A,B). [resolve(38,b,34,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | specific(A,B). [resolve(45,b,41,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | existent(A,B). [resolve(45,b,42,a)].
% 0.76/1.02 Derived: -instrumentality(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,43,e)].
% 0.76/1.02 Derived: -instrumentality(A,B) | singleton(A,B). [resolve(45,b,44,a)].
% 0.76/1.03 46 entity(skc6,skc8). [resolve(39,a,34,a)].
% 0.76/1.03 Derived: specific(skc6,skc8). [resolve(46,a,41,a)].
% 0.76/1.03 Derived: existent(skc6,skc8). [resolve(46,a,42,a)].
% 0.76/1.03 Derived: -placename(skc6,A) | -of(skc6,B,skc8) | -placename(skc6,B) | -of(skc6,A,skc8) | B = A. [resolve(46,a,43,e)].
% 0.76/1.03 Derived: singleton(skc6,skc8). [resolve(46,a,44,a)].
% 0.76/1.03 47 -relname(A,B) | relation(A,B) # label(clause19) # label(axiom). [assumption].
% 0.76/1.03 48 -placename(A,B) | relname(A,B) # label(clause18) # label(axiom). [assumption].
% 0.76/1.03 Derived: relation(A,B) | -placename(A,B). [resolve(47,a,48,b)].
% 0.76/1.03 49 relation(A,B) | -placename(A,B). [resolve(47,a,48,b)].
% 0.76/1.03 50 -relation(A,B) | abstraction(A,B) # label(clause20) # label(axiom). [assumption].
% 0.76/1.03 Derived: -placename(A,B) | abstraction(A,B). [resolve(49,a,50,a)].
% 0.76/1.03 51 -placename(A,B) | abstraction(A,B). [resolve(49,a,50,a)].
% 0.76/1.03 52 -abstraction(A,B) | nonhuman(A,B) # label(clause22) # label(axiom). [assumption].
% 0.76/1.03 53 -abstraction(A,B) | unisex(A,B) # label(clause24) # label(axiom). [assumption].
% 0.76/1.03 54 -abstraction(A,B) | -specific(A,B). [resolve(14,b,15,a)].
% 0.76/1.03 55 -abstraction(A,B) | singleton(A,B). [resolve(26,b,25,a)].
% 0.76/1.03 Derived: -placename(A,B) | nonhuman(A,B). [resolve(51,b,52,a)].
% 0.76/1.03 Derived: -placename(A,B) | unisex(A,B). [resolve(51,b,53,a)].
% 0.76/1.03 Derived: -placename(A,B) | -specific(A,B). [resolve(51,b,54,a)].
% 0.76/1.03 Derived: -placename(A,B) | singleton(A,B). [resolve(51,b,55,a)].
% 0.76/1.03 56 car(skc6,skc11). [resolve(1,a,2,a)].
% 0.76/1.03 57 -car(A,B) | vehicle(A,B) # label(clause29) # label(axiom). [assumption].
% 0.76/1.03 Derived: vehicle(skc6,skc11). [resolve(56,a,57,a)].
% 0.76/1.03 58 vehicle(skc6,skc11). [resolve(56,a,57,a)].
% 0.76/1.03 59 -vehicle(A,B) | transport(A,B) # label(clause30) # label(axiom). [assumption].
% 0.76/1.03 Derived: transport(skc6,skc11). [resolve(58,a,59,a)].
% 0.76/1.03 60 transport(skc6,skc11). [resolve(58,a,59,a)].
% 0.76/1.03 61 -transport(A,B) | instrumentality(A,B) # label(clause31) # label(axiom). [assumption].
% 0.76/1.03 Derived: instrumentality(skc6,skc11). [resolve(60,a,61,a)].
% 0.76/1.03 62 -location(A,B) | nonliving(A,B). [resolve(33,b,35,a)].
% 0.76/1.03 63 location(skc6,skc10). [resolve(3,a,4,a)].
% 0.76/1.03 Derived: nonliving(skc6,skc10). [resolve(62,a,63,a)].
% 0.76/1.03 64 -location(A,B) | impartial(A,B). [resolve(33,b,36,a)].
% 0.76/1.03 Derived: impartial(skc6,skc10). [resolve(64,a,63,a)].
% 0.76/1.03 65 -location(A,B) | unisex(A,B). [resolve(33,b,37,a)].
% 0.76/1.03 Derived: unisex(skc6,skc10). [resolve(65,a,63,a)].
% 0.76/1.03 66 -location(A,B) | specific(A,B). [resolve(40,b,41,a)].
% 0.76/1.03 Derived: specific(skc6,skc10). [resolve(66,a,63,a)].
% 0.76/1.03 67 -location(A,B) | existent(A,B). [resolve(40,b,42,a)].
% 0.76/1.03 Derived: existent(skc6,skc10). [resolve(67,a,63,a)].
% 0.76/1.03 68 -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(40,b,43,e)].
% 0.76/1.03 Derived: -placename(skc6,A) | -of(skc6,B,skc10) | -placename(skc6,B) | -of(skc6,A,skc10) | B = A. [resolve(68,a,63,a)].
% 0.76/1.03 69 -location(A,B) | singleton(A,B). [resolve(40,b,44,a)].
% 0.76/1.03 Derived: singleton(skc6,skc10). [resolve(69,a,63,a)].
% 0.76/1.03 70 -placename(A,B) | -specific(A,B). [resolve(51,b,54,a)].
% 0.76/1.03 71 specific(skc6,skc7). [resolve(18,a,20,a)].
% 0.76/1.03 72 -instrumentality(A,B) | specific(A,B). [resolve(45,b,41,a)].
% 0.76/1.03 73 specific(skc6,skc8). [resolve(46,a,41,a)].
% 0.76/1.03 Derived: -placename(skc6,skc7). [resolve(70,b,71,a)].
% 0.76/1.03 Derived: -placename(A,B) | -instrumentality(A,B). [resolve(70,b,72,b)].
% 0.76/1.03 Derived: -placename(skc6,skc8). [resolve(70,b,73,a)].
% 0.76/1.03 74 specific(skc6,skc10). [resolve(66,a,63,a)].
% 0.76/1.03 Derived: -placename(skc6,skc10). [resolve(74,a,70,b)].
% 0.76/1.03 75 instrumentality(skc6,skc11). [resolve(60,a,61,a)].
% 0.76/1.03 76 -instrumentality(A,B) | nonliving(A,B). [resolve(38,b,35,a)].
% 0.76/1.03 77 -instrumentality(A,B) | impartial(A,B). [resolve(38,b,36,a)].
% 0.76/1.03 78 -instrumentality(A,B) | existent(A,B). [resolve(45,b,42,a)].
% 0.76/1.03 79 -instrumentality(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(45,b,43,e)].
% 0.76/1.03 Derived: nonliving(skc6,skc11). [resolve(75,a,76,a)].
% 0.76/1.03 Derived: impartial(skc6,skc11). [resolve(75,a,77,a)].
% 0.76/1.03 Derived: existent(skc6,skc11). [resolve(75,a,78,a)].
% 0.76/1.03 Derived: -placename(skc6,A) | -of(skc6,B,skc11) | -placename(skc6,B) | -of(skc6,A,skc11) | B = A. [resolve(75,a,79,a)].
% 0.76/1.03 80 -placename(
% 0.76/1.03 WARNING: denials share constants (see output).
% 0.76/1.03
% 0.76/1.03 A,B) | -instrumentality(A,B). [resolve(70,b,72,b)].
% 0.76/1.03 Derived: -placename(skc6,skc11). [resolve(80,b,75,a)].
% 0.76/1.03
% 0.76/1.03 ============================== end predicate elimination =============
% 0.76/1.03
% 0.76/1.03 Auto_denials:
% 0.76/1.03 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.76/1.03
% 0.76/1.03 WARNING, because some of the denials share constants,
% 0.76/1.03 some of the denials or their descendents may be subsumed,
% 0.76/1.03 preventing the target number of proofs from being found.
% 0.76/1.03 The shared constants are: skc7, skc6.
% 0.76/1.03
% 0.76/1.03 Term ordering decisions:
% 0.76/1.03 Function symbol KB weights: skc6=1. skc10=1. skc11=1. skc8=1. skc9=1. skc7=1.
% 0.76/1.03
% 0.76/1.03 ============================== end of process initial clauses ========
% 0.76/1.03
% 0.76/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.03
% 0.76/1.03 ============================== end of clauses for search =============
% 0.76/1.03
% 0.76/1.03 ============================== SEARCH ================================
% 0.76/1.03
% 0.76/1.03 % Starting search at 0.02 seconds.
% 0.76/1.03
% 0.76/1.03 ============================== STATISTICS ============================
% 0.76/1.03
% 0.76/1.03 Given=13. Generated=15. Kept=13. proofs=0.
% 0.76/1.03 Usable=13. Sos=0. Demods=0. Limbo=0, Disabled=120. Hints=0.
% 0.76/1.03 Megabytes=0.06.
% 0.76/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.76/1.03
% 0.76/1.03 ============================== end of statistics =====================
% 0.76/1.03
% 0.76/1.03 ============================== end of search =========================
% 0.76/1.03
% 0.76/1.03 SEARCH FAILED
% 0.76/1.03
% 0.76/1.03 Exiting with failure.
% 0.76/1.03
% 0.76/1.03 Process 26258 exit (sos_empty) Thu Jun 30 19:50:08 2022
% 0.76/1.03 Prover9 interrupted
%------------------------------------------------------------------------------