TSTP Solution File: NLP252+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP252+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:23 EDT 2022
% Result : Theorem 0.92s 1.19s
% Output : Refutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP252+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n012.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 17:19:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.04 ============================== Prover9 ===============================
% 0.41/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.04 Process 1662 was started by sandbox on n012.cluster.edu,
% 0.41/1.04 Thu Jun 30 17:19:03 2022
% 0.41/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1505_n012.cluster.edu".
% 0.41/1.04 ============================== end of head ===========================
% 0.41/1.04
% 0.41/1.04 ============================== INPUT =================================
% 0.41/1.04
% 0.41/1.04 % Reading from file /tmp/Prover9_1505_n012.cluster.edu
% 0.41/1.04
% 0.41/1.04 set(prolog_style_variables).
% 0.41/1.04 set(auto2).
% 0.41/1.04 % set(auto2) -> set(auto).
% 0.41/1.04 % set(auto) -> set(auto_inference).
% 0.41/1.04 % set(auto) -> set(auto_setup).
% 0.41/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.04 % set(auto) -> set(auto_limits).
% 0.41/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.04 % set(auto) -> set(auto_denials).
% 0.41/1.04 % set(auto) -> set(auto_process).
% 0.41/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.04 % set(auto2) -> assign(stats, some).
% 0.41/1.04 % set(auto2) -> clear(echo_input).
% 0.41/1.04 % set(auto2) -> set(quiet).
% 0.41/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.04 % set(auto2) -> clear(print_given).
% 0.41/1.04 assign(lrs_ticks,-1).
% 0.41/1.04 assign(sos_limit,10000).
% 0.41/1.04 assign(order,kbo).
% 0.41/1.04 set(lex_order_vars).
% 0.41/1.04 clear(print_given).
% 0.41/1.04
% 0.41/1.04 % formulas(sos). % not echoed (72 formulas)
% 0.41/1.04
% 0.41/1.04 ============================== end of input ==========================
% 0.41/1.04
% 0.41/1.04 % From the command line: assign(max_seconds, 300).
% 0.41/1.04
% 0.41/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.04
% 0.41/1.04 % Formulas that are not ordinary clauses:
% 0.41/1.04 1 (all U all V (jules_forename(U,V) -> forename(U,V))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 2 (all U all V (vincent_forename(U,V) -> forename(U,V))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 3 (all U all V (relname(U,V) -> relation(U,V))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 4 (all U all V (forename(U,V) -> relname(U,V))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 5 (all U all V (man(U,V) -> male(U,V))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 6 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 7 (all U all V (human_person(U,V) -> human(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 8 (all U all V (organism(U,V) -> living(U,V))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 9 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 10 (all U all V (entity(U,V) -> existent(U,V))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 11 (all U all V (entity(U,V) -> specific(U,V))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 12 (all U all V (entity(U,V) -> thing(U,V))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 13 (all U all V (organism(U,V) -> entity(U,V))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 14 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 15 (all U all V (man(U,V) -> human_person(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 16 (all U all V (state(U,V) -> event(U,V))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 17 (all U all V (state(U,V) -> eventuality(U,V))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 18 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 19 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 20 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 21 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 22 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 23 (all U all V (proposition(U,V) -> relation(U,V))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 24 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 25 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 26 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 27 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 28 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 29 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 30 (all U all V (smoke(U,V) -> event(U,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 31 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 32 (all U all V (nonhuman(U,V) -> -human(U,V))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 33 (all U all V (specific(U,V) -> -general(U,V))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 34 (all U all V (unisex(U,V) -> -male(U,V))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 35 (all U all V all W (accessible_world(V,W) & jules_forename(V,U) -> jules_forename(W,U))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 36 (all U all V all W all X (accessible_world(W,X) & of(W,U,V) -> of(X,U,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 37 (all U all V all W (accessible_world(V,W) & vincent_forename(V,U) -> vincent_forename(W,U))) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 38 (all U all V all W (accessible_world(V,W) & relname(V,U) -> relname(W,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 39 (all U all V all W (accessible_world(V,W) & forename(V,U) -> forename(W,U))) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 40 (all U all V all W (accessible_world(V,W) & male(V,U) -> male(W,U))) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 41 (all U all V all W (accessible_world(V,W) & animate(V,U) -> animate(W,U))) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 42 (all U all V all W (accessible_world(V,W) & human(V,U) -> human(W,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 43 (all U all V all W (accessible_world(V,W) & living(V,U) -> living(W,U))) # label(ax43) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 44 (all U all V all W (accessible_world(V,W) & impartial(V,U) -> impartial(W,U))) # label(ax44) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 45 (all U all V all W (accessible_world(V,W) & existent(V,U) -> existent(W,U))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 46 (all U all V all W (accessible_world(V,W) & entity(V,U) -> entity(W,U))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 47 (all U all V all W (accessible_world(V,W) & organism(V,U) -> organism(W,U))) # label(ax47) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 48 (all U all V all W (accessible_world(V,W) & human_person(V,U) -> human_person(W,U))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 49 (all U all V all W (accessible_world(V,W) & man(V,U) -> man(W,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 50 (all U all V all W (accessible_world(V,W) & state(V,U) -> state(W,U))) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 51 (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(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 52 (all U all V all W (accessible_world(V,W) & general(V,U) -> general(W,U))) # label(ax52) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 53 (all U all V all W (accessible_world(V,W) & nonhuman(V,U) -> nonhuman(W,U))) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 54 (all U all V all W (accessible_world(V,W) & abstraction(V,U) -> abstraction(W,U))) # label(ax54) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 55 (all U all V all W (accessible_world(V,W) & relation(V,U) -> relation(W,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 56 (all U all V all W (accessible_world(V,W) & proposition(V,U) -> proposition(W,U))) # label(ax56) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 57 (all U all V all W all X (accessible_world(W,X) & theme(W,U,V) -> theme(X,U,V))) # label(ax57) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 58 (all U all V all W (accessible_world(V,W) & think_believe_consider(V,U) -> think_believe_consider(W,U))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 59 (all U all V all W all X (accessible_world(W,X) & agent(W,U,V) -> agent(X,U,V))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 60 (all U all V all W (accessible_world(V,W) & present(V,U) -> present(W,U))) # label(ax60) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 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.41/1.05 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.41/1.05 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.41/1.05 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.41/1.05 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.41/1.05 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.41/1.05 67 (all U all V all W (accessible_world(V,W) & event(V,U) -> event(W,U))) # label(ax67) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 68 (all U all V all W (accessible_world(V,W) & smoke(V,U) -> smoke(W,U))) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 69 (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(ax69) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 70 (all U all V all W all X (be(U,V,W,X) -> W = X)) # label(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 71 (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(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 72 --((exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 exists X2 (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 X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & agent(Y,X4,X3) & present(Y,X4) & smoke(Y,X4))))) & of(U,Z,X1) & man(U,X1) & jules_forename(U,Z) & forename(U,Z) & man(U,X1) & state(U,X2) & be(U,X2,X1,X1))))) & -(exists X5 (actual_world(X5) & (exists X6 exists X7 exists X8 exists V exists W exists X exists Y exists Z exists X1 exists X2 exists X9 exists X10 (of(X5,X7,X6) & man(X5,X6) & vincent_forename(X5,X7) & forename(X5,X7) & of(X5,X8,X1) & jules_forename(X5,X8) & forename(X5,X8) & of(X5,W,V) & man(X5,V) & vincent_forename(X5,W) & forename(X5,W) & proposition(X5,Y) & agent(X5,X,V) & theme(X5,X,Y) & event(X5,X) & present(X5,X) & think_believe_consider(X5,X) & accessible_world(X5,Y) & (all X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & agent(Y,X4,X3) & present(Y,X4) & smoke(Y,X4))))) & of(X5,Z,X1) & man(X5,X1) & jules_forename(X5,Z) & forename(X5,Z) & man(X5,X1) & state(X5,X2) & be(X5,X2,X1,X1) & proposition(X5,X10) & agent(X5,X9,X6) & theme(X5,X9,X10) & event(X5,X9) & present(X5,X9) & think_believe_consider(X5,X9) & accessible_world(X5,X10) & (exists X11 (event(X10,X11) & agent(X10,X11,X1) & present(X10,X11) & smoke(X10,X11)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.05
% 0.41/1.05 ============================== end of process non-clausal formulas ===
% 0.41/1.05
% 0.41/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.05
% 0.41/1.05 ============================== PREDICATE ELIMINATION =================
% 0.41/1.05 73 -actual_world(A) | -of(A,B,C) | -man(A,C) | -vincent_forename(A,B) | -forename(A,B) | -of(A,D,E) | -jules_forename(A,D) | -forename(A,D) | -of(A,F,V6) | -man(A,V6) | -vincent_forename(A,F) | -forename(A,F) | -proposition(A,V7) | -agent(A,V8,V6) | -theme(A,V8,V7) | -event(A,V8) | -present(A,V8) | -think_believe_consider(A,V8) | -accessible_world(A,V7) | -event(V7,V9) | -agent(V7,V9,f2(A,C,B,D,V6,F,V8,V7,V10,E,V11,V12,V13)) | -present(V7,V9) | -smoke(V7,V9) | -of(A,V10,E) | -man(A,E) | -jules_forename(A,V10) | -forename(A,V10) | -state(A,V11) | -be(A,V11,E,E) | -proposition(A,V13) | -agent(A,V12,C) | -theme(A,V12,V13) | -event(A,V12) | -present(A,V12) | -think_believe_consider(A,V12) | -accessible_world(A,V13) | -event(V13,V14) | -agent(V13,V14,E) | -present(V13,V14) | -smoke(V13,V14) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.41/1.05 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.41/1.05 Derived: -of(c1,A,B) | -man(c1,B) | -vincent_forename(c1,A) | -forename(c1,A) | -of(c1,C,D) | -jules_forename(c1,C) | -forename(c1,C) | -of(c1,E,F) | -man(c1,F) | -vincent_forename(c1,E) | -forename(c1,E) | -proposition(c1,V6) | -agent(c1,V7,F) | -theme(c1,V7,V6) | -event(c1,V7) | -present(c1,V7) | -think_believe_consider(c1,V7) | -accessible_world(c1,V6) | -event(V6,V8) | -agent(V6,V8,f2(c1,B,A,C,F,E,V7,V6,V9,D,V10,V11,V12)) | -present(V6,V8) | -smoke(V6,V8) | -of(c1,V9,D) | -man(c1,D) | -jules_forename(c1,V9) | -forename(c1,V9) | -state(c1,V10) | -be(c1,V10,D,D) | -proposition(c1,V12) | -agent(c1,V11,B) | -theme(c1,V11,V12) | -event(c1,V11) | -present(c1,V11) | -think_believe_consider(c1,V11) | -accessible_world(c1,V12) | -event(V12,V13) | -agent(V12,V13,D) | -present(V12,V13) | -smoke(V12,V13). [resolve(73,a,74,a)].
% 0.41/1.05 75 -actual_world(A) | -of(A,B,C) | -man(A,C) | -vincent_forename(A,B) | -forename(A,B) | -of(A,D,E) | -jules_forename(A,D) | -forename(A,D) | -of(A,F,V6) | -man(A,V6) | -vincent_forename(A,F) | -forename(A,F) | -proposition(A,V7) | -agent(A,V8,V6) | -theme(A,V8,V7) | -event(A,V8) | -present(A,V8) | -think_believe_consider(A,V8) | -accessible_world(A,V7) | man(V7,f2(A,C,B,D,V6,F,V8,V7,V9,E,V10,V11,V12)) | -of(A,V9,E) | -man(A,E) | -jules_forename(A,V9) | -forename(A,V9) | -state(A,V10) | -be(A,V10,E,E) | -proposition(A,V12) | -agent(A,V11,C) | -theme(A,V11,V12) | -event(A,V11) | -present(A,V11) | -think_believe_consider(A,V11) | -accessible_world(A,V12) | -event(V12,V13) | -agent(V12,V13,E) | -present(V12,V13) | -smoke(V12,V13) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.41/1.05 Derived: -of(c1,A,B) | -man(c1,B) | -vincent_forename(c1,A) | -forename(c1,A) | -of(c1,C,D) | -jules_forename(c1,C) | -forename(c1,C) | -of(c1,E,F) | -man(c1,F) | -vincent_forename(c1,E) | -forename(c1,E) | -proposition(c1,V6) | -agent(c1,V7,F) | -theme(c1,V7,V6) | -event(c1,V7) | -present(c1,V7) | -think_believe_consider(c1,V7) | -accessible_world(c1,V6) | man(V6,f2(c1,B,A,C,F,E,V7,V6,V8,D,V9,V10,V11)) | -of(c1,V8,D) | -man(c1,D) | -jules_forename(c1,V8) | -forename(c1,V8) | -state(c1,V9) | -be(c1,V9,D,D) | -proposition(c1,V11) | -agent(c1,V10,B) | -theme(c1,V10,V11) | -event(c1,V10) | -present(c1,V10) | -think_believe_consider(c1,V10) | -accessible_world(c1,V11) | -event(V11,V12) | -agent(V11,V12,D) | -present(V11,V12) | -smoke(V11,V12). [resolve(75,a,74,a)].
% 0.92/1.19
% 0.92/1.19 ============================== end predicate elimination =============
% 0.92/1.19
% 0.92/1.19 Auto_denials:
% 0.92/1.19 % copying label ax31 to answer in negative clause
% 0.92/1.19 % copying label ax32 to answer in negative clause
% 0.92/1.19 % copying label ax33 to answer in negative clause
% 0.92/1.19 % copying label ax34 to answer in negative clause
% 0.92/1.19 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.92/1.19
% 0.92/1.19 Term ordering decisions:
% 0.92/1.19
% 0.92/1.19 % Assigning unary symbol f1 kb_weight 0 and highest precedence (46).
% 0.92/1.19 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. f2=1. f1=0.
% 0.92/1.19
% 0.92/1.19 ============================== end of process initial clauses ========
% 0.92/1.19
% 0.92/1.19 ============================== CLAUSES FOR SEARCH ====================
% 0.92/1.19
% 0.92/1.19 ============================== end of clauses for search =============
% 0.92/1.19
% 0.92/1.19 ============================== SEARCH ================================
% 0.92/1.19
% 0.92/1.19 % Starting search at 0.03 seconds.
% 0.92/1.19
% 0.92/1.19 ============================== PROOF =================================
% 0.92/1.19 % SZS status Theorem
% 0.92/1.19 % SZS output start Refutation
% 0.92/1.19
% 0.92/1.19 % Proof 1 at 0.16 (+ 0.00) seconds.
% 0.92/1.19 % Length of proof is 40.
% 0.92/1.19 % Level of proof is 6.
% 0.92/1.19 % Maximum clause weight is 142.000.
% 0.92/1.19 % Given clauses 370.
% 0.92/1.19
% 0.92/1.19 49 (all U all V all W (accessible_world(V,W) & man(V,U) -> man(W,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.92/1.19 72 --((exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 exists X2 (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 X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & agent(Y,X4,X3) & present(Y,X4) & smoke(Y,X4))))) & of(U,Z,X1) & man(U,X1) & jules_forename(U,Z) & forename(U,Z) & man(U,X1) & state(U,X2) & be(U,X2,X1,X1))))) & -(exists X5 (actual_world(X5) & (exists X6 exists X7 exists X8 exists V exists W exists X exists Y exists Z exists X1 exists X2 exists X9 exists X10 (of(X5,X7,X6) & man(X5,X6) & vincent_forename(X5,X7) & forename(X5,X7) & of(X5,X8,X1) & jules_forename(X5,X8) & forename(X5,X8) & of(X5,W,V) & man(X5,V) & vincent_forename(X5,W) & forename(X5,W) & proposition(X5,Y) & agent(X5,X,V) & theme(X5,X,Y) & event(X5,X) & present(X5,X) & think_believe_consider(X5,X) & accessible_world(X5,Y) & (all X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & agent(Y,X4,X3) & present(Y,X4) & smoke(Y,X4))))) & of(X5,Z,X1) & man(X5,X1) & jules_forename(X5,Z) & forename(X5,Z) & man(X5,X1) & state(X5,X2) & be(X5,X2,X1,X1) & proposition(X5,X10) & agent(X5,X9,X6) & theme(X5,X9,X10) & event(X5,X9) & present(X5,X9) & think_believe_consider(X5,X9) & accessible_world(X5,X10) & (exists X11 (event(X10,X11) & agent(X10,X11,X1) & present(X10,X11) & smoke(X10,X11)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.92/1.19 73 -actual_world(A) | -of(A,B,C) | -man(A,C) | -vincent_forename(A,B) | -forename(A,B) | -of(A,D,E) | -jules_forename(A,D) | -forename(A,D) | -of(A,F,V6) | -man(A,V6) | -vincent_forename(A,F) | -forename(A,F) | -proposition(A,V7) | -agent(A,V8,V6) | -theme(A,V8,V7) | -event(A,V8) | -present(A,V8) | -think_believe_consider(A,V8) | -accessible_world(A,V7) | -event(V7,V9) | -agent(V7,V9,f2(A,C,B,D,V6,F,V8,V7,V10,E,V11,V12,V13)) | -present(V7,V9) | -smoke(V7,V9) | -of(A,V10,E) | -man(A,E) | -jules_forename(A,V10) | -forename(A,V10) | -state(A,V11) | -be(A,V11,E,E) | -proposition(A,V13) | -agent(A,V12,C) | -theme(A,V12,V13) | -event(A,V12) | -present(A,V12) | -think_believe_consider(A,V12) | -accessible_world(A,V13) | -event(V13,V14) | -agent(V13,V14,E) | -present(V13,V14) | -smoke(V13,V14) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 75 -actual_world(A) | -of(A,B,C) | -man(A,C) | -vincent_forename(A,B) | -forename(A,B) | -of(A,D,E) | -jules_forename(A,D) | -forename(A,D) | -of(A,F,V6) | -man(A,V6) | -vincent_forename(A,F) | -forename(A,F) | -proposition(A,V7) | -agent(A,V8,V6) | -theme(A,V8,V7) | -event(A,V8) | -present(A,V8) | -think_believe_consider(A,V8) | -accessible_world(A,V7) | man(V7,f2(A,C,B,D,V6,F,V8,V7,V9,E,V10,V11,V12)) | -of(A,V9,E) | -man(A,E) | -jules_forename(A,V9) | -forename(A,V9) | -state(A,V10) | -be(A,V10,E,E) | -proposition(A,V12) | -agent(A,V11,C) | -theme(A,V11,V12) | -event(A,V11) | -present(A,V11) | -think_believe_consider(A,V11) | -accessible_world(A,V12) | -event(V12,V13) | -agent(V12,V13,E) | -present(V12,V13) | -smoke(V12,V13) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 76 man(c1,c2) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 77 vincent_forename(c1,c3) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 78 forename(c1,c3) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 79 proposition(c1,c5) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 80 event(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 81 present(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 82 think_believe_consider(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 83 accessible_world(c1,c5) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 84 man(c1,c7) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 85 jules_forename(c1,c6) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 86 forename(c1,c6) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 87 state(c1,c8) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 88 of(c1,c3,c2) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 89 agent(c1,c4,c2) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 90 theme(c1,c4,c5) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 91 of(c1,c6,c7) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 92 be(c1,c8,c7,c7) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 127 -man(c5,A) | event(c5,f1(A)) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 128 -man(c5,A) | present(c5,f1(A)) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 129 -man(c5,A) | smoke(c5,f1(A)) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 131 -man(c5,A) | agent(c5,f1(A),A) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.92/1.19 145 -accessible_world(A,B) | -man(A,C) | man(B,C) # label(ax49) # label(axiom). [clausify(49)].
% 0.92/1.19 168 -of(c1,A,B) | -man(c1,B) | -vincent_forename(c1,A) | -forename(c1,A) | -of(c1,C,D) | -jules_forename(c1,C) | -forename(c1,C) | -of(c1,E,F) | -man(c1,F) | -vincent_forename(c1,E) | -forename(c1,E) | -proposition(c1,V6) | -agent(c1,V7,F) | -theme(c1,V7,V6) | -event(c1,V7) | -present(c1,V7) | -think_believe_consider(c1,V7) | -accessible_world(c1,V6) | -event(V6,V8) | -agent(V6,V8,f2(c1,B,A,C,F,E,V7,V6,V9,D,V10,V11,V12)) | -present(V6,V8) | -smoke(V6,V8) | -of(c1,V9,D) | -man(c1,D) | -jules_forename(c1,V9) | -forename(c1,V9) | -state(c1,V10) | -be(c1,V10,D,D) | -proposition(c1,V12) | -agent(c1,V11,B) | -theme(c1,V11,V12) | -event(c1,V11) | -present(c1,V11) | -think_believe_consider(c1,V11) | -accessible_world(c1,V12) | -event(V12,V13) | -agent(V12,V13,D) | -present(V12,V13) | -smoke(V12,V13). [resolve(73,a,74,a)].
% 0.92/1.19 169 -of(c1,A,B) | -man(c1,B) | -vincent_forename(c1,A) | -forename(c1,A) | -of(c1,C,D) | -jules_forename(c1,C) | -forename(c1,C) | -of(c1,E,F) | -man(c1,F) | -vincent_forename(c1,E) | -forename(c1,E) | -proposition(c1,V6) | -agent(c1,V7,F) | -theme(c1,V7,V6) | -event(c1,V7) | -present(c1,V7) | -think_believe_consider(c1,V7) | -accessible_world(c1,V6) | man(V6,f2(c1,B,A,C,F,E,V7,V6,V8,D,V9,V10,V11)) | -of(c1,V8,D) | -man(c1,D) | -jules_forename(c1,V8) | -forename(c1,V8) | -state(c1,V9) | -be(c1,V9,D,D) | -proposition(c1,V11) | -agent(c1,V10,B) | -theme(c1,V10,V11) | -event(c1,V10) | -present(c1,V10) | -think_believe_consider(c1,V10) | -accessible_world(c1,V11) | -event(V11,V12) | -agent(V11,V12,D) | -present(V11,V12) | -smoke(V11,V12). [resolve(75,a,74,a)].
% 0.92/1.19 184 man(c5,c7). [hyper(145,a,83,a,b,84,a)].
% 0.95/1.21 236 agent(c5,f1(c7),c7). [hyper(131,a,184,a)].
% 0.95/1.21 237 smoke(c5,f1(c7)). [hyper(129,a,184,a)].
% 0.95/1.21 238 present(c5,f1(c7)). [hyper(128,a,184,a)].
% 0.95/1.21 239 event(c5,f1(c7)). [hyper(127,a,184,a)].
% 0.95/1.21 346 man(c5,f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5)). [hyper(169,a,88,a,b,76,a,c,77,a,d,78,a,e,91,a,f,85,a,g,86,a,h,88,a,i,76,a,j,77,a,k,78,a,l,79,a,m,89,a,n,90,a,o,80,a,p,81,a,q,82,a,r,83,a,t,91,a,u,84,a,v,85,a,w,86,a,x,87,a,y,92,a,z,79,a,A,89,a,B,90,a,C,80,a,D,81,a,E,82,a,F,83,a,G,239,a,H,236,a,I,238,a,J,237,a)].
% 0.95/1.21 426 agent(c5,f1(f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5)),f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5)). [hyper(131,a,346,a)].
% 0.95/1.21 427 smoke(c5,f1(f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(129,a,346,a)].
% 0.95/1.21 428 present(c5,f1(f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(128,a,346,a)].
% 0.95/1.21 429 event(c5,f1(f2(c1,c2,c3,c6,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(127,a,346,a)].
% 0.95/1.21 487 $F. [ur(168,a,88,a,b,76,a,c,77,a,d,78,a,e,91,a,f,85,a,g,86,a,h,88,a,i,76,a,j,77,a,k,78,a,l,79,a,m,89,a,n,90,a,o,80,a,p,81,a,q,82,a,r,83,a,t,426,a,u,428,a,v,427,a,w,91,a,x,84,a,y,85,a,z,86,a,A,87,a,B,92,a,C,79,a,D,89,a,E,90,a,F,80,a,G,81,a,H,82,a,I,83,a,J,239,a,K,236,a,L,238,a,M,237,a),unit_del(a,429)].
% 0.95/1.21
% 0.95/1.21 % SZS output end Refutation
% 0.95/1.21 ============================== end of proof ==========================
% 0.95/1.21
% 0.95/1.21 % Disable descendants (x means already disabled):
% 0.95/1.21 0x 73x 168 348 378 449 467
% 0.95/1.21
% 0.95/1.21 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.18 sec).
% 0.95/1.21
% 0.95/1.21 ============================== STATISTICS ============================
% 0.95/1.21
% 0.95/1.21 Given=571. Generated=840. Kept=573. proofs=1.
% 0.95/1.21 Usable=568. Sos=0. Demods=0. Limbo=0, Disabled=102. Hints=0.
% 0.95/1.21 Megabytes=0.74.
% 0.95/1.21 User_CPU=0.19, System_CPU=0.00, Wall_clock=0.
% 0.95/1.21
% 0.95/1.21 ============================== end of statistics =====================
% 0.95/1.21
% 0.95/1.21 ============================== end of search =========================
% 0.95/1.21
% 0.95/1.21 SEARCH FAILED
% 0.95/1.21
% 0.95/1.21 Exiting with 1 proof.
% 0.95/1.21
% 0.95/1.21 Process 1662 exit (sos_empty) Thu Jun 30 17:19:03 2022
% 0.95/1.21 Prover9 interrupted
%------------------------------------------------------------------------------