TSTP Solution File: SWV397+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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:31 EDT 2022
% Result : Theorem 0.47s 1.06s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 18:47:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.05 ============================== Prover9 ===============================
% 0.47/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.05 Process 10231 was started by sandbox on n003.cluster.edu,
% 0.47/1.05 Wed Jun 15 18:47:11 2022
% 0.47/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10078_n003.cluster.edu".
% 0.47/1.05 ============================== end of head ===========================
% 0.47/1.05
% 0.47/1.05 ============================== INPUT =================================
% 0.47/1.05
% 0.47/1.05 % Reading from file /tmp/Prover9_10078_n003.cluster.edu
% 0.47/1.05
% 0.47/1.05 set(prolog_style_variables).
% 0.47/1.05 set(auto2).
% 0.47/1.05 % set(auto2) -> set(auto).
% 0.47/1.05 % set(auto) -> set(auto_inference).
% 0.47/1.05 % set(auto) -> set(auto_setup).
% 0.47/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.05 % set(auto) -> set(auto_limits).
% 0.47/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.05 % set(auto) -> set(auto_denials).
% 0.47/1.05 % set(auto) -> set(auto_process).
% 0.47/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.05 % set(auto2) -> assign(stats, some).
% 0.47/1.05 % set(auto2) -> clear(echo_input).
% 0.47/1.05 % set(auto2) -> set(quiet).
% 0.47/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.05 % set(auto2) -> clear(print_given).
% 0.47/1.05 assign(lrs_ticks,-1).
% 0.47/1.05 assign(sos_limit,10000).
% 0.47/1.05 assign(order,kbo).
% 0.47/1.05 set(lex_order_vars).
% 0.47/1.05 clear(print_given).
% 0.47/1.05
% 0.47/1.05 % formulas(sos). % not echoed (42 formulas)
% 0.47/1.05
% 0.47/1.05 ============================== end of input ==========================
% 0.47/1.05
% 0.47/1.05 % From the command line: assign(max_seconds, 300).
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.05
% 0.47/1.05 % Formulas that are not ordinary clauses:
% 0.47/1.05 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.47/1.05 2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 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.47/1.05 5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 6 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 7 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 8 (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.47/1.05 9 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 10 (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.47/1.05 11 (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.47/1.05 12 (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.47/1.05 13 (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.47/1.05 14 (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.47/1.05 15 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 16 (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.47/1.05 17 (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.47/1.05 18 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 19 (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.47/1.05 20 (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.47/1.05 21 (all U all V (succ_cpq(U,V) -> succ_cpq(U,findmin_cpq_eff(V)))) # label(ax34) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 22 (all U all V (succ_cpq(U,V) -> succ_cpq(U,removemin_cpq_eff(V)))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 23 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 24 (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.47/1.05 25 (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.47/1.05 26 (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.47/1.05 27 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 28 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 29 (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.47/1.05 30 (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.47/1.05 31 (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.47/1.05 32 (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.47/1.05 33 (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.47/1.05 34 (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.47/1.05 35 (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.47/1.05 36 (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.47/1.05 37 (all U all V findmin_cpq_res(triple(U,create_slb,V)) = bottom) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 38 (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.47/1.05 39 (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.47/1.06 40 (all U removemin_cpq_res(U) = findmin_cpq_res(U)) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 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.47/1.06
% 0.47/1.06 ============================== end of process non-clausal formulas ===
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.06
% 0.47/1.06 ============================== PREDICATE ELIMINATION =================
% 0.47/1.06
% 0.47/1.06 ============================== end predicate elimination =============
% 0.47/1.06
% 0.47/1.06 Auto_denials: (non-Horn, no changes).
% 0.47/1.06
% 0.47/1.06 Term ordering decisions:
% 0.47/1.06 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.47/1.06
% 0.47/1.06 ============================== end of process initial clauses ========
% 0.47/1.06
% 0.47/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.06
% 0.47/1.06 ============================== end of clauses for search =============
% 0.47/1.06
% 0.47/1.06 ============================== SEARCH ================================
% 0.47/1.06
% 0.47/1.06 % Starting search at 0.02 seconds.
% 0.47/1.06
% 0.47/1.06 ============================== PROOF =================================
% 0.47/1.06 % SZS status Theorem
% 0.47/1.06 % SZS output start Refutation
% 0.47/1.06
% 0.47/1.06 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.47/1.06 % Length of proof is 10.
% 0.47/1.06 % Level of proof is 4.
% 0.47/1.06 % Maximum clause weight is 14.000.
% 0.47/1.06 % Given clauses 22.
% 0.47/1.06
% 0.47/1.06 27 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 30 (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.47/1.06 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.47/1.06 51 ok(remove_cpq(triple(c1,c2,c3),c4)) # label(l33_co) # label(negated_conjecture). [clausify(41)].
% 0.47/1.06 59 contains_slb(A,B) | triple(C,A,bad) = remove_cpq(triple(C,A,D),B) # label(ax43) # label(axiom). [clausify(30)].
% 0.47/1.06 60 contains_slb(A,B) | remove_cpq(triple(C,A,D),B) = triple(C,A,bad). [copy(59),flip(b)].
% 0.47/1.06 65 -contains_slb(c2,c4) # label(l33_co) # label(negated_conjecture). [clausify(41)].
% 0.47/1.06 67 -ok(triple(A,B,bad)) # label(ax40) # label(axiom). [clausify(27)].
% 0.47/1.06 102 remove_cpq(triple(A,c2,B),c4) = triple(A,c2,bad). [resolve(65,a,60,a)].
% 0.47/1.06 103 $F. [back_rewrite(51),rewrite([102(6)]),unit_del(a,67)].
% 0.47/1.06
% 0.47/1.06 % SZS output end Refutation
% 0.47/1.06 ============================== end of proof ==========================
% 0.47/1.06
% 0.47/1.06 ============================== STATISTICS ============================
% 0.47/1.06
% 0.47/1.06 Given=22. Generated=78. Kept=58. proofs=1.
% 0.47/1.06 Usable=21. Sos=35. Demods=10. Limbo=1, Disabled=53. Hints=0.
% 0.47/1.06 Megabytes=0.19.
% 0.47/1.06 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.06
% 0.47/1.06 ============================== end of statistics =====================
% 0.47/1.06
% 0.47/1.06 ============================== end of search =========================
% 0.47/1.06
% 0.47/1.06 THEOREM PROVED
% 0.47/1.06 % SZS status Theorem
% 0.47/1.06
% 0.47/1.06 Exiting with 1 proof.
% 0.47/1.06
% 0.47/1.06 Process 10231 exit (max_proofs) Wed Jun 15 18:47:11 2022
% 0.47/1.06 Prover9 interrupted
%------------------------------------------------------------------------------