↑ 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  : NUM603+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n016.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:58 PM UTC 2026

% Result   : Theorem 0.38s 0.48s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  10 unt;   0 def)
%            Number of atoms       :   67 (   8 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   70 (  27   ~;  23   |;  15   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).

fof(f30,axiom,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
     => sdtlseqdt0(sz00,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).

fof(f81,axiom,
    ( aFunction0(xN)
    & szDzozmdt0(xN) = szNzAzT0
    & sdtlpdtrp0(xN,sz00) = xS
    & ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => ( ( aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
            & isCountable0(sdtlpdtrp0(xN,X0)) )
         => ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
            & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).

fof(f83,axiom,
    ! [X0,X1] :
      ( ( aElementOf0(X0,szNzAzT0)
        & aElementOf0(X1,szNzAzT0) )
     => ( sdtlseqdt0(X1,X0)
       => aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3754) ).

fof(f99,axiom,
    ( aElementOf0(xi,szNzAzT0)
    & sdtlpdtrp0(xe,xi) = xx ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).

fof(f100,conjecture,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f101,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(negated_conjecture,[status(cth)],[f100]) ).

fof(f109,plain,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(flattening,[],[f101]) ).

fof(f145,plain,
    ! [X0] :
      ( sdtlseqdt0(sz00,X0)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f211,plain,
    ( aFunction0(xN)
    & szDzozmdt0(xN) = szNzAzT0
    & sdtlpdtrp0(xN,sz00) = xS
    & ! [X0] :
        ( ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
          & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X0))
        | ~ aElementOf0(X0,szNzAzT0) ) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f212,plain,
    ( aFunction0(xN)
    & szDzozmdt0(xN) = szNzAzT0
    & sdtlpdtrp0(xN,sz00) = xS
    & ! [X0] :
        ( ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0))))
          & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0))) )
        | ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
        | ~ isCountable0(sdtlpdtrp0(xN,X0))
        | ~ aElementOf0(X0,szNzAzT0) ) ),
    inference(flattening,[],[f211]) ).

fof(f214,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(ennf_transformation,[],[f83]) ).

fof(f215,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(flattening,[],[f214]) ).

fof(f349,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(cnf_transformation,[],[f24]) ).

fof(f356,plain,
    ! [X0] :
      ( ~ aElementOf0(X0,szNzAzT0)
      | sdtlseqdt0(sz00,X0) ),
    inference(cnf_transformation,[],[f145]) ).

fof(f463,plain,
    xS = sdtlpdtrp0(xN,sz00),
    inference(cnf_transformation,[],[f212]) ).

fof(f468,plain,
    ! [X0,X1] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
      | ~ sdtlseqdt0(X1,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f502,plain,
    aElementOf0(xi,szNzAzT0),
    inference(cnf_transformation,[],[f99]) ).

fof(f503,plain,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(cnf_transformation,[],[f109]) ).

fof(f910,plain,
    ! [X0] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
      | ~ sdtlseqdt0(sz00,X0)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(sz00,szNzAzT0) ),
    inference(superposition,[],[f468,f463]) ).

fof(f911,plain,
    ! [X0] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
      | ~ aElementOf0(X0,szNzAzT0)
      | ~ aElementOf0(sz00,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f910,f356]) ).

fof(f913,plain,
    ! [X0] :
      ( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
      | ~ aElementOf0(X0,szNzAzT0) ),
    inference(forward_subsumption_resolution,[],[f911,f349]) ).

fof(f997,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(resolution,[],[f913,f503]) ).

fof(f1000,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f997,f502]) ).

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