TSTP Solution File: DAT057_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT057_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n012.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:29 EDT 2024

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

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

tff(type_def_6,type,
    array: $tType ).

tff(func_def_0,type,
    mkarray: array ).

tff(func_def_1,type,
    none: data ).

tff(func_def_2,type,
    put: ( array * $int * data ) > array ).

tff(func_def_3,type,
    get: ( array * $int ) > data ).

tff(func_def_4,type,
    sK0: data ).

tff(func_def_5,type,
    sK1: array ).

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

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

tff(func_def_8,type,
    sK4: ( array * array ) > $int ).

tff(f31,plain,
    $false,
    inference(subsumption_resolution,[],[f30,f22]) ).

tff(f22,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ( ( sK2 != sK3 )
    & ( get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f13,f15]) ).

tff(f15,plain,
    ( ? [X0: data,X1: array,X2: $int,X3: $int] :
        ( ( X2 != X3 )
        & ( get(X1,X3) != get(put(X1,X2,X0),X3) ) )
   => ( ( sK2 != sK3 )
      & ( get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f13,plain,
    ? [X0: data,X1: array,X2: $int,X3: $int] :
      ( ( X2 != X3 )
      & ( get(X1,X3) != get(put(X1,X2,X0),X3) ) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ ! [X0: data,X1: array,X2: $int,X3: $int] :
        ( ( X2 = X3 )
        | ( get(X1,X3) = get(put(X1,X2,X0),X3) ) ),
    inference(rectify,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ ! [X2: data,X1: array,X0: $int,X3: $int] :
        ( ( X0 = X3 )
        | ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    ! [X2: data,X1: array,X0: $int,X3: $int] :
      ( ( X0 = X3 )
      | ( get(X1,X3) = get(put(X1,X0,X2),X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_1) ).

tff(f30,plain,
    sK2 = sK3,
    inference(trivial_inequality_removal,[],[f29]) ).

tff(f29,plain,
    ( ( get(sK1,sK3) != get(sK1,sK3) )
    | ( sK2 = sK3 ) ),
    inference(superposition,[],[f21,f24]) ).

tff(f24,plain,
    ! [X2: array,X3: $int,X0: $int,X1: data] :
      ( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
      | ( X0 = X3 ) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f14,plain,
    ! [X0: $int,X1: data,X2: array,X3: $int] :
      ( ( get(put(X2,X0,X1),X3) = get(X2,X3) )
      | ( X0 = X3 ) ),
    inference(ennf_transformation,[],[f10]) ).

tff(f10,plain,
    ! [X0: $int,X1: data,X2: array,X3: $int] :
      ( ( X0 != X3 )
     => ( get(put(X2,X0,X1),X3) = get(X2,X3) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X3: $int,X2: data,X1: array,X0: $int] :
      ( ( X0 != X3 )
     => ( get(put(X1,X3,X2),X0) = get(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_19) ).

tff(f21,plain,
    get(sK1,sK3) != get(put(sK1,sK2,sK0),sK3),
    inference(cnf_transformation,[],[f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : DAT057_1 : TPTP v8.2.0. Released v5.5.0.
% 0.00/0.11  % 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.09/0.31  % Computer : n012.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit   : 300
% 0.09/0.31  % WCLimit    : 300
% 0.09/0.31  % DateTime   : Sun May 19 23:38:23 EDT 2024
% 0.09/0.31  % CPUTime    : 
% 0.09/0.31  This is a TF0_THM_EQU_ARI problem
% 0.09/0.31  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.60/0.77  % (18160)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.60/0.77  % (18162)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.77  % (18161)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.60/0.77  % (18163)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.60/0.77  % (18164)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.60/0.77  % (18165)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.60/0.77  % (18166)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.60/0.77  % (18167)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.60/0.77  % (18164)Refutation not found, incomplete strategy% (18164)------------------------------
% 0.60/0.77  % (18164)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77  % (18164)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77  
% 0.60/0.77  % (18164)Memory used [KB]: 987
% 0.60/0.77  % (18164)Time elapsed: 0.003 s
% 0.60/0.77  % (18164)Instructions burned: 2 (million)
% 0.60/0.77  % (18163)Also succeeded, but the first one will report.
% 0.60/0.77  % (18160)Also succeeded, but the first one will report.
% 0.60/0.77  % (18165)First to succeed.
% 0.60/0.77  % (18167)Refutation not found, incomplete strategy% (18167)------------------------------
% 0.60/0.77  % (18167)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77  % (18167)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77  
% 0.60/0.77  % (18167)Memory used [KB]: 973
% 0.60/0.77  % (18167)Time elapsed: 0.002 s
% 0.60/0.77  % (18167)Instructions burned: 2 (million)
% 0.60/0.77  % (18161)Also succeeded, but the first one will report.
% 0.60/0.77  % (18164)------------------------------
% 0.60/0.77  % (18164)------------------------------
% 0.60/0.77  % (18162)Also succeeded, but the first one will report.
% 0.60/0.77  % (18166)Also succeeded, but the first one will report.
% 0.60/0.78  % (18167)------------------------------
% 0.60/0.78  % (18167)------------------------------
% 0.60/0.78  % (18165)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18159"
% 0.60/0.78  % (18165)Refutation found. Thanks to Tanya!
% 0.60/0.78  % SZS status Theorem for theBenchmark
% 0.60/0.78  % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.78  % (18165)------------------------------
% 0.60/0.78  % (18165)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78  % (18165)Termination reason: Refutation
% 0.60/0.78  
% 0.60/0.78  % (18165)Memory used [KB]: 981
% 0.60/0.78  % (18165)Time elapsed: 0.003 s
% 0.60/0.78  % (18165)Instructions burned: 3 (million)
% 0.60/0.78  % (18159)Success in time 0.462 s
% 0.60/0.78  % Vampire---4.8 exiting
%------------------------------------------------------------------------------