TSTP Solution File: NLP119+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP119+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:06:57 EDT 2022
% Result : Unknown 0.96s 1.23s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP119+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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:52:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.04 ============================== Prover9 ===============================
% 0.74/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.04 Process 3260 was started by sandbox on n006.cluster.edu,
% 0.74/1.04 Thu Jun 30 20:52:53 2022
% 0.74/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3107_n006.cluster.edu".
% 0.74/1.04 ============================== end of head ===========================
% 0.74/1.04
% 0.74/1.04 ============================== INPUT =================================
% 0.74/1.04
% 0.74/1.04 % Reading from file /tmp/Prover9_3107_n006.cluster.edu
% 0.74/1.04
% 0.74/1.04 set(prolog_style_variables).
% 0.74/1.04 set(auto2).
% 0.74/1.04 % set(auto2) -> set(auto).
% 0.74/1.04 % set(auto) -> set(auto_inference).
% 0.74/1.04 % set(auto) -> set(auto_setup).
% 0.74/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.04 % set(auto) -> set(auto_limits).
% 0.74/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.04 % set(auto) -> set(auto_denials).
% 0.74/1.04 % set(auto) -> set(auto_process).
% 0.74/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.04 % set(auto2) -> assign(stats, some).
% 0.74/1.04 % set(auto2) -> clear(echo_input).
% 0.74/1.04 % set(auto2) -> set(quiet).
% 0.74/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.04 % set(auto2) -> clear(print_given).
% 0.74/1.04 assign(lrs_ticks,-1).
% 0.74/1.04 assign(sos_limit,10000).
% 0.74/1.04 assign(order,kbo).
% 0.74/1.04 set(lex_order_vars).
% 0.74/1.04 clear(print_given).
% 0.74/1.04
% 0.74/1.04 % formulas(sos). % not echoed (1 formulas)
% 0.74/1.04
% 0.74/1.04 ============================== end of input ==========================
% 0.74/1.04
% 0.74/1.04 % From the command line: assign(max_seconds, 300).
% 0.74/1.04
% 0.74/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.04
% 0.74/1.04 % Formulas that are not ordinary clauses:
% 0.74/1.04 1 ---(((exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z (of(U,W,V) & city(U,V) & hollywood_placename(U,W) & placename(U,W) & chevy(U,X) & white(U,X) & dirty(U,X) & old(U,X) & street(U,Y) & lonely(U,Y) & event(U,Z) & agent(U,Z,X) & present(U,Z) & barrel(U,Z) & down(U,Z,Y) & in(U,Z,V))))) -> (exists X1 (actual_world(X1) & (exists X2 exists X3 exists X4 exists X5 (street(X1,X2) & lonely(X1,X2) & of(X1,X3,X4) & city(X1,X4) & hollywood_placename(X1,X3) & placename(X1,X3) & chevy(X1,X4) & white(X1,X4) & dirty(X1,X4) & old(X1,X4) & event(X1,X5) & agent(X1,X5,X4) & present(X1,X5) & barrel(X1,X5) & down(X1,X5,X2) & in(X1,X5,X4)))))) & ((exists X1 (actual_world(X1) & (exists X2 exists X3 exists X4 exists X5 (street(X1,X2) & lonely(X1,X2) & of(X1,X3,X4) & city(X1,X4) & hollywood_placename(X1,X3) & placename(X1,X3) & chevy(X1,X4) & white(X1,X4) & dirty(X1,X4) & old(X1,X4) & event(X1,X5) & agent(X1,X5,X4) & present(X1,X5) & barrel(X1,X5) & down(X1,X5,X2) & in(X1,X5,X4))))) -> (exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z (of(U,W,V) & city(U,V) & hollywood_placename(U,W) & placename(U,W) & chevy(U,X) & white(U,X) & dirty(U,X) & old(U,X) & street(U,Y) & lonely(U,Y) & event(U,Z) & agent(U,Z,X) & present(U,Z) & barrel(U,Z) & down(U,Z,Y) & in(U,Z,V))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.04
% 0.74/1.04 ============================== end of process non-clausal formulas ===
% 0.74/1.04
% 0.74/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.04
% 0.74/1.04 ============================== PREDICATE ELIMINATION =================
% 0.74/1.04
% 0.74/1.04 ============================== end predicate elimination =============
% 0.74/1.04
% 0.74/1.04 Auto_denials: (non-Horn, no changes).
% 0.74/1.04
% 0.74/1.04 Term ordering decisions:
% 0.74/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1.
% 0.74/1.04
% 0.74/1.04 ============================== end of process initial clauses ========
% 0.74/1.04
% 0.74/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.96/1.23
% 0.96/1.23 ============================== end of clauses for search =============
% 0.96/1.23
% 0.96/1.23 ============================== SEARCH ================================
% 0.96/1.23
% 0.96/1.23 % Starting search at 0.05 seconds.
% 0.96/1.23
% 0.96/1.23 ============================== STATISTICS ============================
% 0.96/1.23
% 0.96/1.23 Given=683. Generated=3882. Kept=1635. proofs=0.
% 0.96/1.23 Usable=388. Sos=0. Demods=0. Limbo=0, Disabled=1571. Hints=0.
% 0.96/1.23 Megabytes=2.17.
% 0.96/1.23 User_CPU=0.22, System_CPU=0.01, Wall_clock=1.
% 0.96/1.23
% 0.96/1.23 ============================== end of statistics =====================
% 0.96/1.23
% 0.96/1.23 ============================== end of search =========================
% 0.96/1.23
% 0.96/1.23 SEARCH FAILED
% 0.96/1.23
% 0.96/1.23 Exiting with failure.
% 0.96/1.23
% 0.96/1.23 Process 3260 exit (sos_empty) Thu Jun 30 20:52:54 2022
% 0.96/1.23 Prover9 interrupted
%------------------------------------------------------------------------------