%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU150+3 : 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 : n012.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:10 EDT 2022

% Result   : Theorem 0.19s 0.54s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  14 unt;   0 def)
%            Number of atoms       :   50 (  49 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  16   ~;   8   |;   5   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   42 (  33   !;   9   ?)

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

fof(f25,plain,
    sK3 != sK2,
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ( sK3 != sK2
    & singleton(sK4) = unordered_pair(sK3,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f17,f18]) ).

fof(f18,plain,
    ( ? [X0,X1,X2] :
        ( X0 != X1
        & unordered_pair(X1,X0) = singleton(X2) )
   => ( sK3 != sK2
      & singleton(sK4) = unordered_pair(sK3,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f17,plain,
    ? [X0,X1,X2] :
      ( X0 != X1
      & unordered_pair(X1,X0) = singleton(X2) ),
    inference(rectify,[],[f9]) ).

fof(f9,plain,
    ? [X0,X2,X1] :
      ( X0 != X2
      & singleton(X1) = unordered_pair(X2,X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
    ~ ! [X0,X1,X2] :
        ( singleton(X1) = unordered_pair(X2,X0)
       => X0 = X2 ),
    inference(rectify,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ! [X2,X0,X1] :
        ( singleton(X0) = unordered_pair(X1,X2)
       => X1 = X2 ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ! [X2,X0,X1] :
      ( singleton(X0) = unordered_pair(X1,X2)
     => X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).

fof(f49,plain,
    sK3 = sK2,
    inference(trivial_inequality_removal,[],[f47]) ).

fof(f47,plain,
    ( sF5 != sF5
    | sK3 = sK2 ),
    inference(superposition,[],[f40,f44]) ).

fof(f44,plain,
    singleton(sK3) = sF5,
    inference(superposition,[],[f26,f43]) ).

fof(f43,plain,
    sK3 = sK4,
    inference(trivial_inequality_removal,[],[f42]) ).

fof(f42,plain,
    ( sF5 != sF5
    | sK3 = sK4 ),
    inference(superposition,[],[f41,f26]) ).

fof(f41,plain,
    ! [X0] :
      ( singleton(X0) != sF5
      | sK3 = X0 ),
    inference(forward_demodulation,[],[f37,f28]) ).

fof(f28,plain,
    sF6 = sF5,
    inference(definition_folding,[],[f24,f27,f26]) ).

fof(f27,plain,
    unordered_pair(sK3,sK2) = sF6,
    introduced(function_definition,[]) ).

fof(f24,plain,
    singleton(sK4) = unordered_pair(sK3,sK2),
    inference(cnf_transformation,[],[f19]) ).

fof(f37,plain,
    ! [X0] :
      ( sK3 = X0
      | singleton(X0) != sF6 ),
    inference(superposition,[],[f20,f27]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( singleton(X0) != unordered_pair(X2,X1)
      | X0 = X2 ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( X0 = X2
      | singleton(X0) != unordered_pair(X2,X1) ),
    inference(rectify,[],[f10]) ).

fof(f10,plain,
    ! [X1,X2,X0] :
      ( X0 = X1
      | singleton(X1) != unordered_pair(X0,X2) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X2,X1,X0] :
      ( singleton(X1) = unordered_pair(X0,X2)
     => X0 = X1 ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0,X2] :
      ( singleton(X0) = unordered_pair(X1,X2)
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).

fof(f26,plain,
    singleton(sK4) = sF5,
    introduced(function_definition,[]) ).

fof(f40,plain,
    ! [X7] :
      ( sF5 != singleton(X7)
      | sK2 = X7 ),
    inference(superposition,[],[f20,f33]) ).

fof(f33,plain,
    unordered_pair(sK2,sK3) = sF5,
    inference(forward_demodulation,[],[f29,f28]) ).

fof(f29,plain,
    sF6 = unordered_pair(sK2,sK3),
    inference(superposition,[],[f21,f27]) ).

fof(f21,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(rectify,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEU150+3 : 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.13/0.34  % Computer : n012.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:45:05 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.52  % (23897)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.19/0.53  % (23897)First to succeed.
% 0.19/0.54  % (23886)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.19/0.54  % (23889)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.19/0.54  % (23886)Also succeeded, but the first one will report.
% 0.19/0.54  % (23897)Refutation found. Thanks to Tanya!
% 0.19/0.54  % SZS status Theorem for theBenchmark
% 0.19/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54  % (23897)------------------------------
% 0.19/0.54  % (23897)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (23897)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (23897)Termination reason: Refutation
% 0.19/0.54  
% 0.19/0.54  % (23897)Memory used [KB]: 5373
% 0.19/0.54  % (23897)Time elapsed: 0.125 s
% 0.19/0.54  % (23897)Instructions burned: 2 (million)
% 0.19/0.54  % (23897)------------------------------
% 0.19/0.54  % (23897)------------------------------
% 0.19/0.54  % (23883)Success in time 0.195 s
%------------------------------------------------------------------------------