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.25 % Computer : n140.star.cs.uiowa.edu 0.02/0.25 % Model : x86_64 x86_64 0.02/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.25 % Memory : 32218.625MB 0.02/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.25 % CPULimit : 300 0.02/0.25 % DateTime : Fri Jul 13 14:53:11 CDT 2018 0.02/0.25 % CPUTime : 0.27/0.59 ============================== Prover9 =============================== 0.27/0.59 Prover9 (32) version 2009-11A, November 2009. 0.27/0.59 Process 24203 was started by sandbox on n140.star.cs.uiowa.edu, 0.27/0.59 Fri Jul 13 14:53:12 2018 0.27/0.59 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24171_n140.star.cs.uiowa.edu". 0.27/0.59 ============================== end of head =========================== 0.27/0.59 0.27/0.59 ============================== INPUT ================================= 0.27/0.59 0.27/0.59 % Reading from file /tmp/Prover9_24171_n140.star.cs.uiowa.edu 0.27/0.59 0.27/0.59 set(prolog_style_variables). 0.27/0.59 set(auto2). 0.27/0.59 % set(auto2) -> set(auto). 0.27/0.59 % set(auto) -> set(auto_inference). 0.27/0.59 % set(auto) -> set(auto_setup). 0.27/0.59 % set(auto_setup) -> set(predicate_elim). 0.27/0.59 % set(auto_setup) -> assign(eq_defs, unfold). 0.27/0.59 % set(auto) -> set(auto_limits). 0.27/0.59 % set(auto_limits) -> assign(max_weight, "100.000"). 0.27/0.59 % set(auto_limits) -> assign(sos_limit, 20000). 0.27/0.59 % set(auto) -> set(auto_denials). 0.27/0.59 % set(auto) -> set(auto_process). 0.27/0.59 % set(auto2) -> assign(new_constants, 1). 0.27/0.59 % set(auto2) -> assign(fold_denial_max, 3). 0.27/0.59 % set(auto2) -> assign(max_weight, "200.000"). 0.27/0.59 % set(auto2) -> assign(max_hours, 1). 0.27/0.59 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.27/0.59 % set(auto2) -> assign(max_seconds, 0). 0.27/0.59 % set(auto2) -> assign(max_minutes, 5). 0.27/0.59 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.27/0.59 % set(auto2) -> set(sort_initial_sos). 0.27/0.59 % set(auto2) -> assign(sos_limit, -1). 0.27/0.59 % set(auto2) -> assign(lrs_ticks, 3000). 0.27/0.59 % set(auto2) -> assign(max_megs, 400). 0.27/0.59 % set(auto2) -> assign(stats, some). 0.27/0.59 % set(auto2) -> clear(echo_input). 0.27/0.59 % set(auto2) -> set(quiet). 0.27/0.59 % set(auto2) -> clear(print_initial_clauses). 0.27/0.59 % set(auto2) -> clear(print_given). 0.27/0.59 assign(lrs_ticks,-1). 0.27/0.59 assign(sos_limit,10000). 0.27/0.59 assign(order,kbo). 0.27/0.59 set(lex_order_vars). 0.27/0.59 clear(print_given). 0.27/0.59 0.27/0.59 % formulas(sos). % not echoed (42 formulas) 0.27/0.59 0.27/0.59 ============================== end of input ========================== 0.27/0.59 0.27/0.59 % From the command line: assign(max_seconds, 300). 0.27/0.59 0.27/0.59 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.27/0.59 0.27/0.59 % Formulas that are not ordinary clauses: 0.27/0.59 1 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 2 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 3 (all U all V (strictly_less_than(U,V) <-> -less_than(V,U) & less_than(U,V))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 4 (all U all V all W (less_than(U,V) & less_than(V,W) -> less_than(U,W))) # label(transitivity) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 5 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 6 (all U all V all W remove_slb(insert_slb(U,pair(V,W)),V) = U) # label(ax24) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 7 (all U all V all W all X (less_than(W,X) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,X)))) # label(ax30) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 8 (all U all V all W all X all Y (pair_in_list(U,W,Y) | Y = X & W = V <-> pair_in_list(insert_slb(U,pair(V,X)),W,Y))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 9 (all U all V all W all X (strictly_less_than(X,W) -> update_slb(insert_slb(U,pair(V,X)),W) = insert_slb(update_slb(U,W),pair(V,W)))) # label(ax29) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 10 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 11 (all U all V all W all X (W != V & contains_slb(U,W) -> remove_slb(insert_slb(U,pair(V,X)),W) = insert_slb(remove_slb(U,W),pair(V,X)))) # label(ax25) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 12 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 13 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 14 (all U all V all W lookup_slb(insert_slb(U,pair(V,W)),V) = W) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 15 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 16 (all U all V all W all X (contains_slb(U,W) | W = V <-> contains_slb(insert_slb(U,pair(V,X)),W))) # label(ax21) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 17 (all U all V all W all X (W != V & contains_slb(U,W) -> lookup_slb(U,W) = lookup_slb(insert_slb(U,pair(V,X)),W))) # label(ax27) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 18 (all U all V all W all X (-contains_slb(V,X) -> triple(U,V,bad) = remove_cpq(triple(U,V,W),X))) # label(ax43) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 19 (all U all V all W all X all Y (strictly_less_than(X,Y) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> $F))) # label(ax38) # label(axiom) # label(non_clause). [assumption]. 0.27/0.59 20 (all U all V all W all X triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) = insert_cpq(triple(U,V,W),X)) # label(ax42) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 21 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 22 (all U all V all W all X (create_slb != V & less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) & contains_slb(V,findmin_pqp_res(U)) -> triple(U,update_slb(V,findmin_pqp_res(U)),W) = findmin_cpq_eff(triple(U,V,W)))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 23 (all U all V all W all X (contains_slb(V,X) & strictly_less_than(X,lookup_slb(V,X)) -> triple(remove_pqp(U,X),remove_slb(V,X),bad) = remove_cpq(triple(U,V,W),X))) # label(ax45) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 24 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,insert_cpq(V,W)))) # label(ax32) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 25 (all U all V all W all X (contains_slb(V,X) <-> contains_cpq(triple(U,V,W),X))) # label(ax39) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 26 (all U all V (succ_cpq(U,V) -> succ_cpq(U,findmin_cpq_eff(V)))) # label(ax34) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 27 (all U all V all W all X (-contains_slb(V,findmin_pqp_res(U)) & create_slb != V -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax47) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 28 (all U all V findmin_cpq_res(triple(U,create_slb,V)) = bottom) # label(ax50) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 29 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 30 (all U removemin_cpq_res(U) = findmin_cpq_res(U)) # label(ax53) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 31 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 32 (all U all V (succ_cpq(U,V) -> succ_cpq(U,removemin_cpq_eff(V)))) # label(ax35) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 33 (all U all V all W (succ_cpq(U,V) -> succ_cpq(U,remove_cpq(V,W)))) # label(ax33) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 34 (all U all V all W all X all Y (less_than(Y,X) -> (check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) <-> check_cpq(triple(U,V,W))))) # label(ax37) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 35 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 36 (all U removemin_cpq_eff(U) = remove_cpq(findmin_cpq_eff(U),findmin_cpq_res(U))) # label(ax52) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 37 (all U all V all W all X (V != create_slb -> findmin_pqp_res(U) = findmin_cpq_res(triple(U,V,W)))) # label(ax51) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 38 (all U all V all W all X (V != create_slb & strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))) & contains_slb(V,findmin_pqp_res(U)) -> triple(U,update_slb(V,findmin_pqp_res(U)),bad) = findmin_cpq_eff(triple(U,V,W)))) # label(ax48) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 39 (all U all V all W all X (contains_slb(V,X) & less_than(lookup_slb(V,X),X) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),W))) # label(ax44) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 40 (all U all V findmin_cpq_eff(triple(U,create_slb,V)) = triple(U,create_slb,bad)) # label(ax46) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 41 -(all U all V all W all X (ok(remove_cpq(triple(U,V,W),X)) -> contains_slb(V,X))) # label(l33_co) # label(negated_conjecture) # label(non_clause). [assumption]. 0.27/0.60 0.27/0.60 ============================== end of process non-clausal formulas === 0.27/0.60 0.27/0.60 ============================== PROCESS INITIAL CLAUSES =============== 0.27/0.60 0.27/0.60 ============================== PREDICATE ELIMINATION ================= 0.27/0.60 0.27/0.60 ============================== end predicate elimination ============= 0.27/0.60 0.27/0.60 Auto_denials: (non-Horn, no changes). 0.27/0.60 0.27/0.60 Term ordering decisions: 0.27/0.60 Function symbol KB weights: create_slb=1. bad=1. bottom=1. c1=1. c2=1. c3=1. c4=1. insert_slb=1. pair=1. update_slb=1. lookup_slb=1. remove_cpq=1. remove_slb=1. insert_cpq=1. remove_pqp=1. insert_pqp=1. findmin_pqp_res=1. findmin_cpq_eff=1. findmin_cpq_res=1. removemin_cpq_eff=1. removemin_cpq_res=1. triple=1. 0.27/0.60 0.27/0.60 ============================== end of process initial clauses ======== 0.27/0.60 0.27/0.60 ============================== CLAUSES FOR SEARCH ==================== 0.27/0.60 0.27/0.60 ============================== end of clauses for search ============= 0.27/0.60 0.27/0.60 ============================== SEARCH ================================ 0.27/0.60 0.27/0.60 % Starting search at 0.01 seconds. 0.27/0.60 0.27/0.60 ============================== PROOF ================================= 0.27/0.60 % SZS status Theorem 0.27/0.60 % SZS output start Refutation 0.27/0.60 0.27/0.60 % Proof 1 at 0.01 (+ 0.00) seconds. 0.27/0.60 % Length of proof is 9. 0.27/0.60 % Level of proof is 3. 0.27/0.60 % Maximum clause weight is 14.000. 0.27/0.60 % Given clauses 22. 0.27/0.60 0.27/0.60 18 (all U all V all W all X (-contains_slb(V,X) -> triple(U,V,bad) = remove_cpq(triple(U,V,W),X))) # label(ax43) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 35 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption]. 0.27/0.60 41 -(all U all V all W all X (ok(remove_cpq(triple(U,V,W),X)) -> contains_slb(V,X))) # label(l33_co) # label(negated_conjecture) # label(non_clause). [assumption]. 0.27/0.60 51 ok(remove_cpq(triple(c1,c2,c3),c4)) # label(l33_co) # label(negated_conjecture). [clausify(41)]. 0.27/0.60 58 contains_slb(A,B) | remove_cpq(triple(C,A,D),B) = triple(C,A,bad) # label(ax43) # label(axiom). [clausify(18)]. 0.27/0.60 64 -contains_slb(c2,c4) # label(l33_co) # label(negated_conjecture). [clausify(41)]. 0.27/0.60 66 -ok(triple(A,B,bad)) # label(ax40) # label(axiom). [clausify(35)]. 0.27/0.60 103 remove_cpq(triple(A,c2,B),c4) = triple(A,c2,bad). [resolve(64,a,58,a)]. 0.27/0.60 104 $F. [back_rewrite(51),rewrite([103(6)]),unit_del(a,66)]. 0.27/0.60 0.27/0.60 % SZS output end Refutation 0.27/0.60 ============================== end of proof ========================== 0.27/0.60 0.27/0.60 ============================== STATISTICS ============================ 0.27/0.60 0.27/0.60 Given=22. Generated=78. Kept=58. proofs=1. 0.27/0.60 Usable=21. Sos=35. Demods=10. Limbo=1, Disabled=53. Hints=0. 0.27/0.60 Megabytes=0.19. 0.27/0.60 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. 0.27/0.60 0.27/0.60 ============================== end of statistics ===================== 0.27/0.60 0.27/0.60 ============================== end of search ========================= 0.27/0.60 0.27/0.60 THEOREM PROVED 0.27/0.60 % SZS status Theorem 0.27/0.60 0.27/0.60 Exiting with 1 proof. 0.27/0.60 0.27/0.60 Process 24203 exit (max_proofs) Fri Jul 13 14:53:12 2018 0.27/0.60 Prover9 interrupted 0.27/0.60 EOF