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