↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV215+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n012.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:08:24 PM UTC 2026

% Result   : Theorem 2.07s 0.68s
% Output   : Refutation 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :  382 ( 361 equ)
%            Maximal formula atoms :   75 (  38 avg)
%            Number of connectives :  644 ( 272   ~; 101   |; 267   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   46 (  23 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :    8 (   4   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ! [X0,X1] :
      ( ( leq(n0,X0)
        & leq(n0,X1)
        & leq(X0,n5)
        & leq(X1,n5) )
     => ( ( ~ ( n0 = X0
              & n3 = X1 )
          & ~ ( n0 = X0
              & n4 = X1 )
          & ~ ( n0 = X0
              & n5 = X1 )
          & ~ ( n0 = X1
              & n1 = X0 )
          & ~ ( n0 = X1
              & n2 = X0 )
          & ~ ( n0 = X1
              & n3 = X0 )
          & ~ ( n0 = X1
              & n4 = X0 )
          & ~ ( n0 = X1
              & n5 = X0 )
          & ~ ( n1 = X0
              & n1 = X1 )
          & ~ ( n1 = X0
              & n2 = X1 )
          & ~ ( n1 = X0
              & n3 = X1 )
          & ~ ( n1 = X0
              & n4 = X1 )
          & ~ ( n1 = X0
              & n5 = X1 )
          & ~ ( n1 = X1
              & n2 = X0 )
          & ~ ( n1 = X1
              & n3 = X0 )
          & ~ ( n1 = X1
              & n4 = X0 )
          & ~ ( n1 = X1
              & n5 = X0 )
          & ~ ( n2 = X0
              & n2 = X1 )
          & ~ ( n2 = X0
              & n3 = X1 )
          & ~ ( n2 = X0
              & n4 = X1 )
          & ~ ( n2 = X0
              & n5 = X1 )
          & ~ ( n2 = X1
              & n3 = X0 )
          & ~ ( n2 = X1
              & n4 = X0 )
          & ~ ( n2 = X1
              & n5 = X0 )
          & ~ ( n3 = X0
              & n3 = X1 )
          & ~ ( n3 = X0
              & n4 = X1 )
          & ~ ( n3 = X0
              & n5 = X1 )
          & ~ ( n3 = X1
              & n4 = X0 )
          & ~ ( n3 = X1
              & n5 = X0 )
          & ~ ( n4 = X0
              & n4 = X1 )
          & ~ ( n4 = X0
              & n5 = X1 )
          & ~ ( n4 = X1
              & n5 = X0 )
          & ~ ( n5 = X0
              & n5 = X1 )
          & n0 = X0
          & n2 = X0
          & n2 = X1
          & n4 = X1 )
       => n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0161) ).

fof(f54,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( leq(n0,X0)
          & leq(n0,X1)
          & leq(X0,n5)
          & leq(X1,n5) )
       => ( ( ~ ( n0 = X0
                & n3 = X1 )
            & ~ ( n0 = X0
                & n4 = X1 )
            & ~ ( n0 = X0
                & n5 = X1 )
            & ~ ( n0 = X1
                & n1 = X0 )
            & ~ ( n0 = X1
                & n2 = X0 )
            & ~ ( n0 = X1
                & n3 = X0 )
            & ~ ( n0 = X1
                & n4 = X0 )
            & ~ ( n0 = X1
                & n5 = X0 )
            & ~ ( n1 = X0
                & n1 = X1 )
            & ~ ( n1 = X0
                & n2 = X1 )
            & ~ ( n1 = X0
                & n3 = X1 )
            & ~ ( n1 = X0
                & n4 = X1 )
            & ~ ( n1 = X0
                & n5 = X1 )
            & ~ ( n1 = X1
                & n2 = X0 )
            & ~ ( n1 = X1
                & n3 = X0 )
            & ~ ( n1 = X1
                & n4 = X0 )
            & ~ ( n1 = X1
                & n5 = X0 )
            & ~ ( n2 = X0
                & n2 = X1 )
            & ~ ( n2 = X0
                & n3 = X1 )
            & ~ ( n2 = X0
                & n4 = X1 )
            & ~ ( n2 = X0
                & n5 = X1 )
            & ~ ( n2 = X1
                & n3 = X0 )
            & ~ ( n2 = X1
                & n4 = X0 )
            & ~ ( n2 = X1
                & n5 = X0 )
            & ~ ( n3 = X0
                & n3 = X1 )
            & ~ ( n3 = X0
                & n4 = X1 )
            & ~ ( n3 = X0
                & n5 = X1 )
            & ~ ( n3 = X1
                & n4 = X0 )
            & ~ ( n3 = X1
                & n5 = X0 )
            & ~ ( n4 = X0
                & n4 = X1 )
            & ~ ( n4 = X0
                & n5 = X1 )
            & ~ ( n4 = X1
                & n5 = X0 )
            & ~ ( n5 = X0
                & n5 = X1 )
            & n0 = X0
            & n2 = X0
            & n2 = X1
            & n4 = X1 )
         => n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f94,plain,
    ? [X0,X1] :
      ( n0 != times(divide(n1,n400),a_select2(sigma,n2))
      & ( n0 != X0
        | n3 != X1 )
      & ( n0 != X0
        | n4 != X1 )
      & ( n0 != X0
        | n5 != X1 )
      & ( n0 != X1
        | n1 != X0 )
      & ( n0 != X1
        | n2 != X0 )
      & ( n0 != X1
        | n3 != X0 )
      & ( n0 != X1
        | n4 != X0 )
      & ( n0 != X1
        | n5 != X0 )
      & ( n1 != X0
        | n1 != X1 )
      & ( n1 != X0
        | n2 != X1 )
      & ( n1 != X0
        | n3 != X1 )
      & ( n1 != X0
        | n4 != X1 )
      & ( n1 != X0
        | n5 != X1 )
      & ( n1 != X1
        | n2 != X0 )
      & ( n1 != X1
        | n3 != X0 )
      & ( n1 != X1
        | n4 != X0 )
      & ( n1 != X1
        | n5 != X0 )
      & ( n2 != X0
        | n2 != X1 )
      & ( n2 != X0
        | n3 != X1 )
      & ( n2 != X0
        | n4 != X1 )
      & ( n2 != X0
        | n5 != X1 )
      & ( n2 != X1
        | n3 != X0 )
      & ( n2 != X1
        | n4 != X0 )
      & ( n2 != X1
        | n5 != X0 )
      & ( n3 != X0
        | n3 != X1 )
      & ( n3 != X0
        | n4 != X1 )
      & ( n3 != X0
        | n5 != X1 )
      & ( n3 != X1
        | n4 != X0 )
      & ( n3 != X1
        | n5 != X0 )
      & ( n4 != X0
        | n4 != X1 )
      & ( n4 != X0
        | n5 != X1 )
      & ( n4 != X1
        | n5 != X0 )
      & ( n5 != X0
        | n5 != X1 )
      & n0 = X0
      & n2 = X0
      & n2 = X1
      & n4 = X1
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X0,n5)
      & leq(X1,n5) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f95,plain,
    ? [X0,X1] :
      ( n0 != times(divide(n1,n400),a_select2(sigma,n2))
      & ( n0 != X0
        | n3 != X1 )
      & ( n0 != X0
        | n4 != X1 )
      & ( n0 != X0
        | n5 != X1 )
      & ( n0 != X1
        | n1 != X0 )
      & ( n0 != X1
        | n2 != X0 )
      & ( n0 != X1
        | n3 != X0 )
      & ( n0 != X1
        | n4 != X0 )
      & ( n0 != X1
        | n5 != X0 )
      & ( n1 != X0
        | n1 != X1 )
      & ( n1 != X0
        | n2 != X1 )
      & ( n1 != X0
        | n3 != X1 )
      & ( n1 != X0
        | n4 != X1 )
      & ( n1 != X0
        | n5 != X1 )
      & ( n1 != X1
        | n2 != X0 )
      & ( n1 != X1
        | n3 != X0 )
      & ( n1 != X1
        | n4 != X0 )
      & ( n1 != X1
        | n5 != X0 )
      & ( n2 != X0
        | n2 != X1 )
      & ( n2 != X0
        | n3 != X1 )
      & ( n2 != X0
        | n4 != X1 )
      & ( n2 != X0
        | n5 != X1 )
      & ( n2 != X1
        | n3 != X0 )
      & ( n2 != X1
        | n4 != X0 )
      & ( n2 != X1
        | n5 != X0 )
      & ( n3 != X0
        | n3 != X1 )
      & ( n3 != X0
        | n4 != X1 )
      & ( n3 != X0
        | n5 != X1 )
      & ( n3 != X1
        | n4 != X0 )
      & ( n3 != X1
        | n5 != X0 )
      & ( n4 != X0
        | n4 != X1 )
      & ( n4 != X0
        | n5 != X1 )
      & ( n4 != X1
        | n5 != X0 )
      & ( n5 != X0
        | n5 != X1 )
      & n0 = X0
      & n2 = X0
      & n2 = X1
      & n4 = X1
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X0,n5)
      & leq(X1,n5) ),
    inference(flattening,[],[f94]) ).

fof(f117,plain,
    ( n0 != times(divide(n1,n400),a_select2(sigma,n2))
    & ( n0 != sK0
      | n3 != sK1 )
    & ( n0 != sK0
      | n4 != sK1 )
    & ( n0 != sK0
      | n5 != sK1 )
    & ( n0 != sK1
      | n1 != sK0 )
    & ( n0 != sK1
      | n2 != sK0 )
    & ( n0 != sK1
      | n3 != sK0 )
    & ( n0 != sK1
      | n4 != sK0 )
    & ( n0 != sK1
      | n5 != sK0 )
    & ( n1 != sK0
      | n1 != sK1 )
    & ( n1 != sK0
      | n2 != sK1 )
    & ( n1 != sK0
      | n3 != sK1 )
    & ( n1 != sK0
      | n4 != sK1 )
    & ( n1 != sK0
      | n5 != sK1 )
    & ( n1 != sK1
      | n2 != sK0 )
    & ( n1 != sK1
      | n3 != sK0 )
    & ( n1 != sK1
      | n4 != sK0 )
    & ( n1 != sK1
      | n5 != sK0 )
    & ( n2 != sK0
      | n2 != sK1 )
    & ( n2 != sK0
      | n3 != sK1 )
    & ( n2 != sK0
      | n4 != sK1 )
    & ( n2 != sK0
      | n5 != sK1 )
    & ( n2 != sK1
      | n3 != sK0 )
    & ( n2 != sK1
      | n4 != sK0 )
    & ( n2 != sK1
      | n5 != sK0 )
    & ( n3 != sK0
      | n3 != sK1 )
    & ( n3 != sK0
      | n4 != sK1 )
    & ( n3 != sK0
      | n5 != sK1 )
    & ( n3 != sK1
      | n4 != sK0 )
    & ( n3 != sK1
      | n5 != sK0 )
    & ( n4 != sK0
      | n4 != sK1 )
    & ( n4 != sK0
      | n5 != sK1 )
    & ( n4 != sK1
      | n5 != sK0 )
    & ( n5 != sK0
      | n5 != sK1 )
    & n0 = sK0
    & n2 = sK0
    & n2 = sK1
    & n4 = sK1
    & leq(n0,sK0)
    & leq(n0,sK1)
    & leq(sK0,n5)
    & leq(sK1,n5) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f95]) ).

fof(f124,plain,
    n4 = sK1,
    inference(cnf_transformation,[],[f117]) ).

fof(f126,plain,
    n2 = sK0,
    inference(cnf_transformation,[],[f117]) ).

fof(f141,plain,
    ( n2 != sK0
    | n4 != sK1 ),
    inference(cnf_transformation,[],[f117]) ).

fof(f231,plain,
    ( sK0 != sK0
    | sK1 != sK1 ),
    inference(definition_unfolding,[],[f141,f126,f124]) ).

fof(f283,plain,
    $false,
    inference(trivial_inequality_removal,[],[f231]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWV215+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.10  % Computer : n012.cluster.edu
% 0.00/0.10  % Model    : x86_64 x86_64
% 0.00/0.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10  % Memory   : 8046.5625MB
% 0.00/0.10  % OS       : Linux 6.8.0-71-generic
% 0.00/0.10  % CPULimit : 300
% 0.00/0.10  % WCLimit  : 300
% 0.00/0.10  % DateTime : Mon Sep 28 10:12:34 UTC 2026
% 0.00/0.10  % CPUTime  : 
% 0.00/0.10  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.12  Running first-order theorem proving
% 0.08/0.12  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.07/0.68  % (3280538)Detected formulas, will run a generic FOF schedule.
% 2.07/0.68  % (3280548)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=482330216:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.07/0.68  % (3280545)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=2237971241:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.07/0.68  % (3280544)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=3265288778:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.07/0.68  % (3280546)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1222747695:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.07/0.68  % (3280547)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2497864079:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.07/0.68  % (3280549)dis-21_1_sil=8000:lcm=predicate:random_seed=3956291024: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.07/0.68  % (3280543)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=1311943686:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.07/0.68  % (3280547)First to succeed.
% 2.07/0.68  % (3280547)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3280538"
% 2.07/0.68  % (3280546)Also succeeded, but the first one will report.
% 2.07/0.68  % (3280549)Also succeeded, but the first one will report.
% 2.07/0.68  % (3280548)Also succeeded, but the first one will report.
% 2.07/0.68  % (3280547)Refutation found. Thanks to Tanya!
% 2.07/0.68  % SZS status Theorem for theBenchmark
% 2.07/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 2.07/0.68  % (3280547)------------------------------
% 2.07/0.68  % (3280547)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.68  % (3280547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.68  % (3280547)CaDiCaL version: 2.1.3
% 2.07/0.68  % (3280547)Termination reason: Refutation
% 2.07/0.68  % (3280547)Time elapsed: 0.002 s
% 2.07/0.68  % (3280547)Peak memory usage: 88 MB
% 2.07/0.68  % (3280547)Instructions burned: 4 (million)
% 2.07/0.68  % (3280547)------------------------------
% 2.07/0.68  % (3280547)------------------------------
% 2.07/0.68  % (3280538)Success in time 0.27 s
% 2.07/0.68  % Vampire exiting
%------------------------------------------------------------------------------