0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.33 % Computer : n010.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 02:41:50 EDT 2022 0.13/0.34 % CPUTime : 0.73/0.99 ============================== Prover9 =============================== 0.73/0.99 Prover9 (32) version 2009-11A, November 2009. 0.73/0.99 Process 4825 was started by sandbox on n010.cluster.edu, 0.73/0.99 Tue Aug 9 02:41:51 2022 0.73/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_4585_n010.cluster.edu". 0.73/0.99 ============================== end of head =========================== 0.73/0.99 0.73/0.99 ============================== INPUT ================================= 0.73/0.99 0.73/0.99 % Reading from file /tmp/Prover9_4585_n010.cluster.edu 0.73/0.99 0.73/0.99 set(prolog_style_variables). 0.73/0.99 set(auto2). 0.73/0.99 % set(auto2) -> set(auto). 0.73/0.99 % set(auto) -> set(auto_inference). 0.73/0.99 % set(auto) -> set(auto_setup). 0.73/0.99 % set(auto_setup) -> set(predicate_elim). 0.73/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.73/0.99 % set(auto) -> set(auto_limits). 0.73/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.73/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.73/0.99 % set(auto) -> set(auto_denials). 0.73/0.99 % set(auto) -> set(auto_process). 0.73/0.99 % set(auto2) -> assign(new_constants, 1). 0.73/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.73/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.73/0.99 % set(auto2) -> assign(max_hours, 1). 0.73/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.73/0.99 % set(auto2) -> assign(max_seconds, 0). 0.73/0.99 % set(auto2) -> assign(max_minutes, 5). 0.73/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.73/0.99 % set(auto2) -> set(sort_initial_sos). 0.73/0.99 % set(auto2) -> assign(sos_limit, -1). 0.73/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.73/0.99 % set(auto2) -> assign(max_megs, 400). 0.73/0.99 % set(auto2) -> assign(stats, some). 0.73/0.99 % set(auto2) -> clear(echo_input). 0.73/0.99 % set(auto2) -> set(quiet). 0.73/0.99 % set(auto2) -> clear(print_initial_clauses). 0.73/0.99 % set(auto2) -> clear(print_given). 0.73/0.99 assign(lrs_ticks,-1). 0.73/0.99 assign(sos_limit,10000). 0.73/0.99 assign(order,kbo). 0.73/0.99 set(lex_order_vars). 0.73/0.99 clear(print_given). 0.73/0.99 0.73/0.99 % formulas(sos). % not echoed (2 formulas) 0.73/0.99 0.73/0.99 ============================== end of input ========================== 0.73/0.99 0.73/0.99 % From the command line: assign(max_seconds, 960). 0.73/0.99 0.73/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.73/0.99 0.73/0.99 % Formulas that are not ordinary clauses: 0.73/0.99 1 (exists A exists B exists C (predicate2(C,kill,A,AuntAgatha) & (all D all E (predicate1(E,live,D) & modifier_pp(E,in,DreadburyMansion) -> AuntAgatha = D | Charles = D | Butler = D)) & (all F all G all H (predicate2(H,kill,F,G) -> (exists I predicate2(I,hate,F,G)))) & (all N all O (predicate2(O,hate,AuntAgatha,N) -> -(exists P predicate2(P,hate,Charles,N)))) & -(exists Q predicate2(Q,hate,AuntAgatha,Butler)) & (all R (Butler != R -> (exists S predicate2(S,hate,AuntAgatha,R)))) & AuntAgatha != Butler & (all Z -(all A1 exists B1 predicate2(B1,hate,Z,A1))) & (all W all X (predicate2(X,hate,AuntAgatha,W) -> (exists Y predicate2(Y,hate,Butler,W)))) & (all T (-(exists U (U = T & property2(U,rich,comp_than,AuntAgatha))) -> (exists V predicate2(V,hate,Butler,T)))) & (all J -(exists K exists L exists M (predicate2(L,kill,J,K) & property2(M,rich,comp_than,K) & M = J))) & modifier_pp(B,in,DreadburyMansion) & predicate1(B,live,A))) # label(background) # label(axiom) # label(non_clause). [assumption]. 0.73/0.99 2 -(exists A predicate2(A,kill,AuntAgatha,AuntAgatha)) # label(prove) # label(negated_conjecture) # label(non_clause). [assumption]. 0.73/0.99 0.73/0.99 ============================== end of process non-clausal formulas === 0.73/0.99 0.73/0.99 ============================== PROCESS INITIAL CLAUSES =============== 0.73/0.99 0.73/0.99 ============================== PREDICATE ELIMINATION ================= 0.73/0.99 0.73/0.99 ============================== end predicate elimination ============= 0.73/0.99 0.73/0.99 Auto_denials: (non-Horn, no changes). 0.73/0.99 0.73/0.99 Term ordering decisions: 0.73/0.99 Function symbol KB weights: hate=1. in=1. kill=1. live=1. comp_than=1. rich=1. f1=1. f2=1. f3=1. f5=1. f6=1. f8=1. f9=1. f7=1. f4=1. 0.73/0.99 0.73/0.99 ============================== PROOF ================================= 0.73/0.99 % SZS status Theorem 0.73/0.99 % SZS output start Refutation 0.73/0.99 0.73/0.99 % Proof 1 at 0.01 (+ 0.00) seconds. 0.73/0.99 % Length of proof is 3. 0.73/0.99 % Level of proof is 2. 0.73/0.99 % Maximum clause weight is 0.000. 0.73/0.99 % Given clauses 0. 0.73/0.99 0.73/0.99 1 (exists A exists B exists C (predicate2(C,kill,A,AuntAgatha) & (all D all E (predicate1(E,live,D) & modifier_pp(E,in,DreadburyMansion) -> AuntAgatha = D | Charles = D | Butler = D)) & (all F all G all H (predicate2(H,kill,F,G) -> (exists I predicate2(I,hate,F,G)))) & (all N all O (predicate2(O,hate,AuntAgatha,N) -> -(exists P predicate2(P,hate,Charles,N)))) & -(exists Q predicate2(Q,hate,AuntAgatha,Butler)) & (all R (Butler != R -> (exists S predicate2(S,hate,AuntAgatha,R)))) & AuntAgatha != Butler & (all Z -(all A1 exists B1 predicate2(B1,hate,Z,A1))) & (all W all X (predicate2(X,hate,AuntAgatha,W) -> (exists Y predicate2(Y,hate,Butler,W)))) & (all T (-(exists U (U = T & property2(U,rich,comp_than,AuntAgatha))) -> (exists V predicate2(V,hate,Butler,T)))) & (all J -(exists K exists L exists M (predicate2(L,kill,J,K) & property2(M,rich,comp_than,K) & M = J))) & modifier_pp(B,in,DreadburyMansion) & predicate1(B,live,A))) # label(background) # label(axiom) # label(non_clause). [assumption]. 0.73/0.99 9 A != B # label(background) # label(axiom). [clausify(1)]. 0.73/0.99 10 $F. [copy(9),xx(a)]. 0.73/0.99 0.73/0.99 % SZS output end Refutation 0.73/0.99 ============================== end of proof ========================== 0.73/0.99 0.73/0.99 ============================== STATISTICS ============================ 0.73/0.99 0.73/0.99 Given=0. Generated=7. Kept=6. proofs=1. 0.73/0.99 Usable=0. Sos=0. Demods=0. Limbo=6, Disabled=7. Hints=0. 0.73/0.99 Megabytes=0.07. 0.73/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. 0.73/0.99 0.73/0.99 ============================== end of statistics ===================== 0.73/0.99 0.73/0.99 ============================== end of search ========================= 0.73/0.99 0.73/0.99 THEOREM PROVED 0.73/0.99 % SZS status Theorem 0.73/0.99 0.73/0.99 Exiting with 1 proof. 0.73/0.99 0.73/0.99 Process 4825 exit (max_proofs) Tue Aug 9 02:41:51 2022 0.73/0.99 Prover9 interrupted 0.73/1.00 EOF