TSTP Solution File: DAT066_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT066_1 : TPTP v8.2.0. Released v5.5.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 : n023.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:31 EDT 2024

% Result   : Theorem 0.70s 0.86s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   25 (   6 unt;  11 typ;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (  10   ~;   5   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   38 (   0 atm;  10 fun;  10 num;  18 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    9 (   6   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   27 (  24   !;   3   ?;  27   :)

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

tff(func_def_0,type,
    empty: heap ).

tff(func_def_1,type,
    toop: heap > $int ).

tff(func_def_2,type,
    sel: ( heap * $int ) > $int ).

tff(func_def_3,type,
    length: heap > $int ).

tff(func_def_4,type,
    app: ( heap * $int ) > heap ).

tff(func_def_5,type,
    get: heap > heap ).

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

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

tff(func_def_12,type,
    sK2: heap ).

tff(pred_def_1,type,
    lsls: ( heap * heap ) > $o ).

tff(f78,plain,
    $false,
    inference(trivial_inequality_removal,[],[f76]) ).

tff(f76,plain,
    sK0 != sK0,
    inference(superposition,[],[f44,f65]) ).

tff(f65,plain,
    ! [X0: $int] : ( sel(app(sK2,X0),sK1) = X0 ),
    inference(superposition,[],[f61,f45]) ).

tff(f45,plain,
    sK1 = $sum(1,length(sK2)),
    inference(cnf_transformation,[],[f39]) ).

tff(f39,plain,
    ? [X0: $int,X1: $int,X2: heap] :
      ( ( $sum(1,length(X2)) = X1 )
      & ( sel(app(X2,X0),X1) != X0 ) ),
    inference(ennf_transformation,[],[f29]) ).

tff(f29,plain,
    ~ ! [X0: $int,X1: $int,X2: heap] :
        ( ( $sum(1,length(X2)) != X1 )
        | ( sel(app(X2,X0),X1) = X0 ) ),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ! [X2: $int,X0: $int,X1: heap] :
        ( ( $sum(1,length(X1)) != X0 )
        | ( sel(app(X1,X2),X0) = X2 ) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ! [X2: $int,X0: $int,X1: heap] :
      ( ( $sum(1,length(X1)) != X0 )
      | ( sel(app(X1,X2),X0) = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_1) ).

tff(f61,plain,
    ! [X2: $int,X0: heap] : ( sel(app(X0,X2),$sum(1,length(X0))) = X2 ),
    inference(equality_resolution,[],[f47]) ).

tff(f47,plain,
    ! [X2: $int,X0: heap,X1: $int] :
      ( ( $sum(1,length(X0)) != X1 )
      | ( sel(app(X0,X2),X1) = X2 ) ),
    inference(cnf_transformation,[],[f41]) ).

tff(f41,plain,
    ! [X0: heap,X1: $int,X2: $int] :
      ( ( sel(app(X0,X2),X1) = X2 )
      | ( $sum(1,length(X0)) != X1 ) ),
    inference(ennf_transformation,[],[f31]) ).

tff(f31,plain,
    ! [X0: heap,X1: $int,X2: $int] :
      ( ( $sum(1,length(X0)) = X1 )
     => ( sel(app(X0,X2),X1) = X2 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,axiom,
    ! [X1: heap,X0: $int,X2: $int] :
      ( ( $sum(1,length(X1)) = X0 )
     => ( sel(app(X1,X2),X0) = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_2) ).

tff(f44,plain,
    sK0 != sel(app(sK2,sK0),sK1),
    inference(cnf_transformation,[],[f39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15  % Problem    : DAT066_1 : TPTP v8.2.0. Released v5.5.0.
% 0.15/0.17  % 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.16/0.39  % Computer : n023.cluster.edu
% 0.16/0.39  % Model    : x86_64 x86_64
% 0.16/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39  % Memory   : 8042.1875MB
% 0.16/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit   : 300
% 0.16/0.39  % WCLimit    : 300
% 0.16/0.39  % DateTime   : Sun May 19 23:29:53 EDT 2024
% 0.16/0.39  % CPUTime    : 
% 0.16/0.39  This is a TF0_THM_EQU_ARI problem
% 0.16/0.40  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.67/0.85  % (30335)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.67/0.85  % (30328)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.67/0.85  % (30329)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.70/0.85  % (30328)Refutation not found, incomplete strategy% (30328)------------------------------
% 0.70/0.85  % (30328)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.85  % (30334)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.70/0.85  % (30330)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.70/0.86  % (30331)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.70/0.86  % (30334)First to succeed.
% 0.70/0.86  % (30334)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30326"
% 0.70/0.86  % (30328)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.86  
% 0.70/0.86  % (30328)Memory used [KB]: 1074
% 0.70/0.86  % (30328)Time elapsed: 0.005 s
% 0.70/0.86  % (30328)Instructions burned: 4 (million)
% 0.70/0.86  % (30328)------------------------------
% 0.70/0.86  % (30328)------------------------------
% 0.70/0.86  % (30334)Refutation found. Thanks to Tanya!
% 0.70/0.86  % SZS status Theorem for theBenchmark
% 0.70/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.86  % (30334)------------------------------
% 0.70/0.86  % (30334)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.86  % (30334)Termination reason: Refutation
% 0.70/0.86  
% 0.70/0.86  % (30334)Memory used [KB]: 1069
% 0.70/0.86  % (30334)Time elapsed: 0.006 s
% 0.70/0.86  % (30334)Instructions burned: 5 (million)
% 0.70/0.86  % (30326)Success in time 0.457 s
% 0.70/0.86  % Vampire---4.8 exiting
%------------------------------------------------------------------------------