TSTP Solution File: SEU167+2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU167+2 : 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 : n015.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:33 EDT 2024

% Result   : Theorem 13.53s 2.31s
% Output   : Refutation 13.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   46 (  17   ~;   9   |;  15   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (  33   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f131404,plain,
    $false,
    inference(unit_resulting_resolution,[],[f274,f127518,f325]) ).

fof(f325,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f124,plain,
    ! [X0,X1,X2] :
      ( ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
        & subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f53]) ).

fof(f53,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
        & subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).

fof(f127518,plain,
    ~ subset(cartesian_product2(sK14,sK16),cartesian_product2(sK14,sK17)),
    inference(unit_resulting_resolution,[],[f275,f127236,f330]) ).

fof(f330,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X1,X2)
      | subset(X0,X2)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f132,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f131]) ).

fof(f131,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X1,X2)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f60]) ).

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

fof(f127236,plain,
    ! [X0] : subset(cartesian_product2(sK14,X0),cartesian_product2(sK15,X0)),
    inference(unit_resulting_resolution,[],[f273,f324]) ).

fof(f324,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f273,plain,
    subset(sK14,sK15),
    inference(cnf_transformation,[],[f174]) ).

fof(f174,plain,
    ( ~ subset(cartesian_product2(sK14,sK16),cartesian_product2(sK15,sK17))
    & subset(sK16,sK17)
    & subset(sK14,sK15) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16,sK17])],[f107,f173]) ).

fof(f173,plain,
    ( ? [X0,X1,X2,X3] :
        ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
        & subset(X2,X3)
        & subset(X0,X1) )
   => ( ~ subset(cartesian_product2(sK14,sK16),cartesian_product2(sK15,sK17))
      & subset(sK16,sK17)
      & subset(sK14,sK15) ) ),
    introduced(choice_axiom,[]) ).

fof(f107,plain,
    ? [X0,X1,X2,X3] :
      ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
      & subset(X2,X3)
      & subset(X0,X1) ),
    inference(flattening,[],[f106]) ).

fof(f106,plain,
    ? [X0,X1,X2,X3] :
      ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
      & subset(X2,X3)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f55,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( subset(X2,X3)
          & subset(X0,X1) )
       => subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
    inference(negated_conjecture,[],[f54]) ).

fof(f54,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( subset(X2,X3)
        & subset(X0,X1) )
     => subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).

fof(f275,plain,
    ~ subset(cartesian_product2(sK14,sK16),cartesian_product2(sK15,sK17)),
    inference(cnf_transformation,[],[f174]) ).

fof(f274,plain,
    subset(sK16,sK17),
    inference(cnf_transformation,[],[f174]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU167+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 12:04:36 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (3246)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (3249)WARNING: value z3 for option sas not known
% 0.15/0.38  % (3251)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38  % (3250)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38  % (3252)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38  % (3253)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38  % (3248)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38  % (3247)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38  % (3249)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.23/0.40  TRYING [1]
% 0.23/0.40  TRYING [2]
% 0.23/0.41  TRYING [3]
% 0.23/0.43  TRYING [1]
% 0.23/0.44  TRYING [2]
% 0.23/0.46  TRYING [4]
% 0.23/0.51  TRYING [3]
% 1.34/0.63  TRYING [5]
% 2.34/0.69  TRYING [4]
% 5.36/1.13  TRYING [6]
% 5.62/1.21  TRYING [5]
% 7.71/1.49  TRYING [1]
% 7.71/1.49  TRYING [2]
% 7.71/1.49  TRYING [3]
% 7.71/1.50  TRYING [4]
% 8.28/1.56  TRYING [5]
% 10.59/1.90  TRYING [6]
% 13.53/2.31  % (3253)First to succeed.
% 13.53/2.31  % (3253)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3246"
% 13.53/2.31  % (3253)Refutation found. Thanks to Tanya!
% 13.53/2.31  % SZS status Theorem for theBenchmark
% 13.53/2.31  % SZS output start Proof for theBenchmark
% See solution above
% 13.53/2.31  % (3253)------------------------------
% 13.53/2.31  % (3253)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 13.53/2.31  % (3253)Termination reason: Refutation
% 13.53/2.31  
% 13.53/2.31  % (3253)Memory used [KB]: 34876
% 13.53/2.31  % (3253)Time elapsed: 1.934 s
% 13.53/2.31  % (3253)Instructions burned: 5482 (million)
% 13.53/2.31  % (3246)Success in time 1.937 s
%------------------------------------------------------------------------------