↑ 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  : SWC026+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 : n005.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:04:20 PM UTC 2026

% Result   : Theorem 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (   6 unt;   2 def)
%            Number of atoms       :   94 (  56 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  103 (  35   ~;  32   |;  26   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn   8   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ( nil != X3
                      & nil = X2 )
                    | ( nil != X2
                      & nil = X3 )
                    | ( ( nil != X1
                        | nil = X0 )
                      & ( nil != X0
                        | nil = X1 ) ) ) ) ) ) ),
    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
                      | ( nil != X3
                        & nil = X2 )
                      | ( nil != X2
                        & nil = X3 )
                      | ( ( nil != X1
                          | nil = X0 )
                        & ( nil != X0
                          | nil = X1 ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( nil = X3
                    | nil != X2 )
                  & ( nil = X2
                    | nil != X3 )
                  & ( ( nil = X1
                      & nil != X0 )
                    | ( nil = X0
                      & nil != X1 ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( nil = X3
                    | nil != X2 )
                  & ( nil = X2
                    | nil != X3 )
                  & ( ( nil = X1
                      & nil != X0 )
                    | ( nil = X0
                      & nil != X1 ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f411,plain,
    ( nil = sK47
    | nil = sK48 ),
    inference(cnf_transformation,[],[f222]) ).

fof(f412,plain,
    ( nil != sK48
    | nil != sK47 ),
    inference(cnf_transformation,[],[f222]) ).

fof(f413,plain,
    ( nil != sK49
    | nil = sK50 ),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    ( nil != sK50
    | nil = sK49 ),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f423,plain,
    ( nil != sK50
    | nil != sK49 ),
    inference(definition_unfolding,[],[f412,f417,f416]) ).

fof(f424,plain,
    ( nil = sK49
    | nil = sK50 ),
    inference(definition_unfolding,[],[f411,f416,f417]) ).

fof(f536,definition,
    ( spl51_1
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).

fof(f540,definition,
    ( spl51_2
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).

fof(f543,plain,
    ( spl51_1
    | spl51_2 ),
    inference(avatar_split_clause,[],[f424,f540,f536]) ).

fof(f544,plain,
    ( ~ spl51_2
    | ~ spl51_1 ),
    inference(avatar_split_clause,[],[f423,f536,f540]) ).

fof(f545,plain,
    ( spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f413,f540,f536]) ).

fof(f546,plain,
    ( spl51_2
    | ~ spl51_1 ),
    inference(avatar_split_clause,[],[f414,f536,f540]) ).

cnf(s1,plain,
    ( spl51_1
    | spl51_2 ),
    inference(sat_conversion,[],[f543]) ).

cnf(s2,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(sat_conversion,[],[f544]) ).

cnf(s3,plain,
    ( spl51_1
    | ~ spl51_2 ),
    inference(sat_conversion,[],[f545]) ).

cnf(s4,plain,
    ( ~ spl51_1
    | spl51_2 ),
    inference(sat_conversion,[],[f546]) ).

cnf(s18,plain,
    spl51_1,
    inference(rat,[],[s1,s3]) ).

cnf(s19,plain,
    spl51_2,
    inference(rat,[],[s4,s18]) ).

cnf(s20,plain,
    $false,
    inference(rat,[],[s2,s19,s18]) ).

fof(f582,plain,
    $false,
    inference(avatar_sat_refutation,[],[s20]) ).

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