TSTP Solution File: SEU140+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n013.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 : Sun May  5 09:27:20 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   56 (  12 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  18   ~;  11   |;  13   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   37 (  28   !;   9   ?)

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

fof(f40,plain,
    ~ disjoint(sK0,sK2),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ( ~ disjoint(sK0,sK2)
    & disjoint(sK1,sK2)
    & subset(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f25,f31]) ).

fof(f31,plain,
    ( ? [X0,X1,X2] :
        ( ~ disjoint(X0,X2)
        & disjoint(X1,X2)
        & subset(X0,X1) )
   => ( ~ disjoint(sK0,sK2)
      & disjoint(sK1,sK2)
      & subset(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ? [X0,X1,X2] :
      ( ~ disjoint(X0,X2)
      & disjoint(X1,X2)
      & subset(X0,X1) ),
    inference(flattening,[],[f24]) ).

fof(f24,plain,
    ? [X0,X1,X2] :
      ( ~ disjoint(X0,X2)
      & disjoint(X1,X2)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( disjoint(X1,X2)
          & subset(X0,X1) )
       => disjoint(X0,X2) ),
    inference(negated_conjecture,[],[f15]) ).

fof(f15,conjecture,
    ! [X0,X1,X2] :
      ( ( disjoint(X1,X2)
        & subset(X0,X1) )
     => disjoint(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).

fof(f175,plain,
    disjoint(sK0,sK2),
    inference(trivial_inequality_removal,[],[f174]) ).

fof(f174,plain,
    ( empty_set != empty_set
    | disjoint(sK0,sK2) ),
    inference(superposition,[],[f50,f168]) ).

fof(f168,plain,
    empty_set = set_intersection2(sK0,sK2),
    inference(resolution,[],[f125,f38]) ).

fof(f38,plain,
    subset(sK0,sK1),
    inference(cnf_transformation,[],[f32]) ).

fof(f125,plain,
    ! [X0] :
      ( ~ subset(X0,sK1)
      | empty_set = set_intersection2(X0,sK2) ),
    inference(resolution,[],[f103,f44]) ).

fof(f44,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ! [X0] :
      ( empty_set = X0
      | ~ subset(X0,empty_set) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,axiom,
    ! [X0] :
      ( subset(X0,empty_set)
     => empty_set = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).

fof(f103,plain,
    ! [X0] :
      ( subset(set_intersection2(X0,sK2),empty_set)
      | ~ subset(X0,sK1) ),
    inference(superposition,[],[f52,f72]) ).

fof(f72,plain,
    empty_set = set_intersection2(sK1,sK2),
    inference(resolution,[],[f49,f39]) ).

fof(f39,plain,
    disjoint(sK1,sK2),
    inference(cnf_transformation,[],[f32]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | set_intersection2(X0,X1) = empty_set ),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | set_intersection2(X0,X1) != empty_set )
      & ( set_intersection2(X0,X1) = empty_set
        | ~ disjoint(X0,X1) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> set_intersection2(X0,X1) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

fof(f52,plain,
    ! [X2,X0,X1] :
      ( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).

fof(f50,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) != empty_set
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SEU140+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34  % Computer : n013.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   : Fri May  3 11:01:19 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  % (18676)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.35  % (18680)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.35  % (18681)WARNING: value z3 for option sas not known
% 0.13/0.35  % (18681)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.36  TRYING [1]
% 0.13/0.36  TRYING [2]
% 0.13/0.36  TRYING [3]
% 0.13/0.36  % (18681)First to succeed.
% 0.13/0.36  TRYING [4]
% 0.13/0.36  % (18681)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18676"
% 0.13/0.36  % (18681)Refutation found. Thanks to Tanya!
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36  % (18681)------------------------------
% 0.13/0.36  % (18681)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.36  % (18681)Termination reason: Refutation
% 0.13/0.36  
% 0.13/0.36  % (18681)Memory used [KB]: 837
% 0.13/0.36  % (18681)Time elapsed: 0.005 s
% 0.13/0.36  % (18681)Instructions burned: 7 (million)
% 0.13/0.36  % (18676)Success in time 0.006 s
%------------------------------------------------------------------------------