TSTP Solution File: SWV019-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n006.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  : 300s
% DateTime : Tue May 21 05:53:35 EDT 2024

% Result   : Unsatisfiable 0.63s 0.80s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   35 (  16 unt;   0 def)
%            Number of atoms       :   68 (   3 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   57 (  24   ~;  26   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   8 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f71,plain,
    $false,
    inference(avatar_sat_refutation,[],[f39,f40,f41,f47,f53,f67,f69,f70]) ).

fof(f70,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f56,f16]) ).

fof(f16,plain,
    ( spl0_2
  <=> less_than(successor(an_index),lower_bound) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f56,plain,
    ~ less_than(successor(an_index),lower_bound),
    inference(unit_resulting_resolution,[],[f4,f7,f3]) ).

fof(f3,axiom,
    ! [X2,X3,X1] :
      ( ~ less_than(X2,X3)
      | less_than(X1,X3)
      | ~ less_than(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).

fof(f7,axiom,
    ~ less_than(an_index,lower_bound),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).

fof(f4,axiom,
    ! [X1] : less_than(X1,successor(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).

fof(f69,plain,
    ( spl0_4
    | spl0_6 ),
    inference(avatar_contradiction_clause,[],[f68]) ).

fof(f68,plain,
    ( $false
    | spl0_4
    | spl0_6 ),
    inference(subsumption_resolution,[],[f60,f51]) ).

fof(f51,plain,
    ( less_than(upper_bound,index_of_maximal)
    | spl0_4
    | spl0_6 ),
    inference(unit_resulting_resolution,[],[f25,f34,f1]) ).

fof(f1,axiom,
    ! [X0] :
      ( in_array_bounds(array,X0)
      | less_than(upper_bound,X0)
      | less_than(X0,lower_bound) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).

fof(f34,plain,
    ( ~ in_array_bounds(array,index_of_maximal)
    | spl0_6 ),
    inference(avatar_component_clause,[],[f32]) ).

fof(f32,plain,
    ( spl0_6
  <=> in_array_bounds(array,index_of_maximal) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).

fof(f25,plain,
    ( ~ less_than(index_of_maximal,lower_bound)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f24,plain,
    ( spl0_4
  <=> less_than(index_of_maximal,lower_bound) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).

fof(f60,plain,
    ~ less_than(upper_bound,index_of_maximal),
    inference(unit_resulting_resolution,[],[f8,f6,f3]) ).

fof(f6,axiom,
    less_than(index_of_maximal,an_index),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).

fof(f8,axiom,
    ~ less_than(upper_bound,an_index),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).

fof(f67,plain,
    spl0_5,
    inference(avatar_split_clause,[],[f61,f28]) ).

fof(f28,plain,
    ( spl0_5
  <=> less_than(index_of_maximal,successor(an_index)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).

fof(f61,plain,
    less_than(index_of_maximal,successor(an_index)),
    inference(unit_resulting_resolution,[],[f6,f4,f3]) ).

fof(f53,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f50,f12]) ).

fof(f12,plain,
    ( spl0_1
  <=> in_array_bounds(array,an_index) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f50,plain,
    in_array_bounds(array,an_index),
    inference(unit_resulting_resolution,[],[f7,f8,f1]) ).

fof(f47,plain,
    ~ spl0_3,
    inference(avatar_split_clause,[],[f44,f20]) ).

fof(f20,plain,
    ( spl0_3
  <=> less_than(successor(upper_bound),successor(an_index)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f44,plain,
    ~ less_than(successor(upper_bound),successor(an_index)),
    inference(unit_resulting_resolution,[],[f8,f2]) ).

fof(f2,axiom,
    ! [X2,X1] :
      ( ~ less_than(successor(X1),successor(X2))
      | less_than(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).

fof(f41,plain,
    ~ spl0_4,
    inference(avatar_split_clause,[],[f9,f24]) ).

fof(f9,axiom,
    ~ less_than(index_of_maximal,lower_bound),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).

fof(f40,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f5,f36,f32]) ).

fof(f36,plain,
    ( spl0_7
  <=> maximal_value = array_value_at(array,index_of_maximal) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).

fof(f5,axiom,
    ( maximal_value = array_value_at(array,index_of_maximal)
    | ~ in_array_bounds(array,index_of_maximal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).

fof(f39,plain,
    ( ~ spl0_1
    | spl0_2
    | spl0_3
    | spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f10,f36,f32,f28,f24,f20,f16,f12]) ).

fof(f10,axiom,
    ( maximal_value != array_value_at(array,index_of_maximal)
    | ~ in_array_bounds(array,index_of_maximal)
    | ~ less_than(index_of_maximal,successor(an_index))
    | less_than(index_of_maximal,lower_bound)
    | less_than(successor(upper_bound),successor(an_index))
    | less_than(successor(an_index),lower_bound)
    | ~ in_array_bounds(array,an_index) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 06:51:53 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.34  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.12/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.63/0.80  % (14308)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.63/0.80  % (14306)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.63/0.80  % (14309)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.63/0.80  % (14311)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.63/0.80  % (14307)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.63/0.80  % (14312)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.63/0.80  % (14313)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.63/0.80  % (14310)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.63/0.80  % (14311)Refutation not found, incomplete strategy% (14311)------------------------------
% 0.63/0.80  % (14311)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (14311)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (14311)Memory used [KB]: 979
% 0.63/0.80  % (14311)Time elapsed: 0.003 s
% 0.63/0.80  % (14311)Instructions burned: 2 (million)
% 0.63/0.80  % (14313)Refutation not found, incomplete strategy% (14313)------------------------------
% 0.63/0.80  % (14313)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (14313)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (14313)Memory used [KB]: 980
% 0.63/0.80  % (14313)Time elapsed: 0.003 s
% 0.63/0.80  % (14313)Instructions burned: 2 (million)
% 0.63/0.80  % (14311)------------------------------
% 0.63/0.80  % (14311)------------------------------
% 0.63/0.80  % (14306)Also succeeded, but the first one will report.
% 0.63/0.80  % (14309)First to succeed.
% 0.63/0.80  % (14313)------------------------------
% 0.63/0.80  % (14313)------------------------------
% 0.63/0.80  % (14312)Also succeeded, but the first one will report.
% 0.63/0.80  % (14308)Also succeeded, but the first one will report.
% 0.63/0.80  % (14309)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14304"
% 0.63/0.80  % (14309)Refutation found. Thanks to Tanya!
% 0.63/0.80  % SZS status Unsatisfiable for theBenchmark
% 0.63/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.80  % (14309)------------------------------
% 0.63/0.80  % (14309)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (14309)Termination reason: Refutation
% 0.63/0.80  
% 0.63/0.80  % (14309)Memory used [KB]: 984
% 0.63/0.80  % (14309)Time elapsed: 0.004 s
% 0.63/0.80  % (14309)Instructions burned: 4 (million)
% 0.63/0.80  % (14304)Success in time 0.457 s
% 0.63/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------