TSTP Solution File: NLP238+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP238+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:12 EDT 2022
% Result : Timeout 300.03s 300.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP238+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 : n004.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 11:22:53 EDT 2022
% 0.14/0.36 % CPUTime :
% 1.01/1.33 ============================== Prover9 ===============================
% 1.01/1.33 Prover9 (32) version 2009-11A, November 2009.
% 1.01/1.33 Process 7163 was started by sandbox2 on n004.cluster.edu,
% 1.01/1.33 Fri Jul 1 11:22:53 2022
% 1.01/1.33 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7010_n004.cluster.edu".
% 1.01/1.33 ============================== end of head ===========================
% 1.01/1.33
% 1.01/1.33 ============================== INPUT =================================
% 1.01/1.33
% 1.01/1.33 % Reading from file /tmp/Prover9_7010_n004.cluster.edu
% 1.01/1.33
% 1.01/1.33 set(prolog_style_variables).
% 1.01/1.33 set(auto2).
% 1.01/1.33 % set(auto2) -> set(auto).
% 1.01/1.33 % set(auto) -> set(auto_inference).
% 1.01/1.33 % set(auto) -> set(auto_setup).
% 1.01/1.33 % set(auto_setup) -> set(predicate_elim).
% 1.01/1.33 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.01/1.33 % set(auto) -> set(auto_limits).
% 1.01/1.33 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.01/1.33 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.01/1.33 % set(auto) -> set(auto_denials).
% 1.01/1.33 % set(auto) -> set(auto_process).
% 1.01/1.33 % set(auto2) -> assign(new_constants, 1).
% 1.01/1.33 % set(auto2) -> assign(fold_denial_max, 3).
% 1.01/1.33 % set(auto2) -> assign(max_weight, "200.000").
% 1.01/1.33 % set(auto2) -> assign(max_hours, 1).
% 1.01/1.33 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.01/1.33 % set(auto2) -> assign(max_seconds, 0).
% 1.01/1.33 % set(auto2) -> assign(max_minutes, 5).
% 1.01/1.33 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.01/1.33 % set(auto2) -> set(sort_initial_sos).
% 1.01/1.33 % set(auto2) -> assign(sos_limit, -1).
% 1.01/1.33 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.01/1.33 % set(auto2) -> assign(max_megs, 400).
% 1.01/1.33 % set(auto2) -> assign(stats, some).
% 1.01/1.33 % set(auto2) -> clear(echo_input).
% 1.01/1.33 % set(auto2) -> set(quiet).
% 1.01/1.33 % set(auto2) -> clear(print_initial_clauses).
% 1.01/1.33 % set(auto2) -> clear(print_given).
% 1.01/1.33 assign(lrs_ticks,-1).
% 1.01/1.33 assign(sos_limit,10000).
% 1.01/1.33 assign(order,kbo).
% 1.01/1.33 set(lex_order_vars).
% 1.01/1.33 clear(print_given).
% 1.01/1.33
% 1.01/1.33 % formulas(sos). % not echoed (1 formulas)
% 1.01/1.33
% 1.01/1.33 ============================== end of input ==========================
% 1.01/1.33
% 1.01/1.33 % From the command line: assign(max_seconds, 300).
% 1.01/1.33
% 1.01/1.33 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.01/1.33
% 1.01/1.33 % Formulas that are not ordinary clauses:
% 1.01/1.33 1 ---(((exists U (actual_world(U) & (exists V exists W exists X exists Y exists Z exists X1 exists X2 exists X3 exists X4 exists X5 exists X6 exists X7 (of(U,W,V) & man(U,V) & jules_forename(U,W) & forename(U,W) & of(U,X,X4) & vincent_forename(U,X) & forename(U,X) & of(U,Z,Y) & man(U,Y) & vincent_forename(U,Z) & forename(U,Z) & proposition(U,X2) & agent(U,X1,Y) & theme(U,X1,X2) & event(U,X1) & present(U,X1) & think_believe_consider(U,X1) & accessible_world(U,X2) & (all X8 (man(X2,X8) -> (exists X9 (event(X2,X9) & agent(X2,X9,X8) & present(X2,X9) & smoke(X2,X9))))) & of(U,X3,X4) & man(U,X4) & jules_forename(U,X3) & forename(U,X3) & man(U,X4) & state(U,X5) & be(U,X5,X4,X4) & proposition(U,X7) & agent(U,X6,X4) & theme(U,X6,X7) & event(U,X6) & present(U,X6) & think_believe_consider(U,X6) & accessible_world(U,X7) & (exists X10 (event(X7,X10) & agent(X7,X10,V) & present(X7,X10) & smoke(X7,X10))))))) -> (exists X11 (actual_world(X11) & (exists X12 exists X13 exists X14 exists X15 exists X16 exists X17 exists X18 exists X19 exists X20 exists X21 exists X22 exists X23 (of(X11,X13,X12) & man(X11,X12) & vincent_forename(X11,X13) & forename(X11,X13) & of(X11,X14,X20) & jules_forename(X11,X14) & forename(X11,X14) & of(X11,X16,X15) & man(X11,X15) & vincent_forename(X11,X16) & forename(X11,X16) & proposition(X11,X18) & agent(X11,X17,X15) & theme(X11,X17,X18) & event(X11,X17) & present(X11,X17) & think_believe_consider(X11,X17) & accessible_world(X11,X18) & (all X24 (man(X18,X24) -> (exists X25 (event(X18,X25) & agent(X18,X25,X24) & present(X18,X25) & smoke(X18,X25))))) & of(X11,X19,X20) & man(X11,X20) & jules_forename(X11,X19) & forename(X11,X19) & man(X11,X20) & state(X11,X21) & be(X11,X21,X20,X20) & proposition(X11,X23) & agent(X11,X22,X12) & theme(X11,X22,X23) & event(X11,X22) & present(X11,X22) & think_believe_consider(X11,X22) & accessible_world(X11,X23) & (exists X26 (event(X23,X26) & agent(X23,X26,X20) & present(X23,X26) & smoke(X23,X26))Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------