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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET917+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Sun May  5 09:19:41 EDT 2024

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

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

fof(f42,plain,
    singleton(sK0) != singleton(sK0),
    inference(superposition,[],[f36,f41]) ).

fof(f41,plain,
    singleton(sK0) = set_intersection2(sK1,singleton(sK0)),
    inference(resolution,[],[f29,f38]) ).

fof(f38,plain,
    in(sK0,sK1),
    inference(resolution,[],[f27,f23]) ).

fof(f23,plain,
    ~ disjoint(singleton(sK0),sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ( singleton(sK0) != set_intersection2(singleton(sK0),sK1)
    & ~ disjoint(singleton(sK0),sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f17]) ).

fof(f17,plain,
    ( ? [X0,X1] :
        ( singleton(X0) != set_intersection2(singleton(X0),X1)
        & ~ disjoint(singleton(X0),X1) )
   => ( singleton(sK0) != set_intersection2(singleton(sK0),sK1)
      & ~ disjoint(singleton(sK0),sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ? [X0,X1] :
      ( singleton(X0) != set_intersection2(singleton(X0),X1)
      & ~ disjoint(singleton(X0),X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] :
        ( singleton(X0) = set_intersection2(singleton(X0),X1)
        | disjoint(singleton(X0),X1) ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X1] :
      ( singleton(X0) = set_intersection2(singleton(X0),X1)
      | disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t58_zfmisc_1) ).

fof(f27,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( ~ in(X0,X1)
     => disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( singleton(X0) = set_intersection2(X1,singleton(X0))
      | ~ in(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( in(X0,X1)
     => singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).

fof(f36,plain,
    singleton(sK0) != set_intersection2(sK1,singleton(sK0)),
    inference(superposition,[],[f24,f26]) ).

fof(f26,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f24,plain,
    singleton(sK0) != set_intersection2(singleton(sK0),sK1),
    inference(cnf_transformation,[],[f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET917+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 16:40:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (1336)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (1339)WARNING: value z3 for option sas not known
% 0.14/0.37  % (1340)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37  % (1338)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37  % (1337)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37  % (1341)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.14/0.37  % (1342)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.14/0.37  % (1339)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.14/0.37  % (1343)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.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  % (1342)First to succeed.
% 0.14/0.38  % (1343)Also succeeded, but the first one will report.
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [3]
% 0.14/0.38  % (1341)Also succeeded, but the first one will report.
% 0.14/0.38  % (1342)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1336"
% 0.14/0.38  % (1339)Also succeeded, but the first one will report.
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (1342)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (1342)------------------------------
% 0.14/0.38  % (1342)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38  % (1342)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (1342)Memory used [KB]: 759
% 0.14/0.38  % (1342)Time elapsed: 0.004 s
% 0.14/0.38  % (1342)Instructions burned: 3 (million)
% 0.14/0.38  % (1336)Success in time 0.017 s
%------------------------------------------------------------------------------