%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET926+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 : n009.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:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f78,plain,
    $false,
    inference(avatar_sat_refutation,[],[f59,f72,f77]) ).

fof(f77,plain,
    ~ spl6_3,
    inference(avatar_contradiction_clause,[],[f76]) ).

fof(f76,plain,
    ( $false
    | ~ spl6_3 ),
    inference(trivial_inequality_removal,[],[f74]) ).

fof(f74,plain,
    ( empty_set != empty_set
    | ~ spl6_3 ),
    inference(superposition,[],[f24,f54]) ).

fof(f54,plain,
    ( empty_set = sF5
    | ~ spl6_3 ),
    inference(avatar_component_clause,[],[f52]) ).

fof(f52,plain,
    ( spl6_3
  <=> empty_set = sF5 ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).

fof(f24,plain,
    empty_set != sF5,
    inference(definition_folding,[],[f17,f22,f21]) ).

fof(f21,plain,
    singleton(sK1) = sF4,
    introduced(function_definition,[]) ).

fof(f22,plain,
    sF5 = set_difference(sF4,sK2),
    introduced(function_definition,[]) ).

fof(f17,plain,
    empty_set != set_difference(singleton(sK1),sK2),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ? [X0,X1] :
      ( singleton(X0) != set_difference(singleton(X0),X1)
      & empty_set != set_difference(singleton(X0),X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X0,X1] :
        ( empty_set = set_difference(singleton(X0),X1)
        | singleton(X0) = set_difference(singleton(X0),X1) ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X0,X1] :
      ( empty_set = set_difference(singleton(X0),X1)
      | singleton(X0) = set_difference(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_zfmisc_1) ).

fof(f72,plain,
    ~ spl6_4,
    inference(avatar_contradiction_clause,[],[f71]) ).

fof(f71,plain,
    ( $false
    | ~ spl6_4 ),
    inference(trivial_inequality_removal,[],[f70]) ).

fof(f70,plain,
    ( sF4 != sF4
    | ~ spl6_4 ),
    inference(superposition,[],[f23,f58]) ).

fof(f58,plain,
    ( sF5 = sF4
    | ~ spl6_4 ),
    inference(avatar_component_clause,[],[f56]) ).

fof(f56,plain,
    ( spl6_4
  <=> sF5 = sF4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).

fof(f23,plain,
    sF5 != sF4,
    inference(definition_folding,[],[f18,f21,f22,f21]) ).

fof(f18,plain,
    set_difference(singleton(sK1),sK2) != singleton(sK1),
    inference(cnf_transformation,[],[f10]) ).

fof(f59,plain,
    ( spl6_3
    | spl6_4 ),
    inference(avatar_split_clause,[],[f37,f56,f52]) ).

fof(f37,plain,
    ( sF5 = sF4
    | empty_set = sF5 ),
    inference(superposition,[],[f32,f22]) ).

fof(f32,plain,
    ! [X0] :
      ( set_difference(sF4,X0) = sF4
      | empty_set = set_difference(sF4,X0) ),
    inference(superposition,[],[f29,f21]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( singleton(X0) = set_difference(singleton(X0),X1)
      | empty_set = set_difference(singleton(X0),X1) ),
    inference(resolution,[],[f12,f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | empty_set = set_difference(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
    <=> empty_set = set_difference(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).

fof(f12,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | singleton(X0) = set_difference(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X1,X0] :
      ( ~ in(X0,X1)
    <=> singleton(X0) = set_difference(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l34_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET926+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n009.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:28:05 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (27905)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.50  % (27906)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.20/0.51  % (27897)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.51  % (27897)First to succeed.
% 0.20/0.51  % (27899)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.20/0.51  % (27906)Also succeeded, but the first one will report.
% 0.20/0.51  % (27897)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  % (27897)------------------------------
% 0.20/0.51  % (27897)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (27897)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (27897)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (27897)Memory used [KB]: 5373
% 0.20/0.51  % (27897)Time elapsed: 0.111 s
% 0.20/0.51  % (27897)Instructions burned: 2 (million)
% 0.20/0.51  % (27897)------------------------------
% 0.20/0.51  % (27897)------------------------------
% 0.20/0.51  % (27891)Success in time 0.156 s
%------------------------------------------------------------------------------