0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.33 % Computer : n014.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % DateTime : Thu Jul 2 12:34:10 EDT 2020 0.13/0.33 % CPUTime : 0.41/1.06 ============================== Prover9 =============================== 0.41/1.06 Prover9 (32) version 2009-11A, November 2009. 0.41/1.06 Process 25190 was started by sandbox2 on n014.cluster.edu, 0.41/1.06 Thu Jul 2 12:34:11 2020 0.41/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_25037_n014.cluster.edu". 0.41/1.06 ============================== end of head =========================== 0.41/1.06 0.41/1.06 ============================== INPUT ================================= 0.41/1.06 0.41/1.06 % Reading from file /tmp/Prover9_25037_n014.cluster.edu 0.41/1.06 0.41/1.06 set(prolog_style_variables). 0.41/1.06 set(auto2). 0.41/1.06 % set(auto2) -> set(auto). 0.41/1.06 % set(auto) -> set(auto_inference). 0.41/1.06 % set(auto) -> set(auto_setup). 0.41/1.06 % set(auto_setup) -> set(predicate_elim). 0.41/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.41/1.06 % set(auto) -> set(auto_limits). 0.41/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.41/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.41/1.06 % set(auto) -> set(auto_denials). 0.41/1.06 % set(auto) -> set(auto_process). 0.41/1.06 % set(auto2) -> assign(new_constants, 1). 0.41/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.41/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.41/1.06 % set(auto2) -> assign(max_hours, 1). 0.41/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.41/1.06 % set(auto2) -> assign(max_seconds, 0). 0.41/1.06 % set(auto2) -> assign(max_minutes, 5). 0.41/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.41/1.06 % set(auto2) -> set(sort_initial_sos). 0.41/1.06 % set(auto2) -> assign(sos_limit, -1). 0.41/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.41/1.06 % set(auto2) -> assign(max_megs, 400). 0.41/1.06 % set(auto2) -> assign(stats, some). 0.41/1.06 % set(auto2) -> clear(echo_input). 0.41/1.06 % set(auto2) -> set(quiet). 0.41/1.06 % set(auto2) -> clear(print_initial_clauses). 0.41/1.06 % set(auto2) -> clear(print_given). 0.41/1.06 assign(lrs_ticks,-1). 0.41/1.06 assign(sos_limit,10000). 0.41/1.06 assign(order,kbo). 0.41/1.06 set(lex_order_vars). 0.41/1.06 clear(print_given). 0.41/1.06 0.41/1.06 % formulas(sos). % not echoed (53 formulas) 0.41/1.06 0.41/1.06 ============================== end of input ========================== 0.41/1.06 0.41/1.06 % From the command line: assign(max_seconds, 960). 0.41/1.06 0.41/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.41/1.06 0.41/1.06 % Formulas that are not ordinary clauses: 0.41/1.06 1 a1 = a3 -> goal # label(diff_a3_a1) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 2 (all A all B all C (B = A & C = B -> A = C)) # label(transitivity_of_equal) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 3 b1 = b3 -> goal # label(diff_b3_b1) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 4 incident(b1,a2a3) & incident(b2,a3a1) & incident(b3,a1a2) -> goal # label(t_b_in_a) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 5 (all A all B (line(B) & line(A) -> (exists C (incident(C,B) & incident(C,A))))) # label(meet) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 6 (all A all B (A = B -> A = B)) # label(symmetry_of_equal) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 7 a3 = a2 -> goal # label(diff_a2_a3) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 8 (all A (incident(p3,A) & incident(p1,A) & incident(p2,A) -> goal)) # label(goal_normal) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 9 (all A all B all C (incident(A,B) & C = B -> incident(A,C))) # label(line_congruence) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 10 (all A all B (incident(A,B) -> line(B))) # label(sort_line) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 11 b1 = b2 -> goal # label(diff_b1_b2) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 12 incident(a2,b3b1) & incident(a3,b1b2) & incident(a1,b2b3) -> goal # label(t_a_in_b) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 13 (all A all B (incident(A,B) -> point(A))) # label(sort_point) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 14 (all A all B all C (A = B & incident(B,C) -> incident(A,C))) # label(point_congruence) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 15 b3b1 = a3a1 -> goal # label(not31) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 16 a2 = a1 -> goal # label(diff_a1_a2) # label(axiom) # label(non_clause). [assumption]. 0.41/1.06 17 (all A all B (point(A) & point(B) -> (exists C (incident(B,C) & incident(A,C))))) # label(join) # label(axioAlarm clock 119.36/120.02 Prover9 interrupted 119.36/120.02 EOF