TSTP Solution File: NLP255-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP255-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:25 EDT 2022
% Result : Unknown 0.74s 1.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NLP255-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.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 : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 30 19:07:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 17410 was started by sandbox on n017.cluster.edu,
% 0.74/1.02 Thu Jun 30 19:07:09 2022
% 0.74/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17256_n017.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_17256_n017.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (95 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.02
% 0.74/1.02 % Formulas that are not ordinary clauses:
% 0.74/1.02
% 0.74/1.02 ============================== end of process non-clausal formulas ===
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.02
% 0.74/1.02 ============================== PREDICATE ELIMINATION =================
% 0.74/1.02 1 -proposition(A,B) | -accessible_world(A,B) | -smoke(B,C) | -present(B,C) | -agent(B,C,skf4(B)) | -event(B,C) | -think_believe_consider(A,D) | -present(A,D) | -event(A,D) | -theme(A,D,B) | -vincent_forename(A,E) | -forename(A,E) | -agent(A,D,F) | -man(A,F) | -of(A,E,F) | -accessible_world(A,V6) | -proposition(A,V6) | -theme(A,V7,V6) | -event(A,V7) | -present(A,V7) | -think_believe_consider(A,V7) | -state(A,V8) | -of(A,V9,V10) | -vincent_forename(A,V9) | -forename(A,V9) | -man(A,V10) | -be(A,V8,V10,V10) | -agent(A,V7,V10) | -smoke(V6,V11) | -present(V6,V11) | -agent(V6,V11,V10) | -event(V6,V11) | -forename(A,V12) | -jules_forename(A,V12) | -of(A,V12,V10) | -actual_world(A) # label(clause95) # label(negated_conjecture). [assumption].
% 0.74/1.02 2 actual_world(skc8) # label(clause72) # label(negated_conjecture). [assumption].
% 0.74/1.02 Derived: -proposition(skc8,A) | -accessible_world(skc8,A) | -smoke(A,B) | -present(A,B) | -agent(A,B,skf4(A)) | -event(A,B) | -think_believe_consider(skc8,C) | -present(skc8,C) | -event(skc8,C) | -theme(skc8,C,A) | -vincent_forename(skc8,D) | -forename(skc8,D) | -agent(skc8,C,E) | -man(skc8,E) | -of(skc8,D,E) | -accessible_world(skc8,F) | -proposition(skc8,F) | -theme(skc8,V6,F) | -event(skc8,V6) | -present(skc8,V6) | -think_believe_consider(skc8,V6) | -state(skc8,V7) | -of(skc8,V8,V9) | -vincent_forename(skc8,V8) | -forename(skc8,V8) | -man(skc8,V9) | -be(skc8,V7,V9,V9) | -agent(skc8,V6,V9) | -smoke(F,V10) | -present(F,V10) | -agent(F,V10,V9) | -event(F,V10) | -forename(skc8,V11) | -jules_forename(skc8,V11) | -of(skc8,V11,V9). [resolve(1,J,2,a)].
% 0.74/1.02 3 -proposition(A,B) | -accessible_world(A,B) | -think_believe_consider(A,C) | -present(A,C) | -event(A,C) | -theme(A,C,B) | -vincent_forename(A,D) | -forename(A,D) | -agent(A,C,E) | -man(A,E) | -of(A,D,E) | -accessible_world(A,F) | -proposition(A,F) | -theme(A,V6,F) | -event(A,V6) | -present(A,V6) | -think_believe_consider(A,V6) | -state(A,V7) | -of(A,V8,V9) | -vincent_forename(A,V8) | -forename(A,V8) | -man(A,V9) | -be(A,V7,V9,V9) | -agent(A,V6,V9) | -smoke(F,V10) | -present(F,V10) | -agent(F,V10,V9) | -event(F,V10) | -forename(A,V11) | -jules_forename(A,V11) | -of(A,V11,V9) | -actual_world(A) | man(B,skf4(B)) # label(clause94) # label(negated_conjecture). [assumption].
% 0.74/1.10 Derived: -proposition(skc8,A) | -accessible_world(skc8,A) | -think_believe_consider(skc8,B) | -present(skc8,B) | -event(skc8,B) | -theme(skc8,B,A) | -vincent_forename(skc8,C) | -forename(skc8,C) | -agent(skc8,B,D) | -man(skc8,D) | -of(skc8,C,D) | -accessible_world(skc8,E) | -proposition(skc8,E) | -theme(skc8,F,E) | -event(skc8,F) | -present(skc8,F) | -think_believe_consider(skc8,F) | -state(skc8,V6) | -of(skc8,V7,V8) | -vincent_forename(skc8,V7) | -forename(skc8,V7) | -man(skc8,V8) | -be(skc8,V6,V8,V8) | -agent(skc8,F,V8) | -smoke(E,V9) | -present(E,V9) | -agent(E,V9,V8) | -event(E,V9) | -forename(skc8,V10) | -jules_forename(skc8,V10) | -of(skc8,V10,V8) | man(A,skf4(A)). [resolve(3,F,2,a)].
% 0.74/1.10
% 0.74/1.10 ============================== end predicate elimination =============
% 0.74/1.10
% 0.74/1.10 Auto_denials:
% 0.74/1.10 % copying label clause31 to answer in negative clause
% 0.74/1.10 % copying label clause32 to answer in negative clause
% 0.74/1.10 % copying label clause33 to answer in negative clause
% 0.74/1.10 % copying label clause34 to answer in negative clause
% 0.74/1.10 % assign(max_proofs, 5). % (Horn set with more than one neg. clause)
% 0.74/1.10
% 0.74/1.10 Term ordering decisions:
% 0.74/1.10 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.74/1.10
% 0.74/1.10 ============================== end of process initial clauses ========
% 0.74/1.10
% 0.74/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.10
% 0.74/1.10 ============================== end of clauses for search =============
% 0.74/1.10
% 0.74/1.10 ============================== SEARCH ================================
% 0.74/1.10
% 0.74/1.10 % Starting search at 0.03 seconds.
% 0.74/1.10
% 0.74/1.10 ============================== STATISTICS ============================
% 0.74/1.10
% 0.74/1.10 Given=451. Generated=669. Kept=451. proofs=0.
% 0.74/1.10 Usable=448. Sos=0. Demods=0. Limbo=0, Disabled=100. Hints=0.
% 0.74/1.10 Megabytes=0.39.
% 0.74/1.10 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.74/1.10
% 0.74/1.10 ============================== end of statistics =====================
% 0.74/1.10
% 0.74/1.10 ============================== end of search =========================
% 0.74/1.10
% 0.74/1.10 SEARCH FAILED
% 0.74/1.10
% 0.74/1.10 Exiting with failure.
% 0.74/1.10
% 0.74/1.10 Process 17410 exit (sos_empty) Thu Jun 30 19:07:09 2022
% 0.74/1.10 Prover9 interrupted
%------------------------------------------------------------------------------