TSTP Solution File: NLP228+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP228+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:08:07 EDT 2022
% Result : Unknown 0.80s 1.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP228+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.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 : Thu Jun 30 22:59:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.05 ============================== Prover9 ===============================
% 0.42/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.05 Process 18513 was started by sandbox2 on n011.cluster.edu,
% 0.42/1.05 Thu Jun 30 22:59:34 2022
% 0.42/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18360_n011.cluster.edu".
% 0.42/1.05 ============================== end of head ===========================
% 0.42/1.05
% 0.42/1.05 ============================== INPUT =================================
% 0.42/1.05
% 0.42/1.05 % Reading from file /tmp/Prover9_18360_n011.cluster.edu
% 0.42/1.05
% 0.42/1.05 set(prolog_style_variables).
% 0.42/1.05 set(auto2).
% 0.42/1.05 % set(auto2) -> set(auto).
% 0.42/1.05 % set(auto) -> set(auto_inference).
% 0.42/1.05 % set(auto) -> set(auto_setup).
% 0.42/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.05 % set(auto) -> set(auto_limits).
% 0.42/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.05 % set(auto) -> set(auto_denials).
% 0.42/1.05 % set(auto) -> set(auto_process).
% 0.42/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.05 % set(auto2) -> assign(stats, some).
% 0.42/1.05 % set(auto2) -> clear(echo_input).
% 0.42/1.05 % set(auto2) -> set(quiet).
% 0.42/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.05 % set(auto2) -> clear(print_given).
% 0.42/1.05 assign(lrs_ticks,-1).
% 0.42/1.05 assign(sos_limit,10000).
% 0.42/1.05 assign(order,kbo).
% 0.42/1.05 set(lex_order_vars).
% 0.42/1.05 clear(print_given).
% 0.42/1.05
% 0.42/1.05 % formulas(sos). % not echoed (72 formulas)
% 0.42/1.05
% 0.42/1.05 ============================== end of input ==========================
% 0.42/1.05
% 0.42/1.05 % From the command line: assign(max_seconds, 300).
% 0.42/1.05
% 0.42/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.05
% 0.42/1.05 % Formulas that are not ordinary clauses:
% 0.42/1.05 1 (all U all V (vincent_forename(U,V) -> forename(U,V))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 2 (all U all V (proposition(U,V) -> relation(U,V))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 3 (all U all V (smoke(U,V) -> event(U,V))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 4 (all U all V (jules_forename(U,V) -> forename(U,V))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 5 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 6 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 7 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 8 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 9 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 10 (all U all V (relname(U,V) -> relation(U,V))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 11 (all U all V (forename(U,V) -> relname(U,V))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 12 (all U all V (man(U,V) -> male(U,V))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 13 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 14 (all U all V (human_person(U,V) -> human(U,V))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 15 (all U all V (organism(U,V) -> living(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 16 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 17 (all U all V (entity(U,V) -> existent(U,V))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 18 (all U all V (entity(U,V) -> specific(U,V))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 19 (all U all V (entity(U,V) -> thing(U,V))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 20 (all U all V (organism(U,V) -> entity(U,V))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 21 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 22 (all U all V (man(U,V) -> human_person(U,V))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 23 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 24 (all U all V (state(U,V) -> event(U,V))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 25 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 26 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 27 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 28 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 29 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 30 (all U all V (state(U,V) -> eventuality(U,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 31 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 32 (all U all V (nonhuman(U,V) -> -human(U,V))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 33 (all U all V (specific(U,V) -> -general(U,V))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 34 (all U all V (unisex(U,V) -> -male(U,V))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 35 (all U all V all W (accessible_world(V,W) & vincent_forename(V,U) -> vincent_forename(W,U))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 36 (all U all V all W (accessible_world(V,W) & proposition(V,U) -> proposition(W,U))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 37 (all U all V all W all X (accessible_world(W,X) & theme(W,U,V) -> theme(X,U,V))) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 38 (all U all V all W (accessible_world(V,W) & think_believe_consider(V,U) -> think_believe_consider(W,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 39 (all U all V all W all X (accessible_world(W,X) & agent(W,U,V) -> agent(X,U,V))) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 40 (all U all V all W (accessible_world(V,W) & present(V,U) -> present(W,U))) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 41 (all U all V all W (accessible_world(V,W) & smoke(V,U) -> smoke(W,U))) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 42 (all U all V all W all X (accessible_world(W,X) & of(W,U,V) -> of(X,U,V))) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 43 (all U all V all W (accessible_world(V,W) & jules_forename(V,U) -> jules_forename(W,U))) # label(ax43) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 44 (all U all V all W (accessible_world(V,W) & general(V,U) -> general(W,U))) # label(ax44) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 45 (all U all V all W (accessible_world(V,W) & nonhuman(V,U) -> nonhuman(W,U))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 46 (all U all V all W (accessible_world(V,W) & abstraction(V,U) -> abstraction(W,U))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 47 (all U all V all W (accessible_world(V,W) & relation(V,U) -> relation(W,U))) # label(ax47) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 48 (all U all V all W (accessible_world(V,W) & relname(V,U) -> relname(W,U))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.05 49 (all U all V all W (accessible_world(V,W) & forename(V,U) -> forename(W,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 50 (all U all V all W (accessible_world(V,W) & male(V,U) -> male(W,U))) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 51 (all U all V all W (accessible_world(V,W) & animate(V,U) -> animate(W,U))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 52 (all U all V all W (accessible_world(V,W) & human(V,U) -> human(W,U))) # label(ax52) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 53 (all U all V all W (accessible_world(V,W) & living(V,U) -> living(W,U))) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 54 (all U all V all W (accessible_world(V,W) & impartial(V,U) -> impartial(W,U))) # label(ax54) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 55 (all U all V all W (accessible_world(V,W) & existent(V,U) -> existent(W,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 56 (all U all V all W (accessible_world(V,W) & entity(V,U) -> entity(W,U))) # label(ax56) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 57 (all U all V all W (accessible_world(V,W) & organism(V,U) -> organism(W,U))) # label(ax57) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 58 (all U all V all W (accessible_world(V,W) & human_person(V,U) -> human_person(W,U))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 59 (all U all V all W (accessible_world(V,W) & man(V,U) -> man(W,U))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 60 (all U all V all W (accessible_world(V,W) & event(V,U) -> event(W,U))) # label(ax60) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 61 (all U all V all W (accessible_world(V,W) & unisex(V,U) -> unisex(W,U))) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 62 (all U all V all W (accessible_world(V,W) & nonexistent(V,U) -> nonexistent(W,U))) # label(ax62) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 63 (all U all V all W (accessible_world(V,W) & specific(V,U) -> specific(W,U))) # label(ax63) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 64 (all U all V all W (accessible_world(V,W) & singleton(V,U) -> singleton(W,U))) # label(ax64) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 65 (all U all V all W (accessible_world(V,W) & thing(V,U) -> thing(W,U))) # label(ax65) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 66 (all U all V all W (accessible_world(V,W) & eventuality(V,U) -> eventuality(W,U))) # label(ax66) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 67 (all U all V all W (accessible_world(V,W) & state(V,U) -> state(W,U))) # label(ax67) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 68 (all U all V all W all X all Y (accessible_world(X,Y) & be(X,U,V,W) -> be(Y,U,V,W))) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 69 (all U all V all W all X all Y all Z (think_believe_consider(U,V) & proposition(U,Y) & theme(U,V,Y) & agent(U,V,X) & think_believe_consider(U,W) & proposition(U,Z) & theme(U,W,Z) & agent(U,W,X) -> Y = Z)) # label(ax69) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 70 (all U all V all W (entity(U,V) & forename(U,W) & of(U,W,V) -> -(exists X (forename(U,X) & X != W & of(U,X,V))))) # label(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 71 (all U all V all W all X (be(U,V,W,X) -> W = X)) # label(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.06 72 --((exists U (actual_world(U) & (exists V exists W exists X exists Y (of(U,W,V) & man(U,V) & vincent_forename(U,W) & forename(U,W) & proposition(U,Y) & agent(U,X,V) & theme(U,X,Y) & event(U,X) & present(U,X) & think_believe_consider(U,X) & accessible_world(U,Y) & (all Z (man(Y,Z) -> (exists X1 (event(Y,X1) & agent(Y,X1,Z) & present(Y,X1) & smoke(Y,X1))))))))) & -(exists X2 (actual_world(X2) & (exists X3 exists V exists W exists X exists Y exists X4 exists X5 (of(X2,X3,V) & jules_forename(X2,X3) & forename(X2,X3) & of(X2,W,V) & man(X2,V) & vincent_forename(X2,W) & forename(X2,W) & proposition(X2,Y) & agent(X2,X,V) & theme(X2,X,Y) & event(X2,X) & present(X2,X) & think_believe_consider(X2,X) & accessible_world(X2,Y) & (all Z (man(Y,Z) -> (exists X1 (event(Y,X1) & agent(Y,X1,Z) & present(Y,X1) & smoke(Y,X1))))) & man(X2,X4) & state(X2,X5) & be(X2,X5,V,X4)))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.09
% 0.80/1.09 ============================== end of process non-clausal formulas ===
% 0.80/1.09
% 0.80/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.09
% 0.80/1.09 ============================== PREDICATE ELIMINATION =================
% 0.80/1.09 73 -actual_world(A) | -of(A,B,C) | -jules_forename(A,B) | -forename(A,B) | -of(A,D,C) | -man(A,C) | -vincent_forename(A,D) | -forename(A,D) | -proposition(A,E) | -agent(A,F,C) | -theme(A,F,E) | -event(A,F) | -present(A,F) | -think_believe_consider(A,F) | -accessible_world(A,E) | -event(E,V6) | -agent(E,V6,f2(A,B,C,D,F,E,V7,V8)) | -present(E,V6) | -smoke(E,V6) | -man(A,V7) | -state(A,V8) | -be(A,V8,C,V7) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.80/1.09 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.80/1.09 Derived: -of(c1,A,B) | -jules_forename(c1,A) | -forename(c1,A) | -of(c1,C,B) | -man(c1,B) | -vincent_forename(c1,C) | -forename(c1,C) | -proposition(c1,D) | -agent(c1,E,B) | -theme(c1,E,D) | -event(c1,E) | -present(c1,E) | -think_believe_consider(c1,E) | -accessible_world(c1,D) | -event(D,F) | -agent(D,F,f2(c1,A,B,C,E,D,V6,V7)) | -present(D,F) | -smoke(D,F) | -man(c1,V6) | -state(c1,V7) | -be(c1,V7,B,V6). [resolve(73,a,74,a)].
% 0.80/1.09 75 -actual_world(A) | -of(A,B,C) | -jules_forename(A,B) | -forename(A,B) | -of(A,D,C) | -man(A,C) | -vincent_forename(A,D) | -forename(A,D) | -proposition(A,E) | -agent(A,F,C) | -theme(A,F,E) | -event(A,F) | -present(A,F) | -think_believe_consider(A,F) | -accessible_world(A,E) | man(E,f2(A,B,C,D,F,E,V6,V7)) | -man(A,V6) | -state(A,V7) | -be(A,V7,C,V6) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.80/1.09 Derived: -of(c1,A,B) | -jules_forename(c1,A) | -forename(c1,A) | -of(c1,C,B) | -man(c1,B) | -vincent_forename(c1,C) | -forename(c1,C) | -proposition(c1,D) | -agent(c1,E,B) | -theme(c1,E,D) | -event(c1,E) | -present(c1,E) | -think_believe_consider(c1,E) | -accessible_world(c1,D) | man(D,f2(c1,A,B,C,E,D,F,V6)) | -man(c1,F) | -state(c1,V6) | -be(c1,V6,B,F). [resolve(75,a,74,a)].
% 0.80/1.09
% 0.80/1.09 ============================== end predicate elimination =============
% 0.80/1.09
% 0.80/1.09 Auto_denials:
% 0.80/1.09 % copying label ax31 to answer in negative clause
% 0.80/1.09 % copying label ax32 to answer in negative clause
% 0.80/1.09 % copying label ax33 to answer in negative clause
% 0.80/1.09 % copying label ax34 to answer in negative clause
% 0.80/1.09 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.80/1.09
% 0.80/1.09 Term ordering decisions:
% 0.80/1.09
% 0.80/1.09 % Assigning unary symbol f1 kb_weight 0 and highest precedence (43).
% 0.80/1.09 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f2=1. f1=0.
% 0.80/1.09
% 0.80/1.09 ============================== end of process initial clauses ========
% 0.80/1.09
% 0.80/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.09
% 0.80/1.09 ============================== end of clauses for search =============
% 0.80/1.09
% 0.80/1.09 ============================== SEARCH ================================
% 0.80/1.09
% 0.80/1.09 % Starting search at 0.02 seconds.
% 0.80/1.09
% 0.80/1.09 ============================== STATISTICS ============================
% 0.80/1.09
% 0.80/1.09 Given=304. Generated=431. Kept=304. proofs=0.
% 0.80/1.09 Usable=304. Sos=0. Demods=0. Limbo=0, Disabled=91. Hints=0.
% 0.80/1.09 Megabytes=0.39.
% 0.80/1.09 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.80/1.09
% 0.80/1.09 ============================== end of statistics =====================
% 0.80/1.09
% 0.80/1.09 ============================== end of search =========================
% 0.80/1.09
% 0.80/1.09 SEARCH FAILED
% 0.80/1.09
% 0.80/1.09 Exiting with failure.
% 0.80/1.09
% 0.80/1.09 Process 18513 exit (sos_empty) Thu Jun 30 22:59:34 2022
% 0.80/1.09 Prover9 interrupted
%------------------------------------------------------------------------------