TSTP Solution File: NUM533+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM533+1 : TPTP v8.1.0. Released v4.0.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 : n022.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:05:40 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (   8 unt;   0 def)
%            Number of atoms       :  115 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  135 (  53   ~;  51   |;  24   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   38 (  34   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f197,plain,
    $false,
    inference(subsumption_resolution,[],[f196,f44]) ).

fof(f44,plain,
    aSet0(xA),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,axiom,
    ( aSet0(xC)
    & aSet0(xB)
    & aSet0(xA) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__522) ).

fof(f196,plain,
    ~ aSet0(xA),
    inference(subsumption_resolution,[],[f195,f48]) ).

fof(f48,plain,
    ~ aSubsetOf0(xA,xC),
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ( aSubsetOf0(xB,xC)
    & ~ aSubsetOf0(xA,xC)
    & aSubsetOf0(xA,xB) ),
    inference(flattening,[],[f26]) ).

fof(f26,plain,
    ( ~ aSubsetOf0(xA,xC)
    & aSubsetOf0(xA,xB)
    & aSubsetOf0(xB,xC) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,negated_conjecture,
    ~ ( ( aSubsetOf0(xA,xB)
        & aSubsetOf0(xB,xC) )
     => aSubsetOf0(xA,xC) ),
    inference(negated_conjecture,[],[f15]) ).

fof(f15,conjecture,
    ( ( aSubsetOf0(xA,xB)
      & aSubsetOf0(xB,xC) )
   => aSubsetOf0(xA,xC) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f195,plain,
    ( aSubsetOf0(xA,xC)
    | ~ aSet0(xA) ),
    inference(subsumption_resolution,[],[f194,f46]) ).

fof(f46,plain,
    aSet0(xC),
    inference(cnf_transformation,[],[f14]) ).

fof(f194,plain,
    ( ~ aSet0(xC)
    | aSubsetOf0(xA,xC)
    | ~ aSet0(xA) ),
    inference(duplicate_literal_removal,[],[f190]) ).

fof(f190,plain,
    ( aSubsetOf0(xA,xC)
    | ~ aSet0(xA)
    | ~ aSet0(xC)
    | ~ aSet0(xC)
    | aSubsetOf0(xA,xC) ),
    inference(resolution,[],[f57,f186]) ).

fof(f186,plain,
    ! [X0] :
      ( aElementOf0(sK1(X0,xA),xC)
      | ~ aSet0(X0)
      | aSubsetOf0(xA,X0) ),
    inference(resolution,[],[f156,f93]) ).

fof(f93,plain,
    ! [X1] :
      ( ~ aElementOf0(X1,xB)
      | aElementOf0(X1,xC) ),
    inference(subsumption_resolution,[],[f89,f46]) ).

fof(f89,plain,
    ! [X1] :
      ( aElementOf0(X1,xC)
      | ~ aSet0(xC)
      | ~ aElementOf0(X1,xB) ),
    inference(resolution,[],[f55,f49]) ).

fof(f49,plain,
    aSubsetOf0(xB,xC),
    inference(cnf_transformation,[],[f27]) ).

fof(f55,plain,
    ! [X3,X0,X1] :
      ( ~ aSubsetOf0(X1,X0)
      | ~ aElementOf0(X3,X1)
      | aElementOf0(X3,X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ( ~ aElementOf0(sK1(X0,X1),X0)
              & aElementOf0(sK1(X0,X1),X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X3] :
                  ( aElementOf0(X3,X0)
                  | ~ aElementOf0(X3,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f40,f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ aElementOf0(X2,X0)
          & aElementOf0(X2,X1) )
     => ( ~ aElementOf0(sK1(X0,X1),X0)
        & aElementOf0(sK1(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f40,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X3] :
                  ( aElementOf0(X3,X0)
                  | ~ aElementOf0(X3,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(rectify,[],[f39]) ).

fof(f39,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X2] :
                  ( aElementOf0(X2,X0)
                  | ~ aElementOf0(X2,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(flattening,[],[f38]) ).

fof(f38,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( aSubsetOf0(X1,X0)
            | ? [X2] :
                ( ~ aElementOf0(X2,X0)
                & aElementOf0(X2,X1) )
            | ~ aSet0(X1) )
          & ( ( ! [X2] :
                  ( aElementOf0(X2,X0)
                  | ~ aElementOf0(X2,X1) )
              & aSet0(X1) )
            | ~ aSubsetOf0(X1,X0) ) )
      | ~ aSet0(X0) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0] :
      ( ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( ! [X2] :
                ( aElementOf0(X2,X0)
                | ~ aElementOf0(X2,X1) )
            & aSet0(X1) ) )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ! [X1] :
          ( aSubsetOf0(X1,X0)
        <=> ( aSet0(X1)
            & ! [X2] :
                ( aElementOf0(X2,X1)
               => aElementOf0(X2,X0) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).

fof(f156,plain,
    ! [X1] :
      ( aElementOf0(sK1(X1,xA),xB)
      | aSubsetOf0(xA,X1)
      | ~ aSet0(X1) ),
    inference(subsumption_resolution,[],[f154,f44]) ).

fof(f154,plain,
    ! [X1] :
      ( aElementOf0(sK1(X1,xA),xB)
      | ~ aSet0(xA)
      | aSubsetOf0(xA,X1)
      | ~ aSet0(X1) ),
    inference(resolution,[],[f56,f92]) ).

fof(f92,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,xA)
      | aElementOf0(X0,xB) ),
    inference(subsumption_resolution,[],[f88,f45]) ).

fof(f45,plain,
    aSet0(xB),
    inference(cnf_transformation,[],[f14]) ).

fof(f88,plain,
    ! [X0] :
      ( ~ aSet0(xB)
      | ~ aElementOf0(X0,xA)
      | aElementOf0(X0,xB) ),
    inference(resolution,[],[f55,f47]) ).

fof(f47,plain,
    aSubsetOf0(xA,xB),
    inference(cnf_transformation,[],[f27]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( aElementOf0(sK1(X0,X1),X1)
      | aSubsetOf0(X1,X0)
      | ~ aSet0(X1)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ~ aElementOf0(sK1(X0,X1),X0)
      | ~ aSet0(X0)
      | ~ aSet0(X1)
      | aSubsetOf0(X1,X0) ),
    inference(cnf_transformation,[],[f42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 07:01:11 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.48  % (11500)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.49  % (11492)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49  % (11490)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.50  % (11489)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50  % (11500)First to succeed.
% 0.20/0.50  % (11489)Refutation not found, incomplete strategy% (11489)------------------------------
% 0.20/0.50  % (11489)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (11489)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (11489)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50  
% 0.20/0.50  % (11489)Memory used [KB]: 5373
% 0.20/0.50  % (11489)Time elapsed: 0.100 s
% 0.20/0.50  % (11489)Instructions burned: 2 (million)
% 0.20/0.50  % (11489)------------------------------
% 0.20/0.50  % (11489)------------------------------
% 0.20/0.50  % (11492)Also succeeded, but the first one will report.
% 0.20/0.50  % (11500)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (11500)------------------------------
% 0.20/0.50  % (11500)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (11500)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (11500)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (11500)Memory used [KB]: 5500
% 0.20/0.50  % (11500)Time elapsed: 0.099 s
% 0.20/0.50  % (11500)Instructions burned: 4 (million)
% 0.20/0.50  % (11500)------------------------------
% 0.20/0.50  % (11500)------------------------------
% 0.20/0.50  % (11485)Success in time 0.152 s
%------------------------------------------------------------------------------