↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 2.89s 1.16s
% Output   : Refutation 2.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  13 unt;   2 def)
%            Number of atoms       :   88 (  18 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   82 (  27   ~;  21   |;  23   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   20 (   0 sgn  12   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f57,axiom,
    ! [X0] :
      ( ssList(X0)
     => segmentP(X0,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).

fof(f74,axiom,
    equalelemsP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).

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

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

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

fof(f121,plain,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f216,plain,
    ( nil = sK8
    & sK7 = sK9
    & sK6 = sK8
    & ( ~ segmentP(sK7,sK6)
      | ~ equalelemsP(sK6) )
    & 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(f269,plain,
    ssList(sK9),
    inference(cnf_transformation,[],[f216]) ).

fof(f270,plain,
    ( ~ segmentP(sK7,sK6)
    | ~ equalelemsP(sK6) ),
    inference(cnf_transformation,[],[f216]) ).

fof(f271,plain,
    sK6 = sK8,
    inference(cnf_transformation,[],[f216]) ).

fof(f272,plain,
    sK7 = sK9,
    inference(cnf_transformation,[],[f216]) ).

fof(f273,plain,
    nil = sK8,
    inference(cnf_transformation,[],[f216]) ).

fof(f300,plain,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f121]) ).

fof(f309,plain,
    equalelemsP(nil),
    inference(cnf_transformation,[],[f74]) ).

fof(f438,plain,
    ( ~ segmentP(sK9,sK8)
    | ~ equalelemsP(sK8) ),
    inference(definition_unfolding,[],[f270,f272,f271,f271]) ).

fof(f454,plain,
    ! [X0] :
      ( segmentP(X0,sK8)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f300,f273]) ).

fof(f455,plain,
    equalelemsP(sK8),
    inference(definition_unfolding,[],[f309,f273]) ).

fof(f614,definition,
    ( spl50_11
  <=> equalelemsP(sK8) ),
    introduced(definition,[new_symbols(definition,[spl50_11])],[avatar_definition]) ).

fof(f615,plain,
    ( ~ equalelemsP(sK8)
    | spl50_11 ),
    inference(avatar_component_clause,[],[f614]) ).

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

fof(f618,plain,
    ( ~ segmentP(sK9,sK8)
    | spl50_12 ),
    inference(avatar_component_clause,[],[f617]) ).

fof(f619,plain,
    ( ~ spl50_11
    | ~ spl50_12 ),
    inference(avatar_split_clause,[],[f438,f617,f614]) ).

fof(f622,plain,
    ( ~ ssList(sK9)
    | spl50_12 ),
    inference(resolution,[],[f454,f618]) ).

fof(f623,plain,
    ( $false
    | spl50_12 ),
    inference(resolution,[],[f622,f269]) ).

fof(f624,plain,
    spl50_12,
    inference(avatar_contradiction_clause,[],[f623]) ).

fof(f625,plain,
    ( $false
    | spl50_11 ),
    inference(resolution,[],[f615,f455]) ).

fof(f626,plain,
    spl50_11,
    inference(avatar_contradiction_clause,[],[f625]) ).

cnf(s9,plain,
    ( ~ spl50_11
    | ~ spl50_12 ),
    inference(sat_conversion,[],[f619]) ).

cnf(s11,plain,
    spl50_12,
    inference(sat_conversion,[],[f624]) ).

cnf(s12,plain,
    spl50_11,
    inference(sat_conversion,[],[f626]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s9,s11,s12]) ).

fof(f627,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

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