0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.31 % Computer : n020.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1440 0.10/0.31 % WCLimit : 180 0.10/0.31 % DateTime : Mon Jul 3 08:26:46 EDT 2023 0.10/0.31 % CPUTime : 0.70/1.02 ============================== Prover9 =============================== 0.70/1.02 Prover9 (32) version 2009-11A, November 2009. 0.70/1.02 Process 25222 was started by sandbox2 on n020.cluster.edu, 0.70/1.02 Mon Jul 3 08:26:47 2023 0.70/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_25067_n020.cluster.edu". 0.70/1.02 ============================== end of head =========================== 0.70/1.02 0.70/1.02 ============================== INPUT ================================= 0.70/1.02 0.70/1.02 % Reading from file /tmp/Prover9_25067_n020.cluster.edu 0.70/1.02 0.70/1.02 set(prolog_style_variables). 0.70/1.02 set(auto2). 0.70/1.02 % set(auto2) -> set(auto). 0.70/1.02 % set(auto) -> set(auto_inference). 0.70/1.02 % set(auto) -> set(auto_setup). 0.70/1.02 % set(auto_setup) -> set(predicate_elim). 0.70/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.70/1.02 % set(auto) -> set(auto_limits). 0.70/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.70/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.70/1.02 % set(auto) -> set(auto_denials). 0.70/1.02 % set(auto) -> set(auto_process). 0.70/1.02 % set(auto2) -> assign(new_constants, 1). 0.70/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.70/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.70/1.02 % set(auto2) -> assign(max_hours, 1). 0.70/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.70/1.02 % set(auto2) -> assign(max_seconds, 0). 0.70/1.02 % set(auto2) -> assign(max_minutes, 5). 0.70/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.70/1.02 % set(auto2) -> set(sort_initial_sos). 0.70/1.02 % set(auto2) -> assign(sos_limit, -1). 0.70/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.70/1.02 % set(auto2) -> assign(max_megs, 400). 0.70/1.02 % set(auto2) -> assign(stats, some). 0.70/1.02 % set(auto2) -> clear(echo_input). 0.70/1.02 % set(auto2) -> set(quiet). 0.70/1.02 % set(auto2) -> clear(print_initial_clauses). 0.70/1.02 % set(auto2) -> clear(print_given). 0.70/1.02 assign(lrs_ticks,-1). 0.70/1.02 assign(sos_limit,10000). 0.70/1.02 assign(order,kbo). 0.70/1.02 set(lex_order_vars). 0.70/1.02 clear(print_given). 0.70/1.02 0.70/1.02 % formulas(sos). % not echoed (11 formulas) 0.70/1.02 0.70/1.02 ============================== end of input ========================== 0.70/1.02 0.70/1.02 % From the command line: assign(max_seconds, 1440). 0.70/1.02 0.70/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.70/1.02 0.70/1.02 % Formulas that are not ordinary clauses: 0.70/1.02 1 (all U (sorti1(U) -> U = op1(U,unit1) & U = op1(unit1,U))) # label(ax2_AndLHS) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 2 (exists V (sorti1(V) & V = unit1)) # label(ax2_AndRHS) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 3 (all U (sorti1(U) -> (all V (sorti1(V) -> sorti1(op1(U,V)))))) # label(ax5) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 4 (exists U (sorti1(U) & (all V (sorti1(V) -> (all W (sorti1(W) -> U != op1(V,W) | U != unit1 & op1(V,U) = W)))))) # label(ax7) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 5 -(exists U ((all V (sorti2(V) -> (all W (sorti2(W) -> op2(V,W) != U | op2(V,U) = W & U != unit2)))) & sorti2(U))) # label(ax8) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 6 (all U (sorti2(U) -> (all V (sorti2(V) -> sorti2(op2(U,V)))))) # label(ax6) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 7 (exists V (sorti2(V) & unit2 = V)) # label(ax4_AndLHS) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 8 (all U (sorti2(U) -> U = op2(unit2,U) & op2(U,unit2) = U)) # label(ax4_AndRHS) # label(axiom) # label(non_clause). [assumption]. 0.70/1.02 9 -((all U (sorti1(U) -> sorti2(h(U)))) & (all V (sorti2(V) -> sorti1(j(V)))) -> -((all W (sorti1(W) -> (all X (sorti1(X) -> h(op1(W,X)) = op2(h(W),h(X)))))) & (all X1 (sorti2(X1) -> h(j(X1)) = X1)) & (all X2 (sorti1(X2) -> j(h(X2)) = X2)) & (all Y (sorti2(Y) -> (all Z (sorti2(Z) -> op1(j(Y),j(Z)) = j(op2(Y,Z)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.70/1.02 0.70/1.02 ============================== end of process non-clausal formulas === 0.70/1.02 0.70/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.70/1.02 0.70/1.02 ============================== PREDICATE ELIMINATION ================= 0.70/1.02 0.70/1.02 ============================== end predicate elimination ============= 0.70/1.02 0.70/1.02 Auto_denials: 0.70/1.02 % copying label ax7 to answer in negative clause 0.70/1.02 0.70/1.02 Term ordering decisions: 0.70/1.02 Function symbol KB weights: unit2=1. unit1=1. c1=1. c2=1. c3=1. op1=1. op2=1. h=1. jAlarm clock 179.68/180.05 Prover9 interrupted 179.68/180.05 EOF