TSTP Solution File: DAT067_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT067_1 : TPTP v8.1.2. 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 : n014.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 : Wed May  1 02:18:44 EDT 2024

% Result   : Theorem 0.65s 0.82s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   33 (   7 unt;  13 typ;   0 def)
%            Number of atoms       :   35 (  25 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   32 (  17   ~;   7   |;   4   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number arithmetic     :   56 (   0 atm;  16 fun;  16 num;  24 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   13 (   8   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   34 (  28   !;   6   ?;  34   :)

% 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(pred_def_3,type,
    sQ3_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_4,type,
    sQ4_eqProxy: ( heap * heap ) > $o ).

tff(f137,plain,
    $false,
    inference(subsumption_resolution,[],[f136,f99]) ).

tff(f99,plain,
    ~ sQ3_eqProxy(sK1,$sum(1,length(sK2))),
    inference(equality_proxy_replacement,[],[f72,f77]) ).

tff(f77,plain,
    ! [X0: $int,X1: $int] :
      ( sQ3_eqProxy(X0,X1)
    <=> ( X0 = X1 ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).

tff(f72,plain,
    sK1 != $sum(1,length(sK2)),
    inference(cnf_transformation,[],[f52]) ).

tff(f52,plain,
    ( ( sK1 != $sum(1,length(sK2)) )
    & ( sel(app(sK2,sK0),sK1) != sel(sK2,sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f46,f51]) ).

tff(f51,plain,
    ( ? [X0: $int,X1: $int,X2: heap] :
        ( ( $sum(1,length(X2)) != X1 )
        & ( sel(app(X2,X0),X1) != sel(X2,X1) ) )
   => ( ( sK1 != $sum(1,length(sK2)) )
      & ( sel(app(sK2,sK0),sK1) != sel(sK2,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

tff(f15,conjecture,
    ! [X2: $int,X0: $int,X1: heap] :
      ( ( $sum(1,length(X1)) = X0 )
      | ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.WxpMPiJaZ0/Vampire---4.8_22577',th_2) ).

tff(f136,plain,
    sQ3_eqProxy(sK1,$sum(1,length(sK2))),
    inference(resolution,[],[f119,f102]) ).

tff(f102,plain,
    ! [X0: $int,X1: $int] :
      ( ~ sQ3_eqProxy(X0,X1)
      | sQ3_eqProxy(X1,X0) ),
    inference(equality_proxy_axiom,[],[f77]) ).

tff(f119,plain,
    sQ3_eqProxy($sum(1,length(sK2)),sK1),
    inference(resolution,[],[f100,f87]) ).

tff(f87,plain,
    ! [X2: $int,X0: $int,X1: heap] :
      ( sQ3_eqProxy(sel(app(X1,X0),X2),sel(X1,X2))
      | sQ3_eqProxy($sum(1,length(X1)),X2) ),
    inference(equality_proxy_replacement,[],[f55,f77,f77]) ).

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

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

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

tff(f3,axiom,
    ! [X2: $int,X1: heap,X0: $int] :
      ( ( $sum(1,length(X1)) != X0 )
     => ( sel(app(X1,X2),X0) = sel(X1,X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.WxpMPiJaZ0/Vampire---4.8_22577',ax_3) ).

tff(f100,plain,
    ~ sQ3_eqProxy(sel(app(sK2,sK0),sK1),sel(sK2,sK1)),
    inference(equality_proxy_replacement,[],[f71,f77]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : DAT067_1 : TPTP v8.1.2. Released v5.5.0.
% 0.06/0.13  % 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.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Apr 30 16:24:18 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TF0_THM_EQU_ARI problem
% 0.12/0.34  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/tmp/tmp.WxpMPiJaZ0/Vampire---4.8_22577
% 0.60/0.81  % (22690)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 (2995ds/34Mi)
% 0.60/0.81  % (22694)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 (2995ds/34Mi)
% 0.60/0.81  % (22691)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 (2995ds/51Mi)
% 0.60/0.81  % (22696)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 (2995ds/83Mi)
% 0.60/0.81  % (22695)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.81  % (22692)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.81  % (22697)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 (2995ds/56Mi)
% 0.60/0.81  % (22693)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.82  % (22694)First to succeed.
% 0.60/0.82  % (22690)Also succeeded, but the first one will report.
% 0.60/0.82  % (22695)Also succeeded, but the first one will report.
% 0.65/0.82  % (22694)Refutation found. Thanks to Tanya!
% 0.65/0.82  % SZS status Theorem for Vampire---4
% 0.65/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.82  % (22694)------------------------------
% 0.65/0.82  % (22694)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.82  % (22694)Termination reason: Refutation
% 0.65/0.82  
% 0.65/0.82  % (22694)Memory used [KB]: 1065
% 0.65/0.82  % (22694)Time elapsed: 0.005 s
% 0.65/0.82  % (22694)Instructions burned: 5 (million)
% 0.65/0.82  % (22694)------------------------------
% 0.65/0.82  % (22694)------------------------------
% 0.65/0.82  % (22686)Success in time 0.478 s
% 0.65/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------