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