TSTP Solution File: NLP005+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP005+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:26 EDT 2022
% Result : Unknown 49.26s 49.52s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP005+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 19:40:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.81/1.09 ============================== Prover9 ===============================
% 0.81/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.09 Process 24969 was started by sandbox on n019.cluster.edu,
% 0.81/1.09 Thu Jun 30 19:40:39 2022
% 0.81/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24816_n019.cluster.edu".
% 0.81/1.09 ============================== end of head ===========================
% 0.81/1.09
% 0.81/1.09 ============================== INPUT =================================
% 0.81/1.09
% 0.81/1.09 % Reading from file /tmp/Prover9_24816_n019.cluster.edu
% 0.81/1.09
% 0.81/1.09 set(prolog_style_variables).
% 0.81/1.09 set(auto2).
% 0.81/1.09 % set(auto2) -> set(auto).
% 0.81/1.09 % set(auto) -> set(auto_inference).
% 0.81/1.09 % set(auto) -> set(auto_setup).
% 0.81/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.09 % set(auto) -> set(auto_limits).
% 0.81/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.09 % set(auto) -> set(auto_denials).
% 0.81/1.09 % set(auto) -> set(auto_process).
% 0.81/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.09 % set(auto2) -> assign(stats, some).
% 0.81/1.09 % set(auto2) -> clear(echo_input).
% 0.81/1.09 % set(auto2) -> set(quiet).
% 0.81/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.09 % set(auto2) -> clear(print_given).
% 0.81/1.09 assign(lrs_ticks,-1).
% 0.81/1.09 assign(sos_limit,10000).
% 0.81/1.09 assign(order,kbo).
% 0.81/1.09 set(lex_order_vars).
% 0.81/1.09 clear(print_given).
% 0.81/1.09
% 0.81/1.09 % formulas(sos). % not echoed (1 formulas)
% 0.81/1.09
% 0.81/1.09 ============================== end of input ==========================
% 0.81/1.09
% 0.81/1.09 % From the command line: assign(max_seconds, 300).
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.09
% 0.81/1.09 % Formulas that are not ordinary clauses:
% 0.81/1.09 1 -(((exists U exists V exists W exists X exists Y exists Z exists X1 exists X3 exists X4 (seat(U) & furniture(U) & front(U) & hollywood(V) & city(V) & event(W) & chevy(X) & car(X) & white(X) & dirty(X) & old(X) & street(Y) & way(Y) & lonely(Y) & barrel(W,X) & down(W,Y) & in(W,V) & Z != X1 & fellow(Z) & man(Z) & young(Z) & fellow(X1) & man(X1) & young(X1) & Z = X3 & in(X3,U) & X1 = X4 & in(X4,U))) -> (exists X5 exists X6 exists X7 exists X8 exists X9 exists X10 exists X11 exists X12 exists X14 exists X15 (seat(X5) & furniture(X5) & front(X5) & seat(X6) & furniture(X6) & front(X6) & hollywood(X7) & city(X7) & event(X8) & street(X9) & way(X9) & lonely(X9) & chevy(X10) & car(X10) & white(X10) & dirty(X10) & old(X10) & barrel(X8,X10) & down(X8,X9) & in(X8,X7) & X11 != X12 & fellow(X11) & man(X11) & young(X11) & fellow(X12) & man(X12) & young(X12) & X11 = X14 & in(X14,X5) & X12 = X15 & in(X15,X6)))) & ((exists X16 exists X17 exists X18 exists X19 exists X20 exists X21 exists X22 exists X23 exists X25 exists X26 (seat(X16) & furniture(X16) & front(X16) & seat(X17) & furniture(X17) & front(X17) & hollywood(X18) & city(X18) & event(X19) & street(X20) & way(X20) & lonely(X20) & chevy(X21) & car(X21) & white(X21) & dirty(X21) & old(X21) & barrel(X19,X21) & down(X19,X20) & in(X19,X18) & X22 != X23 & fellow(X22) & man(X22) & young(X22) & fellow(X23) & man(X23) & young(X23) & X22 = X25 & in(X25,X16) & X23 = X26 & in(X26,X17))) -> (exists X27 exists X28 exists X29 exists X30 exists X31 exists X32 exists X33 exists X35 exists X36 (seat(X27) & furniture(X27) & front(X27) & hollywood(X28) & city(X28) & event(X29) & chevy(X30) & car(X30) & white(X30) & dirty(X30) & old(X30) & street(X31) & way(X31) & lonely(X31) & barrel(X29,X30) & down(X29,X31) & in(X29,X28) & X32 != X33 & fellow(X32) & man(X32) & young(X32) & fellow(X33) & man(X33) & young(X33) & X32 = X35 & in(X35,X27) & X33 = X36 & in(X36,X27))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 49.20/49.51
% 49.20/49.51 ============================== end of process non-clausal formulas ===
% 49.20/49.51
% 49.20/49.51 ============================== PROCESS INITIAL CLAUSES ===============
% 49.20/49.51
% 49.20/49.51 ============================== PREDICATE ELIMINATION =================
% 49.20/49.51
% 49.20/49.51 ============================== end predicate elimination =============
% 49.20/49.51
% 49.20/49.51 Auto_denials: (non-Horn, no changes).
% 49.20/49.51
% 49.20/49.51 Term ordering decisions:
% 49.20/49.51 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. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1.
% 49.20/49.51
% 49.20/49.51 ============================== end of process initial clauses ========
% 49.20/49.51
% 49.20/49.51 ============================== CLAUSES FOR SEARCH ====================
% 49.20/49.51
% 49.20/49.51 ============================== end of clauses for search =============
% 49.20/49.51
% 49.20/49.51 ============================== SEARCH ================================
% 49.20/49.51
% 49.20/49.51 % Starting search at 2.32 seconds.
% 49.20/49.51
% 49.20/49.51 ============================== STATISTICS ============================
% 49.20/49.51
% 49.20/49.51 Given=22934. Generated=764076. Kept=79783. proofs=0.
% 49.20/49.51 Usable=3837. Sos=0. Demods=0. Limbo=0, Disabled=76874. Hints=0.
% 49.20/49.51 Megabytes=97.17.
% 49.20/49.51 User_CPU=48.07, System_CPU=0.44, Wall_clock=49.
% 49.20/49.51
% 49.20/49.51 ============================== end of statistics =====================
% 49.20/49.51
% 49.20/49.51 ============================== end of search =========================
% 49.20/49.51
% 49.20/49.51 SEARCH FAILED
% 49.20/49.51
% 49.20/49.51 Exiting with failure.
% 49.20/49.51
% 49.20/49.51 Process 24969 exit (sos_empty) Thu Jun 30 19:41:28 2022
% 49.20/49.51 Prover9 interrupted
%------------------------------------------------------------------------------