TSTP Solution File: SWV413+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:35 EDT 2022
% Result : Theorem 0.44s 1.01s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.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 : Thu Jun 16 01:01:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 28170 was started by sandbox2 on n007.cluster.edu,
% 0.44/1.01 Thu Jun 16 01:01:27 2022
% 0.44/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27792_n007.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_27792_n007.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (20 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 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.44/1.01 2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 9 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 15 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 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.44/1.01 18 (all U all V all W all X (pair_in_list(U,V,W) & less_than(X,W) -> pair_in_list(update_slb(U,X),V,W))) # label(l49_li3637) # label(lemma) # label(non_clause). [assumption].
% 0.44/1.01 19 -(all U all V all W all X (pair_in_list(U,V,W) & strictly_less_than(V,X) & less_than(X,W) -> (exists Y (pair_in_list(update_slb(U,X),V,Y) & less_than(X,Y))))) # label(l49_co) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01 20 -strictly_less_than(A,B) | -less_than(B,A) # label(stricly_smaller_definition) # label(axiom). [clausify(4)].
% 0.44/1.01 21 strictly_less_than(c2,c4) # label(l49_co) # label(negated_conjecture). [clausify(19)].
% 0.44/1.01 Derived: -less_than(c4,c2). [resolve(20,a,21,a)].
% 0.44/1.01 22 -strictly_less_than(A,B) | less_than(A,B) # label(stricly_smaller_definition) # label(axiom). [clausify(4)].
% 0.44/1.01 Derived: less_than(c2,c4). [resolve(22,a,21,a)].
% 0.44/1.01 23 strictly_less_than(A,B) | -less_than(A,B) | less_than(B,A) # label(stricly_smaller_definition) # label(axiom). [clausify(4)].
% 0.44/1.01 24 -strictly_less_than(A,B) | update_slb(insert_slb(C,pair(D,A)),B) = insert_slb(update_slb(C,B),pair(D,B)) # label(ax29) # label(axiom). [clausify(16)].
% 0.44/1.01 Derived: update_slb(insert_slb(A,pair(B,c2)),c4) = insert_slb(update_slb(A,c4),pair(B,c4)). [resolve(24,a,21,a)].
% 0.44/1.01 Derived: update_slb(insert_slb(A,pair(B,C)),D) = insert_slb(update_slb(A,D),pair(B,D)) | -less_than(C,D) | less_than(D,C). [resolve(24,a,23,a)].
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials: (non-Horn, no changes).
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01 Function symbol KB weights: create_slb=1. bottom=1. c1=1. c2=1. c3=1. c4=1. insert_slb=1. pair=1. update_slb=1. lookup_slb=1. remove_slb=1.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.02 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== PROOF =================================
% 0.44/1.01 % SZS status Theorem
% 0.44/1.01 % SZS output start Refutation
% 0.44/1.01
% 0.44/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/1.01 % Length of proof is 8.
% 0.44/1.01 % Level of proof is 3.
% 0.44/1.01 % Maximum clause weight is 13.000.
% 0.44/1.01 % Given clauses 31.
% 0.44/1.01
% 0.44/1.01 18 (all U all V all W all X (pair_in_list(U,V,W) & less_than(X,W) -> pair_in_list(update_slb(U,X),V,W))) # label(l49_li3637) # label(lemma) # label(non_clause). [assumption].
% 0.44/1.01 19 -(all U all V all W all X (pair_in_list(U,V,W) & strictly_less_than(V,X) & less_than(X,W) -> (exists Y (pair_in_list(update_slb(U,X),V,Y) & less_than(X,Y))))) # label(l49_co) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.01 27 less_than(c4,c3) # label(l49_co) # label(negated_conjecture). [clausify(19)].
% 0.44/1.01 28 pair_in_list(c1,c2,c3) # label(l49_co) # label(negated_conjecture). [clausify(19)].
% 0.44/1.01 37 -pair_in_list(update_slb(c1,c4),c2,A) | -less_than(c4,A) # label(l49_co) # label(negated_conjecture). [clausify(19)].
% 0.44/1.01 43 -pair_in_list(A,B,C) | -less_than(D,C) | pair_in_list(update_slb(A,D),B,C) # label(l49_li3637) # label(lemma). [clausify(18)].
% 0.44/1.01 55 -pair_in_list(update_slb(c1,c4),c2,c3). [ur(37,b,27,a)].
% 0.44/1.01 78 $F. [ur(43,b,27,a,c,55,a),unit_del(a,28)].
% 0.44/1.01
% 0.44/1.01 % SZS output end Refutation
% 0.44/1.01 ============================== end of proof ==========================
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=31. Generated=111. Kept=53. proofs=1.
% 0.44/1.01 Usable=30. Sos=21. Demods=8. Limbo=0, Disabled=36. Hints=0.
% 0.44/1.01 Megabytes=0.12.
% 0.44/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 THEOREM PROVED
% 0.44/1.01 % SZS status Theorem
% 0.44/1.01
% 0.44/1.01 Exiting with 1 proof.
% 0.44/1.01
% 0.44/1.01 Process 28170 exit (max_proofs) Thu Jun 16 01:01:27 2022
% 0.44/1.01 Prover9 interrupted
%------------------------------------------------------------------------------