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