0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n027.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 : 1200 0.12/0.34 % DateTime : Tue Jul 13 16:54:55 EDT 2021 0.12/0.34 % CPUTime : 0.77/1.08 ============================== Prover9 =============================== 0.77/1.08 Prover9 (32) version 2009-11A, November 2009. 0.77/1.08 Process 17959 was started by sandbox on n027.cluster.edu, 0.77/1.08 Tue Jul 13 16:54:56 2021 0.77/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_17717_n027.cluster.edu". 0.77/1.08 ============================== end of head =========================== 0.77/1.08 0.77/1.08 ============================== INPUT ================================= 0.77/1.08 0.77/1.08 % Reading from file /tmp/Prover9_17717_n027.cluster.edu 0.77/1.08 0.77/1.08 set(prolog_style_variables). 0.77/1.08 set(auto2). 0.77/1.08 % set(auto2) -> set(auto). 0.77/1.08 % set(auto) -> set(auto_inference). 0.77/1.08 % set(auto) -> set(auto_setup). 0.77/1.08 % set(auto_setup) -> set(predicate_elim). 0.77/1.08 % set(auto_setup) -> assign(eq_defs, unfold). 0.77/1.08 % set(auto) -> set(auto_limits). 0.77/1.08 % set(auto_limits) -> assign(max_weight, "100.000"). 0.77/1.08 % set(auto_limits) -> assign(sos_limit, 20000). 0.77/1.08 % set(auto) -> set(auto_denials). 0.77/1.08 % set(auto) -> set(auto_process). 0.77/1.08 % set(auto2) -> assign(new_constants, 1). 0.77/1.08 % set(auto2) -> assign(fold_denial_max, 3). 0.77/1.08 % set(auto2) -> assign(max_weight, "200.000"). 0.77/1.08 % set(auto2) -> assign(max_hours, 1). 0.77/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.77/1.08 % set(auto2) -> assign(max_seconds, 0). 0.77/1.08 % set(auto2) -> assign(max_minutes, 5). 0.77/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.77/1.08 % set(auto2) -> set(sort_initial_sos). 0.77/1.08 % set(auto2) -> assign(sos_limit, -1). 0.77/1.08 % set(auto2) -> assign(lrs_ticks, 3000). 0.77/1.08 % set(auto2) -> assign(max_megs, 400). 0.77/1.08 % set(auto2) -> assign(stats, some). 0.77/1.08 % set(auto2) -> clear(echo_input). 0.77/1.08 % set(auto2) -> set(quiet). 0.77/1.08 % set(auto2) -> clear(print_initial_clauses). 0.77/1.08 % set(auto2) -> clear(print_given). 0.77/1.08 assign(lrs_ticks,-1). 0.77/1.08 assign(sos_limit,10000). 0.77/1.08 assign(order,kbo). 0.77/1.08 set(lex_order_vars). 0.77/1.08 clear(print_given). 0.77/1.08 0.77/1.08 % formulas(sos). % not echoed (10 formulas) 0.77/1.08 0.77/1.08 ============================== end of input ========================== 0.77/1.08 0.77/1.08 % From the command line: assign(max_seconds, 1200). 0.77/1.08 0.77/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.77/1.08 0.77/1.08 % Formulas that are not ordinary clauses: 0.77/1.08 1 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 2 (all B all C all D (member(D,intersection(B,C)) <-> member(D,B) & member(D,C))) # label(intersection_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 3 (all B all C ((all D (member(D,B) <-> member(D,C))) <-> B = C)) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 4 (all B all C all D (member(D,difference(B,C)) <-> -member(D,C) & member(D,B))) # label(difference_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 5 (all B all C (subset(B,C) & subset(C,B) <-> C = B)) # label(equal_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 6 (all B all C all D (member(D,B) | member(D,C) <-> member(D,union(B,C)))) # label(union_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 7 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 8 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 9 (all B all C intersection(C,B) = intersection(B,C)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause). [assumption]. 0.77/1.08 10 -(all B all C union(intersection(B,C),difference(B,C)) = B) # label(prove_union_intersection_difference) # label(negated_conjecture) # label(non_clause). [assumption]. 0.77/1.08 0.77/1.08 ============================== end of process non-clausal formulas === 0.77/1.08 0.77/1.08 ============================== PROCESS INITIAL CLAUSES =============== 0.77/1.08 0.77/1.08 ============================== PREDICATE ELIMINATION ================= 0.77/1.08 0.77/1.08 ============================== end predicate elimination ============= 0.77/1.08 0.77/1.08 Auto_denials: (non-Horn, no changes). 0.77/1.08 0.77/1.08 Term ordering decisions: 0.77/1.08 Function symbol KB weights: c1=1. c2=1. intersection=1. union=1. difference=1. f1=1. f2=1. 0.77/1.08 0.77/1.08 ============================== end of process initial clauses ======== 0.77/1.08 0.77/1.08 =======================Alarm clock 119.79/120.06 Prover9 interrupted 119.79/120.06 EOF