↑ 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  : LAT388+4 : 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 : n013.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 11:48:46 AM UTC 2026

% Result   : Theorem 0.17s 0.46s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   94 (   3 equ)
%            Maximal formula atoms :   12 (   8 avg)
%            Number of connectives :  104 (  21   ~;  19   |;  49   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   8 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (  22   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f30,axiom,
    ( aElementOf0(xp,szDzozmdt0(xf))
    & sdtlpdtrp0(xf,xp) = xp
    & aFixedPointOf0(xp,xf)
    & ! [X0] :
        ( aElementOf0(X0,xT)
       => sdtlseqdt0(X0,xp) )
    & aUpperBoundOfIn0(xp,xT,xS)
    & ! [X0] :
        ( ( ( aElementOf0(X0,xS)
            & ! [X1] :
                ( aElementOf0(X1,xT)
               => sdtlseqdt0(X1,X0) ) )
          | aUpperBoundOfIn0(X0,xT,xS) )
       => sdtlseqdt0(xp,X0) )
    & aSupremumOfIn0(xp,xT,xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).

fof(f31,conjecture,
    ? [X0] :
      ( ( aElementOf0(X0,xS)
        & ( ( aElementOf0(X0,xS)
            & ! [X1] :
                ( aElementOf0(X1,xT)
               => sdtlseqdt0(X1,X0) ) )
          | aUpperBoundOfIn0(X0,xT,xS) )
        & ! [X1] :
            ( ( aElementOf0(X1,xS)
              & ! [X2] :
                  ( aElementOf0(X2,xT)
                 => sdtlseqdt0(X2,X1) )
              & aUpperBoundOfIn0(X1,xT,xS) )
           => sdtlseqdt0(X0,X1) ) )
      | aSupremumOfIn0(X0,xT,xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f32,negated_conjecture,
    ~ ? [X0] :
        ( ( aElementOf0(X0,xS)
          & ( ( aElementOf0(X0,xS)
              & ! [X1] :
                  ( aElementOf0(X1,xT)
                 => sdtlseqdt0(X1,X0) ) )
            | aUpperBoundOfIn0(X0,xT,xS) )
          & ! [X1] :
              ( ( aElementOf0(X1,xS)
                & ! [X2] :
                    ( aElementOf0(X2,xT)
                   => sdtlseqdt0(X2,X1) )
                & aUpperBoundOfIn0(X1,xT,xS) )
             => sdtlseqdt0(X0,X1) ) )
        | aSupremumOfIn0(X0,xT,xS) ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f37,plain,
    ( aElementOf0(xp,szDzozmdt0(xf))
    & sdtlpdtrp0(xf,xp) = xp
    & aFixedPointOf0(xp,xf)
    & ! [X0] :
        ( aElementOf0(X0,xT)
       => sdtlseqdt0(X0,xp) )
    & aUpperBoundOfIn0(xp,xT,xS)
    & ! [X1] :
        ( ( ( aElementOf0(X1,xS)
            & ! [X2] :
                ( aElementOf0(X2,xT)
               => sdtlseqdt0(X2,X1) ) )
          | aUpperBoundOfIn0(X1,xT,xS) )
       => sdtlseqdt0(xp,X1) )
    & aSupremumOfIn0(xp,xT,xS) ),
    inference(rectify,[],[f30]) ).

fof(f38,plain,
    ~ ? [X0] :
        ( ( aElementOf0(X0,xS)
          & ( ( aElementOf0(X0,xS)
              & ! [X1] :
                  ( aElementOf0(X1,xT)
                 => sdtlseqdt0(X1,X0) ) )
            | aUpperBoundOfIn0(X0,xT,xS) )
          & ! [X2] :
              ( ( aElementOf0(X2,xS)
                & ! [X3] :
                    ( aElementOf0(X3,xT)
                   => sdtlseqdt0(X3,X2) )
                & aUpperBoundOfIn0(X2,xT,xS) )
             => sdtlseqdt0(X0,X2) ) )
        | aSupremumOfIn0(X0,xT,xS) ),
    inference(rectify,[],[f32]) ).

fof(f78,plain,
    ( aElementOf0(xp,szDzozmdt0(xf))
    & sdtlpdtrp0(xf,xp) = xp
    & aFixedPointOf0(xp,xf)
    & ! [X0] :
        ( sdtlseqdt0(X0,xp)
        | ~ aElementOf0(X0,xT) )
    & aUpperBoundOfIn0(xp,xT,xS)
    & ! [X1] :
        ( sdtlseqdt0(xp,X1)
        | ( ( ~ aElementOf0(X1,xS)
            | ? [X2] :
                ( ~ sdtlseqdt0(X2,X1)
                & aElementOf0(X2,xT) ) )
          & ~ aUpperBoundOfIn0(X1,xT,xS) ) )
    & aSupremumOfIn0(xp,xT,xS) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f79,plain,
    ! [X0] :
      ( ( ~ aElementOf0(X0,xS)
        | ( ( ~ aElementOf0(X0,xS)
            | ? [X1] :
                ( ~ sdtlseqdt0(X1,X0)
                & aElementOf0(X1,xT) ) )
          & ~ aUpperBoundOfIn0(X0,xT,xS) )
        | ? [X2] :
            ( ~ sdtlseqdt0(X0,X2)
            & aElementOf0(X2,xS)
            & ! [X3] :
                ( sdtlseqdt0(X3,X2)
                | ~ aElementOf0(X3,xT) )
            & aUpperBoundOfIn0(X2,xT,xS) ) )
      & ~ aSupremumOfIn0(X0,xT,xS) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f80,plain,
    ! [X0] :
      ( ( ~ aElementOf0(X0,xS)
        | ( ( ~ aElementOf0(X0,xS)
            | ? [X1] :
                ( ~ sdtlseqdt0(X1,X0)
                & aElementOf0(X1,xT) ) )
          & ~ aUpperBoundOfIn0(X0,xT,xS) )
        | ? [X2] :
            ( ~ sdtlseqdt0(X0,X2)
            & aElementOf0(X2,xS)
            & ! [X3] :
                ( sdtlseqdt0(X3,X2)
                | ~ aElementOf0(X3,xT) )
            & aUpperBoundOfIn0(X2,xT,xS) ) )
      & ~ aSupremumOfIn0(X0,xT,xS) ),
    inference(flattening,[],[f79]) ).

fof(f219,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(cnf_transformation,[],[f78]) ).

fof(f236,plain,
    ! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
    inference(cnf_transformation,[],[f80]) ).

fof(f238,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f219,f236]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n013.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 15:13:07 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.46  % (334673)Will run a generic schedule for satisfiability detection.
% 0.17/0.46  % (334682)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2976135552:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46  % (334679)% WARNING: option uhcvi not known.
% 0.17/0.46  % (334682) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-334673-334682"...
% 0.17/0.46  % (334682)...printing done.
% 0.17/0.46  % (334682)Refutation found. Thanks to Tanya!
% 0.17/0.46  % SZS status Theorem for theBenchmark
% 0.17/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46  % (334682)------------------------------
% 0.17/0.46  % (334682)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46  % (334682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46  % (334682)CaDiCaL version: 2.1.3
% 0.17/0.46  % (334682)Termination reason: Refutation
% 0.17/0.46  % (334682)Time elapsed: 0.003 s
% 0.17/0.46  % (334682)Peak memory usage: 12 MB
% 0.17/0.46  % (334682)Instructions burned: 10 (million)
% 0.17/0.46  % (334673)Success in time 0.037 s
% 0.17/0.46  % Vampire exiting
%------------------------------------------------------------------------------