↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM565+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:24:50 PM UTC 2026

% Result   : Theorem 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   94 (  36 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :  101 (  30   ~;  15   |;  44   &)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   25 (  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ( sbrdtbr0(X0) = sz00
      <=> X0 = slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).

fof(f78,axiom,
    xK = sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).

fof(f80,conjecture,
    ! [X0] :
      ( ( aSet0(X0)
        & ! [X1] :
            ( aElementOf0(X1,X0)
           => aElementOf0(X1,xS) )
        & aSubsetOf0(X0,xS)
        & sbrdtbr0(X0) = sz00
        & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) )
     => ( ( aSet0(slcrc0)
          & ~ ? [X1] : aElementOf0(X1,slcrc0) )
       => sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f81,negated_conjecture,
    ~ ! [X0] :
        ( ( aSet0(X0)
          & ! [X1] :
              ( aElementOf0(X1,X0)
             => aElementOf0(X1,xS) )
          & aSubsetOf0(X0,xS)
          & sbrdtbr0(X0) = sz00
          & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) )
       => ( ( aSet0(slcrc0)
            & ~ ? [X1] : aElementOf0(X1,slcrc0) )
         => sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
    inference(negated_conjecture,[status(cth)],[f80]) ).

fof(f92,plain,
    ~ ! [X0] :
        ( ( aSet0(X0)
          & ! [X1] :
              ( aElementOf0(X1,X0)
             => aElementOf0(X1,xS) )
          & aSubsetOf0(X0,xS)
          & sbrdtbr0(X0) = sz00
          & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) )
       => ( ( aSet0(slcrc0)
            & ~ ? [X2] : aElementOf0(X2,slcrc0) )
         => sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
    inference(rectify,[],[f81]) ).

fof(f143,plain,
    ! [X0] :
      ( ( sbrdtbr0(X0) = sz00
      <=> X0 = slcrc0 )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f198,plain,
    ? [X0] :
      ( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
      & aSet0(slcrc0)
      & ! [X2] : ~ aElementOf0(X2,slcrc0)
      & aSet0(X0)
      & ! [X1] :
          ( aElementOf0(X1,xS)
          | ~ aElementOf0(X1,X0) )
      & aSubsetOf0(X0,xS)
      & sbrdtbr0(X0) = sz00
      & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) ),
    inference(ennf_transformation,[],[f92]) ).

fof(f199,plain,
    ? [X0] :
      ( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
      & aSet0(slcrc0)
      & ! [X2] : ~ aElementOf0(X2,slcrc0)
      & aSet0(X0)
      & ! [X1] :
          ( aElementOf0(X1,xS)
          | ~ aElementOf0(X1,X0) )
      & aSubsetOf0(X0,xS)
      & sbrdtbr0(X0) = sz00
      & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) ),
    inference(flattening,[],[f198]) ).

fof(f234,plain,
    ! [X0] :
      ( ( ( sbrdtbr0(X0) = sz00
          | slcrc0 != X0 )
        & ( X0 = slcrc0
          | sz00 != sbrdtbr0(X0) ) )
      | ~ aSet0(X0) ),
    inference(nnf_transformation,[],[f143]) ).

fof(f286,plain,
    ? [X0] :
      ( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
      & aSet0(slcrc0)
      & ! [X1] : ~ aElementOf0(X1,slcrc0)
      & aSet0(X0)
      & ! [X2] :
          ( aElementOf0(X2,xS)
          | ~ aElementOf0(X2,X0) )
      & aSubsetOf0(X0,xS)
      & sbrdtbr0(X0) = sz00
      & aElementOf0(X0,slbdtsldtrb0(xS,sz00)) ),
    inference(rectify,[],[f199]) ).

fof(f287,plain,
    ( sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK37)
    & aSet0(slcrc0)
    & ! [X1] : ~ aElementOf0(X1,slcrc0)
    & aSet0(sK37)
    & ! [X2] :
        ( aElementOf0(X2,xS)
        | ~ aElementOf0(X2,sK37) )
    & aSubsetOf0(sK37,xS)
    & sz00 = sbrdtbr0(sK37)
    & aElementOf0(sK37,slbdtsldtrb0(xS,sz00)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK37]),skolemize(X0,sK37)],[f286]) ).

fof(f355,plain,
    ! [X0] :
      ( slcrc0 = X0
      | sz00 != sbrdtbr0(X0)
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f234]) ).

fof(f484,plain,
    sz00 = xK,
    inference(cnf_transformation,[],[f78]) ).

fof(f491,plain,
    sz00 = sbrdtbr0(sK37),
    inference(cnf_transformation,[],[f287]) ).

fof(f494,plain,
    aSet0(sK37),
    inference(cnf_transformation,[],[f287]) ).

fof(f497,plain,
    sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK37),
    inference(cnf_transformation,[],[f287]) ).

fof(f505,plain,
    ! [X0] :
      ( sbrdtbr0(X0) != xK
      | slcrc0 = X0
      | ~ aSet0(X0) ),
    inference(definition_unfolding,[],[f355,f484]) ).

fof(f510,plain,
    xK = sbrdtbr0(sK37),
    inference(definition_unfolding,[],[f491,f484]) ).

fof(f658,plain,
    ( xK != xK
    | slcrc0 = sK37
    | ~ aSet0(sK37) ),
    inference(superposition,[],[f505,f510]) ).

fof(f659,plain,
    ( slcrc0 = sK37
    | ~ aSet0(sK37) ),
    inference(trivial_inequality_removal,[],[f658]) ).

fof(f660,plain,
    slcrc0 = sK37,
    inference(forward_subsumption_resolution,[],[f659,f494]) ).

fof(f664,plain,
    sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,slcrc0),
    inference(superposition,[],[f497,f660]) ).

fof(f670,plain,
    $false,
    inference(trivial_inequality_removal,[],[f664]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM565+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39  % Computer : n003.cluster.edu
% 0.09/0.39  % Model    : x86_64 x86_64
% 0.09/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39  % Memory   : 8046.5625MB
% 0.09/0.39  % OS       : Linux 6.8.0-71-generic
% 0.09/0.39  % CPULimit : 300
% 0.09/0.39  % WCLimit  : 300
% 0.09/0.39  % DateTime : Sun Sep 27 20:33:27 UTC 2026
% 0.09/0.39  % CPUTime  : 
% 0.09/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.43  Running first-order model finding
% 0.09/0.43  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.48  % (898950)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (898955)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3515730491_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (898956)% WARNING: option uhcvi not known.
% 0.17/0.48  % (898956)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=785969117:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (898957)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2142669578:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (898958)dis+10_1_sil=32000:sp=arity:random_seed=3555126129:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (898959)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1271199165:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (898961)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4258453229:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % (898960)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1067838518:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % TRYING [3]
% 0.17/0.48  % (898958) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-898950-898958"...
% 0.17/0.48  % (898956) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-898950-898956"...
% 0.17/0.48  % (898958)...printing done.
% 0.17/0.48  % (898956)...printing done.
% 0.17/0.48  % (898958)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Theorem for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (898958)------------------------------
% 0.17/0.48  % (898958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (898958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (898958)CaDiCaL version: 2.1.3
% 0.17/0.48  % (898958)Termination reason: Refutation
% 0.17/0.48  % (898958)Time elapsed: 0.010 s
% 0.17/0.48  % (898958)Peak memory usage: 12 MB
% 0.17/0.48  % (898958)Instructions burned: 14 (million)
% 0.17/0.48  % (898950)Success in time 0.045 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------