TSTP Solution File: NLP139+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP139+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:07:10 EDT 2022
% Result : Timeout 300.07s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NLP139+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jul 1 05:03:23 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.93/1.20 ============================== Prover9 ===============================
% 0.93/1.20 Prover9 (32) version 2009-11A, November 2009.
% 0.93/1.20 Process 29480 was started by sandbox2 on n008.cluster.edu,
% 0.93/1.20 Fri Jul 1 05:03:23 2022
% 0.93/1.20 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29326_n008.cluster.edu".
% 0.93/1.20 ============================== end of head ===========================
% 0.93/1.20
% 0.93/1.20 ============================== INPUT =================================
% 0.93/1.20
% 0.93/1.20 % Reading from file /tmp/Prover9_29326_n008.cluster.edu
% 0.93/1.20
% 0.93/1.20 set(prolog_style_variables).
% 0.93/1.20 set(auto2).
% 0.93/1.20 % set(auto2) -> set(auto).
% 0.93/1.20 % set(auto) -> set(auto_inference).
% 0.93/1.20 % set(auto) -> set(auto_setup).
% 0.93/1.20 % set(auto_setup) -> set(predicate_elim).
% 0.93/1.20 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.93/1.20 % set(auto) -> set(auto_limits).
% 0.93/1.20 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.93/1.20 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.93/1.20 % set(auto) -> set(auto_denials).
% 0.93/1.20 % set(auto) -> set(auto_process).
% 0.93/1.20 % set(auto2) -> assign(new_constants, 1).
% 0.93/1.20 % set(auto2) -> assign(fold_denial_max, 3).
% 0.93/1.20 % set(auto2) -> assign(max_weight, "200.000").
% 0.93/1.20 % set(auto2) -> assign(max_hours, 1).
% 0.93/1.20 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.93/1.20 % set(auto2) -> assign(max_seconds, 0).
% 0.93/1.20 % set(auto2) -> assign(max_minutes, 5).
% 0.93/1.20 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.93/1.20 % set(auto2) -> set(sort_initial_sos).
% 0.93/1.20 % set(auto2) -> assign(sos_limit, -1).
% 0.93/1.20 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.93/1.20 % set(auto2) -> assign(max_megs, 400).
% 0.93/1.20 % set(auto2) -> assign(stats, some).
% 0.93/1.20 % set(auto2) -> clear(echo_input).
% 0.93/1.20 % set(auto2) -> set(quiet).
% 0.93/1.20 % set(auto2) -> clear(print_initial_clauses).
% 0.93/1.20 % set(auto2) -> clear(print_given).
% 0.93/1.20 assign(lrs_ticks,-1).
% 0.93/1.20 assign(sos_limit,10000).
% 0.93/1.20 assign(order,kbo).
% 0.93/1.20 set(lex_order_vars).
% 0.93/1.20 clear(print_given).
% 0.93/1.20
% 0.93/1.20 % formulas(sos). % not echoed (1 formulas)
% 0.93/1.20
% 0.93/1.20 ============================== end of input ==========================
% 0.93/1.20
% 0.93/1.20 % From the command line: assign(max_seconds, 300).
% 0.93/1.20
% 0.93/1.20 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.93/1.20
% 0.93/1.20 % Formulas that are not ordinary clauses:
% 0.93/1.20 1 ---(((exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 (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) & (all X2 (frontseat(U,X2) & member(U,X2,X1) -> (exists X3 exists X4 (state(U,X3) & be(U,X3,X2,X4) & in(U,X4,X2))))) & two(U,X1) & group(U,X1) & (all X5 (member(U,X5,X1) -> fellow(U,X5) & young(U,X5))))))) -> (exists X6 (actual_world(X6) & (exists X7 exists X8 exists X9 exists X10 exists X11 (of(X6,X7,X8) & city(X6,X8) & hollywood_placename(X6,X7) & placename(X6,X7) & chevy(X6,X8) & white(X6,X8) & dirty(X6,X8) & old(X6,X8) & street(X6,X9) & lonely(X6,X9) & event(X6,X10) & agent(X6,X10,X8) & present(X6,X10) & barrel(X6,X10) & down(X6,X10,X9) & in(X6,X10,X8) & (all X12 (member(X6,X12,X11) -> (exists X13 exists X14 (frontseat(X6,X14) & state(X6,X13) & be(X6,X13,X12,X14) & in(X6,X14,X14))))) & two(X6,X11) & group(X6,X11) & (all X15 (member(X6,X15,X11) -> fellow(X6,X15) & young(X6,X15)))))))) & ((exists X6 (actual_world(X6) & (exists X7 exists X8 exists X9 exists X10 exists X11 (of(X6,X7,X8) & city(X6,X8) & hollywood_placename(X6,X7) & placename(X6,X7) & chevy(X6,X8) & white(X6,X8) & dirty(X6,X8) & old(X6,X8) & street(X6,X9) & lonely(X6,X9) & event(X6,X10) & agent(X6,X10,X8) & present(X6,X10) & barrel(X6,X10) & down(X6,X10,X9) & in(X6,X10,X8) & (all X12 (member(X6,X12,X11) -> (exists X13 exists X14 (frontseat(X6,X14) & state(X6,X13) & be(X6,X13,X12,X14) & in(X6,X14,X14))))) & two(X6,X11) & group(X6,X11) & (all X15 (member(X6,X15,X11) -> fellow(X6,X15) & young(X6,X15))))))) -> (exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 (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) & agCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------