0.00/0.04 % 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 : n158.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 04:51:09 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 7299 was started by sandbox2 on n158.star.cs.uiowa.edu, 0.06/0.43 Sat Jul 14 04:51:10 2018 0.06/0.43 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7267_n158.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_7267_n158.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 (13 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 I all J (int_less(I,J) -> J != I)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 2 (all I all J (int_leq(J,I) | int_less(I,J))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 3 (all I all J plus(J,I) = plus(I,J)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 4 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 5 (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.06/0.43 6 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> qr(plus(K,C),K) = a(plus(K,C),K))))) & (all C (plus(I,C) = J & int_less(int_zero,C) -> (all K (int_leq(K,I) & int_leq(int_one,K) -> a(K,plus(K,C)) = real_zero)))))) # label(qih) # label(hypothesis) # label(non_clause). [assumption]. 0.06/0.43 7 (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.06/0.43 8 (all I all J (int_less(I,J) | J = I <-> int_leq(I,J))) # label(int_leq) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 9 (all I (int_leq(int_one,I) <-> int_less(int_zero,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 10 (all I all J (int_less(I,J) <-> (exists K (int_less(int_zero,K) & J = plus(I,K))))) # label(plus_and_inverse) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 11 -(all I all J (int_less(I,J) & int_leq(J,n) & int_leq(int_one,I) -> a(I,J) = real_zero)) # label(lt) # label(negated_conjecture) # label(non_clause). [assumption]. 0.06/0.43 0.06/0.43 ============================== end of process non-clausal formulas === 0.06/0.43 0.06/0.43 ============================== PROCESS INITIAL CLAUSES ===============Cputime limit exceeded (core dumped) 300.04/300.34 EOF