↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 3.57s 1.23s
% Output   : Refutation 3.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   71 (  27 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   76 (  24   ~;  23   |;  22   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (  13   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f68,axiom,
    ! [X0] :
      ( ssItem(X0)
     => strictorderedP(cons(X0,nil)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).

fof(f69,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | strictorderedP(X0)
                  | ( ! [X4] :
                        ( ~ ssItem(X4)
                        | cons(X4,nil) != X2
                        | ~ memberP(X3,X4) )
                    & ( nil != X3
                      | nil != X2 ) ) ) ) ) ),
    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
                    | strictorderedP(X0)
                    | ( ! [X4] :
                          ( ~ ssItem(X4)
                          | cons(X4,nil) != X2
                          | ~ memberP(X3,X4) )
                      & ( nil != X3
                        | nil != X2 ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ~ strictorderedP(X0)
                  & ( ? [X4] :
                        ( ssItem(X4)
                        & cons(X4,nil) = X2
                        & memberP(X3,X4) )
                    | ( nil = X3
                      & nil = X2 ) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f111,plain,
    ! [X0] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f147,plain,
    ( ssList(sK3)
    & sK1 = sK3
    & sK0 = sK2
    & ~ strictorderedP(sK0)
    & ( ( ssItem(sK4)
        & sK2 = cons(sK4,nil)
        & memberP(sK3,sK4) )
      | ( nil = sK3
        & nil = sK2 ) )
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f98]) ).

fof(f172,plain,
    ( sK2 = cons(sK4,nil)
    | nil = sK2 ),
    inference(cnf_transformation,[],[f147]) ).

fof(f174,plain,
    ( nil = sK2
    | ssItem(sK4) ),
    inference(cnf_transformation,[],[f147]) ).

fof(f176,plain,
    ~ strictorderedP(sK0),
    inference(cnf_transformation,[],[f147]) ).

fof(f177,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f147]) ).

fof(f208,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[],[f69]) ).

fof(f209,plain,
    ! [X0] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f245,plain,
    ~ strictorderedP(sK2),
    inference(definition_unfolding,[],[f176,f177]) ).

fof(f278,plain,
    ( strictorderedP(sK2)
    | ~ ssItem(sK4)
    | nil = sK2 ),
    inference(superposition,[],[f209,f172]) ).

fof(f279,plain,
    ( strictorderedP(sK2)
    | nil = sK2 ),
    inference(forward_subsumption_resolution,[],[f278,f174]) ).

fof(f281,plain,
    nil = sK2,
    inference(forward_subsumption_resolution,[],[f279,f245]) ).

fof(f288,plain,
    strictorderedP(sK2),
    inference(superposition,[],[f208,f281]) ).

fof(f290,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f288,f245]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC293+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19  % Computer : n001.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 09:01:02 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running first-order theorem proving
% 0.10/0.23  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
% 3.57/1.23  % (229696)Detected formulas, will run a generic FOF schedule.
% 3.57/1.23  % (229802)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=2875890236:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.57/1.23  % (229804)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2460840823:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.57/1.23  % (229803)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=228492323:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.57/1.23  % (229801)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=961077232:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.57/1.23  % (229805)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=563490404:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.57/1.23  % (229799)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=2361283759:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.57/1.23  % (229804)First to succeed.
% 3.57/1.23  % (229804)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-229696"
% 3.57/1.23  % (229803)Also succeeded, but the first one will report.
% 3.57/1.23  % (229805)Also succeeded, but the first one will report.
% 3.57/1.23  % (229806)dis-21_1_sil=8000:lcm=predicate:random_seed=3877621813: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)
% 3.57/1.23  % (229806)Instruction limit reached! 
% 3.57/1.23  % (229806)------------------------------
% 3.57/1.23  % (229806)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.23  % (229806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.23  % (229806)CaDiCaL version: 2.1.3
% 3.57/1.23  % (229806)Termination reason: Instruction limit
% 3.57/1.23  % (229806)Termination phase: Saturation
% 3.57/1.23  % (229806)Time elapsed: 0.071 s
% 3.57/1.23  % (229806)Peak memory usage: 91 MB
% 3.57/1.23  % (229806)Instructions burned: 131 (million)
% 3.57/1.23  % (229804)Refutation found. Thanks to Tanya!
% 3.57/1.23  % SZS status Theorem for theBenchmark
% 3.57/1.23  % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.23  % (229804)------------------------------
% 3.57/1.23  % (229804)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.23  % (229804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.23  % (229804)CaDiCaL version: 2.1.3
% 3.57/1.23  % (229804)Termination reason: Refutation
% 3.57/1.23  % (229804)Time elapsed: 0.004 s
% 3.57/1.23  % (229804)Peak memory usage: 88 MB
% 3.57/1.23  % (229804)Instructions burned: 4 (million)
% 3.57/1.23  % (229804)------------------------------
% 3.57/1.23  % (229804)------------------------------
% 3.57/1.23  % (229696)Success in time 0.441 s
% 3.57/1.23  % Vampire exiting
%------------------------------------------------------------------------------