TSTP Solution File: NLP002+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP002+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:05:23 EDT 2022
% Result : Unknown 0.77s 1.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP002+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 08:47:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 28660 was started by sandbox2 on n015.cluster.edu,
% 0.77/1.03 Fri Jul 1 08:47:28 2022
% 0.77/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28505_n015.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_28505_n015.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (34 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03 1 (all U (chevy(U) -> car(U))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 2 (all U (car(U) -> vehicle(U))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 3 (all U (vehicle(U) -> transport(U))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 4 (all U (transport(U) -> instrumentality(U))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 5 (all U (instrumentality(U) -> artifact(U))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 6 (all U (instrumentality(U) -> -way(U))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 7 (all U (street(U) -> way(U))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 8 (all U (way(U) -> artifact(U))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 9 (all U (artifact(U) -> object(U))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 10 (all U (artifact(U) -> -location(U))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 11 (all U (event(U) -> eventuality(U))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 12 (all U (hollywood(U) -> city(U))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 13 (all U (city(U) -> location(U))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 14 (all U (location(U) -> object(U))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 15 (all U (object(U) -> entity(U))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 16 (all U (old(U) -> -new(U))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 17 (all U (eventuality(U) -> -entity(U))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 18 (all U (abstraction(U) -> -entity(U))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 19 (all U (abstraction(U) -> -eventuality(U))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 20 (all U (male(U) -> -female(U))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 21 (all U (man(U) -> -woman(U))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 22 (all U (man(U) -> male(U))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 23 (all U (male(U) -> human(U))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 24 (all U (female(U) -> human(U))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 25 (all U (woman(U) -> female(U))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 26 (all U (drs(U) <-> proposition(U))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 27 (all U (nonhuman(U) -> entity(U))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 28 (all U (human(U) -> -nonhuman(U))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 29 (all U all V all W (have(U,V,W) & human(V) <-> owner(V) & of(V,W))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 30 (all U all V all W (have(U,V,W) & nonhuman(V) & nonhuman(W) -> partof(W,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 31 (all U all V all W (event(U) & have(U,V,W) -> of(V,W))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 32 (all U all V (of(V,U) -> (exists W (event(W) & have(W,U,V))))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 33 (all U all V all W (partof(U,V) & partof(U,W) -> V = W)) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.04 34 --(exists U exists V exists W exists X (hollywood(U) & city(U) & event(V) & street(W) & way(W) & lonely(W) & chevy(X) & car(X) & white(X) & dirty(X) & old(X) & barrel(V,X) & down(V,W) & in(V,U))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.04
% 0.77/1.04 ============================== end of process non-clausal formulas ===
% 0.77/1.04
% 0.77/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04
% 0.77/1.04 ============================== PREDICATE ELIMINATION =================
% 0.77/1.04 35 -hollywood(A) | city(A) # label(ax12) # label(axiom). [clausify(12)].
% 0.77/1.04 36 hollywood(c1) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: city(c1). [resolve(35,a,36,a)].
% 0.77/1.04 37 -city(A) | location(A) # label(ax13) # label(axiom). [clausify(13)].
% 0.77/1.04 38 city(c1) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: location(c1). [resolve(37,a,38,a)].
% 0.77/1.04 39 city(c1). [resolve(35,a,36,a)].
% 0.77/1.04 40 -event(A) | eventuality(A) # label(ax11) # label(axiom). [clausify(11)].
% 0.77/1.04 41 event(c2) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: eventuality(c2). [resolve(40,a,41,a)].
% 0.77/1.04 42 -of(A,B) | event(f1(B,A)) # label(ax32) # label(axiom). [clausify(32)].
% 0.77/1.04 Derived: -of(A,B) | eventuality(f1(B,A)). [resolve(42,b,40,a)].
% 0.77/1.04 43 -event(A) | -have(A,B,C) | of(B,C) # label(ax31) # label(axiom). [clausify(31)].
% 0.77/1.04 Derived: -have(c2,A,B) | of(A,B). [resolve(43,a,41,a)].
% 0.77/1.04 Derived: -have(f1(A,B),C,D) | of(C,D) | -of(B,A). [resolve(43,a,42,b)].
% 0.77/1.04 44 -street(A) | way(A) # label(ax7) # label(axiom). [clausify(7)].
% 0.77/1.04 45 street(c3) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: way(c3). [resolve(44,a,45,a)].
% 0.77/1.04 46 -instrumentality(A) | -way(A) # label(ax6) # label(axiom). [clausify(6)].
% 0.77/1.04 47 way(c3) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: -instrumentality(c3). [resolve(46,b,47,a)].
% 0.77/1.04 48 -way(A) | artifact(A) # label(ax8) # label(axiom). [clausify(8)].
% 0.77/1.04 Derived: artifact(c3). [resolve(48,a,47,a)].
% 0.77/1.04 49 way(c3). [resolve(44,a,45,a)].
% 0.77/1.04 50 -chevy(A) | car(A) # label(ax1) # label(axiom). [clausify(1)].
% 0.77/1.04 51 chevy(c4) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: car(c4). [resolve(50,a,51,a)].
% 0.77/1.04 52 -car(A) | vehicle(A) # label(ax2) # label(axiom). [clausify(2)].
% 0.77/1.04 53 car(c4) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04 Derived: vehicle(c4). [resolve(52,a,53,a)].
% 0.77/1.04 54 car(c4). [resolve(50,a,51,a)].
% 0.77/1.04 55 -old(A) | -new(A) # label(ax16) # label(axiom). [clausify(16)].
% 0.77/1.04 56 old(c4) # label(co1) # label(negated_conjecture). [clausify(34)].
% 0.77/1.04
% 0.77/1.04 WARNING: denials share constants (see output).
% 0.77/1.04
% 0.77/1.04 Derived: -new(c4). [resolve(55,a,56,a)].
% 0.77/1.04 57 -instrumentality(A) | artifact(A) # label(ax5) # label(axiom). [clausify(5)].
% 0.77/1.04 58 -artifact(A) | -location(A) # label(ax10) # label(axiom). [clausify(10)].
% 0.77/1.04 Derived: -instrumentality(A) | -location(A). [resolve(57,b,58,a)].
% 0.77/1.04 59 -artifact(A) | object(A) # label(ax9) # label(axiom). [clausify(9)].
% 0.77/1.04 Derived: object(A) | -instrumentality(A). [resolve(59,a,57,b)].
% 0.77/1.04 60 artifact(c3). [resolve(48,a,47,a)].
% 0.77/1.04 Derived: -location(c3). [resolve(60,a,58,a)].
% 0.77/1.04 Derived: object(c3). [resolve(60,a,59,a)].
% 0.77/1.04 61 eventuality(c2). [resolve(40,a,41,a)].
% 0.77/1.04 62 -eventuality(A) | -entity(A) # label(ax17) # label(axiom). [clausify(17)].
% 0.77/1.04 63 -abstraction(A) | -eventuality(A) # label(ax19) # label(axiom). [clausify(19)].
% 0.77/1.04 Derived: -entity(c2). [resolve(61,a,62,a)].
% 0.77/1.04 Derived: -abstraction(c2). [resolve(61,a,63,b)].
% 0.77/1.04 64 -of(A,B) | eventuality(f1(B,A)). [resolve(42,b,40,a)].
% 0.77/1.04 Derived: -of(A,B) | -entity(f1(B,A)). [resolve(64,b,62,a)].
% 0.77/1.04 Derived: -of(A,B) | -abstraction(f1(B,A)). [resolve(64,b,63,b)].
% 0.77/1.04 65 -man(A) | male(A) # label(ax22) # label(axiom). [clausify(22)].
% 0.77/1.04 66 -male(A) | -female(A) # label(ax20) # label(axiom). [clausify(20)].
% 0.77/1.04 Derived: -man(A) | -female(A). [resolve(65,b,66,a)].
% 0.77/1.04 67 -male(A) | human(A) # label(ax23) # label(axiom). [clausify(23)].
% 0.77/1.04 Derived: human(A) | -man(A). [resolve(67,a,65,b)].
% 0.77/1.04 68 -female(A) | human(A) # label(ax24) # label(axiom). [clausify(24)].
% 0.77/1.04 69 -human(A) | -nonhuman(A) # label(ax28) # label(axiom). [clausify(28)].
% 0.77/1.04 Derived: -female(A) | -nonhuman(A). [resolve(68,b,69,a)].
% 0.77/1.04 70 human(A) | -owner(A) | -of(A,B) # label(ax29) # label(axiom). [clausify(29)].
% 0.77/1.04 Derived: -owner(A) | -of(A,B) | -nonhuman(A). [resolve(70,a,69,a)].
% 0.77/1.04 71 -have(A,B,C) | -human(B) | owner(B) # label(ax29) # label(axiom). [clausify(29)].
% 0.77/1.04 Derived: -have(A,B,C) | owner(B) | -female(B). [resolve(71,b,68,b)].
% 0.77/1.04 72 -have(A,B,C) | -human(B) | of(B,C) # label(ax29) # label(axiom). [clausify(29)].
% 0.77/1.04 Derived: -have(A,B,C) | of(B,C) | -female(B). [resolve(72,b,68,b)].
% 0.77/1.04 Derived: -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(72,b,70,a)].
% 0.77/1.04 73 vehicle(c4). [resolve(52,a,53,a)].
% 0.77/1.04 74 -vehicle(A) | transport(A) # label(ax3) # label(axiom). [clausify(3)].
% 0.77/1.04 Derived: transport(c4). [resolve(73,a,74,a)].
% 0.77/1.04 75 transport(c4). [resolve(73,a,74,a)].
% 0.77/1.04 76 -transport(A) | instrumentality(A) # label(ax4) # label(axiom). [clausify(4)].
% 0.77/1.04 Derived: instrumentality(c4). [resolve(75,a,76,a)].
% 0.77/1.04 77 -object(A) | entity(A) # label(ax15) # label(axiom). [clausify(15)].
% 0.77/1.04 78 -location(A) | object(A) # label(ax14) # label(axiom). [clausify(14)].
% 0.77/1.04 Derived: entity(A) | -location(A). [resolve(77,a,78,b)].
% 0.77/1.04 79 object(A) | -instrumentality(A). [resolve(59,a,57,b)].
% 0.77/1.04 Derived: -instrumentality(A) | entity(A). [resolve(79,a,77,a)].
% 0.77/1.04 80 object(c3). [resolve(60,a,59,a)].
% 0.77/1.04 Derived: entity(c3). [resolve(80,a,77,a)].
% 0.77/1.04 81 drs(A) | -proposition(A) # label(ax26) # label(axiom). [clausify(26)].
% 0.77/1.04 82 -drs(A) | proposition(A) # label(ax26) # label(axiom). [clausify(26)].
% 0.77/1.04 83 -have(A,B,C) | owner(B) | -female(B). [resolve(71,b,68,b)].
% 0.77/1.04 84 have(A,B,C) | -owner(B) | -of(B,C) # label(ax29) # label(axiom). [clausify(29)].
% 0.77/1.04 85 -owner(A) | -of(A,B) | -nonhuman(A). [resolve(70,a,69,a)].
% 0.77/1.04 Derived: -have(A,B,C) | -female(B) | have(D,B,E) | -of(B,E). [resolve(83,b,84,b)].
% 0.77/1.04 Derived: -have(A,B,C) | -female(B) | -of(B,D) | -nonhuman(B). [resolve(83,b,85,a)].
% 0.77/1.04 86 -have(A,B,C) | of(B,C) | -owner(B) | -of(B,D). [resolve(72,b,70,a)].
% 0.77/1.04 Derived: -have(A,B,C) | of(B,C) | -of(B,D) | -have(E,B,F) | -female(B). [resolve(86,c,83,b)].
% 0.77/1.04
% 0.77/1.04 ============================== end predicate elimination =============
% 0.77/1.04
% 0.77/1.04 Auto_denials:
% 0.77/1.04 % copying label ax18 to answer in negative clause
% 0.77/1.04 % assign(max_proofs, 9). % (Horn set with more than one neg. clause)
% 0.77/1.04
% 0.77/1.04 WARNING, because some of the denials share constants,
% 0.77/1.04 some of the denials or their descendents may be subsumed,
% 0.77/1.04 preventing the target number of proofs from being found.
% 0.77/1.04 The shared constants are: c2, c3.
% 0.77/1.04
% 0.77/1.04 Term ordering decisions:
% 0.77/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. f1=1.
% 0.77/1.04
% 0.77/1.04 ============================== end of process initial clauses ========
% 0.77/1.04
% 0.77/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.04
% 0.77/1.04 ============================== end of clauses for search =============
% 0.77/1.04
% 0.77/1.04 ============================== SEARCH ================================
% 0.77/1.04
% 0.77/1.04 % Starting search at 0.02 seconds.
% 0.77/1.04
% 0.77/1.04 ============================== STATISTICS ============================
% 0.77/1.04
% 0.77/1.04 Given=30. Generated=30. Kept=30. proofs=0.
% 0.77/1.04 Usable=30. Sos=0. Demods=0. Limbo=0, Disabled=87. Hints=0.
% 0.77/1.04 Megabytes=0.09.
% 0.77/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of statistics =====================
% 0.77/1.04
% 0.77/1.04 ============================== end of search =========================
% 0.77/1.04
% 0.77/1.04 SEARCH FAILED
% 0.77/1.04
% 0.77/1.04 Exiting with failure.
% 0.77/1.04
% 0.77/1.04 Process 28660 exit (sos_empty) Fri Jul 1 08:47:28 2022
% 0.77/1.04 Prover9 interrupted
%------------------------------------------------------------------------------