0.07/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.15 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.36 % Computer : n013.cluster.edu 0.13/0.36 % Model : x86_64 x86_64 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.36 % Memory : 8042.1875MB 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.36 % CPULimit : 960 0.13/0.36 % DateTime : Thu Jul 2 10:55:18 EDT 2020 0.13/0.36 % CPUTime : 0.46/1.02 ============================== Prover9 =============================== 0.46/1.02 Prover9 (32) version 2009-11A, November 2009. 0.46/1.02 Process 3544 was started by sandbox2 on n013.cluster.edu, 0.46/1.02 Thu Jul 2 10:55:19 2020 0.46/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_3384_n013.cluster.edu". 0.46/1.02 ============================== end of head =========================== 0.46/1.02 0.46/1.02 ============================== INPUT ================================= 0.46/1.02 0.46/1.02 % Reading from file /tmp/Prover9_3384_n013.cluster.edu 0.46/1.02 0.46/1.02 set(prolog_style_variables). 0.46/1.02 set(auto2). 0.46/1.02 % set(auto2) -> set(auto). 0.46/1.02 % set(auto) -> set(auto_inference). 0.46/1.02 % set(auto) -> set(auto_setup). 0.46/1.02 % set(auto_setup) -> set(predicate_elim). 0.46/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.46/1.02 % set(auto) -> set(auto_limits). 0.46/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.46/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.46/1.02 % set(auto) -> set(auto_denials). 0.46/1.02 % set(auto) -> set(auto_process). 0.46/1.02 % set(auto2) -> assign(new_constants, 1). 0.46/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.46/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.46/1.02 % set(auto2) -> assign(max_hours, 1). 0.46/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.46/1.02 % set(auto2) -> assign(max_seconds, 0). 0.46/1.02 % set(auto2) -> assign(max_minutes, 5). 0.46/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.46/1.02 % set(auto2) -> set(sort_initial_sos). 0.46/1.02 % set(auto2) -> assign(sos_limit, -1). 0.46/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.46/1.02 % set(auto2) -> assign(max_megs, 400). 0.46/1.02 % set(auto2) -> assign(stats, some). 0.46/1.02 % set(auto2) -> clear(echo_input). 0.46/1.02 % set(auto2) -> set(quiet). 0.46/1.02 % set(auto2) -> clear(print_initial_clauses). 0.46/1.02 % set(auto2) -> clear(print_given). 0.46/1.02 assign(lrs_ticks,-1). 0.46/1.02 assign(sos_limit,10000). 0.46/1.02 assign(order,kbo). 0.46/1.02 set(lex_order_vars). 0.46/1.02 clear(print_given). 0.46/1.02 0.46/1.02 % formulas(sos). % not echoed (20 formulas) 0.46/1.02 0.46/1.02 ============================== end of input ========================== 0.46/1.02 0.46/1.02 % From the command line: assign(max_seconds, 960). 0.46/1.02 0.46/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.46/1.02 0.46/1.02 % Formulas that are not ordinary clauses: 0.46/1.02 1 (all A all B (less_than(A,B) -> join(A,B,B) & meet(A,B,A))) # label(less_than_meet_join) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 2 (all A all B all C (join(A,B,C) -> less_than(A,C) & less_than(B,C))) # label(upper_bound_join) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 3 (all A all B all C (meet(A,B,C) -> less_than(C,B) & less_than(C,A))) # label(lower_bound_meet) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 4 (all A all B all C all D (less_than(D,B) & less_than(D,A) & meet(A,B,C) -> less_than(D,C))) # label(greatest_lower_bound_meet) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 5 (all A all B all C all D (less_than(A,D) & less_than(B,D) & join(A,B,C) -> less_than(C,D))) # label(least_upper_bound_join) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 6 (all A all B all C (meet(A,B,C) -> meet(B,A,C))) # label(commutitivity_meet) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 7 (all A all B all C all D all E all F (join(A,B,D) & join(B,C,F) & join(D,C,E) -> join(A,F,E))) # label(associativity_join) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 8 less_than(v,p) -> goal # label(goal_ax) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 9 (all A less_than(A,A)) # label(less_than_reflexive) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 10 (all A all B all C all D all E all F (meet(D,C,E) & meet(B,C,F) & meet(A,B,D) -> meet(A,F,E))) # label(associativity_meet) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 11 (all A all B all C (less_than(B,C) & less_than(A,B) -> less_than(A,C))) # label(less_than_transitive) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 12 (all A all B exists C meet(A,B,C)) # label(do_lattice) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 13 (all A all B all C all D all E all F all G all H (meet(A,B,E) & meet(A,C,F) & join(E,F,G) & meet(A,H,D) & join(B,C,H) -> less_than(D,G))) # label(lo_le_distr) # label(axiom) # label(non_clause). [assumption]. 0.46/1.02 14 (all AAlarm clock 119.73/120.04 Prover9 interrupted 119.73/120.04 EOF