TSTP Solution File: NLP034+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP034+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:49 EDT 2022
% Result : Timeout 300.03s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP034+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 30 21:17:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.09 ============================== Prover9 ===============================
% 0.76/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.09 Process 6103 was started by sandbox2 on n011.cluster.edu,
% 0.76/1.09 Thu Jun 30 21:17:49 2022
% 0.76/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5950_n011.cluster.edu".
% 0.76/1.09 ============================== end of head ===========================
% 0.76/1.09
% 0.76/1.09 ============================== INPUT =================================
% 0.76/1.09
% 0.76/1.09 % Reading from file /tmp/Prover9_5950_n011.cluster.edu
% 0.76/1.09
% 0.76/1.09 set(prolog_style_variables).
% 0.76/1.09 set(auto2).
% 0.76/1.09 % set(auto2) -> set(auto).
% 0.76/1.09 % set(auto) -> set(auto_inference).
% 0.76/1.09 % set(auto) -> set(auto_setup).
% 0.76/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.09 % set(auto) -> set(auto_limits).
% 0.76/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.09 % set(auto) -> set(auto_denials).
% 0.76/1.09 % set(auto) -> set(auto_process).
% 0.76/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.09 % set(auto2) -> assign(stats, some).
% 0.76/1.09 % set(auto2) -> clear(echo_input).
% 0.76/1.09 % set(auto2) -> set(quiet).
% 0.76/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.09 % set(auto2) -> clear(print_given).
% 0.76/1.09 assign(lrs_ticks,-1).
% 0.76/1.09 assign(sos_limit,10000).
% 0.76/1.09 assign(order,kbo).
% 0.76/1.09 set(lex_order_vars).
% 0.76/1.09 clear(print_given).
% 0.76/1.09
% 0.76/1.09 % formulas(sos). % not echoed (1 formulas)
% 0.76/1.09
% 0.76/1.09 ============================== end of input ==========================
% 0.76/1.09
% 0.76/1.09 % From the command line: assign(max_seconds, 300).
% 0.76/1.09
% 0.76/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.09
% 0.76/1.09 % Formulas that are not ordinary clauses:
% 0.76/1.09 1 ---(((exists U (actual_world(U) & (exists V ((all W (member(U,W,V) -> (exists X exists Y (table(U,X) & (all Z (member(U,Z,Y) -> (exists X1 (event(U,X1) & agent(U,X1,Z) & present(U,X1) & sit(U,X1) & at(U,X1,X) & with(U,X1,W))))) & three(U,Y) & group(U,Y) & (all X2 (member(U,X2,Y) -> guy(U,X2) & young(U,X2))))))) & group(U,V) & (all X3 (member(U,X3,V) -> hamburger(U,X3))))))) -> (exists X4 (actual_world(X4) & (exists X5 exists X6 (table(X4,X5) & (all X7 (member(X4,X7,X6) -> (exists X8 ((all X9 (member(X4,X9,X8) -> (exists X10 (event(X4,X10) & agent(X4,X10,X7) & present(X4,X10) & sit(X4,X10) & at(X4,X10,X5) & with(X4,X10,X9))))) & group(X4,X8) & (all X11 (member(X4,X11,X8) -> hamburger(X4,X11))))))) & three(X4,X6) & group(X4,X6) & (all X12 (member(X4,X12,X6) -> guy(X4,X12) & young(X4,X12)))))))) & ((exists X4 (actual_world(X4) & (exists X5 exists X6 (table(X4,X5) & (all X7 (member(X4,X7,X6) -> (exists X8 ((all X9 (member(X4,X9,X8) -> (exists X10 (event(X4,X10) & agent(X4,X10,X7) & present(X4,X10) & sit(X4,X10) & at(X4,X10,X5) & with(X4,X10,X9))))) & group(X4,X8) & (all X11 (member(X4,X11,X8) -> hamburger(X4,X11))))))) & three(X4,X6) & group(X4,X6) & (all X12 (member(X4,X12,X6) -> guy(X4,X12) & young(X4,X12))))))) -> (exists U (actual_world(U) & (exists V ((all W (member(U,W,V) -> (exists X exists Y (table(U,X) & (all Z (member(U,Z,Y) -> (exists X1 (event(U,X1) & agent(U,X1,Z) & present(U,X1) & sit(U,X1) & at(U,X1,X) & with(U,X1,W))))) & three(U,Y) & group(U,Y) & (all X2 (member(U,X2,Y) -> guy(U,X2) & young(U,X2))))))) & group(U,V) & (all X3 (member(U,X3,V) -> hamburger(U,X3))))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.09
% 0.76/1.09 ============================== end of process non-clausal formulas ===
% 0.76/1.09
% 0.76/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.09
% 0.76/1.09 ============================== PREDICATE ELIMINATION =================
% 0.76/1.09
% 0.76/1.09 ============================== end predicate elimination ====Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------