TSTP Solution File: NLP088-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP088-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:06:39 EDT 2022
% Result : Timeout 300.04s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP088-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 09:55:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.05 ============================== Prover9 ===============================
% 0.73/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.05 Process 20121 was started by sandbox on n029.cluster.edu,
% 0.73/1.05 Fri Jul 1 09:55:09 2022
% 0.73/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19968_n029.cluster.edu".
% 0.73/1.05 ============================== end of head ===========================
% 0.73/1.05
% 0.73/1.05 ============================== INPUT =================================
% 0.73/1.05
% 0.73/1.05 % Reading from file /tmp/Prover9_19968_n029.cluster.edu
% 0.73/1.05
% 0.73/1.05 set(prolog_style_variables).
% 0.73/1.05 set(auto2).
% 0.73/1.05 % set(auto2) -> set(auto).
% 0.73/1.05 % set(auto) -> set(auto_inference).
% 0.73/1.05 % set(auto) -> set(auto_setup).
% 0.73/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.05 % set(auto) -> set(auto_limits).
% 0.73/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.05 % set(auto) -> set(auto_denials).
% 0.73/1.05 % set(auto) -> set(auto_process).
% 0.73/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.05 % set(auto2) -> assign(stats, some).
% 0.73/1.05 % set(auto2) -> clear(echo_input).
% 0.73/1.05 % set(auto2) -> set(quiet).
% 0.73/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.05 % set(auto2) -> clear(print_given).
% 0.73/1.05 assign(lrs_ticks,-1).
% 0.73/1.05 assign(sos_limit,10000).
% 0.73/1.05 assign(order,kbo).
% 0.73/1.05 set(lex_order_vars).
% 0.73/1.05 clear(print_given).
% 0.73/1.05
% 0.73/1.05 % formulas(sos). % not echoed (94 formulas)
% 0.73/1.05
% 0.73/1.05 ============================== end of input ==========================
% 0.73/1.05
% 0.73/1.05 % From the command line: assign(max_seconds, 300).
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.05
% 0.73/1.05 % Formulas that are not ordinary clauses:
% 0.73/1.05
% 0.73/1.05 ============================== end of process non-clausal formulas ===
% 0.73/1.05
% 0.73/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.05
% 0.73/1.05 ============================== PREDICATE ELIMINATION =================
% 0.73/1.05 1 -six(A,B) | -group(A,B) | -shot(A,skf10(A,C)) | -cannon(A,D) | -male(A,E) | -man(A,E) | -of(A,D,E) | -ssSkP0(D,E,B,A) | -patient(A,F,V6) | -cry(A,V6) | -agent(A,F,V7) | -male(A,V7) | -scream(A,F) | -nonreflexive(A,F) | -present(A,F) | -event(A,F) | -revenge(A,V8) | -of(A,F,V8) | -actual_world(A) # label(clause94) # label(negated_conjecture). [assumption].
% 0.73/1.05 2 actual_world(skc4) # label(clause75) # label(negated_conjecture). [assumption].
% 0.73/1.05 Derived: -six(skc4,A) | -group(skc4,A) | -shot(skc4,skf10(skc4,B)) | -cannon(skc4,C) | -male(skc4,D) | -man(skc4,D) | -of(skc4,C,D) | -ssSkP0(C,D,A,skc4) | -patient(skc4,E,F) | -cry(skc4,F) | -agent(skc4,E,V6) | -male(skc4,V6) | -scream(skc4,E) | -nonreflexive(skc4,E) | -present(skc4,E) | -event(skc4,E) | -revenge(skc4,V7) | -of(skc4,E,V7). [resolve(1,s,2,a)].
% 0.73/1.05 3 -six(A,B) | -group(A,B) | -cannon(A,C) | -male(A,D) | -man(A,D) | -of(A,C,D) | -ssSkP0(C,D,B,A) | -patient(A,E,F) | -cry(A,F) | -agent(A,E,V6) | -male(A,V6) | -scream(A,E) | -nonreflexive(A,E) | -present(A,E) | -event(A,E) | -revenge(A,V7) | -of(A,E,V7) | -actual_world(A) | member(A,skf10(A,B),B) # label(clause93) # label(negated_conjecture). [assumption].
% 0.73/1.05 Derived: -six(skc4,A) | -group(skc4,A) | -cannon(skc4,B) | -male(skc4,C) | -man(skc4,C) | -of(skc4,B,C) | -ssSkP0(B,C,A,skc4) | -patient(skc4,D,E) | -cry(skc4,E) | -agent(skc4,D,F) | -male(skc4,F) | -scream(skc4,D) | -nonreflexive(skc4,D) | -present(skc4,D) | -event(skc4,D) | -revenge(skc4,V6) | -of(skc4,D,V6) | member(skc4,skf10(skc4,A),A). [resolve(3,r,2,a)].
% 0.73/1.05 4 -eventuality(A,B) | unisex(A,B) # label(clause9) # label(axiom). [assumption].
% 0.73/1.05 5 -male(A,B) | -unisex(A,B) # label(clause40) # label(axiom). [assumption].
% 0.73/1.05 Derived: -eventuality(A,B) | -male(A,B). [resolve(4,b,5,b)].
% 0.73/1.06 6 -object(A,B) | unisex(A,B) # label(clause31) # label(axiom). [assumption].
% 0.73/1.06 Derived: -object(A,B) | -male(A,B). [resolve(6,b,5,b)].
% 0.73/1.06 7 -set(A,B) | multiple(A,B) # label(clause17) # label(axiom). [assumption].
% 0.73/1.06 8 -multiple(A,B) | -singleton(A,B) # label(clause41) # label(axiom). [assumption].
% 0.73/1.06 Derived: -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.73/1.06 9 -organism(A,B) | living(A,B) # label(clause36) # label(axiom). [assumption].
% 0.73/1.06 10 -living(A,B) | -nonliving(A,B) # label(clause42) # label(axiom). [assumption].
% 0.73/1.06 Derived: -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.73/1.06 11 -eventuality(A,B) | nonexistent(A,B) # label(clause8) # label(axiom). [assumption].
% 0.73/1.06 12 -nonexistent(A,B) | -existent(A,B) # label(clause43) # label(axiom). [assumption].
% 0.73/1.06 Derived: -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.73/1.06 13 -object(A,B) | nonliving(A,B) # label(clause29) # label(axiom). [assumption].
% 0.73/1.06 14 -nonliving(A,B) | -animate(A,B) # label(clause44) # label(axiom). [assumption].
% 0.73/1.06 Derived: -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.73/1.06 15 -organism(A,B) | -nonliving(A,B). [resolve(9,b,10,a)].
% 0.73/1.06 Derived: -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.73/1.06 16 -member(A,B,C) | -ssSkP0(D,E,C,A) | from_loc(A,skf11(A,B,D,F),D) # label(clause91) # label(negated_conjecture). [assumption].
% 0.73/1.06 17 -from_loc(A,B,C) | -fire(A,B) | -nonreflexive(A,B) | -present(A,B) | -patient(A,B,skf13(C,D,E,A)) | -agent(A,B,D) | -event(A,B) # label(clause92) # label(negated_conjecture). [assumption].
% 0.73/1.06 Derived: -member(A,B,C) | -ssSkP0(D,E,C,A) | -fire(A,skf11(A,B,D,F)) | -nonreflexive(A,skf11(A,B,D,F)) | -present(A,skf11(A,B,D,F)) | -patient(A,skf11(A,B,D,F),skf13(D,V6,V7,A)) | -agent(A,skf11(A,B,D,F),V6) | -event(A,skf11(A,B,D,F)). [resolve(16,c,17,a)].
% 0.73/1.06 18 -sound(A,B) | event(A,B) # label(clause3) # label(axiom). [assumption].
% 0.73/1.06 19 -scream(A,B) | sound(A,B) # label(clause2) # label(axiom). [assumption].
% 0.73/1.06 20 -eventuality(A,B) | thing(A,B) # label(clause5) # label(axiom). [assumption].
% 0.73/1.06 21 -event(A,B) | eventuality(A,B) # label(clause4) # label(axiom). [assumption].
% 0.73/1.06 Derived: thing(A,B) | -event(A,B). [resolve(20,a,21,b)].
% 0.73/1.06 22 -eventuality(A,B) | specific(A,B) # label(clause7) # label(axiom). [assumption].
% 0.73/1.06 Derived: specific(A,B) | -event(A,B). [resolve(22,a,21,b)].
% 0.73/1.06 23 -eventuality(A,B) | -male(A,B). [resolve(4,b,5,b)].
% 0.73/1.06 Derived: -male(A,B) | -event(A,B). [resolve(23,a,21,b)].
% 0.73/1.06 24 -eventuality(A,B) | -existent(A,B). [resolve(11,b,12,a)].
% 0.73/1.06 Derived: -existent(A,B) | -event(A,B). [resolve(24,a,21,b)].
% 0.73/1.06 25 -entity(A,B) | thing(A,B) # label(clause26) # label(axiom). [assumption].
% 0.73/1.06 26 -thing(A,B) | singleton(A,B) # label(clause6) # label(axiom). [assumption].
% 0.73/1.06 Derived: -entity(A,B) | singleton(A,B). [resolve(25,b,26,a)].
% 0.73/1.06 27 thing(A,B) | -event(A,B). [resolve(20,a,21,b)].
% 0.73/1.06 Derived: -event(A,B) | singleton(A,B). [resolve(27,a,26,a)].
% 0.73/1.06 28 -action(A,B) | act(A,B) # label(clause13) # label(axiom). [assumption].
% 0.73/1.06 29 -revenge(A,B) | action(A,B) # label(clause12) # label(axiom). [assumption].
% 0.73/1.06 Derived: act(A,B) | -revenge(A,B). [resolve(28,a,29,b)].
% 0.73/1.06 30 -shot(A,B) | action(A,B) # label(clause15) # label(axiom). [assumption].
% 0.73/1.06 Derived: -shot(A,B) | act(A,B). [resolve(30,b,28,a)].
% 0.73/1.06 31 act(A,B) | -revenge(A,B). [resolve(28,a,29,b)].
% 0.73/1.06 32 -act(A,B) | event(A,B) # label(clause14) # label(axiom). [assumption].
% 0.73/1.06 Derived: -revenge(A,B) | event(A,B). [resolve(31,a,32,a)].
% 0.73/1.06 33 -shot(A,B) | act(A,B). [resolve(30,b,28,a)].
% 0.73/1.06 Derived: -shot(A,B) | event(A,B). [resolve(33,b,32,a)].
% 0.73/1.06 34 -set(A,B) | -singleton(A,B). [resolve(7,b,8,a)].
% 0.73/1.06 35 -group(A,B) | set(A,B) # label(clause16) # label(axiom). [assumption].
% 0.73/1.06 Derived: -singleton(A,B) | -group(A,B). [resolve(34,a,35,b)].
% 0.73/1.06 36 -weapon(A,B) | weaponry(A,B) # label(clause21) # label(axiom). [assumption].
% 0.73/1.06 37 -cannon(A,B) | weapon(A,B) # label(clause20) # label(axiom). [assumption].
% 0.73/1.06 Derived: weaponry(A,B) | -cannon(A,B). [resolve(36,a,37,b)].
% 0.73/1.06 38 weaponry(A,B) | -cannon(A,B). [resolve(36,a,37,b)].
% 0.73/1.06 39 -weaponry(A,B) | instrumentality(A,B) # label(clause22) # label(axiom). [assumption].
% 0.73/1.06 Derived: -cannon(A,B) | instrumentality(A,B). [resolve(38,a,39,a)].
% 0.82/1.09 40 -cannon(A,B) | instrumentality(A,B). [resolve(38,a,39,a)].
% 0.82/1.09 41 -instrumentality(A,B) | artifact(A,B) # label(clause23) # label(axiom). [assumption].
% 0.82/1.09 Derived: -cannon(A,B) | artifact(A,B). [resolve(40,b,41,a)].
% 0.82/1.09 42 -cannon(A,B) | artifact(A,B). [resolve(40,b,41,a)].
% 0.82/1.09 43 -artifact(A,B) | object(A,B) # label(clause24) # label(axiom). [assumption].
% 0.82/1.09 Derived: -cannon(A,B) | object(A,B). [resolve(42,b,43,a)].
% 0.82/1.09 44 -cannon(A,B) | object(A,B). [resolve(42,b,43,a)].
% 0.82/1.09 45 -object(A,B) | entity(A,B) # label(clause25) # label(axiom). [assumption].
% 0.82/1.09 46 -object(A,B) | impartial(A,B) # label(clause30) # label(axiom). [assumption].
% 0.82/1.09 47 -object(A,B) | -male(A,B). [resolve(6,b,5,b)].
% 0.82/1.09 48 -object(A,B) | -animate(A,B). [resolve(13,b,14,a)].
% 0.82/1.09 49 -organism(A,B) | -object(A,B). [resolve(15,b,13,b)].
% 0.82/1.09 Derived: -cannon(A,B) | entity(A,B). [resolve(44,b,45,a)].
% 0.82/1.09 Derived: -cannon(A,B) | impartial(A,B). [resolve(44,b,46,a)].
% 0.82/1.09 Derived: -cannon(A,B) | -male(A,B). [resolve(44,b,47,a)].
% 0.82/1.09 Derived: -cannon(A,B) | -animate(A,B). [resolve(44,b,48,a)].
% 0.82/1.09 Derived: -cannon(A,B) | -organism(A,B). [resolve(44,b,49,b)].
% 0.82/1.09 50 -organism(A,B) | entity(A,B) # label(clause34) # label(axiom). [assumption].
% 0.82/1.09 51 -entity(A,B) | specific(A,B) # label(clause27) # label(axiom). [assumption].
% 0.82/1.09 52 -entity(A,B) | existent(A,B) # label(clause28) # label(axiom). [assumption].
% 0.82/1.09 Derived: -organism(A,B) | specific(A,B). [resolve(50,b,51,a)].
% 0.82/1.09 Derived: -organism(A,B) | existent(A,B). [resolve(50,b,52,a)].
% 0.82/1.09 53 -entity(A,B) | singleton(A,B). [resolve(25,b,26,a)].
% 0.82/1.09 Derived: singleton(A,B) | -organism(A,B). [resolve(53,a,50,b)].
% 0.82/1.09 54 -cannon(A,B) | entity(A,B). [resolve(44,b,45,a)].
% 0.82/1.09 Derived: -cannon(A,B) | specific(A,B). [resolve(54,b,51,a)].
% 0.82/1.09 Derived: -cannon(A,B) | existent(A,B). [resolve(54,b,52,a)].
% 0.82/1.09 Derived: -cannon(A,B) | singleton(A,B). [resolve(54,b,53,a)].
% 0.82/1.09 55 -human_person(A,B) | organism(A,B) # label(clause33) # label(axiom). [assumption].
% 0.82/1.09 56 -man(A,B) | human_person(A,B) # label(clause32) # label(axiom). [assumption].
% 0.82/1.09 Derived: organism(A,B) | -man(A,B). [resolve(55,a,56,b)].
% 0.82/1.09 57 -human_person(A,B) | human(A,B) # label(clause37) # label(axiom). [assumption].
% 0.82/1.09 Derived: human(A,B) | -man(A,B). [resolve(57,a,56,b)].
% 0.82/1.09 58 -human_person(A,B) | animate(A,B) # label(clause38) # label(axiom). [assumption].
% 0.82/1.09 Derived: animate(A,B) | -man(A,B). [resolve(58,a,56,b)].
% 0.82/1.09 59 organism(A,B) | -man(A,B). [resolve(55,a,56,b)].
% 0.82/1.09 60 -organism(A,B) | impartial(A,B) # label(clause35) # label(axiom). [assumption].
% 0.82/1.09 61 -cannon(A,B) | -organism(A,B). [resolve(44,b,49,b)].
% 0.82/1.09 62 -organism(A,B) | specific(A,B). [resolve(50,b,51,a)].
% 0.82/1.09 63 -organism(A,B) | existent(A,B). [resolve(50,b,52,a)].
% 0.82/1.09 64 singleton(A,B) | -organism(A,B). [resolve(53,a,50,b)].
% 0.82/1.09 Derived: -man(A,B) | impartial(A,B). [resolve(59,a,60,a)].
% 0.82/1.09 Derived: -man(A,B) | -cannon(A,B). [resolve(59,a,61,b)].
% 0.82/1.09 Derived: -man(A,B) | specific(A,B). [resolve(59,a,62,a)].
% 0.82/1.09 Derived: -man(A,B) | existent(A,B). [resolve(59,a,63,a)].
% 0.82/1.09 Derived: -man(A,B) | singleton(A,B). [resolve(59,a,64,b)].
% 0.82/1.09 65 -cannon(A,B) | existent(A,B). [resolve(54,b,52,a)].
% 0.82/1.09 66 -existent(A,B) | -event(A,B). [resolve(24,a,21,b)].
% 0.82/1.09 Derived: -cannon(A,B) | -event(A,B). [resolve(65,b,66,a)].
% 0.82/1.09 67 -man(A,B) | existent(A,B). [resolve(59,a,63,a)].
% 0.82/1.09 Derived: -man(A,B) | -event(A,B). [resolve(67,b,66,a)].
% 0.82/1.09 68 -singleton(A,B) | -group(A,B). [resolve(34,a,35,b)].
% 0.82/1.09 69 -event(A,B) | singleton(A,B). [resolve(27,a,26,a)].
% 0.82/1.09 Derived: -group(A,B) | -event(A,B). [resolve(68,a,69,b)].
% 0.82/1.09 70 -cannon(A,B) | singleton(A,B). [resolve(54,b,53,a)].
% 0.82/1.09 Derived: -cannon(A,B) | -group(A,B). [resolve(70,b,68,a)].
% 0.82/1.09 71 -man(A,B) | singleton(A,B). [resolve(59,a,64,b)].
% 0.82/1.09 Derived: -man(A,B) | -group(A,B). [resolve(71,b,68,a)].
% 0.82/1.09 72 animate(A,B) | -man(A,B). [resolve(58,a,56,b)].
% 0.82/1.09 73 -cannon(A,B) | -animate(A,B). [resolve(44,b,48,a)].
% 0.82/1.09
% 0.82/1.09 ============================== end predicate elimination =============
% 0.82/1.09
% 0.82/1.09 Auto_denials: (non-Horn, no changes).
% 0.82/1.09
% 0.82/1.09 Term ordering decisions:
% 0.82/1.09 Function symbol KB weights: skc4=1. skc5=1. skc7=1. skc6=1. skf15=1. skf17=1. skf19=1. skf21=1. skf23=1. skf25=1. skf10=1. skCputime limit exceeded (core dumped) (core dumped)
% 300.04/300.32 Prover9 interrupted
% 300.04/300.32 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------