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.03/0.23 % Computer : n068.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 05:08:10 CDT 2018 0.03/0.24 % CPUTime : 0.07/0.44 ============================== Prover9 =============================== 0.07/0.44 Prover9 (32) version 2009-11A, November 2009. 0.07/0.44 Process 46279 was started by sandbox on n068.star.cs.uiowa.edu, 0.07/0.44 Sat Jul 14 05:08:10 2018 0.07/0.44 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_46247_n068.star.cs.uiowa.edu". 0.07/0.44 ============================== end of head =========================== 0.07/0.44 0.07/0.44 ============================== INPUT ================================= 0.07/0.44 0.07/0.44 % Reading from file /tmp/Prover9_46247_n068.star.cs.uiowa.edu 0.07/0.44 0.07/0.44 set(prolog_style_variables). 0.07/0.44 set(auto2). 0.07/0.44 % set(auto2) -> set(auto). 0.07/0.44 % set(auto) -> set(auto_inference). 0.07/0.44 % set(auto) -> set(auto_setup). 0.07/0.44 % set(auto_setup) -> set(predicate_elim). 0.07/0.44 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.44 % set(auto) -> set(auto_limits). 0.07/0.44 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.44 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.44 % set(auto) -> set(auto_denials). 0.07/0.44 % set(auto) -> set(auto_process). 0.07/0.44 % set(auto2) -> assign(new_constants, 1). 0.07/0.44 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.44 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.44 % set(auto2) -> assign(max_hours, 1). 0.07/0.44 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.44 % set(auto2) -> assign(max_seconds, 0). 0.07/0.44 % set(auto2) -> assign(max_minutes, 5). 0.07/0.44 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.44 % set(auto2) -> set(sort_initial_sos). 0.07/0.44 % set(auto2) -> assign(sos_limit, -1). 0.07/0.44 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.44 % set(auto2) -> assign(max_megs, 400). 0.07/0.44 % set(auto2) -> assign(stats, some). 0.07/0.44 % set(auto2) -> clear(echo_input). 0.07/0.44 % set(auto2) -> set(quiet). 0.07/0.44 % set(auto2) -> clear(print_initial_clauses). 0.07/0.44 % set(auto2) -> clear(print_given). 0.07/0.44 assign(lrs_ticks,-1). 0.07/0.44 assign(sos_limit,10000). 0.07/0.44 assign(order,kbo). 0.07/0.44 set(lex_order_vars). 0.07/0.44 clear(print_given). 0.07/0.44 0.07/0.44 % formulas(sos). % not echoed (13 formulas) 0.07/0.44 0.07/0.44 ============================== end of input ========================== 0.07/0.44 0.07/0.44 % From the command line: assign(max_seconds, 300). 0.07/0.44 0.07/0.44 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.44 0.07/0.44 % Formulas that are not ordinary clauses: 0.07/0.44 1 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 2 (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.07/0.44 3 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 4 (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.07/0.44 5 (all I all J (int_less(I,J) | I = J <-> int_leq(I,J))) # label(int_leq) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 6 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 7 (all I all J (int_leq(J,I) | int_less(I,J))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 8 (all I (int_less(int_zero,I) <-> int_leq(int_one,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 9 (all I all J (int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) & int_leq(int_one,I) -> (all K (int_leq(K,J) & int_leq(int_one,K) -> a(K,K) = real_one)) & (all C (J = plus(I,C) & int_less(int_zero,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> a(K,plus(K,C)) = real_zero)))) & (all C (I = plus(J,C) & int_less(int_zero,C) -> (all K (int_leq(K,J) & int_leq(int_one,K) -> real_zero = a(plus(K,C),K))))))) # label(qii) # label(hypothesis) # label(non_clause). [assumption]. 0.07/0.44 10 (all I all J (int_less(I,J) <-> (exists K (int_less(int_zero,K) & plus(I,K) = J)))) # label(plus_and_inverse) # label(axiom) # label(non_clause). [assumption]. 0.07/0.44 11 -(all I all J (int_leq(I,n) & int_less(J,I) & int_leq(int_one,J) -> real_zero = a(I,J))) # label(ut) # label(negated_conjecture) # label(non_clause). [assumption]. 0.07/0.44 0.07/0.44 ============================== end of process non-clausal formulas === 0.07/0.44 0.07/0.44 ========Cputime limit exceeded (core dumped) 300.03/300.25 EOF