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