TSTP Solution File: NLP250+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP250+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:08:22 EDT 2022
% Result : Unknown 0.81s 1.18s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NLP250+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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 : Thu Jun 30 17:11:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/1.08 ============================== Prover9 ===============================
% 0.44/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.08 Process 10288 was started by sandbox2 on n015.cluster.edu,
% 0.44/1.08 Thu Jun 30 17:11:57 2022
% 0.44/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10135_n015.cluster.edu".
% 0.44/1.08 ============================== end of head ===========================
% 0.44/1.08
% 0.44/1.08 ============================== INPUT =================================
% 0.44/1.08
% 0.44/1.08 % Reading from file /tmp/Prover9_10135_n015.cluster.edu
% 0.44/1.08
% 0.44/1.08 set(prolog_style_variables).
% 0.44/1.08 set(auto2).
% 0.44/1.08 % set(auto2) -> set(auto).
% 0.44/1.08 % set(auto) -> set(auto_inference).
% 0.44/1.08 % set(auto) -> set(auto_setup).
% 0.44/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.08 % set(auto) -> set(auto_limits).
% 0.44/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.08 % set(auto) -> set(auto_denials).
% 0.44/1.08 % set(auto) -> set(auto_process).
% 0.44/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.08 % set(auto2) -> assign(stats, some).
% 0.44/1.08 % set(auto2) -> clear(echo_input).
% 0.44/1.08 % set(auto2) -> set(quiet).
% 0.44/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.08 % set(auto2) -> clear(print_given).
% 0.44/1.08 assign(lrs_ticks,-1).
% 0.44/1.08 assign(sos_limit,10000).
% 0.44/1.08 assign(order,kbo).
% 0.44/1.08 set(lex_order_vars).
% 0.44/1.08 clear(print_given).
% 0.44/1.08
% 0.44/1.08 % formulas(sos). % not echoed (72 formulas)
% 0.44/1.08
% 0.44/1.08 ============================== end of input ==========================
% 0.44/1.08
% 0.44/1.08 % From the command line: assign(max_seconds, 300).
% 0.44/1.08
% 0.44/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.08
% 0.44/1.08 % Formulas that are not ordinary clauses:
% 0.44/1.08 1 (all U all V (jules_forename(U,V) -> forename(U,V))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 2 (all U all V (vincent_forename(U,V) -> forename(U,V))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 3 (all U all V (relname(U,V) -> relation(U,V))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 4 (all U all V (forename(U,V) -> relname(U,V))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 5 (all U all V (man(U,V) -> male(U,V))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 6 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax6) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 7 (all U all V (human_person(U,V) -> human(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 8 (all U all V (organism(U,V) -> living(U,V))) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 9 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 10 (all U all V (entity(U,V) -> existent(U,V))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 11 (all U all V (entity(U,V) -> specific(U,V))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 12 (all U all V (entity(U,V) -> thing(U,V))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 13 (all U all V (organism(U,V) -> entity(U,V))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 14 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 15 (all U all V (man(U,V) -> human_person(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 16 (all U all V (state(U,V) -> event(U,V))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 17 (all U all V (state(U,V) -> eventuality(U,V))) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 18 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 19 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 20 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 21 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 22 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 23 (all U all V (proposition(U,V) -> relation(U,V))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 24 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 25 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 26 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 27 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 28 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 29 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 30 (all U all V (smoke(U,V) -> event(U,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 31 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 32 (all U all V (nonhuman(U,V) -> -human(U,V))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 33 (all U all V (specific(U,V) -> -general(U,V))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 34 (all U all V (unisex(U,V) -> -male(U,V))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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.44/1.08 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,X6,X7) & jules_forename(X5,X6) & forename(X5,X6) & of(X5,X8,X7) & man(X5,X7) & vincent_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,X7) & 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,X7) & present(X10,X11) & smoke(X10,X11)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.08
% 0.44/1.08 ============================== end of process non-clausal formulas ===
% 0.44/1.08
% 0.44/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.08
% 0.44/1.08 ============================== PREDICATE ELIMINATION =================
% 0.44/1.08 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) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -forename(A,E) | -proposition(A,V6) | -agent(A,V7,F) | -theme(A,V7,V6) | -event(A,V7) | -present(A,V7) | -think_believe_consider(A,V7) | -accessible_world(A,V6) | -event(V6,V8) | -agent(V6,V8,f2(A,B,C,D,F,E,V7,V6,V9,V10,V11,V12,V13)) | -present(V6,V8) | -smoke(V6,V8) | -of(A,V9,V10) | -man(A,V10) | -jules_forename(A,V9) | -forename(A,V9) | -state(A,V11) | -be(A,V11,V10,V10) | -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,C) | -present(V13,V14) | -smoke(V13,V14) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.44/1.08 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.44/1.08 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) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -forename(c1,D) | -proposition(c1,F) | -agent(c1,V6,E) | -theme(c1,V6,F) | -event(c1,V6) | -present(c1,V6) | -think_believe_consider(c1,V6) | -accessible_world(c1,F) | -event(F,V7) | -agent(F,V7,f2(c1,A,B,C,E,D,V6,F,V8,V9,V10,V11,V12)) | -present(F,V7) | -smoke(F,V7) | -of(c1,V8,V9) | -man(c1,V9) | -jules_forename(c1,V8) | -forename(c1,V8) | -state(c1,V10) | -be(c1,V10,V9,V9) | -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,B) | -present(V12,V13) | -smoke(V12,V13). [resolve(73,a,74,a)].
% 0.44/1.08 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) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -forename(A,E) | -proposition(A,V6) | -agent(A,V7,F) | -theme(A,V7,V6) | -event(A,V7) | -present(A,V7) | -think_believe_consider(A,V7) | -accessible_world(A,V6) | man(V6,f2(A,B,C,D,F,E,V7,V6,V8,V9,V10,V11,V12)) | -of(A,V8,V9) | -man(A,V9) | -jules_forename(A,V8) | -forename(A,V8) | -state(A,V10) | -be(A,V10,V9,V9) | -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,C) | -present(V12,V13) | -smoke(V12,V13) # label(co1) # label(negated_conjecture). [clausify(72)].
% 0.44/1.08 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) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -forename(c1,D) | -proposition(c1,F) | -agent(c1,V6,E) | -theme(c1,V6,F) | -event(c1,V6) | -present(c1,V6) | -think_believe_consider(c1,V6) | -accessible_world(c1,F) | man(F,f2(c1,A,B,C,E,D,V6,F,V7,V8,V9,V10,V11)) | -of(c1,V7,V8) | -man(c1,V8) | -jules_forename(c1,V7) | -forename(c1,V7) | -state(c1,V9) | -be(c1,V9,V8,V8) | -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,B) | -present(V11,V12) | -smoke(V11,V12). [resolve(75,a,74,a)].
% 0.81/1.18
% 0.81/1.18 ============================== end predicate elimination =============
% 0.81/1.18
% 0.81/1.18 Auto_denials:
% 0.81/1.18 % copying label ax31 to answer in negative clause
% 0.81/1.18 % copying label ax32 to answer in negative clause
% 0.81/1.18 % copying label ax33 to answer in negative clause
% 0.81/1.18 % copying label ax34 to answer in negative clause
% 0.81/1.18 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.81/1.18
% 0.81/1.18 Term ordering decisions:
% 0.81/1.18
% 0.81/1.18 % Assigning unary symbol f1 kb_weight 0 and highest precedence (46).
% 0.81/1.18 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.81/1.18
% 0.81/1.18 ============================== end of process initial clauses ========
% 0.81/1.18
% 0.81/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.18
% 0.81/1.18 ============================== end of clauses for search =============
% 0.81/1.18
% 0.81/1.18 ============================== SEARCH ================================
% 0.81/1.18
% 0.81/1.18 % Starting search at 0.02 seconds.
% 0.81/1.18
% 0.81/1.18 ============================== STATISTICS ============================
% 0.81/1.18
% 0.81/1.18 Given=488. Generated=720. Kept=488. proofs=0.
% 0.81/1.18 Usable=488. Sos=0. Demods=0. Limbo=0, Disabled=97. Hints=0.
% 0.81/1.18 Megabytes=0.52.
% 0.81/1.18 User_CPU=0.11, System_CPU=0.01, Wall_clock=1.
% 0.81/1.18
% 0.81/1.18 ============================== end of statistics =====================
% 0.81/1.18
% 0.81/1.18 ============================== end of search =========================
% 0.81/1.18
% 0.81/1.18 SEARCH FAILED
% 0.81/1.18
% 0.81/1.18 Exiting with failure.
% 0.81/1.18
% 0.81/1.18 Process 10288 exit (sos_empty) Thu Jun 30 17:11:58 2022
% 0.81/1.18 Prover9 interrupted
%------------------------------------------------------------------------------