0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.35 % Computer : n012.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 1200 0.13/0.35 % DateTime : Tue Jul 13 14:39:31 EDT 2021 0.13/0.35 % CPUTime : 0.48/1.09 ============================== Prover9 =============================== 0.48/1.09 Prover9 (32) version 2009-11A, November 2009. 0.48/1.09 Process 628 was started by sandbox2 on n012.cluster.edu, 0.48/1.09 Tue Jul 13 14:39:32 2021 0.48/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_452_n012.cluster.edu". 0.48/1.09 ============================== end of head =========================== 0.48/1.09 0.48/1.09 ============================== INPUT ================================= 0.48/1.09 0.48/1.09 % Reading from file /tmp/Prover9_452_n012.cluster.edu 0.48/1.09 0.48/1.09 set(prolog_style_variables). 0.48/1.09 set(auto2). 0.48/1.09 % set(auto2) -> set(auto). 0.48/1.09 % set(auto) -> set(auto_inference). 0.48/1.09 % set(auto) -> set(auto_setup). 0.48/1.09 % set(auto_setup) -> set(predicate_elim). 0.48/1.09 % set(auto_setup) -> assign(eq_defs, unfold). 0.48/1.09 % set(auto) -> set(auto_limits). 0.48/1.09 % set(auto_limits) -> assign(max_weight, "100.000"). 0.48/1.09 % set(auto_limits) -> assign(sos_limit, 20000). 0.48/1.09 % set(auto) -> set(auto_denials). 0.48/1.09 % set(auto) -> set(auto_process). 0.48/1.09 % set(auto2) -> assign(new_constants, 1). 0.48/1.09 % set(auto2) -> assign(fold_denial_max, 3). 0.48/1.09 % set(auto2) -> assign(max_weight, "200.000"). 0.48/1.09 % set(auto2) -> assign(max_hours, 1). 0.48/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.48/1.09 % set(auto2) -> assign(max_seconds, 0). 0.48/1.09 % set(auto2) -> assign(max_minutes, 5). 0.48/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.48/1.09 % set(auto2) -> set(sort_initial_sos). 0.48/1.09 % set(auto2) -> assign(sos_limit, -1). 0.48/1.09 % set(auto2) -> assign(lrs_ticks, 3000). 0.48/1.09 % set(auto2) -> assign(max_megs, 400). 0.48/1.09 % set(auto2) -> assign(stats, some). 0.48/1.09 % set(auto2) -> clear(echo_input). 0.48/1.09 % set(auto2) -> set(quiet). 0.48/1.09 % set(auto2) -> clear(print_initial_clauses). 0.48/1.09 % set(auto2) -> clear(print_given). 0.48/1.09 assign(lrs_ticks,-1). 0.48/1.09 assign(sos_limit,10000). 0.48/1.09 assign(order,kbo). 0.48/1.09 set(lex_order_vars). 0.48/1.09 clear(print_given). 0.48/1.09 0.48/1.09 % formulas(sos). % not echoed (9 formulas) 0.48/1.09 0.48/1.09 ============================== end of input ========================== 0.48/1.09 0.48/1.09 % From the command line: assign(max_seconds, 1200). 0.48/1.09 0.48/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.48/1.09 0.48/1.09 % Formulas that are not ordinary clauses: 0.48/1.09 1 (all B all A B = mult(A,ld(A,B))) # label(f01) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 2 (all A A = mult(A,unit)) # label(f05) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 3 (all B all A A = rd(mult(A,B),B)) # label(f04) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 4 (all B all A A = mult(rd(A,B),B)) # label(f03) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 5 (all C all B all A mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C)))) # label(f08) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 6 (all A A = mult(unit,A)) # label(f06) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 7 (all C all B all A mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C))) # label(f07) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 8 (all B all A ld(A,mult(A,B)) = B) # label(f02) # label(axiom) # label(non_clause). [assumption]. 0.48/1.09 9 -(all X0 all X1 all X2 all X3 (mult(X0,X1) = unit -> mult(mult(mult(X1,X0),X2),X3) = mult(mult(X1,X0),mult(X2,X3)) & mult(X2,mult(X3,mult(X1,X0))) = mult(mult(X2,X3),mult(X1,X0)) & mult(X2,mult(mult(X1,X0),X3)) = mult(mult(X2,mult(X1,X0)),X3))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption]. 0.48/1.09 0.48/1.09 ============================== end of process non-clausal formulas === 0.48/1.09 0.48/1.09 ============================== PROCESS INITIAL CLAUSES =============== 0.48/1.09 0.48/1.09 ============================== PREDICATE ELIMINATION ================= 0.48/1.09 0.48/1.09 ============================== end predicate elimination ============= 0.48/1.09 0.48/1.09 Auto_denials: 0.48/1.09 % copying label goals to answer in negative clause 0.48/1.09 0.48/1.09 Term ordering decisions: 0.48/1.09 Function symbol KB weights: unit=1. c1=1. c2=1. c3=1. c4=1. mult=1. ld=1. rd=1. 0.48/1.09 0.48/1.09 ============================== end of process initial clauses ======== 0.48/1.09 0.48/1.09 ============================== CLAUSES FOR SEARCH ==================== 0.48/1.09 0.48/1.09 ============================== end of clauses for search ============= 0.48/1.09 0.48/1.09 ============================== SEARCH ================================ 0.48/1.09 0.48/1.09 % Starting search at 0.01 secAlarm clock 119.73/120.06 Prover9 interrupted 119.73/120.07 EOF