TSTP Solution File: DAT006_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT006_1 : TPTP v8.1.2. 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 : n019.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 : Sun May  5 05:04:14 EDT 2024

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

% 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_9,type,
    sK0: array ).

tff(func_def_10,type,
    sK1: array ).

tff(f39,plain,
    $false,
    inference(subsumption_resolution,[],[f38,f8]) ).

tff(f8,plain,
    ! [X2: $int] : ( 33 != read(sK0,X2) ),
    inference(cnf_transformation,[],[f6]) ).

tff(f6,plain,
    ? [X0: array,X1: array] :
      ( ! [X2: $int] : ( 33 != read(X0,X2) )
      & ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f4,negated_conjecture,
    ~ ! [X0: array,X1: array] :
        ( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
       => ? [X2: $int] : ( 33 = read(X0,X2) ) ),
    inference(negated_conjecture,[],[f3]) ).

tff(f3,conjecture,
    ! [X0: array,X1: array] :
      ( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
     => ? [X2: $int] : ( 33 = read(X0,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.NeMpGKh8Ry/Vampire---4.8_21048',co1) ).

tff(f38,plain,
    33 = read(sK0,3),
    inference(evaluation,[],[f34]) ).

tff(f34,plain,
    ( ( 33 = read(sK0,3) )
    | ( 3 = 4 )
    | ( 3 = 5 ) ),
    inference(superposition,[],[f32,f10]) ).

tff(f10,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/sandbox/tmp/tmp.NeMpGKh8Ry/Vampire---4.8_21048',ax1) ).

tff(f32,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
      | ( 4 = X0 )
      | ( 5 = X0 ) ),
    inference(duplicate_literal_removal,[],[f27]) ).

tff(f27,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
      | ( 4 = X0 )
      | ( 5 = X0 )
      | ( 4 = X0 ) ),
    inference(superposition,[],[f18,f9]) ).

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

tff(f5,plain,
    ! [X0: array,X1: $int,X2: $int,X3: $int] :
      ( ( read(X0,X2) = read(write(X0,X1,X3),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/sandbox/tmp/tmp.NeMpGKh8Ry/Vampire---4.8_21048',ax2) ).

tff(f18,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
      | ( 4 = X0 )
      | ( 5 = X0 ) ),
    inference(superposition,[],[f14,f9]) ).

tff(f14,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(write(write(sK1,3,33),4,444),5,55),X0) )
      | ( 4 = X0 ) ),
    inference(superposition,[],[f9,f7]) ).

tff(f7,plain,
    sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : DAT006_1 : TPTP v8.1.2. Released v5.0.0.
% 0.14/0.15  % 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.36  % Computer : n019.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Fri May  3 13:00:44 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  This is a TF0_THM_EQU_ARI problem
% 0.16/0.37  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/tmp/tmp.NeMpGKh8Ry/Vampire---4.8_21048
% 0.57/0.75  % (21383)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.75  % (21377)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.75  % (21380)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75  % (21378)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 Vampire---4 for (2996ds/51Mi)
% 0.57/0.75  % (21381)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.75  % (21382)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75  % (21383)First to succeed.
% 0.57/0.75  % (21383)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21276"
% 0.57/0.75  % (21377)Refutation not found, incomplete strategy% (21377)------------------------------
% 0.57/0.75  % (21377)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (21377)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  % (21381)Refutation not found, incomplete strategy% (21381)------------------------------
% 0.57/0.75  % (21381)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (21381)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (21381)Memory used [KB]: 976
% 0.57/0.75  % (21381)Time elapsed: 0.003 s
% 0.57/0.75  % (21381)Instructions burned: 2 (million)
% 0.57/0.75  
% 0.57/0.75  % (21377)Memory used [KB]: 975
% 0.57/0.75  % (21377)Time elapsed: 0.003 s
% 0.57/0.75  % (21377)Instructions burned: 2 (million)
% 0.57/0.75  % (21380)Refutation not found, incomplete strategy% (21380)------------------------------
% 0.57/0.75  % (21380)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (21380)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75  
% 0.57/0.75  % (21380)Memory used [KB]: 978
% 0.57/0.75  % (21380)Time elapsed: 0.003 s
% 0.57/0.75  % (21380)Instructions burned: 2 (million)
% 0.57/0.75  % (21381)------------------------------
% 0.57/0.75  % (21381)------------------------------
% 0.57/0.75  % (21383)Refutation found. Thanks to Tanya!
% 0.57/0.75  % SZS status Theorem for Vampire---4
% 0.57/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75  % (21383)------------------------------
% 0.57/0.75  % (21383)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (21383)Termination reason: Refutation
% 0.57/0.75  
% 0.57/0.75  % (21383)Memory used [KB]: 1056
% 0.57/0.75  % (21383)Time elapsed: 0.003 s
% 0.57/0.75  % (21383)Instructions burned: 5 (million)
% 0.57/0.75  % (21276)Success in time 0.378 s
% 0.61/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------