TSTP Solution File: DAT023_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT023_1 : TPTP v8.2.0. Released v5.0.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n003.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 : Mon May 20 19:49:20 EDT 2024

% Result   : Theorem 0.58s 0.77s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   60 (  17 unt;   8 typ;   0 def)
%            Number of atoms       :  108 (  18 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   97 (  41   ~;  30   |;  11   &)
%                                         (   6 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  122 (  26 atm;   3 fun;  62 num;  31 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :   11 (   6 usr;   8 con; 0-2 aty)
%            Number of variables   :   50 (  44   !;   6   ?;  50   :)

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

tff(func_def_0,type,
    empty: collection ).

tff(func_def_1,type,
    add: ( $int * collection ) > collection ).

tff(func_def_2,type,
    remove: ( $int * collection ) > collection ).

tff(func_def_9,type,
    sK0: collection ).

tff(func_def_10,type,
    sK1: collection ).

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

tff(pred_def_1,type,
    in: ( $int * collection ) > $o ).

tff(f1305,plain,
    $false,
    inference(avatar_sat_refutation,[],[f49,f949,f1073,f1175,f1304]) ).

tff(f1304,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f1303]) ).

tff(f1303,plain,
    ( $false
    | ~ spl3_1 ),
    inference(subsumption_resolution,[],[f1263,f32]) ).

tff(f32,plain,
    ! [X0: $int,X1: collection] : ~ in(X0,remove(X0,X1)),
    inference(cnf_transformation,[],[f22]) ).

tff(f22,plain,
    ! [X0: $int,X1: collection] : ~ in(X0,remove(X0,X1)),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X3: $int,X4: collection] : ~ in(X3,remove(X3,X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

tff(f1263,plain,
    ( in(2,remove(2,sK1))
    | ~ spl3_1 ),
    inference(superposition,[],[f513,f43]) ).

tff(f43,plain,
    ( ( 2 = sK2 )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f41]) ).

tff(f41,plain,
    ( spl3_1
  <=> ( 2 = sK2 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

tff(f513,plain,
    in(sK2,remove(2,sK1)),
    inference(unit_resulting_resolution,[],[f129,f30]) ).

tff(f30,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,remove(X2,X1))
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( X0 != X2 )
        & in(X0,X1) )
    <=> in(X0,remove(X2,X1)) ),
    inference(rectify,[],[f5]) ).

tff(f5,axiom,
    ! [X8: $int,X9: collection,X10: $int] :
      ( ( ( X8 != X10 )
        & in(X8,X9) )
    <=> in(X8,remove(X10,X9)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

tff(f129,plain,
    in(sK2,remove(1,remove(2,sK1))),
    inference(unit_resulting_resolution,[],[f25,f126]) ).

tff(f126,plain,
    ! [X0: $int] :
      ( in(X0,remove(1,remove(2,sK1)))
      | ~ in(X0,sK0) ),
    inference(superposition,[],[f30,f28]) ).

tff(f28,plain,
    sK0 = remove(4,remove(1,remove(2,sK1))),
    inference(cnf_transformation,[],[f24]) ).

tff(f24,plain,
    ? [X0: collection,X1: collection] :
      ( ? [X3: $int] :
          ( ~ $less(2,X3)
          & in(X3,X0) )
      & ( remove(4,remove(1,remove(2,X1))) = X0 )
      & ! [X2: $int] :
          ( $less(0,X2)
          | ~ in(X2,X1) ) ),
    inference(flattening,[],[f23]) ).

tff(f23,plain,
    ? [X0: collection,X1: collection] :
      ( ? [X3: $int] :
          ( ~ $less(2,X3)
          & in(X3,X0) )
      & ( remove(4,remove(1,remove(2,X1))) = X0 )
      & ! [X2: $int] :
          ( $less(0,X2)
          | ~ in(X2,X1) ) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ ! [X0: collection,X1: collection] :
        ( ( ( remove(4,remove(1,remove(2,X1))) = X0 )
          & ! [X2: $int] :
              ( in(X2,X1)
             => $less(0,X2) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $less(2,X3) ) ),
    inference(theory_normalization,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ ! [X0: collection,X1: collection] :
        ( ( ( remove(4,remove(1,remove(2,X1))) = X0 )
          & ! [X2: $int] :
              ( in(X2,X1)
             => $greater(X2,0) ) )
       => ! [X3: $int] :
            ( in(X3,X0)
           => $greater(X3,2) ) ),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    ! [X0: collection,X1: collection] :
      ( ( ( remove(4,remove(1,remove(2,X1))) = X0 )
        & ! [X2: $int] :
            ( in(X2,X1)
           => $greater(X2,0) ) )
     => ! [X3: $int] :
          ( in(X3,X0)
         => $greater(X3,2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f25,plain,
    in(sK2,sK0),
    inference(cnf_transformation,[],[f24]) ).

tff(f1175,plain,
    ( ~ spl3_2
    | ~ spl3_8 ),
    inference(avatar_split_clause,[],[f1172,f945,f45]) ).

tff(f45,plain,
    ( spl3_2
  <=> $less(sK2,2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

tff(f945,plain,
    ( spl3_8
  <=> $less(1,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_8])]) ).

tff(f1172,plain,
    ( ~ $less(sK2,2)
    | ~ spl3_8 ),
    inference(evaluation,[],[f1084]) ).

tff(f1084,plain,
    ( ~ $less(sK2,$sum(1,1))
    | ~ spl3_8 ),
    inference(unit_resulting_resolution,[],[f947,f20]) ).

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

tff(f947,plain,
    ( $less(1,sK2)
    | ~ spl3_8 ),
    inference(avatar_component_clause,[],[f945]) ).

tff(f1073,plain,
    ( spl3_1
    | ~ spl3_7 ),
    inference(avatar_contradiction_clause,[],[f1072]) ).

tff(f1072,plain,
    ( $false
    | spl3_1
    | ~ spl3_7 ),
    inference(subsumption_resolution,[],[f1019,f135]) ).

tff(f135,plain,
    ! [X0: $int] : ~ in(1,remove(X0,sK0)),
    inference(unit_resulting_resolution,[],[f131,f30]) ).

tff(f131,plain,
    ~ in(1,sK0),
    inference(unit_resulting_resolution,[],[f33,f126]) ).

tff(f33,plain,
    ! [X2: $int,X1: collection] : ~ in(X2,remove(X2,X1)),
    inference(equality_resolution,[],[f31]) ).

tff(f31,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( ~ in(X0,remove(X2,X1))
      | ( X0 != X2 ) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f1019,plain,
    ( in(1,remove(2,sK0))
    | spl3_1
    | ~ spl3_7 ),
    inference(superposition,[],[f414,f943]) ).

tff(f943,plain,
    ( ( 1 = sK2 )
    | ~ spl3_7 ),
    inference(avatar_component_clause,[],[f941]) ).

tff(f941,plain,
    ( spl3_7
  <=> ( 1 = sK2 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).

tff(f414,plain,
    ( in(sK2,remove(2,sK0))
    | spl3_1 ),
    inference(unit_resulting_resolution,[],[f25,f42,f29]) ).

tff(f29,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( in(X0,remove(X2,X1))
      | ~ in(X0,X1)
      | ( X0 = X2 ) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f42,plain,
    ( ( 2 != sK2 )
    | spl3_1 ),
    inference(avatar_component_clause,[],[f41]) ).

tff(f949,plain,
    ( spl3_7
    | spl3_8 ),
    inference(avatar_split_clause,[],[f939,f945,f941]) ).

tff(f939,plain,
    ( $less(1,sK2)
    | ( 1 = sK2 ) ),
    inference(resolution,[],[f847,f16]) ).

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

tff(f847,plain,
    ~ $less(sK2,1),
    inference(evaluation,[],[f758]) ).

tff(f758,plain,
    ~ $less(sK2,$sum(0,1)),
    inference(unit_resulting_resolution,[],[f751,f20]) ).

tff(f751,plain,
    $less(0,sK2),
    inference(unit_resulting_resolution,[],[f745,f27]) ).

tff(f27,plain,
    ! [X2: $int] :
      ( ~ in(X2,sK1)
      | $less(0,X2) ),
    inference(cnf_transformation,[],[f24]) ).

tff(f745,plain,
    in(sK2,sK1),
    inference(unit_resulting_resolution,[],[f513,f30]) ).

tff(f49,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f38,f45,f41]) ).

tff(f38,plain,
    ( $less(sK2,2)
    | ( 2 = sK2 ) ),
    inference(resolution,[],[f26,f16]) ).

tff(f26,plain,
    ~ $less(2,sK2),
    inference(cnf_transformation,[],[f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : DAT023_1 : TPTP v8.2.0. Released v5.0.0.
% 0.13/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 23:43:08 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.13/0.36  This is a TF0_THM_EQU_ARI problem
% 0.13/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.75  % (17083)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 (2996ds/56Mi)
% 0.55/0.75  % (17076)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 (2996ds/34Mi)
% 0.55/0.75  % (17078)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.75  % (17080)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 (2996ds/34Mi)
% 0.55/0.75  % (17077)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 (2996ds/51Mi)
% 0.55/0.75  % (17081)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.75  % (17079)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.75  % (17082)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 (2996ds/83Mi)
% 0.58/0.76  % (17083)Instruction limit reached!
% 0.58/0.76  % (17083)------------------------------
% 0.58/0.76  % (17083)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76  % (17083)Termination reason: Unknown
% 0.58/0.76  % (17083)Termination phase: Saturation
% 0.58/0.76  
% 0.58/0.76  % (17083)Memory used [KB]: 1177
% 0.58/0.76  % (17083)Time elapsed: 0.018 s
% 0.58/0.76  % (17083)Instructions burned: 58 (million)
% 0.58/0.76  % (17083)------------------------------
% 0.58/0.76  % (17083)------------------------------
% 0.58/0.76  % (17080)Instruction limit reached!
% 0.58/0.76  % (17080)------------------------------
% 0.58/0.76  % (17080)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76  % (17080)Termination reason: Unknown
% 0.58/0.76  % (17080)Termination phase: Saturation
% 0.58/0.76  
% 0.58/0.76  % (17080)Memory used [KB]: 1129
% 0.58/0.76  % (17080)Time elapsed: 0.019 s
% 0.58/0.76  % (17080)Instructions burned: 34 (million)
% 0.58/0.77  % (17080)------------------------------
% 0.58/0.77  % (17080)------------------------------
% 0.58/0.77  % (17076)Instruction limit reached!
% 0.58/0.77  % (17076)------------------------------
% 0.58/0.77  % (17076)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77  % (17084)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.58/0.77  % (17076)Termination reason: Unknown
% 0.58/0.77  % (17076)Termination phase: Saturation
% 0.58/0.77  
% 0.58/0.77  % (17076)Memory used [KB]: 1142
% 0.58/0.77  % (17076)Time elapsed: 0.020 s
% 0.58/0.77  % (17076)Instructions burned: 34 (million)
% 0.58/0.77  % (17076)------------------------------
% 0.58/0.77  % (17076)------------------------------
% 0.58/0.77  % (17079)Instruction limit reached!
% 0.58/0.77  % (17079)------------------------------
% 0.58/0.77  % (17079)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77  % (17079)Termination reason: Unknown
% 0.58/0.77  % (17079)Termination phase: Saturation
% 0.58/0.77  
% 0.58/0.77  % (17079)Memory used [KB]: 1239
% 0.58/0.77  % (17079)Time elapsed: 0.021 s
% 0.58/0.77  % (17079)Instructions burned: 34 (million)
% 0.58/0.77  % (17079)------------------------------
% 0.58/0.77  % (17079)------------------------------
% 0.58/0.77  % (17082)First to succeed.
% 0.58/0.77  % (17085)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.58/0.77  % (17082)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-17075"
% 0.58/0.77  % (17086)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.58/0.77  % (17082)Refutation found. Thanks to Tanya!
% 0.58/0.77  % SZS status Theorem for theBenchmark
% 0.58/0.77  % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.77  % (17082)------------------------------
% 0.58/0.77  % (17082)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.77  % (17082)Termination reason: Refutation
% 0.58/0.77  
% 0.58/0.77  % (17082)Memory used [KB]: 1368
% 0.58/0.77  % (17082)Time elapsed: 0.023 s
% 0.58/0.77  % (17082)Instructions burned: 36 (million)
% 0.58/0.77  % (17075)Success in time 0.396 s
% 0.58/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------