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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU126+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 : n023.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:06 EDT 2024

% Result   : Theorem 0.22s 0.41s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   28 (  12 unt;   0 def)
%            Number of atoms       :   61 (  20 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   57 (  24   ~;  18   |;  10   &)
%                                         (   1 <=>;   4  =>;   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (  42   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1109,plain,
    $false,
    inference(subsumption_resolution,[],[f1057,f94]) ).

fof(f94,plain,
    sK3 != set_union2(sK2,sK3),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ( sK3 != set_union2(sK2,sK3)
    & subset(sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f40,f60]) ).

fof(f60,plain,
    ( ? [X0,X1] :
        ( set_union2(X0,X1) != X1
        & subset(X0,X1) )
   => ( sK3 != set_union2(sK2,sK3)
      & subset(sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f40,plain,
    ? [X0,X1] :
      ( set_union2(X0,X1) != X1
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(X0,X1)
       => set_union2(X0,X1) = X1 ),
    inference(negated_conjecture,[],[f22]) ).

fof(f22,conjecture,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f1057,plain,
    sK3 = set_union2(sK2,sK3),
    inference(superposition,[],[f1056,f114]) ).

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

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

fof(f1056,plain,
    sK3 = set_union2(sK3,sK2),
    inference(resolution,[],[f1041,f93]) ).

fof(f93,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f61]) ).

fof(f1041,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | set_union2(X0,X1) = X0 ),
    inference(subsumption_resolution,[],[f1030,f110]) ).

fof(f110,plain,
    ! [X0] : subset(X0,X0),
    inference(cnf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X0] : subset(X0,X0),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X0,X1] : subset(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(f1030,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X0
      | ~ subset(X1,X0)
      | ~ subset(X0,X0) ),
    inference(resolution,[],[f402,f104]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( subset(set_union2(X0,X2),X1)
      | ~ subset(X2,X1)
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( subset(set_union2(X0,X2),X1)
      | ~ subset(X2,X1)
      | ~ subset(X0,X1) ),
    inference(flattening,[],[f46]) ).

fof(f46,plain,
    ! [X0,X1,X2] :
      ( subset(set_union2(X0,X2),X1)
      | ~ subset(X2,X1)
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f34]) ).

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

fof(f402,plain,
    ! [X0,X1] :
      ( ~ subset(set_union2(X0,X1),X0)
      | set_union2(X0,X1) = X0 ),
    inference(resolution,[],[f121,f97]) ).

fof(f97,plain,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,axiom,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).

fof(f121,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | X0 = X1
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f71]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SEU126+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 11:59:08 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  % (11814)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (11817)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37  % (11819)WARNING: value z3 for option sas not known
% 0.15/0.38  % (11818)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  % (11820)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38  % (11819)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.15/0.38  % (11821)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  % (11822)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  % (11823)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  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.39  TRYING [4]
% 0.22/0.40  TRYING [3]
% 0.22/0.40  % (11819)First to succeed.
% 0.22/0.41  % (11819)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11814"
% 0.22/0.41  % (11819)Refutation found. Thanks to Tanya!
% 0.22/0.41  % SZS status Theorem for theBenchmark
% 0.22/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.41  % (11819)------------------------------
% 0.22/0.41  % (11819)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.41  % (11819)Termination reason: Refutation
% 0.22/0.41  
% 0.22/0.41  % (11819)Memory used [KB]: 1013
% 0.22/0.41  % (11819)Time elapsed: 0.032 s
% 0.22/0.41  % (11819)Instructions burned: 47 (million)
% 0.22/0.41  % (11814)Success in time 0.048 s
%------------------------------------------------------------------------------