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

% Computer : n004.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 01:05:54 PM UTC 2026

% Result   : Theorem 0.08s 0.30s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   9 unt;   0 def)
%            Number of atoms       :   84 (  12 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :   97 (  29   ~;  22   |;  36   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   26 (  14   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ? [X4] :
                        ( ssItem(X4)
                        & ( ( ~ memberP(X3,X4)
                            & memberP(X2,X4) )
                          | ( ~ memberP(X2,X4)
                            & memberP(X3,X4) ) ) )
                    | ! [X5] :
                        ( ssItem(X5)
                       => ( ~ memberP(X0,X5)
                          | memberP(X1,X5) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X1 != X3
                      | X0 != X2
                      | ? [X4] :
                          ( ssItem(X4)
                          & ( ( ~ memberP(X3,X4)
                              & memberP(X2,X4) )
                            | ( ~ memberP(X2,X4)
                              & memberP(X3,X4) ) ) )
                      | ! [X5] :
                          ( ssItem(X5)
                         => ( ~ memberP(X0,X5)
                            | memberP(X1,X5) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ( ( memberP(X3,X4)
                          | ~ memberP(X2,X4) )
                        & ( memberP(X2,X4)
                          | ~ memberP(X3,X4) ) ) )
                  & ? [X5] :
                      ( memberP(X0,X5)
                      & ~ memberP(X1,X5)
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ( ( memberP(X3,X4)
                          | ~ memberP(X2,X4) )
                        & ( memberP(X2,X4)
                          | ~ memberP(X3,X4) ) ) )
                  & ? [X5] :
                      ( memberP(X0,X5)
                      & ~ memberP(X1,X5)
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & ! [X4] :
        ( ~ ssItem(X4)
        | ( ( memberP(sK56,X4)
            | ~ memberP(sK55,X4) )
          & ( memberP(sK55,X4)
            | ~ memberP(sK56,X4) ) ) )
    & memberP(sK53,sK57)
    & ~ memberP(sK54,sK57)
    & ssItem(sK57)
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57)],[f222]) ).

fof(f500,plain,
    ssItem(sK57),
    inference(cnf_transformation,[],[f296]) ).

fof(f501,plain,
    ~ memberP(sK54,sK57),
    inference(cnf_transformation,[],[f296]) ).

fof(f502,plain,
    memberP(sK53,sK57),
    inference(cnf_transformation,[],[f296]) ).

fof(f504,plain,
    ! [X4] :
      ( ~ memberP(sK55,X4)
      | memberP(sK56,X4)
      | ~ ssItem(X4) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f505,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f506,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f296]) ).

fof(f507,plain,
    memberP(sK55,sK57),
    inference(definition_unfolding,[],[f502,f505]) ).

fof(f508,plain,
    ~ memberP(sK56,sK57),
    inference(definition_unfolding,[],[f501,f506]) ).

fof(f580,plain,
    ( memberP(sK56,sK57)
    | ~ ssItem(sK57) ),
    inference(resolution,[],[f504,f507]) ).

fof(f581,plain,
    ~ ssItem(sK57),
    inference(forward_subsumption_resolution,[],[f580,f508]) ).

fof(f582,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f581,f500]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC405+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  % Computer : n004.cluster.edu
% 0.08/0.22  % Model    : x86_64 x86_64
% 0.08/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22  % Memory   : 8046.5625MB
% 0.08/0.22  % OS       : Linux 6.8.0-71-generic
% 0.08/0.22  % CPULimit : 300
% 0.08/0.22  % WCLimit  : 300
% 0.08/0.22  % DateTime : Mon Sep 28 09:30:52 UTC 2026
% 0.08/0.22  % CPUTime  : 
% 0.08/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.26  Running first-order model finding
% 0.08/0.26  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.08/0.30  % (230651)Will run a generic schedule for satisfiability detection.
% 0.08/0.30  % (230660)dis+10_1_sil=32000:sp=arity:random_seed=2989752635:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.30  % (230657)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2466142522_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.30  % (230660) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-230651-230660"...
% 0.08/0.30  % (230660)...printing done.
% 0.08/0.30  % (230660)Refutation found. Thanks to Tanya!
% 0.08/0.30  % SZS status Theorem for theBenchmark
% 0.08/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.30  % (230660)------------------------------
% 0.08/0.30  % (230660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.30  % (230660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.30  % (230660)CaDiCaL version: 2.1.3
% 0.08/0.30  % (230660)Termination reason: Refutation
% 0.08/0.30  % (230660)Time elapsed: 0.005 s
% 0.08/0.30  % (230660)Peak memory usage: 12 MB
% 0.08/0.30  % (230660)Instructions burned: 9 (million)
% 0.08/0.30  % (230651)Success in time 0.028 s
% 0.08/0.30  % Vampire exiting
%------------------------------------------------------------------------------