TSTP Solution File: DAT011_1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : DAT011_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %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  : 300s
% DateTime : Tue Apr 30 11:03:27 EDT 2024

% Result   : Theorem 2.47s 0.71s
% Output   : Refutation 2.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   54 (  12 unt;   8 typ;   0 def)
%            Number of atoms       :  138 (  33 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  144 (  52   ~;  42   |;  37   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :  258 (  84 atm;  41 fun;  77 num;  56 var)
%            Number of types       :    2 (   1 usr;   1 ari)
%            Number of type conns  :    5 (   2   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (   7 usr;   8 con; 0-3 aty)
%            Number of variables   :   75 (  53   !;  22   ?;  75   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    array: $tType ).

tff(func_def_0,type,
    read: ( array * $int ) > $int ).

tff(func_def_1,type,
    write: ( array * $int * $int ) > array ).

tff(func_def_7,type,
    sK0: array ).

tff(func_def_8,type,
    sK1: array ).

tff(func_def_9,type,
    sK2: $int ).

tff(func_def_10,type,
    sK3: $int ).

tff(func_def_11,type,
    sK4: $int ).

tff(f7593,plain,
    $false,
    inference(avatar_sat_refutation,[],[f126,f254,f7592]) ).

tff(f7592,plain,
    ( spl5_5
    | ~ spl5_6 ),
    inference(avatar_contradiction_clause,[],[f7591]) ).

tff(f7591,plain,
    ( $false
    | spl5_5
    | ~ spl5_6 ),
    inference(subsumption_resolution,[],[f7590,f120]) ).

tff(f120,plain,
    ( ( sK4 != $sum(1,sK3) )
    | spl5_5 ),
    inference(avatar_component_clause,[],[f119]) ).

tff(f119,plain,
    ( spl5_5
  <=> ( sK4 = $sum(1,sK3) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).

tff(f7590,plain,
    ( ( sK4 = $sum(1,sK3) )
    | ~ spl5_6 ),
    inference(subsumption_resolution,[],[f7589,f27]) ).

tff(f27,plain,
    ~ $less(sK4,sK2),
    inference(cnf_transformation,[],[f24]) ).

tff(f24,plain,
    ( ~ $less(0,read(sK0,sK4))
    & ~ $less($sum(sK3,1),sK4)
    & ~ $less(sK4,sK2)
    & ( sK0 = write(sK1,$sum(sK3,1),3) )
    & ! [X5: $int] :
        ( $less(0,read(sK1,X5))
        | $less(sK3,X5)
        | $less(X5,sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f21,f23,f22]) ).

tff(f22,plain,
    ( ? [X0: array,X1: array,X2: $int,X3: $int] :
        ( ? [X4: $int] :
            ( ~ $less(0,read(X0,X4))
            & ~ $less($sum(X3,1),X4)
            & ~ $less(X4,X2) )
        & ( write(X1,$sum(X3,1),3) = X0 )
        & ! [X5: $int] :
            ( $less(0,read(X1,X5))
            | $less(X3,X5)
            | $less(X5,X2) ) )
   => ( ? [X4: $int] :
          ( ~ $less(0,read(sK0,X4))
          & ~ $less($sum(sK3,1),X4)
          & ~ $less(X4,sK2) )
      & ( sK0 = write(sK1,$sum(sK3,1),3) )
      & ! [X5: $int] :
          ( $less(0,read(sK1,X5))
          | $less(sK3,X5)
          | $less(X5,sK2) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f23,plain,
    ( ? [X4: $int] :
        ( ~ $less(0,read(sK0,X4))
        & ~ $less($sum(sK3,1),X4)
        & ~ $less(X4,sK2) )
   => ( ~ $less(0,read(sK0,sK4))
      & ~ $less($sum(sK3,1),sK4)
      & ~ $less(sK4,sK2) ) ),
    introduced(choice_axiom,[]) ).

tff(f21,plain,
    ? [X0: array,X1: array,X2: $int,X3: $int] :
      ( ? [X4: $int] :
          ( ~ $less(0,read(X0,X4))
          & ~ $less($sum(X3,1),X4)
          & ~ $less(X4,X2) )
      & ( write(X1,$sum(X3,1),3) = X0 )
      & ! [X5: $int] :
          ( $less(0,read(X1,X5))
          | $less(X3,X5)
          | $less(X5,X2) ) ),
    inference(rectify,[],[f20]) ).

tff(f20,plain,
    ? [X0: array,X1: array,X2: $int,X3: $int] :
      ( ? [X5: $int] :
          ( ~ $less(0,read(X0,X5))
          & ~ $less($sum(X3,1),X5)
          & ~ $less(X5,X2) )
      & ( write(X1,$sum(X3,1),3) = X0 )
      & ! [X4: $int] :
          ( $less(0,read(X1,X4))
          | $less(X3,X4)
          | $less(X4,X2) ) ),
    inference(flattening,[],[f19]) ).

tff(f19,plain,
    ? [X0: array,X1: array,X2: $int,X3: $int] :
      ( ? [X5: $int] :
          ( ~ $less(0,read(X0,X5))
          & ~ $less($sum(X3,1),X5)
          & ~ $less(X5,X2) )
      & ( write(X1,$sum(X3,1),3) = X0 )
      & ! [X4: $int] :
          ( $less(0,read(X1,X4))
          | $less(X3,X4)
          | $less(X4,X2) ) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f5,plain,
    ~ ! [X0: array,X1: array,X2: $int,X3: $int] :
        ( ( ( write(X1,$sum(X3,1),3) = X0 )
          & ! [X4: $int] :
              ( ( ~ $less(X3,X4)
                & ~ $less(X4,X2) )
             => $less(0,read(X1,X4)) ) )
       => ! [X5: $int] :
            ( ( ~ $less($sum(X3,1),X5)
              & ~ $less(X5,X2) )
           => $less(0,read(X0,X5)) ) ),
    inference(theory_normalization,[],[f4]) ).

tff(f4,negated_conjecture,
    ~ ! [X0: array,X1: array,X2: $int,X3: $int] :
        ( ( ( write(X1,$sum(X3,1),3) = X0 )
          & ! [X4: $int] :
              ( ( $lesseq(X4,X3)
                & $lesseq(X2,X4) )
             => $greater(read(X1,X4),0) ) )
       => ! [X5: $int] :
            ( ( $lesseq(X5,$sum(X3,1))
              & $lesseq(X2,X5) )
           => $greater(read(X0,X5),0) ) ),
    inference(negated_conjecture,[],[f3]) ).

tff(f3,conjecture,
    ! [X0: array,X1: array,X2: $int,X3: $int] :
      ( ( ( write(X1,$sum(X3,1),3) = X0 )
        & ! [X4: $int] :
            ( ( $lesseq(X4,X3)
              & $lesseq(X2,X4) )
           => $greater(read(X1,X4),0) ) )
     => ! [X5: $int] :
          ( ( $lesseq(X5,$sum(X3,1))
            & $lesseq(X2,X5) )
         => $greater(read(X0,X5),0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f7589,plain,
    ( $less(sK4,sK2)
    | ( sK4 = $sum(1,sK3) )
    | ~ spl5_6 ),
    inference(subsumption_resolution,[],[f7586,f582]) ).

tff(f582,plain,
    ( ~ $less(sK3,sK4)
    | ~ spl5_6 ),
    inference(resolution,[],[f63,f125]) ).

tff(f125,plain,
    ( $less(sK4,$sum(1,sK3))
    | ~ spl5_6 ),
    inference(avatar_component_clause,[],[f123]) ).

tff(f123,plain,
    ( spl5_6
  <=> $less(sK4,$sum(1,sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).

tff(f63,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(1,X0))
      | ~ $less(X0,X1) ),
    inference(superposition,[],[f17,f6]) ).

tff(f6,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f17,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(X0,1))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_161,[]) ).

tff(f7586,plain,
    ( $less(sK3,sK4)
    | $less(sK4,sK2)
    | ( sK4 = $sum(1,sK3) ) ),
    inference(resolution,[],[f29,f513]) ).

tff(f513,plain,
    ! [X0: $int] :
      ( $less(0,read(sK0,X0))
      | $less(sK3,X0)
      | $less(X0,sK2)
      | ( $sum(1,sK3) = X0 ) ),
    inference(superposition,[],[f25,f395]) ).

tff(f395,plain,
    ! [X0: $int] :
      ( ( read(sK1,X0) = read(sK0,X0) )
      | ( $sum(1,sK3) = X0 ) ),
    inference(superposition,[],[f31,f33]) ).

tff(f33,plain,
    sK0 = write(sK1,$sum(1,sK3),3),
    inference(forward_demodulation,[],[f26,f6]) ).

tff(f26,plain,
    sK0 = write(sK1,$sum(sK3,1),3),
    inference(cnf_transformation,[],[f24]) ).

tff(f31,plain,
    ! [X2: $int,X3: $int,X0: array,X1: $int] :
      ( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
      | ( X1 = X2 ) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f18,plain,
    ! [X0: array,X1: $int,X2: $int,X3: $int] :
      ( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
      | ( X1 = X2 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,axiom,
    ! [X3: array,X4: $int,X5: $int,X6: $int] :
      ( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
      | ( X4 = X5 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

tff(f25,plain,
    ! [X5: $int] :
      ( $less(0,read(sK1,X5))
      | $less(sK3,X5)
      | $less(X5,sK2) ),
    inference(cnf_transformation,[],[f24]) ).

tff(f29,plain,
    ~ $less(0,read(sK0,sK4)),
    inference(cnf_transformation,[],[f24]) ).

tff(f254,plain,
    ~ spl5_5,
    inference(avatar_contradiction_clause,[],[f253]) ).

tff(f253,plain,
    ( $false
    | ~ spl5_5 ),
    inference(evaluation,[],[f252]) ).

tff(f252,plain,
    ( ~ $less(0,3)
    | ~ spl5_5 ),
    inference(forward_demodulation,[],[f29,f251]) ).

tff(f251,plain,
    ( ( 3 = read(sK0,sK4) )
    | ~ spl5_5 ),
    inference(backward_demodulation,[],[f72,f121]) ).

tff(f121,plain,
    ( ( sK4 = $sum(1,sK3) )
    | ~ spl5_5 ),
    inference(avatar_component_clause,[],[f119]) ).

tff(f72,plain,
    3 = read(sK0,$sum(1,sK3)),
    inference(superposition,[],[f30,f33]) ).

tff(f30,plain,
    ! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    ! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

tff(f126,plain,
    ( spl5_5
    | spl5_6 ),
    inference(avatar_split_clause,[],[f103,f123,f119]) ).

tff(f103,plain,
    ( $less(sK4,$sum(1,sK3))
    | ( sK4 = $sum(1,sK3) ) ),
    inference(resolution,[],[f13,f32]) ).

tff(f32,plain,
    ~ $less($sum(1,sK3),sK4),
    inference(forward_demodulation,[],[f28,f6]) ).

tff(f28,plain,
    ~ $less($sum(sK3,1),sK4),
    inference(cnf_transformation,[],[f24]) ).

tff(f13,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,X0)
      | $less(X0,X1)
      | ( X0 = X1 ) ),
    introduced(theory_axiom_144,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : DAT011_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n014.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Apr 29 22:05:49 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (20985)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (20992)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.39  % (20990)WARNING: value z3 for option sas not known
% 0.15/0.39  % (20994)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.39  % (20988)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39  % (20988)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39  % (20989)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39  % (20991)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39  % (20988)Terminated due to inappropriate strategy.
% 0.15/0.39  % (20988)------------------------------
% 0.15/0.39  % (20988)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (20988)Termination reason: Inappropriate
% 0.15/0.39  
% 0.15/0.39  % (20988)Memory used [KB]: 744
% 0.15/0.39  % (20988)Time elapsed: 0.004 s
% 0.15/0.39  % (20988)Instructions burned: 2 (million)
% 0.15/0.39  % (20988)------------------------------
% 0.15/0.39  % (20988)------------------------------
% 0.15/0.39  % (20993)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.39  % (20990)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39  % (20989)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39  % (20989)Terminated due to inappropriate strategy.
% 0.15/0.39  % (20989)------------------------------
% 0.15/0.39  % (20989)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (20989)Termination reason: Inappropriate
% 0.15/0.39  
% 0.15/0.39  % (20989)Memory used [KB]: 744
% 0.15/0.39  % (20989)Time elapsed: 0.004 s
% 0.15/0.39  % (20991)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39  % (20989)Instructions burned: 2 (million)
% 0.15/0.39  % (20991)Terminated due to inappropriate strategy.
% 0.15/0.39  % (20991)------------------------------
% 0.15/0.39  % (20991)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (20991)Termination reason: Inappropriate
% 0.15/0.39  
% 0.15/0.39  % (20991)Memory used [KB]: 744
% 0.15/0.39  % (20991)Time elapsed: 0.003 s
% 0.15/0.39  % (20991)Instructions burned: 2 (million)
% 0.15/0.39  % (20991)------------------------------
% 0.15/0.39  % (20991)------------------------------
% 0.15/0.39  % (20989)------------------------------
% 0.15/0.39  % (20989)------------------------------
% 0.15/0.42  % (20997)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.22/0.42  % (20998)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.22/0.43  % (20996)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.22/0.43  % (20996)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.43  % (20996)Terminated due to inappropriate strategy.
% 0.22/0.43  % (20996)------------------------------
% 0.22/0.43  % (20996)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.43  % (20996)Termination reason: Inappropriate
% 0.22/0.43  
% 0.22/0.43  % (20996)Memory used [KB]: 744
% 0.22/0.43  % (20996)Time elapsed: 0.004 s
% 0.22/0.43  % (20996)Instructions burned: 2 (million)
% 0.22/0.43  % (20996)------------------------------
% 0.22/0.43  % (20996)------------------------------
% 0.22/0.46  % (20999)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 2.47/0.71  % (20998)First to succeed.
% 2.47/0.71  % (20998)Refutation found. Thanks to Tanya!
% 2.47/0.71  % SZS status Theorem for theBenchmark
% 2.47/0.71  % SZS output start Proof for theBenchmark
% See solution above
% 2.47/0.71  % (20998)------------------------------
% 2.47/0.71  % (20998)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 2.47/0.71  % (20998)Termination reason: Refutation
% 2.47/0.71  
% 2.47/0.71  % (20998)Memory used [KB]: 2462
% 2.47/0.71  % (20998)Time elapsed: 0.292 s
% 2.47/0.71  % (20998)Instructions burned: 673 (million)
% 2.47/0.71  % (20998)------------------------------
% 2.47/0.71  % (20998)------------------------------
% 2.47/0.71  % (20985)Success in time 0.343 s
%------------------------------------------------------------------------------