0.09/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.32 % Computer : n023.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % DateTime : Thu Jul 2 06:45:43 EDT 2020 0.11/0.33 % CPUTime : 0.82/1.24 ============================== Prover9 =============================== 0.82/1.24 Prover9 (32) version 2009-11A, November 2009. 0.82/1.24 Process 28585 was started by sandbox2 on n023.cluster.edu, 0.82/1.24 Thu Jul 2 06:45:44 2020 0.82/1.24 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_28432_n023.cluster.edu". 0.82/1.24 ============================== end of head =========================== 0.82/1.24 0.82/1.24 ============================== INPUT ================================= 0.82/1.24 0.82/1.24 % Reading from file /tmp/Prover9_28432_n023.cluster.edu 0.82/1.24 0.82/1.24 set(prolog_style_variables). 0.82/1.24 set(auto2). 0.82/1.24 % set(auto2) -> set(auto). 0.82/1.24 % set(auto) -> set(auto_inference). 0.82/1.24 % set(auto) -> set(auto_setup). 0.82/1.24 % set(auto_setup) -> set(predicate_elim). 0.82/1.24 % set(auto_setup) -> assign(eq_defs, unfold). 0.82/1.24 % set(auto) -> set(auto_limits). 0.82/1.24 % set(auto_limits) -> assign(max_weight, "100.000"). 0.82/1.24 % set(auto_limits) -> assign(sos_limit, 20000). 0.82/1.24 % set(auto) -> set(auto_denials). 0.82/1.24 % set(auto) -> set(auto_process). 0.82/1.24 % set(auto2) -> assign(new_constants, 1). 0.82/1.24 % set(auto2) -> assign(fold_denial_max, 3). 0.82/1.24 % set(auto2) -> assign(max_weight, "200.000"). 0.82/1.24 % set(auto2) -> assign(max_hours, 1). 0.82/1.24 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.82/1.24 % set(auto2) -> assign(max_seconds, 0). 0.82/1.24 % set(auto2) -> assign(max_minutes, 5). 0.82/1.24 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.82/1.24 % set(auto2) -> set(sort_initial_sos). 0.82/1.24 % set(auto2) -> assign(sos_limit, -1). 0.82/1.24 % set(auto2) -> assign(lrs_ticks, 3000). 0.82/1.24 % set(auto2) -> assign(max_megs, 400). 0.82/1.24 % set(auto2) -> assign(stats, some). 0.82/1.24 % set(auto2) -> clear(echo_input). 0.82/1.24 % set(auto2) -> set(quiet). 0.82/1.24 % set(auto2) -> clear(print_initial_clauses). 0.82/1.24 % set(auto2) -> clear(print_given). 0.82/1.24 assign(lrs_ticks,-1). 0.82/1.24 assign(sos_limit,10000). 0.82/1.24 assign(order,kbo). 0.82/1.24 set(lex_order_vars). 0.82/1.24 clear(print_given). 0.82/1.24 0.82/1.24 % formulas(sos). % not echoed (72 formulas) 0.82/1.24 0.82/1.24 ============================== end of input ========================== 0.82/1.24 0.82/1.24 % From the command line: assign(max_seconds, 960). 0.82/1.24 0.82/1.24 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.82/1.24 0.82/1.24 % Formulas that are not ordinary clauses: 0.82/1.24 1 (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.82/1.24 2 (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.82/1.24 3 (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.82/1.24 4 (all U all V (eventuality(U,V) -> specific(U,V))) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 5 (all U all V all W (abstraction(V,U) & accessible_world(V,W) -> abstraction(W,U))) # label(ax54) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 6 (all U all V (abstraction(U,V) -> unisex(U,V))) # label(ax18) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 7 (all U all V (man(U,V) -> male(U,V))) # label(ax5) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 8 (all U all V all W (relation(V,U) & accessible_world(V,W) -> relation(W,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 9 (all U all V (abstraction(U,V) -> general(U,V))) # label(ax19) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 10 (all U all V (unisex(U,V) -> -male(U,V))) # label(ax34) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 11 (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.82/1.24 12 (all U all V all W (smoke(V,U) & accessible_world(V,W) -> smoke(W,U))) # label(ax68) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 13 (all U all V (state(U,V) -> event(U,V))) # label(ax16) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 14 (all U all V all W (organism(V,U) & accessible_world(V,W) -> organism(W,U))) # label(ax47) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 15 (all U all V all W (state(V,U) & accessible_world(V,W) -> state(W,U))) # label(ax50) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 16 (all U all V (nonhuman(U,V) -> -human(U,V))) # label(ax32) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 17 (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.82/1.24 18 (all U all V (thing(U,V) -> singleton(U,V))) # label(ax27) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 19 (all U all V (entity(U,V) -> thing(U,V))) # label(ax12) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 20 (all U all V (entity(U,V) -> specific(U,V))) # label(ax11) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 21 (all U all V (jules_forename(U,V) -> forename(U,V))) # label(ax1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 22 (all U all V (organism(U,V) -> living(U,V))) # label(ax8) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 23 (all U all V all W (man(V,U) & accessible_world(V,W) -> man(W,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 24 (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.82/1.24 25 (all U all V (forename(U,V) -> relname(U,V))) # label(ax4) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 26 (all U all V (eventuality(U,V) -> thing(U,V))) # label(ax28) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 27 (all U all V (eventuality(U,V) -> unisex(U,V))) # label(ax24) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 28 (all U all V all W (jules_forename(V,U) & accessible_world(V,W) -> jules_forename(W,U))) # label(ax35) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 29 (all U all V (organism(U,V) -> entity(U,V))) # label(ax13) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 30 (all U all V (relname(U,V) -> relation(U,V))) # label(ax3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 31 (all U all V (abstraction(U,V) -> thing(U,V))) # label(ax21) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 32 (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.82/1.24 33 (all U all V all W (impartial(V,U) & accessible_world(V,W) -> impartial(W,U))) # label(ax44) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 34 (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.82/1.24 35 (all U all V (state(U,V) -> eventuality(U,V))) # label(ax17) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 36 (all U all V (vincent_forename(U,V) -> forename(U,V))) # label(ax2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 37 (all U all V all W (of(U,W,V) & forename(U,W) & entity(U,V) -> -(exists X (W != X & of(U,X,V) & forename(U,X))))) # label(ax69) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 38 (all U all V (organism(U,V) -> impartial(U,V))) # label(ax9) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 39 (all U all V (proposition(U,V) -> relation(U,V))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 40 (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.82/1.24 41 (all U all V (smoke(U,V) -> event(U,V))) # label(ax30) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 42 (all U all V (man(U,V) -> human_person(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 43 (all U all V all W (existent(V,U) & accessible_world(V,W) -> existent(W,U))) # label(ax45) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 44 (all U all V all W (specific(V,U) & accessible_world(V,W) -> specific(W,U))) # label(ax63) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 45 (all U all V all W (eventuality(V,U) & accessible_world(V,W) -> eventuality(W,U))) # label(ax66) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 46 (all U all V all W all X (be(U,V,W,X) -> W = X)) # label(ax70) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 47 (all U all V (abstraction(U,V) -> nonhuman(U,V))) # label(ax20) # label(axiom) # label(non_clause). [assumption]. 0.82/1.24 48 (all U all V all W (human(V,U) & accessible_world(V,W) -> human(W,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 49 (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.86/1.24 50 (all U all V all W (human_person(V,U) & accessible_world(V,W) -> human_person(W,U))) # label(ax48) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 51 (all U all V (human_person(U,V) -> animate(U,V))) # label(ax6) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 52 (all U all V all W all X all Y all Z (think_believe_consider(U,V) & theme(U,V,Y) & think_believe_consider(U,W) & theme(U,W,Z) & agent(U,W,X) & proposition(U,Z) & agent(U,V,X) & proposition(U,Y) -> Y = Z)) # label(ax71) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 53 (all U all V (event(U,V) -> eventuality(U,V))) # label(ax29) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 54 (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.86/1.24 55 (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.86/1.24 56 (all U all V all W (relname(V,U) & accessible_world(V,W) -> relname(W,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 57 (all U all V (eventuality(U,V) -> nonexistent(U,V))) # label(ax25) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 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.86/1.24 59 (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.86/1.24 60 (all U all V all W (vincent_forename(V,U) & accessible_world(V,W) -> vincent_forename(W,U))) # label(ax37) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 61 (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.86/1.24 62 (all U all V (specific(U,V) -> -general(U,V))) # label(ax33) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 63 (all U all V (entity(U,V) -> existent(U,V))) # label(ax10) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 64 (all U all V (relation(U,V) -> abstraction(U,V))) # label(ax22) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 65 (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.86/1.24 66 (all U all V all W (nonhuman(V,U) & accessible_world(V,W) -> nonhuman(W,U))) # label(ax53) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 67 (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.86/1.24 68 (all U all V (existent(U,V) -> -nonexistent(U,V))) # label(ax31) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 69 (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.86/1.24 70 (all U all V (human_person(U,V) -> organism(U,V))) # label(ax14) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 71 (all U all V (human_person(U,V) -> human(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption]. 0.86/1.24 72 --(-(exists 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) & jules_forename(X5,X7) & forename(X5,X8) & of(X5,W,V) & man(X5,V) & vincent_forename(X5,W) & agent(X5,X,V) & think_believe_consider(X5,X) & of(X5,Z,X1) & man(X5,X1) & forename(X5,Z) & man(X5,X1) & state(X5,X2) & theme(X5,X9,X10) & think_believe_consider(X5,X9) & accessible_world(X5,X10) & (exists X11 (event(X10,X11) & smoke(X10,X11) & present(X10,X11) & agent(X10,X11,X6))) & present(X5,X9) & event(X5,X9) & agent(X5,X9,V) & proposition(X5,X10) & be(X5,X2,X1,X1) & jules_forename(X5,Z) & (all X3 (man(Y,X3) -> (exists X4 (smoke(Y,X4) & present(Y,X4) & agent(Y,X4,X3) & event(Y,X4))))) & accessible_world(X5,Y) & present(X5,X) & event(X5,X) & theme(X5,X,Y) & proposition(X5,Y) & forename(X5,W) & vincent_forename(X5,X8) & of(X5,X8,V) & forename(X5,X7))) & actual_world(X5))) & (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) & 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) & forename(U,Z) & man(U,X1) & be(U,X2,X1,X1) & state(U,X2) & jules_forename(U,Z) & man(U,X1) & of(U,Z,X1) & (all X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & smoke(Y,X4) & present(Y,X4) & agent(Y,X4,X3))))) & forename(U,W)))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.86/1.25 0.86/1.25 ============================== end of process non-clausal formulas === 0.86/1.25 0.86/1.25 ============================== PROCESS INITIAL CLAUSES =============== 0.86/1.25 0.86/1.25 ============================== PREDICATE ELIMINATION ================= 0.86/1.25 73 -of(A,B,C) | -man(A,C) | -jules_forename(A,B) | -forename(A,D) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -agent(A,V6,F) | -think_believe_consider(A,V6) | -of(A,V7,V8) | -man(A,V8) | -forename(A,V7) | -state(A,V9) | -theme(A,V10,V11) | -think_believe_consider(A,V10) | -accessible_world(A,V11) | -event(V11,V12) | -smoke(V11,V12) | -present(V11,V12) | -agent(V11,V12,C) | -present(A,V10) | -event(A,V10) | -agent(A,V10,F) | -proposition(A,V11) | -be(A,V9,V8,V8) | -jules_forename(A,V7) | -smoke(V13,V14) | -present(V13,V14) | -agent(V13,V14,f1(A,C,B,D,F,E,V6,V13,V7,V8,V9,V10,V11)) | -event(V13,V14) | -accessible_world(A,V13) | -present(A,V6) | -event(A,V6) | -theme(A,V6,V13) | -proposition(A,V13) | -forename(A,E) | -vincent_forename(A,D) | -of(A,D,F) | -forename(A,B) | -actual_world(A) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.25 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.25 Derived: -of(c1,A,B) | -man(c1,B) | -jules_forename(c1,A) | -forename(c1,C) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -agent(c1,F,E) | -think_believe_consider(c1,F) | -of(c1,V6,V7) | -man(c1,V7) | -forename(c1,V6) | -state(c1,V8) | -theme(c1,V9,V10) | -think_believe_consider(c1,V9) | -accessible_world(c1,V10) | -event(V10,V11) | -smoke(V10,V11) | -present(V10,V11) | -agent(V10,V11,B) | -present(c1,V9) | -event(c1,V9) | -agent(c1,V9,E) | -proposition(c1,V10) | -be(c1,V8,V7,V7) | -jules_forename(c1,V6) | -smoke(V12,V13) | -present(V12,V13) | -agent(V12,V13,f1(c1,B,A,C,E,D,F,V12,V6,V7,V8,V9,V10)) | -event(V12,V13) | -accessible_world(c1,V12) | -present(c1,F) | -event(c1,F) | -theme(c1,F,V12) | -proposition(c1,V12) | -forename(c1,D) | -vincent_forename(c1,C) | -of(c1,C,E) | -forename(c1,A). [resolve(73,N,74,a)]. 0.86/1.25 75 -of(A,B,C) | -man(A,C) | -jules_forename(A,B) | -forename(A,D) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -agent(A,V6,F) | -think_believe_consider(A,V6) | -of(A,V7,V8) | -man(A,V8) | -forename(A,V7) | -state(A,V9) | -theme(A,V10,V11) | -think_believe_consider(A,V10) | -accessible_world(A,V11) | -event(V11,V12) | -smoke(V11,V12) | -present(V11,V12) | -agent(V11,V12,C) | -present(A,V10) | -event(A,V10) | -agent(A,V10,F) | -proposition(A,V11) | -be(A,V9,V8,V8) | -jules_forename(A,V7) | man(V13,f1(A,C,B,D,F,E,V6,V13,V7,V8,V9,V10,V11)) | -accessible_world(A,V13) | -present(A,V6) | -event(A,V6) | -theme(A,V6,V13) | -proposition(A,V13) | -forename(A,E) | -vincent_forename(A,D) | -of(A,D,F) | -forename(A,B) | -actual_world(A) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.25 Derived: -of(c1,A,B) | -man(c1,B) | -jules_forename(c1,A) | -forename(c1,C) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -agent(c1,F,E) | -think_believe_consider(c1,F) | -of(c1,V6,V7) | -man(c1,V7) | -forename(c1,V6) | -state(c1,V8) | -theme(c1,V9,V10) | -think_believe_consider(c1,V9) | -accessible_world(c1,V10) | -event(V10,V11) | -smoke(V10,V11) | -present(V10,V11) | -agent(V10,V11,B) | -present(c1,V9) | -event(c1,V9) | -agent(c1,V9,E) | -proposition(c1,V10) | -be(c1,V8,V7,V7) | -jules_forename(c1,V6) | man(V12,f1(c1,B,A,C,E,D,F,V12,V6,V7,V8,V9,V10)) | -accessible_world(c1,V12) | -present(c1,F) | -event(c1,F) | -theme(c1,F,V12) | -proposition(c1,V12) | -forename(c1,D) | -vincent_forename(c1,C) | -of(c1,C,E) | -forename(c1,A). [resolve(75,K,74,a)]. 0.86/1.48 0.86/1.48 ============================== end predicate elimination ============= 0.86/1.48 0.86/1.48 Auto_denials: 0.86/1.48 % copying label ax34 to answer in negative clause 0.86/1.48 % copying label ax32 to answer in negative clause 0.86/1.48 % copying label ax33 to answer in negative clause 0.86/1.48 % copying label ax31 to answer in negative clause 0.86/1.48 % assign(max_proofs, 5). % (Horn set with more than one neg. clause) 0.86/1.48 0.86/1.48 Term ordering decisions: 0.86/1.48 0.86/1.48 % Assigning unary symbol f2 kb_weight 0 and highest precedence (46). 0.86/1.48 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. f1=1. f2=0. 0.86/1.48 0.86/1.48 ============================== end of process initial clauses ======== 0.86/1.48 0.86/1.48 ============================== CLAUSES FOR SEARCH ==================== 0.86/1.48 0.86/1.48 ============================== end of clauses for search ============= 0.86/1.48 0.86/1.48 ============================== SEARCH ================================ 0.86/1.48 0.86/1.48 % Starting search at 0.02 seconds. 0.86/1.48 0.86/1.48 ============================== PROOF ================================= 0.86/1.48 % SZS status Theorem 0.86/1.48 % SZS output start Refutation 0.86/1.48 0.86/1.48 % Proof 1 at 0.24 (+ 0.00) seconds. 0.86/1.48 % Length of proof is 40. 0.86/1.48 % Level of proof is 6. 0.86/1.48 % Maximum clause weight is 142.000. 0.86/1.48 % Given clauses 365. 0.86/1.48 0.86/1.48 23 (all U all V all W (man(V,U) & accessible_world(V,W) -> man(W,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.86/1.48 72 --(-(exists 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) & jules_forename(X5,X7) & forename(X5,X8) & of(X5,W,V) & man(X5,V) & vincent_forename(X5,W) & agent(X5,X,V) & think_believe_consider(X5,X) & of(X5,Z,X1) & man(X5,X1) & forename(X5,Z) & man(X5,X1) & state(X5,X2) & theme(X5,X9,X10) & think_believe_consider(X5,X9) & accessible_world(X5,X10) & (exists X11 (event(X10,X11) & smoke(X10,X11) & present(X10,X11) & agent(X10,X11,X6))) & present(X5,X9) & event(X5,X9) & agent(X5,X9,V) & proposition(X5,X10) & be(X5,X2,X1,X1) & jules_forename(X5,Z) & (all X3 (man(Y,X3) -> (exists X4 (smoke(Y,X4) & present(Y,X4) & agent(Y,X4,X3) & event(Y,X4))))) & accessible_world(X5,Y) & present(X5,X) & event(X5,X) & theme(X5,X,Y) & proposition(X5,Y) & forename(X5,W) & vincent_forename(X5,X8) & of(X5,X8,V) & forename(X5,X7))) & actual_world(X5))) & (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) & 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) & forename(U,Z) & man(U,X1) & be(U,X2,X1,X1) & state(U,X2) & jules_forename(U,Z) & man(U,X1) & of(U,Z,X1) & (all X3 (man(Y,X3) -> (exists X4 (event(Y,X4) & smoke(Y,X4) & present(Y,X4) & agent(Y,X4,X3))))) & forename(U,W)))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.86/1.48 73 -of(A,B,C) | -man(A,C) | -jules_forename(A,B) | -forename(A,D) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -agent(A,V6,F) | -think_believe_consider(A,V6) | -of(A,V7,V8) | -man(A,V8) | -forename(A,V7) | -state(A,V9) | -theme(A,V10,V11) | -think_believe_consider(A,V10) | -accessible_world(A,V11) | -event(V11,V12) | -smoke(V11,V12) | -present(V11,V12) | -agent(V11,V12,C) | -present(A,V10) | -event(A,V10) | -agent(A,V10,F) | -proposition(A,V11) | -be(A,V9,V8,V8) | -jules_forename(A,V7) | -smoke(V13,V14) | -present(V13,V14) | -agent(V13,V14,f1(A,C,B,D,F,E,V6,V13,V7,V8,V9,V10,V11)) | -event(V13,V14) | -accessible_world(A,V13) | -present(A,V6) | -event(A,V6) | -theme(A,V6,V13) | -proposition(A,V13) | -forename(A,E) | -vincent_forename(A,D) | -of(A,D,F) | -forename(A,B) | -actual_world(A) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 74 actual_world(c1) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 75 -of(A,B,C) | -man(A,C) | -jules_forename(A,B) | -forename(A,D) | -of(A,E,F) | -man(A,F) | -vincent_forename(A,E) | -agent(A,V6,F) | -think_believe_consider(A,V6) | -of(A,V7,V8) | -man(A,V8) | -forename(A,V7) | -state(A,V9) | -theme(A,V10,V11) | -think_believe_consider(A,V10) | -accessible_world(A,V11) | -event(V11,V12) | -smoke(V11,V12) | -present(V11,V12) | -agent(V11,V12,C) | -present(A,V10) | -event(A,V10) | -agent(A,V10,F) | -proposition(A,V11) | -be(A,V9,V8,V8) | -jules_forename(A,V7) | man(V13,f1(A,C,B,D,F,E,V6,V13,V7,V8,V9,V10,V11)) | -accessible_world(A,V13) | -present(A,V6) | -event(A,V6) | -theme(A,V6,V13) | -proposition(A,V13) | -forename(A,E) | -vincent_forename(A,D) | -of(A,D,F) | -forename(A,B) | -actual_world(A) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 76 man(c1,c2) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 77 vincent_forename(c1,c3) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 78 proposition(c1,c5) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 79 event(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 80 present(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 81 think_believe_consider(c1,c4) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 82 accessible_world(c1,c5) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 83 forename(c1,c6) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 84 man(c1,c7) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 85 state(c1,c8) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 86 jules_forename(c1,c6) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 87 forename(c1,c3) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 88 of(c1,c3,c2) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 89 agent(c1,c4,c2) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 90 theme(c1,c4,c5) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 91 of(c1,c6,c7) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 92 be(c1,c8,c7,c7) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 127 -man(c5,A) | event(c5,f2(A)) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 128 -man(c5,A) | smoke(c5,f2(A)) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 129 -man(c5,A) | present(c5,f2(A)) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 131 -man(c5,A) | agent(c5,f2(A),A) # label(co1) # label(negated_conjecture). [clausify(72)]. 0.86/1.48 141 -man(A,B) | -accessible_world(A,C) | man(C,B) # label(ax49) # label(axiom). [clausify(23)]. 0.86/1.48 168 -of(c1,A,B) | -man(c1,B) | -jules_forename(c1,A) | -forename(c1,C) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -agent(c1,F,E) | -think_believe_consider(c1,F) | -of(c1,V6,V7) | -man(c1,V7) | -forename(c1,V6) | -state(c1,V8) | -theme(c1,V9,V10) | -think_believe_consider(c1,V9) | -accessible_world(c1,V10) | -event(V10,V11) | -smoke(V10,V11) | -present(V10,V11) | -agent(V10,V11,B) | -present(c1,V9) | -event(c1,V9) | -agent(c1,V9,E) | -proposition(c1,V10) | -be(c1,V8,V7,V7) | -jules_forename(c1,V6) | -smoke(V12,V13) | -present(V12,V13) | -agent(V12,V13,f1(c1,B,A,C,E,D,F,V12,V6,V7,V8,V9,V10)) | -event(V12,V13) | -accessible_world(c1,V12) | -present(c1,F) | -event(c1,F) | -theme(c1,F,V12) | -proposition(c1,V12) | -forename(c1,D) | -vincent_forename(c1,C) | -of(c1,C,E) | -forename(c1,A). [resolve(73,N,74,a)]. 0.86/1.48 169 -of(c1,A,B) | -man(c1,B) | -jules_forename(c1,A) | -forename(c1,C) | -of(c1,D,E) | -man(c1,E) | -vincent_forename(c1,D) | -agent(c1,F,E) | -think_believe_consider(c1,F) | -of(c1,V6,V7) | -man(c1,V7) | -forename(c1,V6) | -state(c1,V8) | -theme(c1,V9,V10) | -think_believe_consider(c1,V9) | -accessible_world(c1,V10) | -event(V10,V11) | -smoke(V10,V11) | -present(V10,V11) | -agent(V10,V11,B) | -present(c1,V9) | -event(c1,V9) | -agent(c1,V9,E) | -proposition(c1,V10) | -be(c1,V8,V7,V7) | -jules_forename(c1,V6) | man(V12,f1(c1,B,A,C,E,D,F,V12,V6,V7,V8,V9,V10)) | -accessible_world(c1,V12) | -present(c1,F) | -event(c1,F) | -theme(c1,F,V12) | -proposition(c1,V12) | -forename(c1,D) | -vincent_forename(c1,C) | -of(c1,C,E) | -forename(c1,A). [resolve(75,K,74,a)]. 0.86/1.51 182 man(c5,c7). [hyper(141,a,84,a,b,82,a)]. 0.86/1.51 239 agent(c5,f2(c7),c7). [hyper(131,a,182,a)]. 0.86/1.51 240 present(c5,f2(c7)). [hyper(129,a,182,a)]. 0.86/1.51 241 smoke(c5,f2(c7)). [hyper(128,a,182,a)]. 0.86/1.51 242 event(c5,f2(c7)). [hyper(127,a,182,a)]. 0.86/1.51 349 man(c5,f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5)). [hyper(169,a,91,a,b,84,a,c,86,a,d,87,a,e,88,a,f,76,a,g,77,a,h,89,a,i,81,a,j,91,a,k,84,a,l,83,a,m,85,a,n,90,a,o,81,a,p,82,a,q,242,a,r,241,a,s,240,a,t,239,a,u,80,a,v,79,a,w,89,a,x,78,a,y,92,a,z,86,a,B,82,a,C,80,a,D,79,a,E,90,a,F,78,a,G,87,a,H,77,a,I,88,a,J,83,a)]. 0.86/1.51 419 agent(c5,f2(f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5)),f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5)). [hyper(131,a,349,a)]. 0.86/1.51 420 present(c5,f2(f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(129,a,349,a)]. 0.86/1.51 421 smoke(c5,f2(f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(128,a,349,a)]. 0.86/1.51 422 event(c5,f2(f1(c1,c7,c6,c3,c2,c3,c4,c5,c6,c7,c8,c4,c5))). [hyper(127,a,349,a)]. 0.86/1.51 484 $F. [ur(168,a,91,a,b,84,a,c,86,a,d,87,a,e,88,a,f,76,a,g,77,a,h,89,a,i,81,a,j,91,a,k,84,a,l,83,a,m,85,a,n,90,a,o,81,a,p,82,a,q,242,a,r,241,a,s,240,a,t,239,a,u,80,a,v,79,a,w,89,a,x,78,a,y,92,a,z,86,a,A,421,a,B,420,a,C,419,a,E,82,a,F,80,a,G,79,a,H,90,a,I,78,a,J,87,a,K,77,a,L,88,a,M,83,a),unit_del(a,422)]. 0.86/1.51 0.86/1.51 % SZS output end Refutation 0.86/1.51 ============================== end of proof ========================== 0.86/1.51 0.86/1.51 % Disable descendants (x means already disabled): 0.86/1.51 0x 73x 168 351 383 445 464 0.86/1.51 0.86/1.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.28 sec). 0.86/1.51 0.86/1.51 ============================== STATISTICS ============================ 0.86/1.51 0.86/1.51 Given=571. Generated=840. Kept=573. proofs=1. 0.86/1.51 Usable=568. Sos=0. Demods=0. Limbo=0, Disabled=102. Hints=0. 0.86/1.51 Megabytes=0.74. 0.86/1.51 User_CPU=0.28, System_CPU=0.00, Wall_clock=1. 0.86/1.51 0.86/1.51 ============================== end of statistics ===================== 0.86/1.51 0.86/1.51 ============================== end of search ========================= 0.86/1.51 0.86/1.51 SEARCH FAILED 0.86/1.51 0.86/1.51 Exiting with 1 proof. 0.86/1.51 0.86/1.51 Process 28585 exit (sos_empty) Thu Jul 2 06:45:45 2020 0.86/1.51 Prover9 interrupted 0.86/1.52 EOF