TSTP Solution File: DAT004_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT004_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 : n022.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:16 EDT 2024

% Result   : Theorem 0.79s 0.97s
% Output   : Refutation 0.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   28 (   9 unt;   6 typ;   0 def)
%            Number of atoms       :   46 (  45 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  13   ~;  11   |;  10   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :  131 (   0 atm;   0 fun; 111 num;  20 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    :   12 (   5 usr;  10 con; 0-3 aty)
%            Number of variables   :   35 (  26   !;   9   ?;  35   :)

% 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(func_def_11,type,
    sK2: $int ).

tff(f40,plain,
    $false,
    inference(subsumption_resolution,[],[f38,f12]) ).

tff(f12,plain,
    66 != read(sK0,4),
    inference(cnf_transformation,[],[f9]) ).

tff(f9,plain,
    ( ( 66 != read(sK0,4) )
    & ( 44 != read(sK0,4) )
    & ( sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8]) ).

tff(f8,plain,
    ( ? [X0: array,X1: array,X2: $int] :
        ( ( 66 != read(X0,4) )
        & ( 44 != read(X0,4) )
        & ( write(write(write(write(X1,3,33),4,44),5,55),X2,66) = X0 ) )
   => ( ( 66 != read(sK0,4) )
      & ( 44 != read(sK0,4) )
      & ( sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

tff(f3,conjecture,
    ! [X0: array,X1: array,X2: $int] :
      ( ( write(write(write(write(X1,3,33),4,44),5,55),X2,66) = X0 )
     => ( ( 66 = read(X0,4) )
        | ( 44 = read(X0,4) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(f38,plain,
    66 = read(sK0,4),
    inference(superposition,[],[f15,f37]) ).

tff(f37,plain,
    4 = sK2,
    inference(subsumption_resolution,[],[f36,f11]) ).

tff(f11,plain,
    44 != read(sK0,4),
    inference(cnf_transformation,[],[f9]) ).

tff(f36,plain,
    ( ( 44 = read(sK0,4) )
    | ( 4 = sK2 ) ),
    inference(evaluation,[],[f32]) ).

tff(f32,plain,
    ( ( 44 = read(sK0,4) )
    | ( 4 = sK2 )
    | ( 4 = 5 ) ),
    inference(superposition,[],[f17,f14]) ).

tff(f14,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/benchmark/theBenchmark.p',ax1) ).

tff(f17,plain,
    ! [X0: $int] :
      ( ( read(sK0,X0) = read(write(write(sK1,3,33),4,44),X0) )
      | ( sK2 = X0 )
      | ( 5 = X0 ) ),
    inference(superposition,[],[f16,f13]) ).

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

tff(f5,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/sandbox/benchmark/theBenchmark.p',ax2) ).

tff(f16,plain,
    ! [X0: $int] :
      ( ( read(write(write(write(sK1,3,33),4,44),5,55),X0) = read(sK0,X0) )
      | ( sK2 = X0 ) ),
    inference(superposition,[],[f13,f10]) ).

tff(f10,plain,
    sK0 = write(write(write(write(sK1,3,33),4,44),5,55),sK2,66),
    inference(cnf_transformation,[],[f9]) ).

tff(f15,plain,
    66 = read(sK0,sK2),
    inference(superposition,[],[f14,f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : DAT004_1 : TPTP v8.2.0. Released v5.0.0.
% 0.12/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 : n022.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.20/0.35  % WCLimit    : 300
% 0.20/0.35  % DateTime   : Sun May 19 23:15:37 EDT 2024
% 0.20/0.35  % CPUTime    : 
% 0.20/0.35  This is a TF0_THM_EQU_ARI problem
% 0.20/0.35  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.79/0.96  % (5001)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2993ds/33Mi)
% 0.79/0.96  % (4998)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 (2993ds/34Mi)
% 0.79/0.96  % (5002)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 (2993ds/34Mi)
% 0.79/0.96  % (4999)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 (2993ds/51Mi)
% 0.79/0.96  % (5004)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 (2993ds/83Mi)
% 0.79/0.96  % (5003)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2993ds/45Mi)
% 0.79/0.96  % (5005)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 (2993ds/56Mi)
% 0.79/0.96  % (5000)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2993ds/78Mi)
% 0.79/0.96  % (5005)Refutation not found, incomplete strategy% (5005)------------------------------
% 0.79/0.96  % (5005)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.96  % (5002)Refutation not found, incomplete strategy% (5002)------------------------------
% 0.79/0.96  % (5002)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.96  % (5002)Termination reason: Refutation not found, incomplete strategy
% 0.79/0.96  
% 0.79/0.96  % (5002)Memory used [KB]: 983
% 0.79/0.96  % (5002)Time elapsed: 0.003 s
% 0.79/0.96  % (5002)Instructions burned: 2 (million)
% 0.79/0.96  % (5005)Termination reason: Refutation not found, incomplete strategy
% 0.79/0.96  
% 0.79/0.96  % (5005)Memory used [KB]: 969
% 0.79/0.96  % (5005)Time elapsed: 0.003 s
% 0.79/0.96  % (4998)Refutation not found, incomplete strategy% (4998)------------------------------
% 0.79/0.96  % (4998)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.96  % (5005)Instructions burned: 2 (million)
% 0.79/0.96  % (4998)Termination reason: Refutation not found, incomplete strategy
% 0.79/0.96  
% 0.79/0.96  % (4998)Memory used [KB]: 984
% 0.79/0.96  % (4998)Time elapsed: 0.003 s
% 0.79/0.96  % (4998)Instructions burned: 2 (million)
% 0.79/0.96  % (5002)------------------------------
% 0.79/0.96  % (5002)------------------------------
% 0.79/0.96  % (5005)------------------------------
% 0.79/0.96  % (5005)------------------------------
% 0.79/0.96  % (5001)Refutation not found, incomplete strategy% (5001)------------------------------
% 0.79/0.96  % (5001)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.96  % (5001)Termination reason: Refutation not found, incomplete strategy
% 0.79/0.96  
% 0.79/0.96  % (5001)Memory used [KB]: 986
% 0.79/0.96  % (5001)Time elapsed: 0.004 s
% 0.79/0.96  % (5001)Instructions burned: 3 (million)
% 0.79/0.96  % (4998)------------------------------
% 0.79/0.96  % (4998)------------------------------
% 0.79/0.96  % (5001)------------------------------
% 0.79/0.96  % (5001)------------------------------
% 0.79/0.96  % (5003)First to succeed.
% 0.79/0.96  % (4999)Also succeeded, but the first one will report.
% 0.79/0.96  % (5000)Also succeeded, but the first one will report.
% 0.79/0.96  % (5004)Also succeeded, but the first one will report.
% 0.79/0.97  % (5003)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4997"
% 0.79/0.97  % (5003)Refutation found. Thanks to Tanya!
% 0.79/0.97  % SZS status Theorem for theBenchmark
% 0.79/0.97  % SZS output start Proof for theBenchmark
% See solution above
% 0.79/0.97  % (5003)------------------------------
% 0.79/0.97  % (5003)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.97  % (5003)Termination reason: Refutation
% 0.79/0.97  
% 0.79/0.97  % (5003)Memory used [KB]: 999
% 0.79/0.97  % (5003)Time elapsed: 0.005 s
% 0.79/0.97  % (5003)Instructions burned: 4 (million)
% 0.79/0.97  % (4997)Success in time 0.607 s
% 0.79/0.97  % Vampire---4.8 exiting
%------------------------------------------------------------------------------