TSTP Solution File: DAT019_1 by Vampire---4.8

View Problem - Process Solution

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

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

% 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(pred_def_1,type,
    in: ( $int * collection ) > $o ).

tff(pred_def_2,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f35,plain,
    $false,
    inference(subsumption_resolution,[],[f34,f26]) ).

tff(f26,plain,
    ! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ! [X0: $int,X1: collection] : in(X0,add(X0,X1)),
    inference(rectify,[],[f2]) ).

tff(f2,axiom,
    ! [X1: $int,X2: collection] : in(X1,add(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.PtwQRtCmDl/Vampire---4.8_9920',ax2) ).

tff(f34,plain,
    ~ in(3,add(3,add(5,empty))),
    inference(resolution,[],[f22,f17]) ).

tff(f17,plain,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(cnf_transformation,[],[f8]) ).

tff(f8,plain,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(flattening,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ in(3,add(1,add(3,add(5,empty)))),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    in(3,add(1,add(3,add(5,empty)))),
    file('/export/starexec/sandbox/tmp/tmp.PtwQRtCmDl/Vampire---4.8_9920',co1) ).

tff(f22,plain,
    ! [X2: $int,X0: $int,X1: collection] :
      ( in(X0,add(X2,X1))
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( X0 = X2 )
        | in(X0,X1)
        | ~ in(X0,add(X2,X1)) )
      & ( in(X0,add(X2,X1))
        | ( ( X0 != X2 )
          & ~ in(X0,X1) ) ) ),
    inference(flattening,[],[f15]) ).

tff(f15,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( X0 = X2 )
        | in(X0,X1)
        | ~ in(X0,add(X2,X1)) )
      & ( in(X0,add(X2,X1))
        | ( ( X0 != X2 )
          & ~ in(X0,X1) ) ) ),
    inference(nnf_transformation,[],[f10]) ).

tff(f10,plain,
    ! [X0: $int,X1: collection,X2: $int] :
      ( ( ( X0 = X2 )
        | in(X0,X1) )
    <=> in(X0,add(X2,X1)) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X5: $int,X6: collection,X7: $int] :
      ( ( ( X5 = X7 )
        | in(X5,X6) )
    <=> in(X5,add(X7,X6)) ),
    file('/export/starexec/sandbox/tmp/tmp.PtwQRtCmDl/Vampire---4.8_9920',ax4) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : DAT019_1 : TPTP v8.1.2. Released v5.0.0.
% 0.16/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 : n007.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 12:46:05 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a TF0_THM_EQU_ARI problem
% 0.22/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/tmp/tmp.PtwQRtCmDl/Vampire---4.8_9920
% 0.59/0.74  % (10301)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.74  % (10301)Refutation not found, incomplete strategy% (10301)------------------------------
% 0.59/0.74  % (10301)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.74  % (10301)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.74  
% 0.59/0.74  % (10301)Memory used [KB]: 957
% 0.59/0.74  % (10301)Time elapsed: 0.001 s
% 0.59/0.74  % (10301)Instructions burned: 2 (million)
% 0.59/0.74  % (10301)------------------------------
% 0.59/0.74  % (10301)------------------------------
% 0.59/0.74  % (10294)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.59/0.74  % (10296)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.74  % (10298)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.59/0.74  % (10295)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.59/0.74  % (10299)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.59/0.74  % (10300)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.59/0.74  % (10297)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.59/0.74  % (10299)Refutation not found, incomplete strategy% (10299)------------------------------
% 0.59/0.74  % (10299)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.74  % (10299)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.74  
% 0.59/0.74  % (10299)Memory used [KB]: 957
% 0.59/0.74  % (10299)Time elapsed: 0.002 s
% 0.59/0.74  % (10299)Instructions burned: 2 (million)
% 0.59/0.74  % (10297)Refutation not found, incomplete strategy% (10297)------------------------------
% 0.59/0.74  % (10297)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.74  % (10298)Also succeeded, but the first one will report.
% 0.59/0.74  % (10294)First to succeed.
% 0.59/0.74  % (10297)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.74  
% 0.59/0.74  % (10297)Memory used [KB]: 957
% 0.59/0.74  % (10297)Time elapsed: 0.003 s
% 0.59/0.74  % (10299)------------------------------
% 0.59/0.74  % (10299)------------------------------
% 0.59/0.74  % (10297)Instructions burned: 2 (million)
% 0.59/0.74  % (10296)Also succeeded, but the first one will report.
% 0.59/0.74  % (10295)Also succeeded, but the first one will report.
% 0.59/0.74  % (10294)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10172"
% 0.59/0.74  % (10300)Also succeeded, but the first one will report.
% 0.59/0.74  % (10297)------------------------------
% 0.59/0.74  % (10297)------------------------------
% 0.59/0.74  % (10304)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 Vampire---4 for (2996ds/55Mi)
% 0.59/0.75  % (10294)Refutation found. Thanks to Tanya!
% 0.59/0.75  % SZS status Theorem for Vampire---4
% 0.59/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75  % (10294)------------------------------
% 0.59/0.75  % (10294)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75  % (10294)Termination reason: Refutation
% 0.59/0.75  
% 0.59/0.75  % (10294)Memory used [KB]: 969
% 0.59/0.75  % (10294)Time elapsed: 0.003 s
% 0.59/0.75  % (10294)Instructions burned: 3 (million)
% 0.59/0.75  % (10172)Success in time 0.373 s
% 0.59/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------