↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC360+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 : n019.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:03:37 PM UTC 2026

% Result   : Theorem 2.18s 0.79s
% Output   : Refutation 2.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   7 unt;   0 def)
%            Number of atoms       :   82 (  12 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :  101 (  31   ~;  24   |;  38   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   21 (  11   !;  10   ?)

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

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

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & neq(sK54,nil)
    & segmentP(sK56,sK55)
    & totalorderedP(sK55)
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(sK55,X4)
        | ~ segmentP(sK56,X4)
        | ~ segmentP(X4,sK55)
        | ~ totalorderedP(X4) )
    & ~ segmentP(sK54,sK53)
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).

fof(f500,plain,
    ~ segmentP(sK54,sK53),
    inference(cnf_transformation,[],[f296]) ).

fof(f503,plain,
    segmentP(sK56,sK55),
    inference(cnf_transformation,[],[f296]) ).

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

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

fof(f576,plain,
    ~ segmentP(sK54,sK55),
    inference(superposition,[],[f500,f505]) ).

fof(f578,plain,
    segmentP(sK54,sK55),
    inference(superposition,[],[f503,f506]) ).

fof(f581,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f578,f576]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC360+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.09/0.19  % Computer : n019.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 09:16:34 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.22  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
% 2.18/0.79  % (3868478)Detected formulas, will run a generic FOF schedule.
% 2.18/0.79  % (3868488)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3122587209:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.18/0.79  % (3868488)First to succeed.
% 2.18/0.79  % (3868488)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3868478"
% 2.18/0.79  % (3868486)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4096284521:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.18/0.79  % (3868487)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4062652278:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.18/0.79  % (3868485)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=1741961817:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.18/0.79  % (3868483)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=2356704024:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.18/0.79  % (3868489)dis-21_1_sil=8000:lcm=predicate:random_seed=1924350151: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.18/0.79  % (3868484)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=2820479237:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.18/0.79  % (3868487)Also succeeded, but the first one will report.
% 2.18/0.79  % (3868486)Also succeeded, but the first one will report.
% 2.18/0.79  % (3868489)Also succeeded, but the first one will report.
% 2.18/0.79  % (3868488)Refutation found. Thanks to Tanya!
% 2.18/0.79  % SZS status Theorem for theBenchmark
% 2.18/0.79  % SZS output start Proof for theBenchmark
% See solution above
% 2.18/0.79  % (3868488)------------------------------
% 2.18/0.79  % (3868488)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.18/0.79  % (3868488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/0.79  % (3868488)CaDiCaL version: 2.1.3
% 2.18/0.79  % (3868488)Termination reason: Refutation
% 2.18/0.79  % (3868488)Time elapsed: 0.004 s
% 2.18/0.79  % (3868488)Peak memory usage: 89 MB
% 2.18/0.79  % (3868488)Instructions burned: 9 (million)
% 2.18/0.79  % (3868488)------------------------------
% 2.18/0.79  % (3868488)------------------------------
% 2.18/0.79  % (3868478)Success in time 0.284 s
% 2.18/0.79  % Vampire exiting
%------------------------------------------------------------------------------