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