↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC121+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 : 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:02:32 PM UTC 2026

% Result   : Theorem 0.23s 1.61s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   9 unt;   3 def)
%            Number of atoms       :  108 (  12 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  119 (  40   ~;  34   |;  34   &)
%                                         (   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)
                        | ~ neq(X2,nil)
                        | ~ segmentP(X3,X2)
                        | ( neq(X0,nil)
                          & segmentP(X1,X0) ) )
                      & ( ~ neq(X1,nil)
                        | 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)
                   => ( X1 != X3
                      | X0 != X2
                      | ( ( ~ neq(X1,nil)
                          | ~ neq(X2,nil)
                          | ~ segmentP(X3,X2)
                          | ( neq(X0,nil)
                            & segmentP(X1,X0) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & neq(X2,nil)
                      & segmentP(X3,X2)
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f215,plain,
    ( sK7 = sK9
    & sK6 = sK8
    & ( ( neq(sK7,nil)
        & neq(sK8,nil)
        & segmentP(sK9,sK8)
        & ( ~ neq(sK6,nil)
          | ~ segmentP(sK7,sK6) ) )
      | ( neq(sK7,nil)
        & ~ neq(sK9,nil) ) )
    & ssList(sK9)
    & ssList(sK8)
    & ssList(sK7)
    & ssList(sK6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9)],[f99]) ).

fof(f268,plain,
    ( ~ neq(sK6,nil)
    | ~ segmentP(sK7,sK6)
    | ~ neq(sK9,nil) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f270,plain,
    ( segmentP(sK9,sK8)
    | ~ neq(sK9,nil) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f272,plain,
    ( neq(sK8,nil)
    | ~ neq(sK9,nil) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f275,plain,
    ( neq(sK7,nil)
    | neq(sK7,nil) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f276,plain,
    sK6 = sK8,
    inference(cnf_transformation,[],[f215]) ).

fof(f277,plain,
    sK7 = sK9,
    inference(cnf_transformation,[],[f215]) ).

fof(f437,plain,
    ( neq(sK9,nil)
    | neq(sK9,nil) ),
    inference(definition_unfolding,[],[f275,f277,f277]) ).

fof(f442,plain,
    ( ~ neq(sK8,nil)
    | ~ segmentP(sK9,sK8)
    | ~ neq(sK9,nil) ),
    inference(definition_unfolding,[],[f268,f276,f277,f276]) ).

fof(f533,plain,
    neq(sK9,nil),
    inference(duplicate_literal_removal,[],[f437]) ).

fof(f573,definition,
    ( spl46_11
  <=> neq(sK9,nil) ),
    introduced(definition,[new_symbols(definition,[spl46_11])],[avatar_definition]) ).

fof(f576,definition,
    ( spl46_12
  <=> segmentP(sK9,sK8) ),
    introduced(definition,[new_symbols(definition,[spl46_12])],[avatar_definition]) ).

fof(f579,definition,
    ( spl46_13
  <=> neq(sK8,nil) ),
    introduced(definition,[new_symbols(definition,[spl46_13])],[avatar_definition]) ).

fof(f581,plain,
    ( ~ spl46_11
    | ~ spl46_12
    | ~ spl46_13 ),
    inference(avatar_split_clause,[],[f442,f579,f576,f573]) ).

fof(f585,plain,
    ( ~ spl46_11
    | spl46_12 ),
    inference(avatar_split_clause,[],[f270,f576,f573]) ).

fof(f588,plain,
    ( ~ spl46_11
    | spl46_13 ),
    inference(avatar_split_clause,[],[f272,f579,f573]) ).

fof(f590,plain,
    spl46_11,
    inference(avatar_split_clause,[],[f533,f573]) ).

cnf(s9,plain,
    ( ~ spl46_11
    | ~ spl46_12
    | ~ spl46_13 ),
    inference(sat_conversion,[],[f581]) ).

cnf(s11,plain,
    ( ~ spl46_11
    | spl46_12 ),
    inference(sat_conversion,[],[f585]) ).

cnf(s13,plain,
    ( ~ spl46_11
    | spl46_13 ),
    inference(sat_conversion,[],[f588]) ).

cnf(s15,plain,
    spl46_11,
    inference(sat_conversion,[],[f590]) ).

cnf(s16,plain,
    spl46_13,
    inference(rat,[],[s13,s15]) ).

cnf(s17,plain,
    spl46_12,
    inference(rat,[],[s11,s15]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s9,s16,s17,s15]) ).

fof(f591,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC121+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42  % Computer : n003.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Mon Sep 28 08:01:27 UTC 2026
% 0.17/0.42  % CPUTime  : 
% 0.17/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.48  Running first-order theorem proving
% 0.23/0.48  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
% 0.23/1.61  % (1419767)Detected formulas, will run a generic FOF schedule.
% 0.23/1.61  % (1419778)dis-21_1_sil=8000:lcm=predicate:random_seed=2819752794: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)
% 0.23/1.61  % (1419778)First to succeed.
% 0.23/1.61  % (1419775)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2926585294:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.23/1.61  % (1419778)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1419767"
% 0.23/1.61  % (1419775)Also succeeded, but the first one will report.
% 0.23/1.61  % (1419774)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=656290023:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.23/1.61  % (1419773)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=2552782546:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.23/1.61  % (1419772)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=4195809533:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.23/1.61  % (1419776)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2026416651:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.23/1.61  % (1419777)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=505883638:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.23/1.61  % (1419776)Also succeeded, but the first one will report.
% 0.23/1.61  % (1419777)Also succeeded, but the first one will report.
% 0.23/1.61  % (1419778)Refutation found. Thanks to Tanya!
% 0.23/1.61  % SZS status Theorem for theBenchmark
% 0.23/1.61  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/1.61  % (1419778)------------------------------
% 0.23/1.61  % (1419778)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.23/1.61  % (1419778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/1.61  % (1419778)CaDiCaL version: 2.1.3
% 0.23/1.61  % (1419778)Termination reason: Refutation
% 0.23/1.61  % (1419778)Time elapsed: 0.005 s
% 0.23/1.61  % (1419778)Peak memory usage: 89 MB
% 0.23/1.61  % (1419778)Instructions burned: 8 (million)
% 0.23/1.61  % (1419778)------------------------------
% 0.23/1.61  % (1419778)------------------------------
% 0.23/1.61  % (1419767)Success in time 0.457 s
% 0.23/1.61  % Vampire exiting
%------------------------------------------------------------------------------