0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.33 % Computer : n017.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1440 0.11/0.33 % WCLimit : 180 0.11/0.33 % DateTime : Mon Jul 3 08:43:53 EDT 2023 0.11/0.33 % CPUTime : 0.58/0.88 ============================== Prover9 =============================== 0.58/0.88 Prover9 (32) version 2009-11A, November 2009. 0.58/0.88 Process 14549 was started by sandbox2 on n017.cluster.edu, 0.58/0.88 Mon Jul 3 08:43:54 2023 0.58/0.88 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_14394_n017.cluster.edu". 0.58/0.88 ============================== end of head =========================== 0.58/0.88 0.58/0.88 ============================== INPUT ================================= 0.58/0.88 0.58/0.88 % Reading from file /tmp/Prover9_14394_n017.cluster.edu 0.58/0.88 0.58/0.88 set(prolog_style_variables). 0.58/0.88 set(auto2). 0.58/0.88 % set(auto2) -> set(auto). 0.58/0.88 % set(auto) -> set(auto_inference). 0.58/0.88 % set(auto) -> set(auto_setup). 0.58/0.88 % set(auto_setup) -> set(predicate_elim). 0.58/0.88 % set(auto_setup) -> assign(eq_defs, unfold). 0.58/0.88 % set(auto) -> set(auto_limits). 0.58/0.88 % set(auto_limits) -> assign(max_weight, "100.000"). 0.58/0.88 % set(auto_limits) -> assign(sos_limit, 20000). 0.58/0.88 % set(auto) -> set(auto_denials). 0.58/0.88 % set(auto) -> set(auto_process). 0.58/0.88 % set(auto2) -> assign(new_constants, 1). 0.58/0.88 % set(auto2) -> assign(fold_denial_max, 3). 0.58/0.88 % set(auto2) -> assign(max_weight, "200.000"). 0.58/0.88 % set(auto2) -> assign(max_hours, 1). 0.58/0.88 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.58/0.88 % set(auto2) -> assign(max_seconds, 0). 0.58/0.88 % set(auto2) -> assign(max_minutes, 5). 0.58/0.88 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.58/0.88 % set(auto2) -> set(sort_initial_sos). 0.58/0.88 % set(auto2) -> assign(sos_limit, -1). 0.58/0.88 % set(auto2) -> assign(lrs_ticks, 3000). 0.58/0.88 % set(auto2) -> assign(max_megs, 400). 0.58/0.88 % set(auto2) -> assign(stats, some). 0.58/0.88 % set(auto2) -> clear(echo_input). 0.58/0.88 % set(auto2) -> set(quiet). 0.58/0.88 % set(auto2) -> clear(print_initial_clauses). 0.58/0.88 % set(auto2) -> clear(print_given). 0.58/0.88 assign(lrs_ticks,-1). 0.58/0.88 assign(sos_limit,10000). 0.58/0.88 assign(order,kbo). 0.58/0.88 set(lex_order_vars). 0.58/0.88 clear(print_given). 0.58/0.88 0.58/0.88 % formulas(sos). % not echoed (18 formulas) 0.58/0.88 0.58/0.88 ============================== end of input ========================== 0.58/0.88 0.58/0.88 % From the command line: assign(max_seconds, 1440). 0.58/0.88 0.58/0.88 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.58/0.88 0.58/0.88 % Formulas that are not ordinary clauses: 0.58/0.88 1 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 2 (all A all B (addition(A,B) = B <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 3 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 4 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 5 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 6 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 7 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 8 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 9 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 10 (all A A = multiplication(one,A)) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 11 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 12 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 13 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption]. 0.58/0.88 14 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(Alarm clock 179.65/180.03 Prover9 interrupted 179.65/180.03 EOF