↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.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 11:54:27 AM UTC 2026

% Result   : Theorem 3.51s 1.45s
% Output   : Refutation 3.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :  159 (   0 equ)
%            Maximal formula atoms :   16 (   9 avg)
%            Number of connectives :  269 ( 127   ~; 124   |;  18   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (  10 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   95 (  76   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,conjecture,
    ~ ? [X0] :
        ~ ( ~ ! [X1] :
                ( ~ r1(X0,X1)
                | p16(X1) )
          | ~ ! [X1] :
                ( ~ r1(X0,X1)
                | p12(X1) )
          | ~ ! [X1] :
                ( ~ r1(X0,X1)
                | p14(X1) )
          | ~ ! [X1] :
                ( ~ r1(X0,X1)
                | p12(X1) )
          | ! [X1] :
              ( ~ r1(X0,X1)
              | p15(X1) )
          | ! [X1] :
              ( ~ r1(X0,X1)
              | p13(X1) )
          | ! [X1] :
              ( ~ r1(X0,X1)
              | p12(X1) )
          | ! [X1] :
              ( ~ r1(X0,X1)
              | p11(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(f3,negated_conjecture,
    ~ ~ ? [X0] :
          ~ ( ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | p16(X1) )
            | ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | p12(X1) )
            | ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | p14(X1) )
            | ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | p12(X1) )
            | ! [X1] :
                ( ~ r1(X0,X1)
                | p15(X1) )
            | ! [X1] :
                ( ~ r1(X0,X1)
                | p13(X1) )
            | ! [X1] :
                ( ~ r1(X0,X1)
                | p12(X1) )
            | ! [X1] :
                ( ~ r1(X0,X1)
                | p11(X1) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f4,plain,
    ~ ~ ? [X0] :
          ~ ( ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | p16(X1) )
            | ~ ! [X2] :
                  ( ~ r1(X0,X2)
                  | p12(X2) )
            | ~ ! [X3] :
                  ( ~ r1(X0,X3)
                  | p14(X3) )
            | ~ ! [X4] :
                  ( ~ r1(X0,X4)
                  | p12(X4) )
            | ! [X5] :
                ( ~ r1(X0,X5)
                | p15(X5) )
            | ! [X6] :
                ( ~ r1(X0,X6)
                | p13(X6) )
            | ! [X7] :
                ( ~ r1(X0,X7)
                | p12(X7) )
            | ! [X8] :
                ( ~ r1(X0,X8)
                | p11(X8) ) ),
    inference(rectify,[],[f3]) ).

fof(f5,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | p16(X1) )
        | ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X3] :
              ( ~ r1(X0,X3)
              | p14(X3) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] :
            ( ~ r1(X0,X5)
            | p15(X5) )
        | ! [X6] :
            ( ~ r1(X0,X6)
            | p13(X6) )
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] :
            ( ~ r1(X0,X8)
            | p11(X8) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | p16(X1) )
        | ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X3] :
              ( ~ r1(X0,X3)
              | p14(X3) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] :
            ( ~ r1(X0,X5)
            | p15(X5) )
        | ! [X6] :
            ( ~ r1(X0,X6)
            | p13(X6) )
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] : ~ r1(X0,X8) ),
    inference(pure_predicate_removal,[],[f5]) ).

fof(f7,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | p16(X1) )
        | ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X3] :
              ( ~ r1(X0,X3)
              | p14(X3) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] :
            ( ~ r1(X0,X5)
            | p15(X5) )
        | ! [X6] : ~ r1(X0,X6)
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] : ~ r1(X0,X8) ),
    inference(pure_predicate_removal,[],[f6]) ).

fof(f8,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | p16(X1) )
        | ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X3] :
              ( ~ r1(X0,X3)
              | p14(X3) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] : ~ r1(X0,X5)
        | ! [X6] : ~ r1(X0,X6)
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] : ~ r1(X0,X8) ),
    inference(pure_predicate_removal,[],[f7]) ).

fof(f9,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | p16(X1) )
        | ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] : ~ r1(X0,X5)
        | ! [X6] : ~ r1(X0,X6)
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] : ~ r1(X0,X8) ),
    inference(pure_predicate_removal,[],[f8]) ).

fof(f10,plain,
    ? [X0] :
      ~ ( ~ ! [X2] :
              ( ~ r1(X0,X2)
              | p12(X2) )
        | ~ ! [X4] :
              ( ~ r1(X0,X4)
              | p12(X4) )
        | ! [X5] : ~ r1(X0,X5)
        | ! [X6] : ~ r1(X0,X6)
        | ! [X7] :
            ( ~ r1(X0,X7)
            | p12(X7) )
        | ! [X8] : ~ r1(X0,X8) ),
    inference(pure_predicate_removal,[],[f9]) ).

fof(f11,plain,
    ? [X0] :
      ( ! [X2] :
          ( ~ r1(X0,X2)
          | p12(X2) )
      & ! [X4] :
          ( ~ r1(X0,X4)
          | p12(X4) )
      & ? [X5] : r1(X0,X5)
      & ? [X6] : r1(X0,X6)
      & ? [X7] :
          ( r1(X0,X7)
          & ~ p12(X7) )
      & ? [X8] : r1(X0,X8) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f12,plain,
    ? [X0] :
      ( ! [X1] :
          ( ~ r1(X0,X1)
          | p12(X1) )
      & ! [X2] :
          ( ~ r1(X0,X2)
          | p12(X2) )
      & ? [X3] : r1(X0,X3)
      & ? [X4] : r1(X0,X4)
      & ? [X5] :
          ( r1(X0,X5)
          & ~ p12(X5) )
      & ? [X6] : r1(X0,X6) ),
    inference(rectify,[],[f11]) ).

fof(f13,plain,
    ( ! [X1] :
        ( ~ r1(sK0,X1)
        | p12(X1) )
    & ! [X2] :
        ( ~ r1(sK0,X2)
        | p12(X2) )
    & r1(sK0,sK1)
    & r1(sK0,sK2)
    & r1(sK0,sK3)
    & ~ p12(sK3)
    & r1(sK0,sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X3,sK1),skolemize(X4,sK2),skolemize(X5,sK3),skolemize(X6,sK4)],[f12]) ).

fof(f15,plain,
    ~ p12(sK3),
    inference(cnf_transformation,[],[f13]) ).

fof(f16,plain,
    r1(sK0,sK3),
    inference(cnf_transformation,[],[f13]) ).

fof(f19,plain,
    ! [X2] :
      ( ~ r1(sK0,X2)
      | p12(X2) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f24,plain,
    p12(sK3),
    inference(resolution,[],[f19,f16]) ).

fof(f26,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f24,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n020.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 16:26:05 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 3.51/1.45  % (3582110)Detected formulas, will run a generic FOF schedule.
% 3.51/1.45  % (3582115)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=1730302713:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.51/1.45  % (3582116)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=34235312:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.51/1.45  % (3582120)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1905389267:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.51/1.45  % (3582117)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=17962368:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.51/1.45  % (3582118)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1135287942:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.51/1.45  % (3582119)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=36193119:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.51/1.45  % (3582119)First to succeed.
% 3.51/1.45  % (3582118)Also succeeded, but the first one will report.
% 3.51/1.45  % (3582120)Also succeeded, but the first one will report.
% 3.51/1.45  % (3582119)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3582110"
% 3.51/1.45  % (3582121)dis-21_1_sil=8000:lcm=predicate:random_seed=4158150129: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.51/1.45  % (3582121)Also succeeded, but the first one will report.
% 3.51/1.45  % (3582119)Refutation found. Thanks to Tanya!
% 3.51/1.45  % SZS status Theorem for theBenchmark
% 3.51/1.45  % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.45  % (3582119)------------------------------
% 3.51/1.45  % (3582119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.45  % (3582119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.45  % (3582119)CaDiCaL version: 2.1.3
% 3.51/1.45  % (3582119)Termination reason: Refutation
% 3.51/1.45  % (3582119)Time elapsed: 0.002 s
% 3.51/1.45  % (3582119)Peak memory usage: 88 MB
% 3.51/1.45  % (3582119)Instructions burned: 1 (million)
% 3.51/1.45  % (3582119)------------------------------
% 3.51/1.45  % (3582119)------------------------------
% 3.51/1.45  % (3582110)Success in time 0.413 s
% 3.51/1.45  % Vampire exiting
%------------------------------------------------------------------------------