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