↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC103+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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:02:27 PM UTC 2026

% Result   : Theorem 2.79s 1.34s
% Output   : Refutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  10 unt;   3 def)
%            Number of atoms       :  106 (  22 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  118 (  40   ~;  31   |;  36   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   4 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)
                    | ( nil != X2
                      & nil = X3 )
                    | ( neq(X0,nil)
                      & frontsegP(X1,X0) )
                    | ( neq(X3,nil)
                      & ( ~ neq(X2,nil)
                        | ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
    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
                      | ~ neq(X1,nil)
                      | ( nil != X2
                        & nil = X3 )
                      | ( neq(X0,nil)
                        & frontsegP(X1,X0) )
                      | ( neq(X3,nil)
                        & ( ~ neq(X2,nil)
                          | ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f101,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ( nil = X2
                    | nil != X3 )
                  & ( ~ neq(X0,nil)
                    | ~ frontsegP(X1,X0) )
                  & ( ~ neq(X3,nil)
                    | ( neq(X2,nil)
                      & frontsegP(X3,X2) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f100]) ).

fof(f113,plain,
    ( sK1 = sK3
    & sK0 = sK2
    & neq(sK1,nil)
    & ( nil = sK2
      | nil != sK3 )
    & ( ~ neq(sK0,nil)
      | ~ frontsegP(sK1,sK0) )
    & ( ~ neq(sK3,nil)
      | ( neq(sK2,nil)
        & frontsegP(sK3,sK2) ) )
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f101]) ).

fof(f123,plain,
    ( ~ neq(sK3,nil)
    | frontsegP(sK3,sK2) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f124,plain,
    ( ~ neq(sK3,nil)
    | neq(sK2,nil) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f125,plain,
    ( ~ neq(sK0,nil)
    | ~ frontsegP(sK1,sK0) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f127,plain,
    neq(sK1,nil),
    inference(cnf_transformation,[],[f113]) ).

fof(f128,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f113]) ).

fof(f129,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f113]) ).

fof(f143,plain,
    neq(sK3,nil),
    inference(definition_unfolding,[],[f127,f129]) ).

fof(f144,plain,
    ( ~ neq(sK2,nil)
    | ~ frontsegP(sK3,sK2) ),
    inference(definition_unfolding,[],[f125,f128,f129,f128]) ).

fof(f155,definition,
    ( spl7_1
  <=> frontsegP(sK3,sK2) ),
    introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).

fof(f159,definition,
    ( spl7_2
  <=> neq(sK3,nil) ),
    introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).

fof(f162,plain,
    ( spl7_1
    | ~ spl7_2 ),
    inference(avatar_split_clause,[],[f123,f159,f155]) ).

fof(f164,definition,
    ( spl7_3
  <=> neq(sK2,nil) ),
    introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).

fof(f167,plain,
    ( spl7_3
    | ~ spl7_2 ),
    inference(avatar_split_clause,[],[f124,f159,f164]) ).

fof(f168,plain,
    ( ~ spl7_1
    | ~ spl7_3 ),
    inference(avatar_split_clause,[],[f144,f164,f155]) ).

fof(f178,plain,
    spl7_2,
    inference(avatar_split_clause,[],[f143,f159]) ).

cnf(s1,plain,
    ( spl7_1
    | ~ spl7_2 ),
    inference(sat_conversion,[],[f162]) ).

cnf(s2,plain,
    ( ~ spl7_2
    | spl7_3 ),
    inference(sat_conversion,[],[f167]) ).

cnf(s3,plain,
    ( ~ spl7_1
    | ~ spl7_3 ),
    inference(sat_conversion,[],[f168]) ).

cnf(s5,plain,
    spl7_2,
    inference(sat_conversion,[],[f178]) ).

cnf(s6,plain,
    spl7_3,
    inference(rat,[],[s2,s5]) ).

cnf(s7,plain,
    ~ spl7_1,
    inference(rat,[],[s3,s6]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s5,s7]) ).

fof(f179,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC103+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 07:53:01 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.39  Running first-order theorem proving
% 0.09/0.39  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.34  % (3237474)Detected formulas, will run a generic FOF schedule.
% 2.79/1.34  % (3237482)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2708144702:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.34  % (3237482)First to succeed.
% 2.79/1.34  % (3237482)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3237474"
% 2.79/1.34  % (3237485)dis-21_1_sil=8000:lcm=predicate:random_seed=999661109:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.79/1.34  % (3237479)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3582078243:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.34  % (3237481)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1081460911:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.34  % (3237483)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1471725713:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.34  % (3237484)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1896670280:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.34  % (3237480)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=375434206:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.34  % (3237483)Also succeeded, but the first one will report.
% 2.79/1.34  % (3237485)Also succeeded, but the first one will report.
% 2.79/1.34  % (3237484)Also succeeded, but the first one will report.
% 2.79/1.34  % (3237482)Refutation found. Thanks to Tanya!
% 2.79/1.34  % SZS status Theorem for theBenchmark
% 2.79/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 2.79/1.34  % (3237482)------------------------------
% 2.79/1.34  % (3237482)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.34  % (3237482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.34  % (3237482)CaDiCaL version: 2.1.3
% 2.79/1.34  % (3237482)Termination reason: Refutation
% 2.79/1.34  % (3237482)Time elapsed: 0.002 s
% 2.79/1.34  % (3237482)Peak memory usage: 89 MB
% 2.79/1.34  % (3237482)Instructions burned: 2 (million)
% 2.79/1.34  % (3237482)------------------------------
% 2.79/1.34  % (3237482)------------------------------
% 2.79/1.34  % (3237474)Success in time 0.314 s
% 2.79/1.34  % Vampire exiting
%------------------------------------------------------------------------------