↑ 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  : SWC040+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 : n011.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:24 PM UTC 2026

% Result   : Theorem 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   87 (  51 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   98 (  26   ~;  20   |;  40   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   24 (  12   !;  12   ?)

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

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

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

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

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

fof(f504,plain,
    ( nil = sK55
    | nil != sK56 ),
    inference(cnf_transformation,[],[f296]) ).

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

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

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

fof(f508,plain,
    nil = sK54,
    inference(cnf_transformation,[],[f296]) ).

fof(f509,plain,
    nil = sK56,
    inference(definition_unfolding,[],[f508,f507]) ).

fof(f568,plain,
    sK55 != sK56,
    inference(definition_unfolding,[],[f505,f509,f506]) ).

fof(f569,plain,
    ( sK55 = sK56
    | sK56 != sK56 ),
    inference(definition_unfolding,[],[f504,f509,f509]) ).

fof(f576,plain,
    sK55 = sK56,
    inference(trivial_inequality_removal,[],[f569]) ).

fof(f601,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f568,f576]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC040+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40  % Computer : n011.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Mon Sep 28 07:34:36 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.44  Running first-order model finding
% 0.14/0.44  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.19/0.48  % (3230765)Will run a generic schedule for satisfiability detection.
% 0.19/0.48  % (3230775)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=607467772:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.48  % (3230771)% WARNING: option uhcvi not known.
% 0.19/0.48  % (3230775) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3230765-3230775"...
% 0.19/0.48  % (3230775)...printing done.
% 0.19/0.48  % (3230775)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (3230775)------------------------------
% 0.19/0.48  % (3230775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48  % (3230775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48  % (3230775)CaDiCaL version: 2.1.3
% 0.19/0.48  % (3230775)Termination reason: Refutation
% 0.19/0.48  % (3230775)Time elapsed: 0.003 s
% 0.19/0.48  % (3230775)Peak memory usage: 11 MB
% 0.19/0.48  % (3230775)Instructions burned: 8 (million)
% 0.19/0.48  % (3230765)Success in time 0.033 s
% 0.19/0.48  % Vampire exiting
%------------------------------------------------------------------------------