TSTP Solution File: SWV383+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:29 EDT 2022
% Result : Theorem 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Wed Jun 15 23:30:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.06 ============================== Prover9 ===============================
% 0.45/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.06 Process 1441 was started by sandbox on n020.cluster.edu,
% 0.45/1.06 Wed Jun 15 23:30:05 2022
% 0.45/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1220_n020.cluster.edu".
% 0.45/1.06 ============================== end of head ===========================
% 0.45/1.06
% 0.45/1.06 ============================== INPUT =================================
% 0.45/1.06
% 0.45/1.06 % Reading from file /tmp/Prover9_1220_n020.cluster.edu
% 0.45/1.06
% 0.45/1.06 set(prolog_style_variables).
% 0.45/1.06 set(auto2).
% 0.45/1.06 % set(auto2) -> set(auto).
% 0.45/1.06 % set(auto) -> set(auto_inference).
% 0.45/1.06 % set(auto) -> set(auto_setup).
% 0.45/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.06 % set(auto) -> set(auto_limits).
% 0.45/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.06 % set(auto) -> set(auto_denials).
% 0.45/1.06 % set(auto) -> set(auto_process).
% 0.45/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.06 % set(auto2) -> assign(stats, some).
% 0.45/1.06 % set(auto2) -> clear(echo_input).
% 0.45/1.06 % set(auto2) -> set(quiet).
% 0.45/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.06 % set(auto2) -> clear(print_given).
% 0.45/1.06 assign(lrs_ticks,-1).
% 0.45/1.06 assign(sos_limit,10000).
% 0.45/1.06 assign(order,kbo).
% 0.45/1.06 set(lex_order_vars).
% 0.45/1.06 clear(print_given).
% 0.45/1.06
% 0.45/1.06 % formulas(sos). % not echoed (43 formulas)
% 0.45/1.06
% 0.45/1.06 ============================== end of input ==========================
% 0.45/1.06
% 0.45/1.06 % From the command line: assign(max_seconds, 300).
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.06
% 0.45/1.06 % Formulas that are not ordinary clauses:
% 0.45/1.06 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.45/1.06 2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 6 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 7 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 9 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 15 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 18 (all U succ_cpq(U,U)) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 23 (all U all V check_cpq(triple(U,create_slb,V))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 27 (all U all V (ok(triple(U,V,bad)) <-> $F)) # label(ax40) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 28 (all U all V all W (-ok(triple(U,V,W)) -> W = bad)) # label(ax41) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 37 (all U all V findmin_cpq_res(triple(U,create_slb,V)) = bottom) # label(ax50) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.07 40 (all U removemin_cpq_res(U) = findmin_cpq_res(U)) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.07 41 (all U all V all W (-check_cpq(triple(U,V,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)) | -check_cpq(triple(X,Y,Z)))))) # label(l19_l20) # label(lemma) # label(non_clause). [assumption].
% 0.45/1.07 42 -(all U all V all W (-check_cpq(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)) | -check_cpq(triple(X,Y,Z)))))) # label(l19_co) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.07
% 0.45/1.07 ============================== end of process non-clausal formulas ===
% 0.45/1.07
% 0.45/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.07
% 0.45/1.07 ============================== PREDICATE ELIMINATION =================
% 0.45/1.07
% 0.45/1.07 ============================== end predicate elimination =============
% 0.45/1.07
% 0.45/1.07 Auto_denials: (non-Horn, no changes).
% 0.45/1.07
% 0.45/1.07 Term ordering decisions:
% 0.45/1.07 Function symbol KB weights: create_slb=1. bad=1. bottom=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=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.45/1.07
% 0.45/1.07 ============================== end of process initial clauses ========
% 0.45/1.07
% 0.45/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.07
% 0.45/1.07 ============================== end of clauses for search =============
% 0.45/1.07
% 0.45/1.07 ============================== SEARCH ================================
% 0.45/1.07
% 0.45/1.07 % Starting search at 0.02 seconds.
% 0.45/1.07
% 0.45/1.07 ============================== PROOF =================================
% 0.45/1.07 % SZS status Theorem
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.45/1.07 % Length of proof is 8.
% 0.45/1.07 % Level of proof is 2.
% 0.45/1.07 % Maximum clause weight is 24.000.
% 0.45/1.07 % Given clauses 53.
% 0.45/1.07
% 0.45/1.07 41 (all U all V all W (-check_cpq(triple(U,V,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)) | -check_cpq(triple(X,Y,Z)))))) # label(l19_l20) # label(lemma) # label(non_clause). [assumption].
% 0.45/1.07 42 -(all U all V all W (-check_cpq(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)) | -check_cpq(triple(X,Y,Z)))))) # label(l19_co) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.07 49 ok(triple(c4,c5,c6)) # label(l19_co) # label(negated_conjecture). [clausify(42)].
% 0.45/1.07 50 check_cpq(triple(c4,c5,c6)) # label(l19_co) # label(negated_conjecture). [clausify(42)].
% 0.45/1.07 58 succ_cpq(triple(c1,c2,c3),triple(c4,c5,c6)) # label(l19_co) # label(negated_conjecture). [clausify(42)].
% 0.45/1.07 70 -check_cpq(triple(c1,c2,c3)) # label(l19_co) # label(negated_conjecture). [clausify(42)].
% 0.45/1.07 98 check_cpq(triple(A,B,C)) | -succ_cpq(triple(A,B,C),triple(D,E,F)) | -ok(triple(D,E,F)) | -check_cpq(triple(D,E,F)) # label(l19_l20) # label(lemma). [clausify(41)].
% 0.45/1.07 162 $F. [resolve(98,b,58,a),unit_del(a,70),unit_del(b,49),unit_del(c,50)].
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 ============================== end of proof ==========================
% 0.45/1.07
% 0.45/1.07 ============================== STATISTICS ============================
% 0.45/1.07
% 0.45/1.07 Given=53. Generated=193. Kept=116. proofs=1.
% 0.45/1.07 Usable=52. Sos=57. Demods=11. Limbo=0, Disabled=63. Hints=0.
% 0.45/1.07 Megabytes=0.29.
% 0.45/1.07 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.45/1.07
% 0.45/1.07 ============================== end of statistics =====================
% 0.45/1.07
% 0.45/1.07 ============================== end of search =========================
% 0.45/1.07
% 0.45/1.07 THEOREM PROVED
% 0.45/1.07 % SZS status Theorem
% 0.45/1.07
% 0.45/1.07 Exiting with 1 proof.
% 0.45/1.07
% 0.45/1.07 Process 1441 exit (max_proofs) Wed Jun 15 23:30:05 2022
% 0.45/1.07 Prover9 interrupted
%------------------------------------------------------------------------------