↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC086+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:22 PM UTC 2026

% Result   : Theorem 5.45s 1.76s
% Output   : Refutation 5.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (  10 unt;   0 def)
%            Number of atoms       :  137 (  34 equ)
%            Maximal formula atoms :   15 (   4 avg)
%            Number of connectives :  167 (  62   ~;  53   |;  39   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   36 (  26   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f55,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).

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

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & neq(X1,nil)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X4,nil)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4) )
                  & ( ( nil = X3
                      & nil = X2 )
                    | ( neq(X2,nil)
                      & segmentP(X3,X2) ) )
                  & 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)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X4,nil)
                      | ~ segmentP(X1,X4)
                      | ~ segmentP(X0,X4) )
                  & ( ( nil = X3
                      & nil = X2 )
                    | ( neq(X2,nil)
                      & segmentP(X3,X2) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f100,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f106,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f55]) ).

fof(f130,plain,
    ( sK1 = sK3
    & sK0 = sK2
    & neq(sK1,nil)
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(X4,nil)
        | ~ segmentP(sK1,X4)
        | ~ segmentP(sK0,X4) )
    & ( ( nil = sK3
        & nil = sK2 )
      | ( neq(sK2,nil)
        & segmentP(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)],[f99]) ).

fof(f131,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f100]) ).

fof(f143,plain,
    ssList(sK2),
    inference(cnf_transformation,[],[f130]) ).

fof(f144,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f130]) ).

fof(f147,plain,
    ( segmentP(sK3,sK2)
    | nil = sK3 ),
    inference(cnf_transformation,[],[f130]) ).

fof(f148,plain,
    ( neq(sK2,nil)
    | nil = sK3 ),
    inference(cnf_transformation,[],[f130]) ).

fof(f149,plain,
    ! [X4] :
      ( ~ ssList(X4)
      | ~ neq(X4,nil)
      | ~ segmentP(sK1,X4)
      | ~ segmentP(sK0,X4) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f150,plain,
    neq(sK1,nil),
    inference(cnf_transformation,[],[f130]) ).

fof(f151,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f130]) ).

fof(f152,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f130]) ).

fof(f153,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f131]) ).

fof(f162,plain,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f191,plain,
    neq(sK3,nil),
    inference(definition_unfolding,[],[f150,f152]) ).

fof(f192,plain,
    ! [X4] :
      ( ~ segmentP(sK3,X4)
      | ~ neq(X4,nil)
      | ~ ssList(X4)
      | ~ segmentP(sK2,X4) ),
    inference(definition_unfolding,[],[f149,f152,f151]) ).

fof(f195,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f153]) ).

fof(f203,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f195]) ).

fof(f204,plain,
    ( ~ neq(sK2,nil)
    | ~ ssList(sK2)
    | ~ segmentP(sK2,sK2)
    | nil = sK3 ),
    inference(resolution,[],[f192,f147]) ).

fof(f207,plain,
    ( ~ ssList(sK2)
    | ~ segmentP(sK2,sK2)
    | nil = sK3 ),
    inference(forward_subsumption_resolution,[],[f204,f148]) ).

fof(f209,plain,
    ( ~ segmentP(sK2,sK2)
    | nil = sK3 ),
    inference(forward_subsumption_resolution,[],[f207,f143]) ).

fof(f216,plain,
    ( ~ ssList(sK2)
    | nil = sK3 ),
    inference(resolution,[],[f162,f209]) ).

fof(f220,plain,
    nil = sK3,
    inference(forward_subsumption_resolution,[],[f216,f143]) ).

fof(f233,plain,
    neq(sK3,sK3),
    inference(superposition,[],[f191,f220]) ).

fof(f249,plain,
    ~ ssList(sK3),
    inference(resolution,[],[f233,f203]) ).

fof(f251,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f249,f144]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC086+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n003.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 07:50:27 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.45/1.76  % (1414888)Detected formulas, will run a generic FOF schedule.
% 5.45/1.76  % (1414954)dis-21_1_sil=8000:lcm=predicate:random_seed=1560222696: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)
% 5.45/1.76  % (1414947)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=1019542234:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.45/1.76  % (1414951)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1775968470:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.45/1.76  % (1414953)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=873903135:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.45/1.76  % (1414950)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=428859284:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.45/1.76  % (1414948)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=2295490594:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.45/1.76  % (1414952)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2840934410:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.45/1.76  % (1414952)First to succeed.
% 5.45/1.76  % (1414951)Also succeeded, but the first one will report.
% 5.45/1.76  % (1414952)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1414888"
% 5.45/1.76  % (1414953)Also succeeded, but the first one will report.
% 5.45/1.76  % (1414954)Instruction limit reached! 
% 5.45/1.76  % (1414954)------------------------------
% 5.45/1.76  % (1414954)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.45/1.76  % (1414954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.45/1.76  % (1414954)CaDiCaL version: 2.1.3
% 5.45/1.76  % (1414954)Termination reason: Instruction limit
% 5.45/1.76  % (1414954)Termination phase: Saturation
% 5.45/1.76  % (1414954)Time elapsed: 0.117 s
% 5.45/1.76  % (1414954)Peak memory usage: 90 MB
% 5.45/1.76  % (1414954)Instructions burned: 129 (million)
% 5.45/1.76  % (1414969)lrs+10_1_sil=8000:sp=occurrence:random_seed=2347894008:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 5.45/1.76  % (1414969)Also succeeded, but the first one will report.
% 5.45/1.76  % (1414952)Refutation found. Thanks to Tanya!
% 5.45/1.76  % SZS status Theorem for theBenchmark
% 5.45/1.76  % SZS output start Proof for theBenchmark
% See solution above
% 5.45/1.76  % (1414952)------------------------------
% 5.45/1.76  % (1414952)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.45/1.76  % (1414952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.45/1.76  % (1414952)CaDiCaL version: 2.1.3
% 5.45/1.76  % (1414952)Termination reason: Refutation
% 5.45/1.76  % (1414952)Time elapsed: 0.006 s
% 5.45/1.76  % (1414952)Peak memory usage: 88 MB
% 5.45/1.76  % (1414952)Instructions burned: 4 (million)
% 5.45/1.76  % (1414952)------------------------------
% 5.45/1.76  % (1414952)------------------------------
% 5.45/1.76  % (1414888)Success in time 0.69 s
% 5.45/1.76  % Vampire exiting
%------------------------------------------------------------------------------