%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET148+3 : TPTP v8.1.0. Released v2.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 : n027.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:23:57 EDT 2022

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

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

fof(f51,plain,
    sK0 != sK0,
    inference(backward_demodulation,[],[f32,f50]) ).

fof(f50,plain,
    ! [X0] : intersection(X0,X0) = X0,
    inference(resolution,[],[f47,f40]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | intersection(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( intersection(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
     => intersection(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).

fof(f47,plain,
    ! [X1] : subset(X1,X1),
    inference(equality_resolution,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) ) ),
    inference(flattening,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( ( subset(X1,X0)
          & subset(X0,X1) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X1,X0)
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        & subset(X0,X1) )
    <=> X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).

fof(f32,plain,
    sK0 != intersection(sK0,sK0),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    sK0 != intersection(sK0,sK0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f16]) ).

fof(f16,plain,
    ( ? [X0] : intersection(X0,X0) != X0
   => sK0 != intersection(sK0,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0] : intersection(X0,X0) != X0,
    inference(ennf_transformation,[],[f9]) ).

fof(f9,negated_conjecture,
    ~ ! [X0] : intersection(X0,X0) = X0,
    inference(negated_conjecture,[],[f8]) ).

fof(f8,conjecture,
    ! [X0] : intersection(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idempotency_of_intersection) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET148+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 13:37:46 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.48  % (17893)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49  % (17917)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.18/0.49  % (17906)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.18/0.49  % (17917)First to succeed.
% 0.18/0.50  % (17906)Also succeeded, but the first one will report.
% 0.18/0.50  % (17917)Refutation found. Thanks to Tanya!
% 0.18/0.50  % SZS status Theorem for theBenchmark
% 0.18/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50  % (17917)------------------------------
% 0.18/0.50  % (17917)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (17917)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (17917)Termination reason: Refutation
% 0.18/0.50  
% 0.18/0.50  % (17917)Memory used [KB]: 5373
% 0.18/0.50  % (17917)Time elapsed: 0.064 s
% 0.18/0.50  % (17917)Instructions burned: 2 (million)
% 0.18/0.50  % (17917)------------------------------
% 0.18/0.50  % (17917)------------------------------
% 0.18/0.50  % (17888)Success in time 0.156 s
%------------------------------------------------------------------------------