TSTP Solution File: NLP257-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP257-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:26 EDT 2022
% Result : Unsatisfiable 0.73s 1.07s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP257-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 : Thu Jun 30 17:42:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 687 was started by sandbox2 on n008.cluster.edu,
% 0.42/1.00 Thu Jun 30 17:42:08 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_511_n008.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_511_n008.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (95 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00 1 -state(A,B) | -be(A,B,C,C) | -man(A,C) | -of(A,D,C) | -jules_forename(A,D) | -forename(A,D) | -jules_forename(A,E) | -forename(A,E) | -smoke(F,V6) | -present(F,V6) | -agent(F,V6,V7) | -event(F,V6) | -man(A,V7) | -of(A,E,V7) | -proposition(A,F) | -accessible_world(A,F) | -smoke(V8,V9) | -present(V8,V9) | -agent(V8,V9,skf4(V8)) | -event(V8,V9) | -accessible_world(A,V8) | -proposition(A,V8) | -theme(A,V10,V8) | -event(A,V10) | -present(A,V10) | -think_believe_consider(A,V10) | -man(A,V11) | -agent(A,V10,V11) | -agent(A,V12,V11) | -forename(A,V13) | -vincent_forename(A,V13) | -of(A,V13,V11) | -think_believe_consider(A,V12) | -present(A,V12) | -event(A,V12) | -theme(A,V12,F) | -actual_world(A) # label(clause95) # label(negated_conjecture). [assumption].
% 0.42/1.00 2 actual_world(skc8) # label(clause72) # label(negated_conjecture). [assumption].
% 0.42/1.00 Derived: -state(skc8,A) | -be(skc8,A,B,B) | -man(skc8,B) | -of(skc8,C,B) | -jules_forename(skc8,C) | -forename(skc8,C) | -jules_forename(skc8,D) | -forename(skc8,D) | -smoke(E,F) | -present(E,F) | -agent(E,F,V6) | -event(E,F) | -man(skc8,V6) | -of(skc8,D,V6) | -proposition(skc8,E) | -accessible_world(skc8,E) | -smoke(V7,V8) | -present(V7,V8) | -agent(V7,V8,skf4(V7)) | -event(V7,V8) | -accessible_world(skc8,V7) | -proposition(skc8,V7) | -theme(skc8,V9,V7) | -event(skc8,V9) | -present(skc8,V9) | -think_believe_consider(skc8,V9) | -man(skc8,V10) | -agent(skc8,V9,V10) | -agent(skc8,V11,V10) | -forename(skc8,V12) | -vincent_forename(skc8,V12) | -of(skc8,V12,V10) | -think_believe_consider(skc8,V11) | -present(skc8,V11) | -event(skc8,V11) | -theme(skc8,V11,E). [resolve(1,K,2,a)].
% 0.42/1.00 3 -state(A,B) | -be(A,B,C,C) | -man(A,C) | -of(A,D,C) | -jules_forename(A,D) | -forename(A,D) | -jules_forename(A,E) | -forename(A,E) | -smoke(F,V6) | -present(F,V6) | -agent(F,V6,V7) | -event(F,V6) | -man(A,V7) | -of(A,E,V7) | -proposition(A,F) | -accessible_world(A,F) | -accessible_world(A,V8) | -proposition(A,V8) | -theme(A,V9,V8) | -event(A,V9) | -present(A,V9) | -think_believe_consider(A,V9) | -man(A,V10) | -agent(A,V9,V10) | -agent(A,V11,V10) | -forename(A,V12) | -vincent_forename(A,V12) | -of(A,V12,V10) | -think_believe_consider(A,V11) | -present(A,V11) | -event(A,V11) | -theme(A,V11,F) | -actual_world(A) | man(V8,skf4(V8)) # label(clause94) # label(negated_conjecture). [assumption].
% 0.73/1.07 Derived: -state(skc8,A) | -be(skc8,A,B,B) | -man(skc8,B) | -of(skc8,C,B) | -jules_forename(skc8,C) | -forename(skc8,C) | -jules_forename(skc8,D) | -forename(skc8,D) | -smoke(E,F) | -present(E,F) | -agent(E,F,V6) | -event(E,F) | -man(skc8,V6) | -of(skc8,D,V6) | -proposition(skc8,E) | -accessible_world(skc8,E) | -accessible_world(skc8,V7) | -proposition(skc8,V7) | -theme(skc8,V8,V7) | -event(skc8,V8) | -present(skc8,V8) | -think_believe_consider(skc8,V8) | -man(skc8,V9) | -agent(skc8,V8,V9) | -agent(skc8,V10,V9) | -forename(skc8,V11) | -vincent_forename(skc8,V11) | -of(skc8,V11,V9) | -think_believe_consider(skc8,V10) | -present(skc8,V10) | -event(skc8,V10) | -theme(skc8,V10,E) | man(V7,skf4(V7)). [resolve(3,G,2,a)].
% 0.73/1.07
% 0.73/1.07 ============================== end predicate elimination =============
% 0.73/1.07
% 0.73/1.07 Auto_denials:
% 0.73/1.07 % copying label clause31 to answer in negative clause
% 0.73/1.07 % copying label clause32 to answer in negative clause
% 0.73/1.07 % copying label clause33 to answer in negative clause
% 0.73/1.07 % copying label clause34 to answer in negative clause
% 0.73/1.07 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.73/1.07
% 0.73/1.07 Term ordering decisions:
% 0.73/1.07 Function symbol KB weights: skc8=1. skc12=1. skc13=1. skc10=1. skc11=1. skc14=1. skc15=1. skc9=1. skf2=1. skf4=1.
% 0.73/1.07
% 0.73/1.07 ============================== end of process initial clauses ========
% 0.73/1.07
% 0.73/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.07
% 0.73/1.07 ============================== end of clauses for search =============
% 0.73/1.07
% 0.73/1.07 ============================== SEARCH ================================
% 0.73/1.07
% 0.73/1.07 % Starting search at 0.03 seconds.
% 0.73/1.07
% 0.73/1.07 ============================== PROOF =================================
% 0.73/1.07 % SZS status Unsatisfiable
% 0.73/1.07 % SZS output start Refutation
% 0.73/1.07
% 0.73/1.07 % Proof 1 at 0.09 (+ 0.00) seconds.
% 0.73/1.07 % Length of proof is 35.
% 0.73/1.07 % Level of proof is 4.
% 0.73/1.07 % Maximum clause weight is 120.000.
% 0.73/1.07 % Given clauses 267.
% 0.73/1.07
% 0.73/1.07 1 -state(A,B) | -be(A,B,C,C) | -man(A,C) | -of(A,D,C) | -jules_forename(A,D) | -forename(A,D) | -jules_forename(A,E) | -forename(A,E) | -smoke(F,V6) | -present(F,V6) | -agent(F,V6,V7) | -event(F,V6) | -man(A,V7) | -of(A,E,V7) | -proposition(A,F) | -accessible_world(A,F) | -smoke(V8,V9) | -present(V8,V9) | -agent(V8,V9,skf4(V8)) | -event(V8,V9) | -accessible_world(A,V8) | -proposition(A,V8) | -theme(A,V10,V8) | -event(A,V10) | -present(A,V10) | -think_believe_consider(A,V10) | -man(A,V11) | -agent(A,V10,V11) | -agent(A,V12,V11) | -forename(A,V13) | -vincent_forename(A,V13) | -of(A,V13,V11) | -think_believe_consider(A,V12) | -present(A,V12) | -event(A,V12) | -theme(A,V12,F) | -actual_world(A) # label(clause95) # label(negated_conjecture). [assumption].
% 0.73/1.07 2 actual_world(skc8) # label(clause72) # label(negated_conjecture). [assumption].
% 0.73/1.07 3 -state(A,B) | -be(A,B,C,C) | -man(A,C) | -of(A,D,C) | -jules_forename(A,D) | -forename(A,D) | -jules_forename(A,E) | -forename(A,E) | -smoke(F,V6) | -present(F,V6) | -agent(F,V6,V7) | -event(F,V6) | -man(A,V7) | -of(A,E,V7) | -proposition(A,F) | -accessible_world(A,F) | -accessible_world(A,V8) | -proposition(A,V8) | -theme(A,V9,V8) | -event(A,V9) | -present(A,V9) | -think_believe_consider(A,V9) | -man(A,V10) | -agent(A,V9,V10) | -agent(A,V11,V10) | -forename(A,V12) | -vincent_forename(A,V12) | -of(A,V12,V10) | -think_believe_consider(A,V11) | -present(A,V11) | -event(A,V11) | -theme(A,V11,F) | -actual_world(A) | man(V8,skf4(V8)) # label(clause94) # label(negated_conjecture). [assumption].
% 0.73/1.07 4 man(skc8,skc15) # label(clause73) # label(negated_conjecture). [assumption].
% 0.73/1.07 5 forename(skc8,skc14) # label(clause74) # label(negated_conjecture). [assumption].
% 0.73/1.07 6 vincent_forename(skc8,skc14) # label(clause75) # label(negated_conjecture). [assumption].
% 0.73/1.07 7 event(skc8,skc13) # label(clause76) # label(negated_conjecture). [assumption].
% 0.73/1.07 8 present(skc8,skc13) # label(clause77) # label(negated_conjecture). [assumption].
% 0.73/1.07 9 think_believe_consider(skc8,skc13) # label(clause78) # label(negated_conjecture). [assumption].
% 0.73/1.07 10 jules_forename(skc8,skc11) # label(clause79) # label(negated_conjecture). [assumption].
% 0.73/1.07 11 forename(skc8,skc11) # label(clause80) # label(negated_conjecture). [assumption].
% 0.73/1.07 12 man(skc8,skc10) # label(clause81) # label(negated_conjecture). [assumption].
% 0.73/1.07 13 state(skc8,skc9) # label(clause82) # label(negated_conjecture). [assumption].
% 0.73/1.07 14 accessible_world(skc8,skc12) # label(clause83) # label(negated_conjecture). [assumption].
% 0.73/1.07 15 proposition(skc8,skc12) # label(clause84) # label(negated_conjecture). [assumption].
% 0.73/1.07 16 of(skc8,skc14,skc15) # label(clause85) # label(negated_conjecture). [assumption].
% 0.73/1.07 17 agent(skc8,skc13,skc15) # label(clause86) # label(negated_conjecture). [assumption].
% 0.73/1.07 18 theme(skc8,skc13,skc12) # label(clause87) # label(negated_conjecture). [assumption].
% 0.73/1.07 19 of(skc8,skc11,skc10) # label(clause88) # label(negated_conjecture). [assumption].
% 0.73/1.07 20 be(skc8,skc9,skc10,skc10) # label(clause89) # label(negated_conjecture). [assumption].
% 0.73/1.07 55 -man(skc12,A) | smoke(skc12,skf2(B)) # label(clause90) # label(negated_conjecture). [assumption].
% 0.73/1.07 56 -man(skc12,A) | present(skc12,skf2(B)) # label(clause91) # label(negated_conjecture). [assumption].
% 0.73/1.07 57 -man(skc12,A) | event(skc12,skf2(B)) # label(clause92) # label(negated_conjecture). [assumption].
% 0.73/1.07 59 -man(skc12,A) | agent(skc12,skf2(A),A) # label(clause93) # label(negated_conjecture). [assumption].
% 0.73/1.07 76 -accessible_world(A,B) | -man(A,C) | man(B,C) # label(clause52) # label(axiom). [assumption].
% 0.73/1.07 96 -state(skc8,A) | -be(skc8,A,B,B) | -man(skc8,B) | -of(skc8,C,B) | -jules_forename(skc8,C) | -forename(skc8,C) | -jules_forename(skc8,D) | -forename(skc8,D) | -smoke(E,F) | -present(E,F) | -agent(E,F,V6) | -event(E,F) | -man(skc8,V6) | -of(skc8,D,V6) | -proposition(skc8,E) | -accessible_world(skc8,E) | -smoke(V7,V8) | -present(V7,V8) | -agent(V7,V8,skf4(V7)) | -event(V7,V8) | -accessible_world(skc8,V7) | -proposition(skc8,V7) | -theme(skc8,V9,V7) | -event(skc8,V9) | -present(skc8,V9) | -think_believe_consider(skc8,V9) | -man(skc8,V10) | -agent(skc8,V9,V10) | -agent(skc8,V11,V10) | -forename(skc8,V12) | -vincent_forename(skc8,V12) | -of(skc8,V12,V10) | -think_believe_consider(skc8,V11) | -present(skc8,V11) | -event(skc8,V11) | -theme(skc8,V11,E). [resolve(1,K,2,a)].
% 0.73/1.07 97 -state(skc8,A) | -be(skc8,A,B,B) | -man(skc8,B) | -of(skc8,C,B) | -jules_forename(skc8,C) | -forename(skc8,C) | -jules_forename(skc8,D) | -forename(skc8,D) | -smoke(E,F) | -present(E,F) | -agent(E,F,V6) | -event(E,F) | -man(skc8,V6) | -of(skc8,D,V6) | -proposition(skc8,E) | -accessible_world(skc8,E) | -accessible_world(skc8,V7) | -proposition(skc8,V7) | -theme(skc8,V8,V7) | -event(skc8,V8) | -present(skc8,V8) | -think_believe_consider(skc8,V8) | -man(skc8,V9) | -agent(skc8,V8,V9) | -agent(skc8,V10,V9) | -forename(skc8,V11) | -vincent_forename(skc8,V11) | -of(skc8,V11,V9) | -think_believe_consider(skc8,V10) | -present(skc8,V10) | -event(skc8,V10) | -theme(skc8,V10,E) | man(V7,skf4(V7)). [resolve(3,G,2,a)].
% 0.73/1.07 113 man(skc12,skc10). [hyper(76,a,14,a,b,12,a)].
% 0.73/1.07 160 agent(skc12,skf2(skc10),skc10). [hyper(59,a,113,a)].
% 0.73/1.07 161 event(skc12,skf2(A)). [hyper(57,a,113,a)].
% 0.73/1.07 162 present(skc12,skf2(A)). [hyper(56,a,113,a)].
% 0.73/1.07 163 smoke(skc12,skf2(A)). [hyper(55,a,113,a)].
% 0.73/1.07 261 man(skc12,skf4(skc12)). [hyper(97,a,13,a,b,20,a,c,12,a,d,19,a,e,10,a,f,11,a,g,10,a,h,11,a,i,163,a,j,162,a,k,160,a,l,161,a,m,12,a,n,19,a,o,15,a,p,14,a,q,14,a,r,15,a,s,18,a,t,7,a,u,8,a,v,9,a,w,4,a,x,17,a,y,17,a,z,5,a,A,6,a,B,16,a,C,9,a,D,8,a,E,7,a,F,18,a)].
% 0.73/1.07 262 -agent(skc12,skf2(A),skf4(skc12)). [ur(96,a,13,a,b,20,a,c,12,a,d,19,a,e,10,a,f,11,a,g,10,a,h,11,a,i,163,a,j,162,a,k,160,a,l,161,a,m,12,a,n,19,a,o,15,a,p,14,a,q,163,a,r,162,a,t,161,a,u,14,a,v,15,a,w,18,a,x,7,a,y,8,a,z,9,a,A,4,a,B,17,a,C,17,a,D,5,a,E,6,a,F,16,a,G,9,a,H,8,a,I,7,a,J,18,a)].
% 0.82/1.09 322 $F. [hyper(59,a,261,a),unit_del(a,262)].
% 0.82/1.09
% 0.82/1.09 % SZS output end Refutation
% 0.82/1.09 ============================== end of proof ==========================
% 0.82/1.09
% 0.82/1.09 % Disable descendants (x means already disabled):
% 0.82/1.09 0x 1x 96 262
% 0.82/1.09
% 0.82/1.09 ============================== STATISTICS ============================
% 0.82/1.09
% 0.82/1.09 Given=494. Generated=734. Kept=495. proofs=1.
% 0.82/1.09 Usable=490. Sos=0. Demods=0. Limbo=0, Disabled=102. Hints=0.
% 0.82/1.09 Megabytes=0.42.
% 0.82/1.09 User_CPU=0.11, System_CPU=0.01, Wall_clock=1.
% 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 1 proof.
% 0.82/1.09
% 0.82/1.09 Process 687 exit (sos_empty) Thu Jun 30 17:42:09 2022
% 0.82/1.09 Prover9 interrupted
%------------------------------------------------------------------------------