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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU083+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 : n018.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:54 EDT 2022

% Result   : Theorem 0.21s 0.53s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  18   ~;   7   |;  17   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (  16   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f330,plain,
    $false,
    inference(subsumption_resolution,[],[f329,f203]) ).

fof(f203,plain,
    finite(sK1),
    inference(cnf_transformation,[],[f137]) ).

fof(f137,plain,
    ( finite(sK0)
    & ~ finite(set_union2(sK0,sK1))
    & finite(sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f135,f136]) ).

fof(f136,plain,
    ( ? [X0,X1] :
        ( finite(X0)
        & ~ finite(set_union2(X0,X1))
        & finite(X1) )
   => ( finite(sK0)
      & ~ finite(set_union2(sK0,sK1))
      & finite(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f135,plain,
    ? [X0,X1] :
      ( finite(X0)
      & ~ finite(set_union2(X0,X1))
      & finite(X1) ),
    inference(rectify,[],[f100]) ).

fof(f100,plain,
    ? [X1,X0] :
      ( finite(X1)
      & ~ finite(set_union2(X1,X0))
      & finite(X0) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ? [X1,X0] :
      ( ~ finite(set_union2(X1,X0))
      & finite(X0)
      & finite(X1) ),
    inference(ennf_transformation,[],[f65]) ).

fof(f65,plain,
    ~ ! [X1,X0] :
        ( ( finite(X0)
          & finite(X1) )
       => finite(set_union2(X1,X0)) ),
    inference(rectify,[],[f62]) ).

fof(f62,negated_conjecture,
    ~ ! [X1,X0] :
        ( ( finite(X1)
          & finite(X0) )
       => finite(set_union2(X0,X1)) ),
    inference(negated_conjecture,[],[f61]) ).

fof(f61,conjecture,
    ! [X1,X0] :
      ( ( finite(X1)
        & finite(X0) )
     => finite(set_union2(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_finset_1) ).

fof(f329,plain,
    ~ finite(sK1),
    inference(subsumption_resolution,[],[f328,f205]) ).

fof(f205,plain,
    finite(sK0),
    inference(cnf_transformation,[],[f137]) ).

fof(f328,plain,
    ( ~ finite(sK0)
    | ~ finite(sK1) ),
    inference(resolution,[],[f303,f204]) ).

fof(f204,plain,
    ~ finite(set_union2(sK0,sK1)),
    inference(cnf_transformation,[],[f137]) ).

fof(f303,plain,
    ! [X0,X1] :
      ( finite(set_union2(X1,X0))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f116,plain,
    ! [X0,X1] :
      ( ~ finite(X1)
      | finite(set_union2(X1,X0))
      | ~ finite(X0) ),
    inference(flattening,[],[f115]) ).

fof(f115,plain,
    ! [X0,X1] :
      ( finite(set_union2(X1,X0))
      | ~ finite(X1)
      | ~ finite(X0) ),
    inference(ennf_transformation,[],[f71]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ( finite(X1)
        & finite(X0) )
     => finite(set_union2(X1,X0)) ),
    inference(rectify,[],[f35]) ).

fof(f35,axiom,
    ! [X1,X0] :
      ( ( finite(X1)
        & finite(X0) )
     => finite(set_union2(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc9_finset_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEU083+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 14:41:10 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.51  % (19622)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.51  % (19611)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.51  % (19614)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)
% 0.21/0.52  % (19603)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52  % (19619)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.21/0.52  % (19622)First to succeed.
% 0.21/0.52  % (19606)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52  % (19627)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.52  % (19627)Also succeeded, but the first one will report.
% 0.21/0.53  % (19622)Refutation found. Thanks to Tanya!
% 0.21/0.53  % SZS status Theorem for theBenchmark
% 0.21/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53  % (19622)------------------------------
% 0.21/0.53  % (19622)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (19622)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (19622)Termination reason: Refutation
% 0.21/0.53  
% 0.21/0.53  % (19622)Memory used [KB]: 5500
% 0.21/0.53  % (19622)Time elapsed: 0.067 s
% 0.21/0.53  % (19622)Instructions burned: 5 (million)
% 0.21/0.53  % (19622)------------------------------
% 0.21/0.53  % (19622)------------------------------
% 0.21/0.53  % (19596)Success in time 0.169 s
%------------------------------------------------------------------------------