TSTP Solution File: SEU137+2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU137+2 : TPTP v8.1.0. Released v3.3.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 : n005.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:32:05 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   29 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   21 (  10   ~;   3   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f341,plain,
    $false,
    inference(subsumption_resolution,[],[f338,f317]) ).

fof(f317,plain,
    set_union2(sK0,sK1) = sK1,
    inference(resolution,[],[f283,f250]) ).

fof(f250,plain,
    ~ subset(sK0,sK1),
    inference(consistent_polarity_flipping,[],[f161]) ).

fof(f161,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f100]) ).

fof(f100,plain,
    ( set_union2(sK0,set_difference(sK1,sK0)) != sK1
    & subset(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f82,f99]) ).

fof(f99,plain,
    ( ? [X0,X1] :
        ( set_union2(X0,set_difference(X1,X0)) != X1
        & subset(X0,X1) )
   => ( set_union2(sK0,set_difference(sK1,sK0)) != sK1
      & subset(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f82,plain,
    ? [X0,X1] :
      ( set_union2(X0,set_difference(X1,X0)) != X1
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f44]) ).

fof(f44,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,X1)
       => set_union2(X0,set_difference(X1,X0)) = X1 ),
    inference(negated_conjecture,[],[f43]) ).

fof(f43,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,set_difference(X1,X0)) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_xboole_1) ).

fof(f283,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | set_union2(X0,X1) = X1 ),
    inference(consistent_polarity_flipping,[],[f212]) ).

fof(f212,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f95,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f338,plain,
    set_union2(sK0,sK1) != sK1,
    inference(superposition,[],[f162,f208]) ).

fof(f208,plain,
    ! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
    inference(cnf_transformation,[],[f142]) ).

fof(f142,plain,
    ! [X0,X1] : set_union2(X1,X0) = set_union2(X1,set_difference(X0,X1)),
    inference(rectify,[],[f38]) ).

fof(f38,axiom,
    ! [X1,X0] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).

fof(f162,plain,
    set_union2(sK0,set_difference(sK1,sK0)) != sK1,
    inference(cnf_transformation,[],[f100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 14:43:18 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.19/0.50  % (5679)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51  % (5679)First to succeed.
% 0.19/0.51  % (5667)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51  % (5679)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (5679)------------------------------
% 0.19/0.51  % (5679)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (5679)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (5679)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (5679)Memory used [KB]: 1023
% 0.19/0.51  % (5679)Time elapsed: 0.094 s
% 0.19/0.51  % (5679)Instructions burned: 6 (million)
% 0.19/0.51  % (5679)------------------------------
% 0.19/0.51  % (5679)------------------------------
% 0.19/0.51  % (5659)Success in time 0.159 s
%------------------------------------------------------------------------------