↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 2.54s 1.26s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   9 unt;   0 def)
%            Number of atoms       :   42 (  33 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   46 (  18   ~;  12   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   16 (  12   !;   4   ?)

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

fof(f98,plain,
    ~ ! [X0,X1,X2,X3] :
        ( nil != X1
        | X1 != X3
        | X0 != X2
        | X3 != X2
        | nil = X0 ),
    inference(pure_predicate_removal,[],[f97]) ).

fof(f100,plain,
    ? [X0,X1,X2,X3] :
      ( nil = X1
      & X1 = X3
      & X0 = X2
      & X2 = X3
      & nil != X0 ),
    inference(ennf_transformation,[],[f98]) ).

fof(f101,plain,
    ( nil = sK1
    & sK1 = sK3
    & sK0 = sK2
    & sK2 = sK3
    & nil != sK0 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f100]) ).

fof(f102,plain,
    nil != sK0,
    inference(cnf_transformation,[],[f101]) ).

fof(f103,plain,
    sK2 = sK3,
    inference(cnf_transformation,[],[f101]) ).

fof(f104,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f101]) ).

fof(f105,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f101]) ).

fof(f106,plain,
    nil = sK1,
    inference(cnf_transformation,[],[f101]) ).

fof(f107,plain,
    nil = sK3,
    inference(definition_unfolding,[],[f106,f105]) ).

fof(f108,plain,
    sK0 = sK3,
    inference(definition_unfolding,[],[f104,f103]) ).

fof(f109,plain,
    sK3 != sK3,
    inference(definition_unfolding,[],[f102,f107,f108]) ).

fof(f110,plain,
    $false,
    inference(trivial_inequality_removal,[],[f109]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC035+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.40  % Computer : n008.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Mon Sep 28 07:34:09 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44  Running first-order theorem proving
% 0.12/0.44  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.54/1.26  % (2080487)Detected formulas, will run a generic FOF schedule.
% 2.54/1.26  % (2080496)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3883447693:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.54/1.26  % (2080496)First to succeed.
% 2.54/1.26  % (2080496)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2080487"
% 2.54/1.26  % (2080495)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1285264127:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.54/1.26  % (2080494)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=3470927486:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.54/1.26  % (2080493)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=656319741:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.54/1.26  % (2080492)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=3703392141:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.54/1.26  % (2080495)Also succeeded, but the first one will report.
% 2.54/1.26  % (2080498)dis-21_1_sil=8000:lcm=predicate:random_seed=4137480505: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.54/1.26  % (2080497)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4095748187:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.54/1.26  % (2080497)Also succeeded, but the first one will report.
% 2.54/1.26  % (2080498)Also succeeded, but the first one will report.
% 2.54/1.26  % (2080496)Refutation found. Thanks to Tanya!
% 2.54/1.26  % SZS status Theorem for theBenchmark
% 2.54/1.26  % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.26  % (2080496)------------------------------
% 2.54/1.26  % (2080496)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.26  % (2080496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.26  % (2080496)CaDiCaL version: 2.1.3
% 2.54/1.26  % (2080496)Termination reason: Refutation
% 2.54/1.26  % (2080496)Time elapsed: 0.001 s
% 2.54/1.26  % (2080496)Peak memory usage: 88 MB
% 2.54/1.26  % (2080496)Instructions burned: 1 (million)
% 2.54/1.26  % (2080496)------------------------------
% 2.54/1.26  % (2080496)------------------------------
% 2.54/1.26  % (2080487)Success in time 0.291 s
% 2.54/1.26  % Vampire exiting
%------------------------------------------------------------------------------