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