↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 2.60s 1.39s
% Output   : Refutation 2.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (  11 unt;   0 def)
%            Number of atoms       :   96 (  38 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  120 (  45   ~;  35   |;  30   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   40 (  27   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | ? [X4] :
                      ( ssList(X4)
                      & ? [X5] :
                          ( ssList(X5)
                          & ? [X6] :
                              ( ssList(X6)
                              & app(app(X4,X5),X6) = X1
                              & app(X4,X6) = X0 ) ) )
                  | ! [X7] :
                      ( ssList(X7)
                     => ! [X8] :
                          ( ssList(X8)
                         => ! [X9] :
                              ( ~ ssList(X9)
                              | app(app(X7,X8),X9) != X3
                              | app(X7,X9) != 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
                    | ? [X4] :
                        ( ssList(X4)
                        & ? [X5] :
                            ( ssList(X5)
                            & ? [X6] :
                                ( ssList(X6)
                                & app(app(X4,X5),X6) = X1
                                & app(X4,X6) = X0 ) ) )
                    | ! [X7] :
                        ( ssList(X7)
                       => ! [X8] :
                            ( ssList(X8)
                           => ! [X9] :
                                ( ~ ssList(X9)
                                | app(app(X7,X8),X9) != X3
                                | app(X7,X9) != X2 ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(app(X4,X5),X6) != X1
                              | app(X4,X6) != X0 ) ) )
                  & ? [X7] :
                      ( ? [X8] :
                          ( ? [X9] :
                              ( ssList(X9)
                              & app(app(X7,X8),X9) = X3
                              & app(X7,X9) = X2 )
                          & ssList(X8) )
                      & ssList(X7) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f295,plain,
    ( ssList(sK56)
    & sK54 = sK56
    & sK53 = sK55
    & ! [X4] :
        ( ~ ssList(X4)
        | ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( ~ ssList(X6)
                | app(app(X4,X5),X6) != sK54
                | app(X4,X6) != sK53 ) ) )
    & ssList(sK59)
    & sK56 = app(app(sK57,sK58),sK59)
    & sK55 = app(sK57,sK59)
    & ssList(sK58)
    & ssList(sK57)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57),skolemize(X8,sK58),skolemize(X9,sK59)],[f221]) ).

fof(f498,plain,
    ssList(sK57),
    inference(cnf_transformation,[],[f295]) ).

fof(f499,plain,
    ssList(sK58),
    inference(cnf_transformation,[],[f295]) ).

fof(f500,plain,
    sK55 = app(sK57,sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f501,plain,
    sK56 = app(app(sK57,sK58),sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f502,plain,
    ssList(sK59),
    inference(cnf_transformation,[],[f295]) ).

fof(f503,plain,
    ! [X6,X4,X5] :
      ( app(X4,X6) != sK53
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X4,X5),X6) != sK54
      | ~ ssList(X4) ),
    inference(cnf_transformation,[],[f295]) ).

fof(f504,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f295]) ).

fof(f505,plain,
    sK54 = sK56,
    inference(cnf_transformation,[],[f295]) ).

fof(f578,plain,
    sK53 = app(sK57,sK59),
    inference(forward_demodulation,[],[f500,f504]) ).

fof(f579,plain,
    sK54 = app(app(sK57,sK58),sK59),
    inference(forward_demodulation,[],[f501,f505]) ).

fof(f580,plain,
    ! [X0] :
      ( sK53 != sK53
      | ~ ssList(X0)
      | ~ ssList(sK59)
      | sK54 != app(app(sK57,X0),sK59)
      | ~ ssList(sK57) ),
    inference(superposition,[],[f503,f578]) ).

fof(f582,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ ssList(sK59)
      | sK54 != app(app(sK57,X0),sK59)
      | ~ ssList(sK57) ),
    inference(trivial_inequality_removal,[],[f580]) ).

fof(f584,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | sK54 != app(app(sK57,X0),sK59)
      | ~ ssList(sK57) ),
    inference(forward_subsumption_resolution,[],[f582,f502]) ).

fof(f597,plain,
    ! [X0] :
      ( sK54 != app(app(sK57,X0),sK59)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f584,f498]) ).

fof(f599,plain,
    ( sK54 != sK54
    | ~ ssList(sK58) ),
    inference(superposition,[],[f597,f579]) ).

fof(f600,plain,
    ~ ssList(sK58),
    inference(trivial_inequality_removal,[],[f599]) ).

fof(f601,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f600,f499]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n017.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 28 07:19:52 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.50  Running first-order theorem proving
% 0.22/0.50  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.60/1.39  % (3371379)Detected formulas, will run a generic FOF schedule.
% 2.60/1.39  % (3371494)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2726616712:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.60/1.39  % (3371494)First to succeed.
% 2.60/1.39  % (3371494)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3371379"
% 2.60/1.39  % (3371492)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2576955617:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.60/1.39  % (3371489)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=477190192:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.60/1.39  % (3371491)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=2099305611:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.60/1.39  % (3371493)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3565741914:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.60/1.39  % (3371493)Also succeeded, but the first one will report.
% 2.60/1.39  % (3371490)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=1734291366:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.60/1.39  % (3371492)Also succeeded, but the first one will report.
% 2.60/1.39  % (3371495)dis-21_1_sil=8000:lcm=predicate:random_seed=4084584690: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.60/1.39  % (3371495)Also succeeded, but the first one will report.
% 2.60/1.39  % (3371494)Refutation found. Thanks to Tanya!
% 2.60/1.39  % SZS status Theorem for theBenchmark
% 2.60/1.39  % SZS output start Proof for theBenchmark
% See solution above
% 2.60/1.39  % (3371494)------------------------------
% 2.60/1.39  % (3371494)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.60/1.39  % (3371494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.60/1.39  % (3371494)CaDiCaL version: 2.1.3
% 2.60/1.39  % (3371494)Termination reason: Refutation
% 2.60/1.39  % (3371494)Time elapsed: 0.004 s
% 2.60/1.39  % (3371494)Peak memory usage: 89 MB
% 2.60/1.39  % (3371494)Instructions burned: 10 (million)
% 2.60/1.39  % (3371494)------------------------------
% 2.60/1.39  % (3371494)------------------------------
% 2.60/1.39  % (3371379)Success in time 0.274 s
% 2.60/1.39  % Vampire exiting
%------------------------------------------------------------------------------