0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n135.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 05:48:40 CDT 2018 0.02/0.23 % CPUTime : 0.06/0.43 ============================== Prover9 =============================== 0.06/0.43 Prover9 (32) version 2009-11A, November 2009. 0.06/0.43 Process 30677 was started by sandbox2 on n135.star.cs.uiowa.edu, 0.06/0.43 Sat Jul 14 05:48:40 2018 0.06/0.43 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30645_n135.star.cs.uiowa.edu". 0.06/0.43 ============================== end of head =========================== 0.06/0.43 0.06/0.43 ============================== INPUT ================================= 0.06/0.43 0.06/0.43 % Reading from file /tmp/Prover9_30645_n135.star.cs.uiowa.edu 0.06/0.43 0.06/0.43 set(prolog_style_variables). 0.06/0.43 set(auto2). 0.06/0.43 % set(auto2) -> set(auto). 0.06/0.43 % set(auto) -> set(auto_inference). 0.06/0.43 % set(auto) -> set(auto_setup). 0.06/0.43 % set(auto_setup) -> set(predicate_elim). 0.06/0.43 % set(auto_setup) -> assign(eq_defs, unfold). 0.06/0.43 % set(auto) -> set(auto_limits). 0.06/0.43 % set(auto_limits) -> assign(max_weight, "100.000"). 0.06/0.43 % set(auto_limits) -> assign(sos_limit, 20000). 0.06/0.43 % set(auto) -> set(auto_denials). 0.06/0.43 % set(auto) -> set(auto_process). 0.06/0.43 % set(auto2) -> assign(new_constants, 1). 0.06/0.43 % set(auto2) -> assign(fold_denial_max, 3). 0.06/0.43 % set(auto2) -> assign(max_weight, "200.000"). 0.06/0.43 % set(auto2) -> assign(max_hours, 1). 0.06/0.43 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.06/0.43 % set(auto2) -> assign(max_seconds, 0). 0.06/0.43 % set(auto2) -> assign(max_minutes, 5). 0.06/0.43 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.06/0.43 % set(auto2) -> set(sort_initial_sos). 0.06/0.43 % set(auto2) -> assign(sos_limit, -1). 0.06/0.43 % set(auto2) -> assign(lrs_ticks, 3000). 0.06/0.43 % set(auto2) -> assign(max_megs, 400). 0.06/0.43 % set(auto2) -> assign(stats, some). 0.06/0.43 % set(auto2) -> clear(echo_input). 0.06/0.43 % set(auto2) -> set(quiet). 0.06/0.43 % set(auto2) -> clear(print_initial_clauses). 0.06/0.43 % set(auto2) -> clear(print_given). 0.06/0.43 assign(lrs_ticks,-1). 0.06/0.43 assign(sos_limit,10000). 0.06/0.43 assign(order,kbo). 0.06/0.43 set(lex_order_vars). 0.06/0.43 clear(print_given). 0.06/0.43 0.06/0.43 % formulas(sos). % not echoed (14 formulas) 0.06/0.43 0.06/0.43 ============================== end of input ========================== 0.06/0.43 0.06/0.43 % From the command line: assign(max_seconds, 300). 0.06/0.43 0.06/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.06/0.43 0.06/0.43 % Formulas that are not ordinary clauses: 0.06/0.43 1 (all X all Y (lesseq(Y,X) | lesseq(X,Y))) # label(lesseq_total) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 2 (all X all Y all Z (lesseq(Y,Z) & lesseq(X,Y) -> lesseq(X,Z))) # label(lesseq_trans) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 3 (all X all Y (X = max(X,Y) | -lesseq(Y,X))) # label(max_1) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 4 (all X all Y (lesseq(summation(X),summation(Y)) <-> lesseq(X,Y))) # label(summation_monotone) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 5 (all X all Y (lesseq(Y,X) & lesseq(X,Y) -> X = Y)) # label(lesseq_antisymmetric) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 6 (all X all Y all N (model_ub(X,Y,N) <-> (exists Z (ub(X,Y,Z) & lesseq(summation(Z),N))))) # label(model_ub_3) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 7 (all X all Y all N (lesseq(summation(max(X,Y)),N) <-> model_max(X,Y,N))) # label(model_max_3) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 8 (all X all Y all Z (lesseq(Y,Z) & lesseq(X,Z) <-> ub(X,Y,Z))) # label(ub) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 9 (all X all Y all N ((all Z (model_ub(X,Y,Z) -> lesseq(N,Z))) & model_ub(X,Y,N) <-> minsol_model_ub(X,Y,N))) # label(minsol_model_ub) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 10 (all X all Y all Z (lesseq(X,Y) <-> lesseq(sum(Z,X),sum(Z,Y)))) # label(sum_monotone_1) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 11 (all X all Y (max(X,Y) = Y | -lesseq(X,Y))) # label(max_2) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 12 (all X all Y all N (minsol_model_max(X,Y,N) <-> (all Z (model_max(X,Y,Z) -> lesseq(N,Z))) & model_max(X,Y,N))) # label(minsol_model_max) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 13 (all X lesseq(X,X)) # label(lesseq_ref) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 14 -(all X all Y all Z (minsol_model_max(X,Y,Z) <-> minsol_model_ub(X,Y,Z))) # label(max_is_ub_1) # label(negated_conjecture) # labCputime limit exceeded (core dumped) 300.06/300.30 EOF