TSTP Solution File: SEU089+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU089+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n008.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 Aug 31 18:31:55 EDT 2022

% Result   : Theorem 1.50s 0.56s
% Output   : Refutation 1.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :   72 (   6 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   66 (  25   ~;  12   |;  24   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :   40 (  28   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f556,plain,
    $false,
    inference(subsumption_resolution,[],[f555,f274]) ).

fof(f274,plain,
    finite(sK18),
    inference(cnf_transformation,[],[f172]) ).

fof(f172,plain,
    ( ~ finite(cartesian_product3(sK18,sK17,sK16))
    & finite(sK16)
    & finite(sK17)
    & finite(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17,sK18])],[f170,f171]) ).

fof(f171,plain,
    ( ? [X0,X1,X2] :
        ( ~ finite(cartesian_product3(X2,X1,X0))
        & finite(X0)
        & finite(X1)
        & finite(X2) )
   => ( ~ finite(cartesian_product3(sK18,sK17,sK16))
      & finite(sK16)
      & finite(sK17)
      & finite(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f170,plain,
    ? [X0,X1,X2] :
      ( ~ finite(cartesian_product3(X2,X1,X0))
      & finite(X0)
      & finite(X1)
      & finite(X2) ),
    inference(rectify,[],[f105]) ).

fof(f105,plain,
    ? [X2,X1,X0] :
      ( ~ finite(cartesian_product3(X0,X1,X2))
      & finite(X2)
      & finite(X1)
      & finite(X0) ),
    inference(flattening,[],[f104]) ).

fof(f104,plain,
    ? [X0,X1,X2] :
      ( ~ finite(cartesian_product3(X0,X1,X2))
      & finite(X2)
      & finite(X1)
      & finite(X0) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( finite(X2)
          & finite(X1)
          & finite(X0) )
       => finite(cartesian_product3(X0,X1,X2)) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ! [X0,X1,X2] :
      ( ( finite(X2)
        & finite(X1)
        & finite(X0) )
     => finite(cartesian_product3(X0,X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_finset_1) ).

fof(f555,plain,
    ~ finite(sK18),
    inference(subsumption_resolution,[],[f554,f275]) ).

fof(f275,plain,
    finite(sK17),
    inference(cnf_transformation,[],[f172]) ).

fof(f554,plain,
    ( ~ finite(sK17)
    | ~ finite(sK18) ),
    inference(subsumption_resolution,[],[f550,f553]) ).

fof(f553,plain,
    ~ finite(sF29),
    inference(subsumption_resolution,[],[f552,f327]) ).

fof(f327,plain,
    ~ finite(sF30),
    inference(definition_folding,[],[f324,f326,f325]) ).

fof(f325,plain,
    cartesian_product2(sK18,sK17) = sF29,
    introduced(function_definition,[]) ).

fof(f326,plain,
    cartesian_product2(sF29,sK16) = sF30,
    introduced(function_definition,[]) ).

fof(f324,plain,
    ~ finite(cartesian_product2(cartesian_product2(sK18,sK17),sK16)),
    inference(definition_unfolding,[],[f277,f310]) ).

fof(f310,plain,
    ! [X2,X0,X1] : cartesian_product3(X2,X0,X1) = cartesian_product2(cartesian_product2(X2,X0),X1),
    inference(cnf_transformation,[],[f193]) ).

fof(f193,plain,
    ! [X0,X1,X2] : cartesian_product3(X2,X0,X1) = cartesian_product2(cartesian_product2(X2,X0),X1),
    inference(rectify,[],[f66]) ).

fof(f66,plain,
    ! [X2,X0,X1] : cartesian_product3(X1,X2,X0) = cartesian_product2(cartesian_product2(X1,X2),X0),
    inference(rectify,[],[f14]) ).

fof(f14,axiom,
    ! [X2,X0,X1] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_zfmisc_1) ).

fof(f277,plain,
    ~ finite(cartesian_product3(sK18,sK17,sK16)),
    inference(cnf_transformation,[],[f172]) ).

fof(f552,plain,
    ( ~ finite(sF29)
    | finite(sF30) ),
    inference(subsumption_resolution,[],[f551,f276]) ).

fof(f276,plain,
    finite(sK16),
    inference(cnf_transformation,[],[f172]) ).

fof(f551,plain,
    ( ~ finite(sK16)
    | finite(sF30)
    | ~ finite(sF29) ),
    inference(superposition,[],[f322,f326]) ).

fof(f322,plain,
    ! [X0,X1] :
      ( finite(cartesian_product2(X1,X0))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(cnf_transformation,[],[f100]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( finite(cartesian_product2(X1,X0))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( finite(cartesian_product2(X1,X0))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(ennf_transformation,[],[f69]) ).

fof(f69,plain,
    ! [X0,X1] :
      ( ( finite(X0)
        & finite(X1) )
     => finite(cartesian_product2(X1,X0)) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X1,X0] :
      ( ( finite(X1)
        & finite(X0) )
     => finite(cartesian_product2(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc14_finset_1) ).

fof(f550,plain,
    ( finite(sF29)
    | ~ finite(sK18)
    | ~ finite(sK17) ),
    inference(superposition,[],[f322,f325]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU089+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 14:40:40 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.52  % (9537)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.54  % (9519)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.55  TRYING [1]
% 0.19/0.55  % (9513)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.50/0.55  % (9527)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.50/0.55  TRYING [2]
% 1.50/0.55  % (9520)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.50/0.55  % (9516)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.50/0.55  % (9528)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.50/0.55  % (9515)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.50/0.55  % (9537)First to succeed.
% 1.50/0.55  % (9527)Also succeeded, but the first one will report.
% 1.50/0.55  % (9520)Instruction limit reached!
% 1.50/0.55  % (9520)------------------------------
% 1.50/0.55  % (9520)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.56  % (9537)Refutation found. Thanks to Tanya!
% 1.50/0.56  % SZS status Theorem for theBenchmark
% 1.50/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 1.50/0.56  % (9537)------------------------------
% 1.50/0.56  % (9537)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.56  % (9537)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.56  % (9537)Termination reason: Refutation
% 1.50/0.56  
% 1.50/0.56  % (9537)Memory used [KB]: 5628
% 1.50/0.56  % (9537)Time elapsed: 0.135 s
% 1.50/0.56  % (9537)Instructions burned: 9 (million)
% 1.50/0.56  % (9537)------------------------------
% 1.50/0.56  % (9537)------------------------------
% 1.50/0.56  % (9512)Success in time 0.204 s
%------------------------------------------------------------------------------