TSTP Solution File: SWV375+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV375+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 21:12:27 EDT 2022
% Result : Unknown 0.86s 1.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV375+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 20:58:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.85/1.09 ============================== Prover9 ===============================
% 0.85/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.85/1.09 Process 7418 was started by sandbox2 on n025.cluster.edu,
% 0.85/1.09 Tue Jun 14 20:58:40 2022
% 0.85/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7265_n025.cluster.edu".
% 0.85/1.09 ============================== end of head ===========================
% 0.85/1.09
% 0.85/1.09 ============================== INPUT =================================
% 0.85/1.09
% 0.85/1.09 % Reading from file /tmp/Prover9_7265_n025.cluster.edu
% 0.85/1.09
% 0.85/1.09 set(prolog_style_variables).
% 0.85/1.09 set(auto2).
% 0.85/1.09 % set(auto2) -> set(auto).
% 0.85/1.09 % set(auto) -> set(auto_inference).
% 0.85/1.09 % set(auto) -> set(auto_setup).
% 0.85/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.85/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.85/1.09 % set(auto) -> set(auto_limits).
% 0.85/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.85/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.85/1.09 % set(auto) -> set(auto_denials).
% 0.85/1.09 % set(auto) -> set(auto_process).
% 0.85/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.85/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.85/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.85/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.85/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.85/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.85/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.85/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.85/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.85/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.85/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.85/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.85/1.09 % set(auto2) -> assign(stats, some).
% 0.85/1.09 % set(auto2) -> clear(echo_input).
% 0.85/1.09 % set(auto2) -> set(quiet).
% 0.85/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.85/1.09 % set(auto2) -> clear(print_given).
% 0.85/1.09 assign(lrs_ticks,-1).
% 0.85/1.09 assign(sos_limit,10000).
% 0.85/1.09 assign(order,kbo).
% 0.85/1.09 set(lex_order_vars).
% 0.85/1.09 clear(print_given).
% 0.85/1.09
% 0.85/1.09 % formulas(sos). % not echoed (64 formulas)
% 0.85/1.09
% 0.85/1.09 ============================== end of input ==========================
% 0.85/1.09
% 0.85/1.09 % From the command line: assign(max_seconds, 300).
% 0.85/1.09
% 0.85/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.85/1.09
% 0.85/1.09 % Formulas that are not ordinary clauses:
% 0.85/1.09 1 (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.85/1.09 2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 4 (all U all V (strictly_less_than(U,V) <-> less_than(U,V) & -less_than(V,U))) # label(stricly_smaller_definition) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 6 (all U all V isnonempty_pq(insert_pq(U,V))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 7 (all U -contains_pq(create_pq,U)) # label(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 8 (all U all V all W (contains_pq(insert_pq(U,V),W) <-> contains_pq(U,W) | V = W)) # label(ax9) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 9 (all U all V (issmallestelement_pq(U,V) <-> (all W (contains_pq(U,W) -> less_than(V,W))))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 10 (all U all V remove_pq(insert_pq(U,V),V) = U) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 11 (all U all V all W (contains_pq(U,W) & V != W -> remove_pq(insert_pq(U,V),W) = insert_pq(remove_pq(U,W),V))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 12 (all U all V (contains_pq(U,V) & issmallestelement_pq(U,V) -> findmin_pq_eff(U,V) = U)) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 13 (all U all V (contains_pq(U,V) & issmallestelement_pq(U,V) -> findmin_pq_res(U,V) = V)) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 14 (all U all V (contains_pq(U,V) & issmallestelement_pq(U,V) -> removemin_pq_eff(U,V) = remove_pq(U,V))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 15 (all U all V (contains_pq(U,V) & issmallestelement_pq(U,V) -> removemin_pq_res(U,V) = V)) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 16 (all U all V all W insert_pq(insert_pq(U,V),W) = insert_pq(insert_pq(U,W),V)) # label(ax17) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 17 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 18 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 19 (all U all V all W all X (contains_slb(insert_slb(U,pair(V,X)),W) <-> contains_slb(U,W) | V = W)) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 20 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 21 (all U all V all W all X all Y (pair_in_list(insert_slb(U,pair(V,X)),W,Y) <-> pair_in_list(U,W,Y) | V = W & X = Y)) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 22 (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.85/1.10 23 (all U all V all W all X (V != W & 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.85/1.10 24 (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.85/1.10 25 (all U all V all W all X (V != W & contains_slb(U,W) -> lookup_slb(insert_slb(U,pair(V,X)),W) = lookup_slb(U,W))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 26 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 27 (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.85/1.10 28 (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.85/1.10 29 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 30 (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.85/1.10 31 (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.85/1.10 32 (all U all V (succ_cpq(U,V) -> succ_cpq(U,findmin_cpq_eff(V)))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 33 (all U all V (succ_cpq(U,V) -> succ_cpq(U,removemin_cpq_eff(V)))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 34 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 35 (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.85/1.10 36 (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.85/1.10 37 (all U all V all W all X (contains_cpq(triple(U,V,W),X) <-> contains_slb(V,X))) # label(ax39) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 38 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 39 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 40 (all U all V all W all X insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W)) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 41 (all U all V all W all X (-contains_slb(V,X) -> remove_cpq(triple(U,V,W),X) = triple(U,V,bad))) # label(ax43) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 42 (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.85/1.10 43 (all U all V all W all X (contains_slb(V,X) & strictly_less_than(X,lookup_slb(V,X)) -> remove_cpq(triple(U,V,W),X) = triple(remove_pqp(U,X),remove_slb(V,X),bad))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 44 (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.85/1.10 45 (all U all V all W all X (V != create_slb & -contains_slb(V,findmin_pqp_res(U)) -> 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.85/1.10 46 (all U all V all W all X (V != create_slb & contains_slb(V,findmin_pqp_res(U)) & strictly_less_than(findmin_pqp_res(U),lookup_slb(V,findmin_pqp_res(U))) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 47 (all U all V all W all X (V != create_slb & contains_slb(V,findmin_pqp_res(U)) & less_than(lookup_slb(V,findmin_pqp_res(U)),findmin_pqp_res(U)) -> findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),W))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 48 (all U all V findmin_cpq_res(triple(U,create_slb,V)) = bottom) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 49 (all U all V all W all X (V != create_slb -> findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 50 (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.85/1.10 51 (all U removemin_cpq_res(U) = findmin_cpq_res(U)) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 52 (all U all V i(triple(U,create_slb,V)) = create_pq) # label(ax54) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 53 (all U all V all W all X all Y i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X)) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 54 (all U all V (pi_sharp_remove(U,V) <-> contains_pq(U,V))) # label(ax56) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 55 (all U all V (pi_remove(U,V) <-> pi_sharp_remove(i(U),V))) # label(ax57) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 56 (all U all V (pi_sharp_find_min(U,V) <-> contains_pq(U,V) & issmallestelement_pq(U,V))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 57 (all U (pi_find_min(U) <-> (exists V pi_sharp_find_min(i(U),V)))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 58 (all U all V (pi_sharp_removemin(U,V) <-> contains_pq(U,V) & issmallestelement_pq(U,V))) # label(ax60) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 59 (all U (pi_removemin(U) <-> (exists V pi_sharp_find_min(i(U),V)))) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 60 (all U (phi(U) <-> (exists V (succ_cpq(U,V) & ok(V) & check_cpq(V))))) # label(ax62) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 61 (all U all V all W (-ok(triple(U,V,W)) -> (all X all Y all Z (succ_cpq(triple(U,V,W),triple(X,Y,Z)) -> -ok(triple(X,Y,Z)))))) # label(l11_l12) # label(lemma) # label(non_clause). [assumption].
% 0.85/1.10 62 -(all U all V all W (-ok(triple(U,V,W)) -> -phi(triple(U,V,W)))) # label(l11_co) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.85/1.10
% 0.85/1.10 ============================== end of process non-clausal formulas ===
% 0.85/1.10
% 0.85/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.85/1.10
% 0.85/1.10 ============================== PREDICATE ELIMINATION =================
% 0.85/1.10 63 -phi(A) | ok(f4(A)) # label(ax62) # label(axiom). [clausify(60)].
% 0.85/1.10 64 phi(triple(c1,c2,c3)) # label(l11_co) # label(negated_conjecture). [clausify(62)].
% 0.85/1.10 Derived: ok(f4(triple(c1,c2,c3))). [resolve(63,a,64,a)].
% 0.85/1.10 65 -phi(A) | check_cpq(f4(A)) # label(ax62) # label(axiom). [clausify(60)].
% 0.85/1.10 Derived: check_cpq(f4(triple(c1,c2,c3))). [resolve(65,a,64,a)].
% 0.85/1.10 66 -phi(A) | succ_cpq(A,f4(A)) # label(ax62) # label(axiom). [clausify(60)].
% 0.85/1.10 Derived: succ_cpq(triple(c1,c2,c3),f4(triple(c1,c2,c3))). [resolve(66,a,64,a)].
% 0.85/1.10 67 phi(A) | -succ_cpq(A,B) | -ok(B) | -check_cpq(B) # label(ax62) # label(axiom). [clausify(60)].
% 0.85/1.10 Derived: -succ_cpq(A,B) | -ok(B) | -check_cpq(B) | ok(f4(A)). [resolve(67,a,63,a)].
% 0.85/1.10 Derived: -succ_cpq(A,B) | -ok(B) | -check_cpq(B) | check_cpq(f4(A)). [resolve(67,a,65,a)].
% 0.85/1.10 Derived: -succ_cpq(A,B) | -ok(B) | -check_cpq(B) | succ_cpq(A,f4(A)). [resolve(67,a,66,a)].
% 0.85/1.10 68 -issmallestelement_pq(A,B) | -contains_pq(A,C) | less_than(B,C) # label(ax10) # label(axiom). [clausify(9)].
% 0.85/1.10 69 issmallestelement_pq(A,B) | contains_pq(A,f1(A,B)) # label(ax10) # label(axiom). [clausify(9)].
% 0.85/1.10 70 -pi_sharp_find_min(A,B) | issmallestelement_pq(A,B) # label(ax58) # label(axiom). [clausify(56)].
% 0.85/1.10 71 -pi_sharp_removemin(A,B) | issmallestelement_pq(A,B) # label(ax60) # label(axiom). [clausify(58)].
% 0.85/1.10 72 issmallestelement_pq(A,B) | -less_than(B,f1(A,B)) # label(ax10) # label(axiom). [clausify(9)].
% 0.85/1.10 Derived: -contains_pq(A,B) | less_than(C,B) | contains_pq(A,f1(A,C)). [resolve(68,a,69,a)].
% 0.85/1.10 Derived: -contains_pq(A,B) | less_than(C,B) | -pi_sharp_find_min(A,C). [resolve(68,a,70,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | less_than(C,B) | -pi_sharp_removemin(A,C). [resolve(68,a,71,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | less_than(C,B) | -less_than(C,f1(A,C)). [resolve(68,a,72,a)].
% 0.85/1.10 73 pi_sharp_find_min(A,B) | -contains_pq(A,B) | -issmallestelement_pq(A,B) # label(ax58) # label(axiom). [clausify(56)].
% 0.85/1.10 Derived: pi_sharp_find_min(A,B) | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(73,c,69,a)].
% 0.85/1.10 Derived: pi_sharp_find_min(A,B) | -contains_pq(A,B) | -pi_sharp_removemin(A,B). [resolve(73,c,71,b)].
% 0.85/1.10 Derived: pi_sharp_find_min(A,B) | -contains_pq(A,B) | -less_than(B,f1(A,B)). [resolve(73,c,72,a)].
% 0.85/1.10 74 pi_sharp_removemin(A,B) | -contains_pq(A,B) | -issmallestelement_pq(A,B) # label(ax60) # label(axiom). [clausify(58)].
% 0.85/1.10 Derived: pi_sharp_removemin(A,B) | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(74,c,69,a)].
% 0.85/1.10 Derived: pi_sharp_removemin(A,B) | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(74,c,70,b)].
% 0.85/1.10 Derived: pi_sharp_removemin(A,B) | -contains_pq(A,B) | -less_than(B,f1(A,B)). [resolve(74,c,72,a)].
% 0.85/1.10 75 -contains_pq(A,B) | -issmallestelement_pq(A,B) | findmin_pq_eff(A,B) = A # label(ax13) # label(axiom). [clausify(12)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | contains_pq(A,f1(A,B)). [resolve(75,b,69,a)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -pi_sharp_find_min(A,B). [resolve(75,b,70,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -pi_sharp_removemin(A,B). [resolve(75,b,71,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -less_than(B,f1(A,B)). [resolve(75,b,72,a)].
% 0.85/1.10 76 -contains_pq(A,B) | -issmallestelement_pq(A,B) | findmin_pq_res(A,B) = B # label(ax14) # label(axiom). [clausify(13)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | contains_pq(A,f1(A,B)). [resolve(76,b,69,a)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | -pi_sharp_find_min(A,B). [resolve(76,b,70,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | -pi_sharp_removemin(A,B). [resolve(76,b,71,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | -less_than(B,f1(A,B)). [resolve(76,b,72,a)].
% 0.85/1.10 77 -contains_pq(A,B) | -issmallestelement_pq(A,B) | removemin_pq_res(A,B) = B # label(ax16) # label(axiom). [clausify(15)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | contains_pq(A,f1(A,B)). [resolve(77,b,69,a)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | -pi_sharp_find_min(A,B). [resolve(77,b,70,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | -pi_sharp_removemin(A,B). [resolve(77,b,71,b)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | -less_than(B,f1(A,B)). [resolve(77,b,72,a)].
% 0.85/1.10 78 -contains_pq(A,B) | -issmallestelement_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) # label(ax15) # label(axiom). [clausify(14)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(78,b,69,a)].
% 0.85/1.10 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(78,b,70,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -pi_sharp_removemin(A,B). [resolve(78,b,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -less_than(B,f1(A,B)). [resolve(78,b,72,a)].
% 0.85/1.11 79 -pi_find_min(A) | pi_sharp_find_min(i(A),f2(A)) # label(ax59) # label(axiom). [clausify(57)].
% 0.85/1.11 80 pi_find_min(A) | -pi_sharp_find_min(i(A),B) # label(ax59) # label(axiom). [clausify(57)].
% 0.85/1.11 Derived: pi_sharp_find_min(i(A),f2(A)) | -pi_sharp_find_min(i(A),B). [resolve(79,a,80,a)].
% 0.85/1.11 81 pi_sharp_removemin(A,B) | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(74,c,69,a)].
% 0.85/1.11 82 -pi_sharp_removemin(A,B) | contains_pq(A,B) # label(ax60) # label(axiom). [clausify(58)].
% 0.85/1.11 83 -contains_pq(A,B) | less_than(C,B) | -pi_sharp_removemin(A,C). [resolve(68,a,71,b)].
% 0.85/1.11 84 pi_sharp_find_min(A,B) | -contains_pq(A,B) | -pi_sharp_removemin(A,B). [resolve(73,c,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | contains_pq(A,f1(A,B)) | -contains_pq(A,C) | less_than(B,C). [resolve(81,a,83,c)].
% 0.85/1.11 Derived: -contains_pq(A,B) | contains_pq(A,f1(A,B)) | pi_sharp_find_min(A,B) | -contains_pq(A,B). [resolve(81,a,84,c)].
% 0.85/1.11 85 pi_sharp_removemin(A,B) | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(74,c,70,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | -pi_sharp_find_min(A,B) | -contains_pq(A,C) | less_than(B,C). [resolve(85,a,83,c)].
% 0.85/1.11 86 pi_sharp_removemin(A,B) | -contains_pq(A,B) | -less_than(B,f1(A,B)). [resolve(74,c,72,a)].
% 0.85/1.11 Derived: -contains_pq(A,B) | -less_than(B,f1(A,B)) | -contains_pq(A,C) | less_than(B,C). [resolve(86,a,83,c)].
% 0.85/1.11 Derived: -contains_pq(A,B) | -less_than(B,f1(A,B)) | pi_sharp_find_min(A,B) | -contains_pq(A,B). [resolve(86,a,84,c)].
% 0.85/1.11 87 -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -pi_sharp_removemin(A,B). [resolve(75,b,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(87,c,81,a)].
% 0.85/1.11 Derived: -contains_pq(A,B) | findmin_pq_eff(A,B) = A | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(87,c,85,a)].
% 0.85/1.11 88 -contains_pq(A,B) | findmin_pq_res(A,B) = B | -pi_sharp_removemin(A,B). [resolve(76,b,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(88,c,81,a)].
% 0.85/1.11 Derived: -contains_pq(A,B) | findmin_pq_res(A,B) = B | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(88,c,85,a)].
% 0.85/1.11 89 -contains_pq(A,B) | removemin_pq_res(A,B) = B | -pi_sharp_removemin(A,B). [resolve(77,b,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(89,c,81,a)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_res(A,B) = B | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(89,c,85,a)].
% 0.85/1.11 90 -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -pi_sharp_removemin(A,B). [resolve(78,b,71,b)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -contains_pq(A,B) | contains_pq(A,f1(A,B)). [resolve(90,c,81,a)].
% 0.85/1.11 Derived: -contains_pq(A,B) | removemin_pq_eff(A,B) = remove_pq(A,B) | -contains_pq(A,B) | -pi_sharp_find_min(A,B). [resolve(90,c,85,a)].
% 0.85/1.11 91 -pi_removemin(A) | pi_sharp_find_min(i(A),f3(A)) # label(ax61) # label(axiom). [clausify(59)].
% 0.85/1.11 92 pi_removemin(A) | -pi_sharp_find_min(i(A),B) # label(ax61) # label(axiom). [clausify(59)].
% 0.85/1.11 Derived: pi_sharp_find_min(i(A),f3(A)) | -pi_sharp_find_min(i(A),B). [resolve(91,a,92,a)].
% 0.85/1.11 93 pi_remove(A,B) | -pi_sharp_remove(i(A),B) # label(ax57) # label(axiom). [clausify(55)].
% 0.85/1.11 94 -pi_remove(A,B) | pi_sharp_remove(i(A),B) # label(ax57) # label(axiom). [clausify(55)].
% 0.85/1.11 95 pi_sharp_remove(A,B) | -contains_pq(A,B) # label(ax56) # label(axiom). [clausify(54)].
% 0.85/1.11 96 -pi_sharp_remove(A,B) | contains_pq(A,B) # label(ax56) # label(axiom). [clausify(54)].
% 0.85/1.11
% 0.85/1.11 ============================== end predicate elimination =============
% 0.85/1.11
% 0.85/1.11 Auto_denials: (non-Horn, no changes).
% 0.85/1.11
% 0.85/1.11 Term ordering decisions:
% 0.85/1.11 Function symbol KB weights: create_slb=1. bad=1. bottom=1. create_pq=1. c1=1. c2=1. c3=1. insert_slb=1. pa
% 0.86/1.31 Fatal error: renum_vars_recurse: too many variables
% 0.86/1.31
% 0.86/1.31 ir=1. insert_pq=1. remove_pq=1. update_slb=1. lookup_slb=1. findmin_pq_eff=1. findmin_pq_res=1. remove_cpq=1. remove_slb=1. removemin_pq_eff=1. removemin_pq_res=1. insert_cpq=1. remove_pqp=1. insert_pqp=1. f1=1. findmin_pqp_res=1. i=1. findmin_cpq_eff=1. findmin_cpq_res=1. removemin_cpq_eff=1. removemin_cpq_res=1. f2=1. f3=1. f4=1. triple=1.
% 0.86/1.31
% 0.86/1.31 ============================== end of process initial clauses ========
% 0.86/1.31
% 0.86/1.31 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.31
% 0.86/1.31 ============================== end of clauses for search =============
% 0.86/1.31
% 0.86/1.31 ============================== SEARCH ================================
% 0.86/1.31
% 0.86/1.31 % Starting search at 0.03 seconds.
% 0.86/1.31
% 0.86/1.31 Fatal error: renum_vars_recurse: too many variables
% 0.86/1.31
% 0.86/1.31 Prover9 interrupted
%------------------------------------------------------------------------------