0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.31 % Computer : n029.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1440 0.10/0.31 % WCLimit : 180 0.10/0.31 % DateTime : Mon Jul 3 07:43:12 EDT 2023 0.16/0.31 % CPUTime : 0.68/0.99 ============================== Prover9 =============================== 0.68/0.99 Prover9 (32) version 2009-11A, November 2009. 0.68/0.99 Process 12825 was started by sandbox on n029.cluster.edu, 0.68/0.99 Mon Jul 3 07:43:13 2023 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_12672_n029.cluster.edu". 0.68/0.99 ============================== end of head =========================== 0.68/0.99 0.68/0.99 ============================== INPUT ================================= 0.68/0.99 0.68/0.99 % Reading from file /tmp/Prover9_12672_n029.cluster.edu 0.68/0.99 0.68/0.99 set(prolog_style_variables). 0.68/0.99 set(auto2). 0.68/0.99 % set(auto2) -> set(auto). 0.68/0.99 % set(auto) -> set(auto_inference). 0.68/0.99 % set(auto) -> set(auto_setup). 0.68/0.99 % set(auto_setup) -> set(predicate_elim). 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.68/0.99 % set(auto) -> set(auto_limits). 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.68/0.99 % set(auto) -> set(auto_denials). 0.68/0.99 % set(auto) -> set(auto_process). 0.68/0.99 % set(auto2) -> assign(new_constants, 1). 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.68/0.99 % set(auto2) -> assign(max_hours, 1). 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.68/0.99 % set(auto2) -> assign(max_seconds, 0). 0.68/0.99 % set(auto2) -> assign(max_minutes, 5). 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.68/0.99 % set(auto2) -> set(sort_initial_sos). 0.68/0.99 % set(auto2) -> assign(sos_limit, -1). 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.68/0.99 % set(auto2) -> assign(max_megs, 400). 0.68/0.99 % set(auto2) -> assign(stats, some). 0.68/0.99 % set(auto2) -> clear(echo_input). 0.68/0.99 % set(auto2) -> set(quiet). 0.68/0.99 % set(auto2) -> clear(print_initial_clauses). 0.68/0.99 % set(auto2) -> clear(print_given). 0.68/0.99 assign(lrs_ticks,-1). 0.68/0.99 assign(sos_limit,10000). 0.68/0.99 assign(order,kbo). 0.68/0.99 set(lex_order_vars). 0.68/0.99 clear(print_given). 0.68/0.99 0.68/0.99 % formulas(sos). % not echoed (13 formulas) 0.68/0.99 0.68/0.99 ============================== end of input ========================== 0.68/0.99 0.68/0.99 % From the command line: assign(max_seconds, 1440). 0.68/0.99 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.68/0.99 0.68/0.99 % Formulas that are not ordinary clauses: 0.68/0.99 1 (all I all J plus(J,I) = plus(I,J)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 2 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 3 (all I1 all J1 all I2 all J2 (int_leq(I2,J2) & int_less(I1,J1) -> int_leq(plus(I1,I2),plus(J1,J2)))) # label(plus_and_order1) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 4 (all I all J (int_leq(I,J) <-> J = I | int_less(I,J))) # label(int_leq) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 5 (all I (int_less(int_zero,I) <-> int_leq(int_one,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 6 (all I all J (int_less(I,J) <-> (exists K (plus(I,K) = J & int_less(int_zero,K))))) # label(plus_and_inverse) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 7 (all I all J (int_leq(J,I) | int_less(I,J))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 8 (all I all J all K (int_less(I,J) & int_less(J,K) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 9 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (plus(I,C) = J & int_leq(int_zero,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> lu(K,plus(K,C)) = a(K,plus(K,C)))))) & (all C (I = plus(J,C) & int_less(int_zero,C) -> (all K (int_leq(K,J) & int_leq(int_one,K) -> a(plus(K,C),K) = real_zero)))))) # label(qiu) # label(hypothesis) # label(non_clause). [assumption]. 0.68/0.99 10 (all I I = plus(I,int_zero)) # label(plus_zero) # label(axiom) # label(non_clause). [assumption]. 0.68/0.99 11 -(all I all J (int_leq(int_one,J) & int_leq(I,n) & int_less(J,I) -> real_zero = a(I,J))) # label(ut) # label(negated_conjecture) # label(non_clause). [assumption]. 0.68/0.99 0.68/0.99 ============================== end of process non-clausal formulas === 0.68/0.99 0.68/0.99 ============================== PROCESS INITIAL CLAUSES =============== 0.68/0.99 0.68/0.99 ==============Alarm clock 179.64/180.08 Prover9 interrupted 179.64/180.09 EOF