↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 2.74s 1.38s
% Output   : Refutation 2.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   5 unt;   0 def)
%            Number of atoms       :   50 (  11 equ)
%            Maximal formula atoms :    9 (   5 avg)
%            Number of connectives :   54 (  14   ~;   8   |;  24   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   7 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   :   16 (   8   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ~ neq(X1,nil)
                    | neq(X3,nil)
                    | singletonP(X1) ) ) ) ) ),
    file('/export/starexec/sandbox/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)
                      | neq(X3,nil)
                      | singletonP(X1) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f110,plain,
    ( sK1 = sK3
    & sK0 = sK2
    & neq(sK1,nil)
    & ~ neq(sK3,nil)
    & ~ singletonP(sK1)
    & 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(f123,plain,
    ~ neq(sK3,nil),
    inference(cnf_transformation,[],[f110]) ).

fof(f124,plain,
    neq(sK1,nil),
    inference(cnf_transformation,[],[f110]) ).

fof(f126,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f110]) ).

fof(f147,plain,
    neq(sK3,nil),
    inference(definition_unfolding,[],[f124,f126]) ).

fof(f156,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f147,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC145+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.12/0.39  % Computer : n011.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 28 08:09:26 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  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.74/1.38  % (3240045)Detected formulas, will run a generic FOF schedule.
% 2.74/1.38  % (3240054)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=397724736:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.38  % (3240054)First to succeed.
% 2.74/1.38  % (3240054)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3240045"
% 2.74/1.38  % (3240055)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2069675882:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.38  % (3240056)dis-21_1_sil=8000:lcm=predicate:random_seed=1732056866: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.74/1.38  % (3240053)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=802478421:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.38  % (3240052)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=3442891385:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.38  % (3240051)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=4178145188:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.38  % (3240050)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=1955357275:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.38  % (3240053)Also succeeded, but the first one will report.
% 2.74/1.38  % (3240056)Also succeeded, but the first one will report.
% 2.74/1.38  % (3240055)Also succeeded, but the first one will report.
% 2.74/1.38  % (3240054)Refutation found. Thanks to Tanya!
% 2.74/1.38  % SZS status Theorem for theBenchmark
% 2.74/1.38  % SZS output start Proof for theBenchmark
% See solution above
% 2.74/1.38  % (3240054)------------------------------
% 2.74/1.38  % (3240054)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.38  % (3240054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.38  % (3240054)CaDiCaL version: 2.1.3
% 2.74/1.38  % (3240054)Termination reason: Refutation
% 2.74/1.38  % (3240054)Time elapsed: 0.001 s
% 2.74/1.38  % (3240054)Peak memory usage: 88 MB
% 2.74/1.38  % (3240054)Instructions burned: 1 (million)
% 2.74/1.38  % (3240054)------------------------------
% 2.74/1.38  % (3240054)------------------------------
% 2.74/1.38  % (3240045)Success in time 0.31 s
% 2.74/1.38  % Vampire exiting
%------------------------------------------------------------------------------