TSTP Solution File: NLP025-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP025-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:05:43 EDT 2022
% Result : Unknown 0.71s 1.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP025-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 : n003.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 : Fri Jul 1 08:58:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 25422 was started by sandbox on n003.cluster.edu,
% 0.41/0.99 Fri Jul 1 08:58:08 2022
% 0.41/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25269_n003.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_25269_n003.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (98 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99
% 0.41/0.99 ============================== end of process non-clausal formulas ===
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.99
% 0.41/0.99 ============================== PREDICATE ELIMINATION =================
% 0.41/0.99 1 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | present(A,skf3(A,V8)) # label(clause89) # label(negated_conjecture). [assumption].
% 0.41/0.99 2 actual_world(skc6) # label(clause74) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | present(skc6,skf3(skc6,V7)). [resolve(1,s,2,a)].
% 0.41/0.99 3 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | desire_want(A,skf3(A,V8)) # label(clause90) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | desire_want(skc6,skf3(skc6,V7)). [resolve(3,s,2,a)].
% 0.41/0.99 4 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | accessible_world(A,skf4(C,A)) # label(clause91) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | accessible_world(skc6,skf4(B,skc6)). [resolve(4,s,2,a)].
% 0.41/0.99 5 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | proposition(A,skf4(C,A)) # label(clause92) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | proposition(skc6,skf4(B,skc6)). [resolve(5,s,2,a)].
% 0.41/0.99 6 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | agent(A,skf3(A,C),C) # label(clause93) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | agent(skc6,skf3(skc6,B),B). [resolve(6,s,2,a)].
% 0.41/0.99 7 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | event(skf4(C,V8),skf5(V8,C)) # label(clause94) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | event(skf4(B,V7),skf5(V7,B)). [resolve(7,s,2,a)].
% 0.41/0.99 8 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | dance(skf4(C,V8),skf5(V8,C)) # label(clause95) # label(negated_conjecture). [assumption].
% 0.41/0.99 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | dance(skf4(B,V7),skf5(V7,B)). [resolve(8,s,2,a)].
% 0.71/1.03 9 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | present(skf4(C,V8),skf5(V8,C)) # label(clause96) # label(negated_conjecture). [assumption].
% 0.71/1.03 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | present(skf4(B,V7),skf5(V7,B)). [resolve(9,s,2,a)].
% 0.71/1.03 10 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | agent(skf4(C,V8),skf5(V8,C),C) # label(clause97) # label(negated_conjecture). [assumption].
% 0.71/1.03 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | agent(skf4(B,V7),skf5(V7,B),B). [resolve(10,s,2,a)].
% 0.71/1.03 11 -vincent_forename(A,B) | -forename(A,B) | -man(A,C) | -of(A,B,C) | -present(A,D) | -desire_want(A,D) | -accessible_world(A,E) | -theme(A,D,E) | -proposition(A,E) | -mia_forename(A,F) | -forename(A,F) | -dance(E,V6) | -present(E,V6) | -agent(E,V6,V7) | -event(E,V6) | -agent(A,D,V7) | -woman(A,V7) | -of(A,F,V7) | -actual_world(A) | theme(A,skf3(A,C),skf4(C,A)) # label(clause98) # label(negated_conjecture). [assumption].
% 0.71/1.03 Derived: -vincent_forename(skc6,A) | -forename(skc6,A) | -man(skc6,B) | -of(skc6,A,B) | -present(skc6,C) | -desire_want(skc6,C) | -accessible_world(skc6,D) | -theme(skc6,C,D) | -proposition(skc6,D) | -mia_forename(skc6,E) | -forename(skc6,E) | -dance(D,F) | -present(D,F) | -agent(D,F,V6) | -event(D,F) | -agent(skc6,C,V6) | -woman(skc6,V6) | -of(skc6,E,V6) | theme(skc6,skf3(skc6,B),skf4(B,skc6)). [resolve(11,s,2,a)].
% 0.71/1.03
% 0.71/1.03 ============================== end predicate elimination =============
% 0.71/1.03
% 0.71/1.03 Auto_denials:
% 0.71/1.03 % copying label clause32 to answer in negative clause
% 0.71/1.03 % copying label clause33 to answer in negative clause
% 0.71/1.03 % copying label clause34 to answer in negative clause
% 0.71/1.03 % copying label clause35 to answer in negative clause
% 0.71/1.03 % copying label clause36 to answer in negative clause
% 0.71/1.03 % copying label clause37 to answer in negative clause
% 0.71/1.03 % assign(max_proofs, 6). % (Horn set with more than one neg. clause)
% 0.71/1.03
% 0.71/1.03 Term ordering decisions:
% 0.71/1.03 Function symbol KB weights: skc6=1. skc8=1. skc10=1. skc11=1. skc7=1. skc9=1. skf4=1. skf3=1. skf5=1.
% 0.71/1.03
% 0.71/1.03 ============================== end of process initial clauses ========
% 0.71/1.03
% 0.71/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.03
% 0.71/1.03 ============================== end of clauses for search =============
% 0.71/1.03
% 0.71/1.03 ============================== SEARCH ================================
% 0.71/1.03
% 0.71/1.03 % Starting search at 0.03 seconds.
% 0.71/1.03
% 0.71/1.03 ============================== STATISTICS ============================
% 0.71/1.03
% 0.71/1.03 Given=330. Generated=469. Kept=330. proofs=0.
% 0.71/1.03 Usable=330. Sos=0. Demods=0. Limbo=0, Disabled=108. Hints=0.
% 0.71/1.03 Megabytes=0.36.
% 0.71/1.03 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.71/1.03
% 0.71/1.03 ============================== end of statistics =====================
% 0.71/1.03
% 0.71/1.03 ============================== end of search =========================
% 0.71/1.03
% 0.71/1.03 SEARCH FAILED
% 0.71/1.03
% 0.71/1.03 Exiting with failure.
% 0.71/1.03
% 0.71/1.03 Process 25422 exit (sos_empty) Fri Jul 1 08:58:08 2022
% 0.71/1.03 Prover9 interrupted
%------------------------------------------------------------------------------