↑ 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  : SWC255+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 : n014.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:17 PM UTC 2026

% Result   : Theorem 0.07s 0.24s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   9 unt;   2 def)
%            Number of atoms       :   75 (  10 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   81 (  30   ~;  21   |;  20   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 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
                    | ( ( ~ neq(X1,nil)
                        | ~ singletonP(X2)
                        | singletonP(X0) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) ) ) ) ) ) ),
    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
                      | ( ( ~ neq(X1,nil)
                          | ~ singletonP(X2)
                          | singletonP(X0) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

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

fof(f413,plain,
    neq(sK48,nil),
    inference(cnf_transformation,[],[f222]) ).

fof(f414,plain,
    ( ~ neq(sK50,nil)
    | ~ singletonP(sK47) ),
    inference(cnf_transformation,[],[f222]) ).

fof(f415,plain,
    ( ~ neq(sK50,nil)
    | singletonP(sK49) ),
    inference(cnf_transformation,[],[f222]) ).

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

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

fof(f426,plain,
    ( ~ neq(sK50,nil)
    | ~ singletonP(sK49) ),
    inference(definition_unfolding,[],[f414,f418]) ).

fof(f427,plain,
    neq(sK50,nil),
    inference(definition_unfolding,[],[f413,f419]) ).

fof(f644,plain,
    ( ~ neq(sK50,nil)
    | ~ singletonP(sK49) ),
    inference(consistent_polarity_flipping,[],[f415]) ).

fof(f645,plain,
    ( ~ neq(sK50,nil)
    | singletonP(sK49) ),
    inference(consistent_polarity_flipping,[],[f426]) ).

fof(f656,definition,
    ( spl51_1
  <=> singletonP(sK49) ),
    introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).

fof(f660,definition,
    ( spl51_2
  <=> neq(sK50,nil) ),
    introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).

fof(f665,plain,
    spl51_2,
    inference(avatar_split_clause,[],[f427,f660]) ).

fof(f666,plain,
    ( spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f645,f660,f656]) ).

fof(f667,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(avatar_split_clause,[],[f644,f660,f656]) ).

cnf(s3,plain,
    spl51_2,
    inference(sat_conversion,[],[f665]) ).

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

cnf(s5,plain,
    ( ~ spl51_1
    | ~ spl51_2 ),
    inference(sat_conversion,[],[f667]) ).

cnf(s19,plain,
    ~ spl51_1,
    inference(rat,[],[s5,s3]) ).

cnf(s20,plain,
    $false,
    inference(rat,[],[s4,s3,s19]) ).

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

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