0.07/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.36 % Computer : n019.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 960 0.14/0.36 % DateTime : Thu Jul 2 10:47:16 EDT 2020 0.14/0.37 % CPUTime : 0.66/0.95 ============================== Prover9 =============================== 0.66/0.95 Prover9 (32) version 2009-11A, November 2009. 0.66/0.95 Process 7931 was started by sandbox2 on n019.cluster.edu, 0.66/0.95 Thu Jul 2 10:47:17 2020 0.66/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7760_n019.cluster.edu". 0.66/0.95 ============================== end of head =========================== 0.66/0.95 0.66/0.95 ============================== INPUT ================================= 0.66/0.95 0.66/0.95 % Reading from file /tmp/Prover9_7760_n019.cluster.edu 0.66/0.95 0.66/0.95 set(prolog_style_variables). 0.66/0.95 set(auto2). 0.66/0.95 % set(auto2) -> set(auto). 0.66/0.95 % set(auto) -> set(auto_inference). 0.66/0.95 % set(auto) -> set(auto_setup). 0.66/0.95 % set(auto_setup) -> set(predicate_elim). 0.66/0.95 % set(auto_setup) -> assign(eq_defs, unfold). 0.66/0.95 % set(auto) -> set(auto_limits). 0.66/0.95 % set(auto_limits) -> assign(max_weight, "100.000"). 0.66/0.95 % set(auto_limits) -> assign(sos_limit, 20000). 0.66/0.95 % set(auto) -> set(auto_denials). 0.66/0.95 % set(auto) -> set(auto_process). 0.66/0.95 % set(auto2) -> assign(new_constants, 1). 0.66/0.95 % set(auto2) -> assign(fold_denial_max, 3). 0.66/0.96 % set(auto2) -> assign(max_weight, "200.000"). 0.66/0.96 % set(auto2) -> assign(max_hours, 1). 0.66/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.66/0.96 % set(auto2) -> assign(max_seconds, 0). 0.66/0.96 % set(auto2) -> assign(max_minutes, 5). 0.66/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.66/0.96 % set(auto2) -> set(sort_initial_sos). 0.66/0.96 % set(auto2) -> assign(sos_limit, -1). 0.66/0.96 % set(auto2) -> assign(lrs_ticks, 3000). 0.66/0.96 % set(auto2) -> assign(max_megs, 400). 0.66/0.96 % set(auto2) -> assign(stats, some). 0.66/0.96 % set(auto2) -> clear(echo_input). 0.66/0.96 % set(auto2) -> set(quiet). 0.66/0.96 % set(auto2) -> clear(print_initial_clauses). 0.66/0.96 % set(auto2) -> clear(print_given). 0.66/0.96 assign(lrs_ticks,-1). 0.66/0.96 assign(sos_limit,10000). 0.66/0.96 assign(order,kbo). 0.66/0.96 set(lex_order_vars). 0.66/0.96 clear(print_given). 0.66/0.96 0.66/0.96 % formulas(sos). % not echoed (12 formulas) 0.66/0.96 0.66/0.96 ============================== end of input ========================== 0.66/0.96 0.66/0.96 % From the command line: assign(max_seconds, 960). 0.66/0.96 0.66/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.66/0.96 0.66/0.96 % Formulas that are not ordinary clauses: 0.66/0.96 1 (all X all A all B (member(X,A) & member(X,B) <-> member(X,intersection(A,B)))) # label(intersection) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 2 (all X all A ((all Y (member(Y,A) -> member(X,Y))) <-> member(X,product(A)))) # label(product) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 3 (all B all A all E (member(B,difference(E,A)) <-> member(B,E) & -member(B,A))) # label(difference) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 4 (all X all A (member(X,power_set(A)) <-> subset(X,A))) # label(power_set) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 5 (all X all A (member(X,singleton(A)) <-> A = X)) # label(singleton) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 6 (all A all B (subset(A,B) <-> (all X (member(X,A) -> member(X,B))))) # label(subset) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 7 (all X -member(X,empty_set)) # label(empty_set) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 8 (all A all B (subset(A,B) & subset(B,A) <-> equal_set(A,B))) # label(equal_set) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 9 (all X all A all B (member(X,B) | member(X,A) <-> member(X,union(A,B)))) # label(union) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 10 (all X all A all B (B = X | X = A <-> member(X,unordered_pair(A,B)))) # label(unordered_pair) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 11 (all X all A (member(X,sum(A)) <-> (exists Y (member(Y,A) & member(X,Y))))) # label(sum) # label(axiom) # label(non_clause). [assumption]. 0.66/0.96 12 -(all A all E (subset(A,E) -> equal_set(intersection(difference(E,A),A),empty_set))) # label(thI28) # label(negated_conjecture) # label(non_clause). [assumption]. 0.66/0.96 0.66/0.96 ============================== end of process non-clausal formulas === 0.66/0.96 0.66/0.96 ============================== PROCESS INITIAL CLAUSES =============== 0.66/0.96 0.66/0.96 ============================== PREDICATE ELIMINATION ================= 0.66/0.96 0.66/0.96 ============================== end predicate elimination ============= 0.66/0.96 119.81/120.06 Alarm clock 119.81/120.06 Prover9 interrupted 119.81/120.06 EOF