0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n005.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1440 0.12/0.34 % WCLimit : 180 0.12/0.34 % DateTime : Mon Jul 3 10:24:45 EDT 2023 0.12/0.34 % CPUTime : 0.46/1.16 ============================== Prover9 =============================== 0.46/1.16 Prover9 (32) version 2009-11A, November 2009. 0.46/1.16 Process 14379 was started by sandbox2 on n005.cluster.edu, 0.46/1.16 Mon Jul 3 10:24:46 2023 0.46/1.16 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_14225_n005.cluster.edu". 0.46/1.16 ============================== end of head =========================== 0.46/1.16 0.46/1.16 ============================== INPUT ================================= 0.46/1.16 0.46/1.16 % Reading from file /tmp/Prover9_14225_n005.cluster.edu 0.46/1.16 0.46/1.16 set(prolog_style_variables). 0.46/1.16 set(auto2). 0.46/1.16 % set(auto2) -> set(auto). 0.46/1.16 % set(auto) -> set(auto_inference). 0.46/1.16 % set(auto) -> set(auto_setup). 0.46/1.16 % set(auto_setup) -> set(predicate_elim). 0.46/1.16 % set(auto_setup) -> assign(eq_defs, unfold). 0.46/1.16 % set(auto) -> set(auto_limits). 0.46/1.16 % set(auto_limits) -> assign(max_weight, "100.000"). 0.46/1.16 % set(auto_limits) -> assign(sos_limit, 20000). 0.46/1.16 % set(auto) -> set(auto_denials). 0.46/1.16 % set(auto) -> set(auto_process). 0.46/1.16 % set(auto2) -> assign(new_constants, 1). 0.46/1.16 % set(auto2) -> assign(fold_denial_max, 3). 0.46/1.16 % set(auto2) -> assign(max_weight, "200.000"). 0.46/1.16 % set(auto2) -> assign(max_hours, 1). 0.46/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.46/1.16 % set(auto2) -> assign(max_seconds, 0). 0.46/1.16 % set(auto2) -> assign(max_minutes, 5). 0.46/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.46/1.16 % set(auto2) -> set(sort_initial_sos). 0.46/1.16 % set(auto2) -> assign(sos_limit, -1). 0.46/1.16 % set(auto2) -> assign(lrs_ticks, 3000). 0.46/1.16 % set(auto2) -> assign(max_megs, 400). 0.46/1.16 % set(auto2) -> assign(stats, some). 0.46/1.16 % set(auto2) -> clear(echo_input). 0.46/1.16 % set(auto2) -> set(quiet). 0.46/1.16 % set(auto2) -> clear(print_initial_clauses). 0.46/1.16 % set(auto2) -> clear(print_given). 0.46/1.16 assign(lrs_ticks,-1). 0.46/1.16 assign(sos_limit,10000). 0.46/1.16 assign(order,kbo). 0.46/1.16 set(lex_order_vars). 0.46/1.16 clear(print_given). 0.46/1.16 0.46/1.16 % formulas(sos). % not echoed (19 formulas) 0.46/1.16 0.46/1.16 ============================== end of input ========================== 0.46/1.16 0.46/1.16 % From the command line: assign(max_seconds, 1440). 0.46/1.16 0.46/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.46/1.16 0.46/1.16 % Formulas that are not ordinary clauses: 0.46/1.16 1 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(distributivity2) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 2 (all A addition(one,multiplication(star(A),A)) = star(A)) # label(star_unfold2) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 3 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 4 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 5 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(distributivity1) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 6 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 7 (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.46/1.16 8 (all A strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one)) # label(infty_unfold1) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 9 (all A all B all C (leq(addition(multiplication(C,A),B),C) -> leq(multiplication(B,star(A)),C))) # label(star_induction2) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 10 (all A star(A) = addition(one,multiplication(A,star(A)))) # label(star_unfold1) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 11 (all A all B (leq(A,B) <-> B = addition(A,B))) # label(order) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 12 (all A A = multiplication(one,A)) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption]. 0.46/1.16 13 (all A strong_iteration(A) = addition(star(A),multiplication(strong_iteration(A),zero))) # label(isolation) # label(axiom) # label(non_clause). [assumptiAlarm clock 179.22/180.01 Prover9 interrupted 179.22/180.01 EOF