%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWW469+1 : TPTP v8.1.0. Released v5.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 : n002.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 19:19:29 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   9 unt;   0 def)
%            Number of atoms       :   68 (  21 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   69 (  27   ~;  11   |;  20   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   25 (  11   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f40,plain,
    $false,
    inference(subsumption_resolution,[],[f39,f33]) ).

fof(f33,plain,
    sK1 = sK0,
    inference(resolution,[],[f32,f24]) ).

fof(f24,plain,
    ! [X1] :
      ( ~ is_state(X1)
      | sK0 = X1 ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ( is_state(sK0)
    & ! [X1] :
        ( ~ is_state(X1)
        | sK0 = X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f17]) ).

fof(f17,plain,
    ( ? [X0] :
        ( is_state(X0)
        & ! [X1] :
            ( ~ is_state(X1)
            | X0 = X1 ) )
   => ( is_state(sK0)
      & ! [X1] :
          ( ~ is_state(X1)
          | sK0 = X1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f15,plain,
    ? [X0] :
      ( is_state(X0)
      & ! [X1] :
          ( ~ is_state(X1)
          | X0 = X1 ) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
    ~ ! [X0] :
        ( is_state(X0)
       => ~ ! [X1] :
              ( is_state(X1)
             => X0 = X1 ) ),
    inference(rectify,[],[f8]) ).

fof(f8,negated_conjecture,
    ~ ! [X1] :
        ( is_state(X1)
       => ~ ! [X0] :
              ( is_state(X0)
             => X0 = X1 ) ),
    inference(negated_conjecture,[],[f7]) ).

fof(f7,conjecture,
    ! [X1] :
      ( is_state(X1)
     => ~ ! [X0] :
            ( is_state(X0)
           => X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

fof(f32,plain,
    is_state(sK1),
    inference(subsumption_resolution,[],[f26,f23]) ).

fof(f23,plain,
    hoare_165779456gleton,
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    hoare_165779456gleton,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(f26,plain,
    ( is_state(sK1)
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[],[f21]) ).

fof(f21,plain,
    ( ~ hoare_165779456gleton
    | ( sK1 != sK2
      & is_state(sK2)
      & is_state(sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f19,f20]) ).

fof(f20,plain,
    ( ? [X0,X1] :
        ( X0 != X1
        & is_state(X1)
        & is_state(X0) )
   => ( sK1 != sK2
      & is_state(sK2)
      & is_state(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ( ~ hoare_165779456gleton
    | ? [X0,X1] :
        ( X0 != X1
        & is_state(X1)
        & is_state(X0) ) ),
    inference(rectify,[],[f16]) ).

fof(f16,plain,
    ( ~ hoare_165779456gleton
    | ? [X1,X0] :
        ( X0 != X1
        & is_state(X0)
        & is_state(X1) ) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f11,plain,
    ( hoare_165779456gleton
   => ? [X1,X0] :
        ( X0 != X1
        & is_state(X0)
        & is_state(X1) ) ),
    inference(unused_predicate_definition_removal,[],[f10]) ).

fof(f10,plain,
    ( hoare_165779456gleton
  <=> ? [X1,X0] :
        ( X0 != X1
        & is_state(X0)
        & is_state(X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ( hoare_165779456gleton
  <=> ? [X1,X0] :
        ( is_state(X1)
        & is_state(X0)
        & X0 != X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

fof(f39,plain,
    sK1 != sK0,
    inference(forward_demodulation,[],[f38,f36]) ).

fof(f36,plain,
    sK0 = sK2,
    inference(resolution,[],[f35,f24]) ).

fof(f35,plain,
    is_state(sK2),
    inference(subsumption_resolution,[],[f27,f23]) ).

fof(f27,plain,
    ( ~ hoare_165779456gleton
    | is_state(sK2) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f38,plain,
    sK1 != sK2,
    inference(subsumption_resolution,[],[f28,f23]) ).

fof(f28,plain,
    ( sK1 != sK2
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWW469+1 : TPTP v8.1.0. Released v5.3.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 : n002.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 20:52:59 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (14479)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.20/0.50  % (14476)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.50  % (14468)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 (3000ds/68Mi)
% 0.20/0.50  % (14465)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  % (14476)First to succeed.
% 0.20/0.50  % (14460)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.51  % (14476)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  % (14476)------------------------------
% 0.20/0.51  % (14476)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (14476)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (14476)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (14476)Memory used [KB]: 895
% 0.20/0.51  % (14476)Time elapsed: 0.065 s
% 0.20/0.51  % (14476)Instructions burned: 2 (million)
% 0.20/0.51  % (14476)------------------------------
% 0.20/0.51  % (14476)------------------------------
% 0.20/0.51  % (14453)Success in time 0.158 s
%------------------------------------------------------------------------------