0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n016.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % DateTime : Thu Jul 2 14:41:34 EDT 2020 0.09/0.31 % CPUTime : 0.34/1.03 ============================== Prover9 =============================== 0.34/1.03 Prover9 (32) version 2009-11A, November 2009. 0.34/1.03 Process 25321 was started by sandbox2 on n016.cluster.edu, 0.34/1.03 Thu Jul 2 14:41:35 2020 0.34/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_25168_n016.cluster.edu". 0.34/1.03 ============================== end of head =========================== 0.34/1.03 0.34/1.03 ============================== INPUT ================================= 0.34/1.03 0.34/1.03 % Reading from file /tmp/Prover9_25168_n016.cluster.edu 0.34/1.03 0.34/1.03 set(prolog_style_variables). 0.34/1.03 set(auto2). 0.34/1.03 % set(auto2) -> set(auto). 0.34/1.03 % set(auto) -> set(auto_inference). 0.34/1.03 % set(auto) -> set(auto_setup). 0.34/1.03 % set(auto_setup) -> set(predicate_elim). 0.34/1.03 % set(auto_setup) -> assign(eq_defs, unfold). 0.34/1.03 % set(auto) -> set(auto_limits). 0.34/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). 0.34/1.03 % set(auto_limits) -> assign(sos_limit, 20000). 0.34/1.03 % set(auto) -> set(auto_denials). 0.34/1.03 % set(auto) -> set(auto_process). 0.34/1.03 % set(auto2) -> assign(new_constants, 1). 0.34/1.03 % set(auto2) -> assign(fold_denial_max, 3). 0.34/1.03 % set(auto2) -> assign(max_weight, "200.000"). 0.34/1.03 % set(auto2) -> assign(max_hours, 1). 0.34/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.34/1.03 % set(auto2) -> assign(max_seconds, 0). 0.34/1.03 % set(auto2) -> assign(max_minutes, 5). 0.34/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.34/1.03 % set(auto2) -> set(sort_initial_sos). 0.34/1.03 % set(auto2) -> assign(sos_limit, -1). 0.34/1.03 % set(auto2) -> assign(lrs_ticks, 3000). 0.34/1.03 % set(auto2) -> assign(max_megs, 400). 0.34/1.03 % set(auto2) -> assign(stats, some). 0.34/1.03 % set(auto2) -> clear(echo_input). 0.34/1.03 % set(auto2) -> set(quiet). 0.34/1.03 % set(auto2) -> clear(print_initial_clauses). 0.34/1.03 % set(auto2) -> clear(print_given). 0.34/1.03 assign(lrs_ticks,-1). 0.34/1.03 assign(sos_limit,10000). 0.34/1.03 assign(order,kbo). 0.34/1.03 set(lex_order_vars). 0.34/1.03 clear(print_given). 0.34/1.03 0.34/1.03 % formulas(sos). % not echoed (39 formulas) 0.34/1.03 0.34/1.03 ============================== end of input ========================== 0.34/1.03 0.34/1.03 % From the command line: assign(max_seconds, 960). 0.34/1.03 0.34/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.34/1.03 0.34/1.03 % Formulas that are not ordinary clauses: 0.34/1.03 1 (all A all B -(empty(A) & empty(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 2 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 3 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 4 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 5 (all A (-empty(A) -> (exists B (-empty(B) & element(B,powerset(A)))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 6 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 7 (all A all B (relation(B) & relation(A) -> relation(relation_composition(A,B)))) # label(dt_k5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 8 (all A all B all C -(element(B,powerset(C)) & empty(C) & in(A,B))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 9 (all A (relation(A) -> (all B (relation_rng(A) = B <-> (all C ((exists D in(ordered_pair(D,C),A)) <-> in(C,B))))))) # label(d5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 10 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 11 (all A all B (subset(A,B) & subset(B,A) <-> A = B)) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 12 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 13 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 14 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 15 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 16 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.34/1.03 17 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 18 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 19 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 20 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 21 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 22 (all A all B unordered_pair(B,A) = unordered_pair(A,B)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 23 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 24 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 25 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 26 (all A (relation(A) -> (all B (relation_dom(A) = B <-> (all C ((exists D in(ordered_pair(C,D),A)) <-> in(C,B))))))) # label(d4_relat_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 27 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 28 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 29 (all A all B (subset(A,B) <-> element(A,powerset(B)))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 30 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 31 (all A all B all C (element(B,powerset(C)) & in(A,B) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 32 (all A exists B (empty(B) & element(B,powerset(A)))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 33 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 34 (all A (relation(A) -> (all B (relation(B) -> (all C (relation(C) -> (relation_composition(A,B) = C <-> (all D all E (in(ordered_pair(D,E),C) <-> (exists F (in(ordered_pair(D,F),A) & in(ordered_pair(F,E),B)))))))))))) # label(d8_relat_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 35 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 36 (all A (relation(A) -> (all B (relation(B) -> subset(relation_rng(relation_composition(A,B)),relation_rng(B)))))) # label(t45_relat_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 37 (exists A (relation(A) & empty(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 85.90/86.26 38 -(all A (relation(A) -> (all B (relation(B) -> (subset(relation_dom(A),relation_rng(B)) -> relation_rng(A) = relation_rng(relation_composition(B,A))))))) # label(t47_relat_1) # label(negated_conjecture) # label(non_clause). [assumption]. 85.90/86.26 85.90/86.26 ============================== end of process non-clausal formulas === 85.90/86.26 85.90/86.26 ============================== PROCESS INITIAL CLAUSES =============== 85.90/86.26 85.90/86.26 ============================== PREDICATE ELIMINATION ================= 85.90/86.26 85.90/86.26 ============================== end predicate elimination ============= 85.90/86.26 85.90/86.26 Auto_denials: (non-Horn, no changes). 85.90/86.26 85.90/86.26 Term ordering decisions: 85.90/86.26 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. relation_composition=1. unordered_pair=1. f3=1. f4=1. f6=1. f8=1. f9=1. relation_rng=1. powerset=1. relation_dom=1. singleton=1. f1=1. f5=1. f10=1. f2=1. f7=1. f12=1. f13=1. f14=1. f11=1. 85.90/86.26 85.90/86.26 ============================== end of process initial clauses ======== 85.90/86.26 85.90/86.26 ============================== CLAUSES FOR SEARCH ==================== 85.90/86.26 85.90/86.26 ============================== end of clauses for search ============= 85.90/86.26 85.90/86.26 ============================== SEARCH ================================ 85.90/86.26 85.90/86.26 % Starting search at 0.01 seconds. 85.90/86.26 85.90/86.26 Low Water (keep): wt=177.000, iters=3388 85.90/86.26 85.90/86.26 Low Water (keep): wt=137.000, iters=3345 85.90/86.26 85.90/86.26 Low Water (keep): wt=135.000, iters=3378 85.90/86.26 85.90/86.26 Low Water (keep): wt=131.000, iters=3333 85.90/86.26 85.90/86.26 Low Water (keep): wt=129.000, iters=3367 85.90/86.26 85.90/86.26 Low Water (keep): wt=91.000, iters=3422 85.90/86.26 85.90/86.26 Low Water (keep): wt=89.000, iters=3372 85.90/86.26 85.90/86.26 LoAlarm clock 119.67/120.10 Prover9 interrupted 119.67/120.10 EOF