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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET917+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 : n021.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:26:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f50,plain,
    $false,
    inference(trivial_inequality_removal,[],[f49]) ).

fof(f49,plain,
    singleton(sK2) != singleton(sK2),
    inference(superposition,[],[f47,f48]) ).

fof(f48,plain,
    singleton(sK2) = set_intersection2(sK1,singleton(sK2)),
    inference(resolution,[],[f32,f43]) ).

fof(f43,plain,
    in(sK2,sK1),
    inference(resolution,[],[f33,f37]) ).

fof(f37,plain,
    ~ disjoint(singleton(sK2),sK1),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ( ~ disjoint(singleton(sK2),sK1)
    & set_intersection2(singleton(sK2),sK1) != singleton(sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f24,f25]) ).

fof(f25,plain,
    ( ? [X0,X1] :
        ( ~ disjoint(singleton(X1),X0)
        & set_intersection2(singleton(X1),X0) != singleton(X1) )
   => ( ~ disjoint(singleton(sK2),sK1)
      & set_intersection2(singleton(sK2),sK1) != singleton(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f24,plain,
    ? [X0,X1] :
      ( ~ disjoint(singleton(X1),X0)
      & set_intersection2(singleton(X1),X0) != singleton(X1) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ? [X1,X0] :
      ( ~ disjoint(singleton(X0),X1)
      & singleton(X0) != set_intersection2(singleton(X0),X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] :
        ( singleton(X0) = set_intersection2(singleton(X0),X1)
        | disjoint(singleton(X0),X1) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X1] :
      ( singleton(X0) = set_intersection2(singleton(X0),X1)
      | disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t58_zfmisc_1) ).

fof(f33,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( ~ in(X0,X1)
     => disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | set_intersection2(X0,singleton(X1)) = singleton(X1) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | set_intersection2(X0,singleton(X1)) = singleton(X1) ),
    inference(rectify,[],[f16]) ).

fof(f16,plain,
    ! [X1,X0] :
      ( ~ in(X0,X1)
      | singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( in(X0,X1)
     => singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_zfmisc_1) ).

fof(f47,plain,
    singleton(sK2) != set_intersection2(sK1,singleton(sK2)),
    inference(superposition,[],[f36,f35]) ).

fof(f35,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f36,plain,
    set_intersection2(singleton(sK2),sK1) != singleton(sK2),
    inference(cnf_transformation,[],[f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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 : n021.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:26:11 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (27336)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (27344)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51  % (27336)First to succeed.
% 0.20/0.51  % (27328)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (27336)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (27336)------------------------------
% 0.20/0.51  % (27336)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (27336)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (27336)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (27336)Memory used [KB]: 895
% 0.20/0.51  % (27336)Time elapsed: 0.101 s
% 0.20/0.51  % (27336)Instructions burned: 2 (million)
% 0.20/0.51  % (27336)------------------------------
% 0.20/0.51  % (27336)------------------------------
% 0.20/0.51  % (27323)Success in time 0.166 s
%------------------------------------------------------------------------------