TSTP Solution File: SWV393+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWV393+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n014.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   : Timeout 300.05s 300.30s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SWV393+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 : n014.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.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun 14 22:21:51 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.41/0.89  ============================== Prover9 ===============================
% 0.41/0.89  Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.89  Process 21452 was started by sandbox2 on n014.cluster.edu,
% 0.41/0.89  Tue Jun 14 22:21:52 2022
% 0.41/0.89  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21298_n014.cluster.edu".
% 0.41/0.89  ============================== end of head ===========================
% 0.41/0.89  
% 0.41/0.89  ============================== INPUT =================================
% 0.41/0.89  
% 0.41/0.89  % Reading from file /tmp/Prover9_21298_n014.cluster.edu
% 0.41/0.89  
% 0.41/0.89  set(prolog_style_variables).
% 0.41/0.89  set(auto2).
% 0.41/0.89      % set(auto2) -> set(auto).
% 0.41/0.89      % set(auto) -> set(auto_inference).
% 0.41/0.89      % set(auto) -> set(auto_setup).
% 0.41/0.89      % set(auto_setup) -> set(predicate_elim).
% 0.41/0.89      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.89      % set(auto) -> set(auto_limits).
% 0.41/0.89      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.89      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.89      % set(auto) -> set(auto_denials).
% 0.41/0.89      % set(auto) -> set(auto_process).
% 0.41/0.89      % set(auto2) -> assign(new_constants, 1).
% 0.41/0.89      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.89      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.89      % set(auto2) -> assign(max_hours, 1).
% 0.41/0.89      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.89      % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.89      % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.89      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.89      % set(auto2) -> set(sort_initial_sos).
% 0.41/0.89      % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.89      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.89      % set(auto2) -> assign(max_megs, 400).
% 0.41/0.89      % set(auto2) -> assign(stats, some).
% 0.41/0.89      % set(auto2) -> clear(echo_input).
% 0.41/0.89      % set(auto2) -> set(quiet).
% 0.41/0.89      % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.89      % set(auto2) -> clear(print_given).
% 0.41/0.89  assign(lrs_ticks,-1).
% 0.41/0.89  assign(sos_limit,10000).
% 0.41/0.89  assign(order,kbo).
% 0.41/0.89  set(lex_order_vars).
% 0.41/0.89  clear(print_given).
% 0.41/0.89  
% 0.41/0.89  % formulas(sos).  % not echoed (19 formulas)
% 0.41/0.89  
% 0.41/0.89  ============================== end of input ==========================
% 0.41/0.89  
% 0.41/0.89  % From the command line: assign(max_seconds, 300).
% 0.41/0.89  
% 0.41/0.89  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.89  
% 0.41/0.89  % Formulas that are not ordinary clauses:
% 0.41/0.89  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.41/0.89  2 (all U all V (less_than(U,V) | less_than(V,U))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  3 (all U less_than(U,U)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  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.41/0.89  5 (all U less_than(bottom,U)) # label(bottom_smallest) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  6 (all U all V all W isnonempty_slb(insert_slb(U,pair(V,W)))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  7 (all U -contains_slb(create_slb,U)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  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.41/0.89  9 (all U all V -pair_in_list(create_slb,U,V)) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
% 0.41/0.89  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.41/0.89  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.41/0.89  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.41/0.89  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.41/0.89  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].
% 25.01/25.34  15 (all U update_slb(create_slb,U) = create_slb) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
% 25.01/25.34  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].
% 25.01/25.34  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].
% 25.01/25.34  18 -(all U ((all V all W (pair_in_list(U,V,W) -> (all X (contains_slb(U,X) -> pair_in_list(remove_slb(U,X),V,W) | V = X)))) -> (all Y all Z all X1 all X2 (pair_in_list(insert_slb(U,pair(X1,X2)),Y,Z) -> (all X1 (contains_slb(insert_slb(U,pair(X1,X2)),X1) -> pair_in_list(remove_slb(insert_slb(U,pair(X1,X2)),X1),Y,Z) | Y = X1)))))) # label(l29_co) # label(negated_conjecture) # label(non_clause).  [assumption].
% 25.01/25.34  
% 25.01/25.34  ============================== end of process non-clausal formulas ===
% 25.01/25.34  
% 25.01/25.34  ============================== PROCESS INITIAL CLAUSES ===============
% 25.01/25.34  
% 25.01/25.34  ============================== PREDICATE ELIMINATION =================
% 25.01/25.34  19 strictly_less_than(A,B) | -less_than(A,B) | less_than(B,A) # label(stricly_smaller_definition) # label(axiom).  [clausify(4)].
% 25.01/25.34  20 -strictly_less_than(A,B) | -less_than(B,A) # label(stricly_smaller_definition) # label(axiom).  [clausify(4)].
% 25.01/25.34  21 -strictly_less_than(A,B) | less_than(A,B) # label(stricly_smaller_definition) # label(axiom).  [clausify(4)].
% 25.01/25.34  22 -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)].
% 25.01/25.34  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(22,a,19,a)].
% 25.01/25.34  
% 25.01/25.34  ============================== end predicate elimination =============
% 25.01/25.34  
% 25.01/25.34  Auto_denials:  (non-Horn, no changes).
% 25.01/25.34  
% 25.01/25.34  Term ordering decisions:
% 25.01/25.34  Function symbol KB weights:  create_slb=1. bottom=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. insert_slb=1. pair=1. update_slb=1. remove_slb=1. lookup_slb=1.
% 25.01/25.34  
% 25.01/25.34  ============================== end of process initial clauses ========
% 25.01/25.34  
% 25.01/25.34  ============================== CLAUSES FOR SEARCH ====================
% 25.01/25.34  
% 25.01/25.34  ============================== end of clauses for search =============
% 25.01/25.34  
% 25.01/25.34  ============================== SEARCH ================================
% 25.01/25.34  
% 25.01/25.34  % Starting search at 0.01 seconds.
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=86.000, iters=3637
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=74.000, iters=3528
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=66.000, iters=3358
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=65.000, iters=3359
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=64.000, iters=3673
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=63.000, iters=3747
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=58.000, iters=3348
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=57.000, iters=3609
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=54.000, iters=3362
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=53.000, iters=3443
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=50.000, iters=3373
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=49.000, iters=3422
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=48.000, iters=3341
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=47.000, iters=3357
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=46.000, iters=3334
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=43.000, iters=3598
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=42.000, iters=3412
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=41.000, iters=3588
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=40.000, iters=3450
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=39.000, iters=3346
% 25.01/25.34  
% 25.01/25.34  Low Water (keep): wt=38.000, iters=3354
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3526, wt=134.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3134, wt=131.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3133, wt=129.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3294, wt=127.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3293, wt=125.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=1433, wt=107.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3065, wt=104.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=2188, wt=102.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3497, wt=101.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=2159, wt=99.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3118, wt=98.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3225, wt=96.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=3379, wt=94.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12498, wt=36.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12525, wt=35.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12625, wt=34.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12670, wt=33.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12665, wt=32.000
% 25.01/25.34  
% 25.01/25.34  Low Water (displace): id=12709, wt=31.000
% 25.01/25.34  
% 25.01/25.34  LowCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------