↑ 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  : SWC391+1 : TPTP v9.3.1. Released v2.4.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 01:05:50 PM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (  11 unt;   0 def)
%            Number of atoms       :   51 (  16 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   50 (  14   ~;   8   |;  18   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 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   :   20 (  10   !;  10   ?)

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

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

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

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

fof(f412,plain,
    ~ memberP(sK48,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f413,plain,
    memberP(sK47,sK51),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    sK49 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f416,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f222]) ).

fof(f417,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f222]) ).

fof(f421,plain,
    sK47 = sK50,
    inference(definition_unfolding,[],[f416,f415]) ).

fof(f425,plain,
    memberP(sK50,sK51),
    inference(definition_unfolding,[],[f413,f421]) ).

fof(f426,plain,
    ~ memberP(sK50,sK51),
    inference(definition_unfolding,[],[f412,f417]) ).

fof(f586,plain,
    ~ memberP(sK50,sK51),
    inference(consistent_polarity_flipping,[],[f425]) ).

fof(f587,plain,
    memberP(sK50,sK51),
    inference(consistent_polarity_flipping,[],[f426]) ).

fof(f631,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f587,f586]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC391+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n003.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 09:27:43 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.08/0.26  % (1456803)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (1456809)% WARNING: option uhcvi not known.
% 0.08/0.26  % (1456809)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1747192996:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (1456809) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1456803-1456809"...
% 0.08/0.26  % (1456809)...printing done.
% 0.08/0.26  % (1456809)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (1456809)------------------------------
% 0.08/0.26  % (1456809)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (1456809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (1456809)CaDiCaL version: 2.1.3
% 0.08/0.26  % (1456809)Termination reason: Refutation
% 0.08/0.26  % (1456809)Time elapsed: 0.003 s
% 0.08/0.26  % (1456809)Peak memory usage: 12 MB
% 0.08/0.26  % (1456809)Instructions burned: 9 (million)
% 0.08/0.26  % (1456803)Success in time 0.034 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------