0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n148.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 05:14:54 CDT 2018 0.02/0.23 % CPUTime : 0.06/0.43 ============================== Prover9 =============================== 0.06/0.43 Prover9 (32) version 2009-11A, November 2009. 0.06/0.43 Process 3345 was started by sandbox on n148.star.cs.uiowa.edu, 0.06/0.43 Sat Jul 14 05:14:55 2018 0.06/0.43 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3313_n148.star.cs.uiowa.edu". 0.06/0.43 ============================== end of head =========================== 0.06/0.43 0.06/0.43 ============================== INPUT ================================= 0.06/0.43 0.06/0.43 % Reading from file /tmp/Prover9_3313_n148.star.cs.uiowa.edu 0.06/0.43 0.06/0.43 set(prolog_style_variables). 0.06/0.43 set(auto2). 0.06/0.43 % set(auto2) -> set(auto). 0.06/0.43 % set(auto) -> set(auto_inference). 0.06/0.43 % set(auto) -> set(auto_setup). 0.06/0.43 % set(auto_setup) -> set(predicate_elim). 0.06/0.43 % set(auto_setup) -> assign(eq_defs, unfold). 0.06/0.43 % set(auto) -> set(auto_limits). 0.06/0.43 % set(auto_limits) -> assign(max_weight, "100.000"). 0.06/0.43 % set(auto_limits) -> assign(sos_limit, 20000). 0.06/0.43 % set(auto) -> set(auto_denials). 0.06/0.43 % set(auto) -> set(auto_process). 0.06/0.43 % set(auto2) -> assign(new_constants, 1). 0.06/0.43 % set(auto2) -> assign(fold_denial_max, 3). 0.06/0.43 % set(auto2) -> assign(max_weight, "200.000"). 0.06/0.43 % set(auto2) -> assign(max_hours, 1). 0.06/0.43 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.06/0.43 % set(auto2) -> assign(max_seconds, 0). 0.06/0.43 % set(auto2) -> assign(max_minutes, 5). 0.06/0.43 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.06/0.43 % set(auto2) -> set(sort_initial_sos). 0.06/0.43 % set(auto2) -> assign(sos_limit, -1). 0.06/0.43 % set(auto2) -> assign(lrs_ticks, 3000). 0.06/0.43 % set(auto2) -> assign(max_megs, 400). 0.06/0.43 % set(auto2) -> assign(stats, some). 0.06/0.43 % set(auto2) -> clear(echo_input). 0.06/0.43 % set(auto2) -> set(quiet). 0.06/0.43 % set(auto2) -> clear(print_initial_clauses). 0.06/0.43 % set(auto2) -> clear(print_given). 0.06/0.43 assign(lrs_ticks,-1). 0.06/0.43 assign(sos_limit,10000). 0.06/0.43 assign(order,kbo). 0.06/0.43 set(lex_order_vars). 0.06/0.43 clear(print_given). 0.06/0.43 0.06/0.43 % formulas(sos). % not echoed (9 formulas) 0.06/0.43 0.06/0.43 ============================== end of input ========================== 0.06/0.43 0.06/0.43 % From the command line: assign(max_seconds, 300). 0.06/0.43 0.06/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.06/0.43 0.06/0.43 % Formulas that are not ordinary clauses: 0.06/0.43 1 (all B all C (B = C <-> (all D (member(D,C) <-> member(D,B))))) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 2 (all B all C ((all D (member(D,C) <-> member(D,B))) -> C = B)) # label(member_equal) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 3 (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.06/0.43 4 (all B all C intersection(B,C) = intersection(C,B)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 5 (all B all C (subset(C,B) & subset(B,C) <-> C = B)) # label(equal_defn) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 6 (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.06/0.43 7 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 8 (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.06/0.43 9 -(all B all C all D intersection(B,difference(C,D)) = difference(intersection(B,C),D)) # label(prove_difference_and_intersection) # label(negated_conjecture) # label(non_clause). [assumption]. 0.06/0.43 0.06/0.43 ============================== end of process non-clausal formulas === 0.06/0.43 0.06/0.43 ============================== PROCESS INITIAL CLAUSES =============== 0.06/0.43 0.06/0.43 ============================== PREDICATE ELIMINATION ================= 0.06/0.43 0.06/0.43 ============================== end predicate elimination ============= 0.06/0.43 0.06/0.43 Auto_denials: (non-Horn, no changes). 0.06/0.43 0.06/0.43 Term ordering decisions: 0.06/0.43 Function symbol KB weights: c1=1. c2=1. c3=1. intersection=1. difference=1. f1=1. f2=1. f3=1. 0.06/0.43 0.06/0.43 ============================== end of process initial clauses ======== 0.06/0.43 0.06/0.43 ============================== CLAUSES FOR SEARCH ==================== 0.06/0.43 0.06/0.43 ============================== end of clausCputime limit exceeded (core dumped) 300.02/300.22 EOF