↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n013.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:20:28 PM UTC 2026

% Result   : Theorem 0.19s 0.26s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :  400 ( 379 equ)
%            Maximal formula atoms :   78 (  30 avg)
%            Number of connectives :  676 ( 289   ~; 107   |; 276   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   47 (  19 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
              & n1 = X1 )
          & ~ ( n0 = X0
              & n2 = X1 )
          & ~ ( 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
          & n0 = X1
          & n3 = X0 )
       => n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0041) ).

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

fof(f143,plain,
    ? [X0,X1] :
      ( n0 != times(divide(n1,n400),a_select2(sigma,n0))
      & ( n0 != X0
        | n1 != X1 )
      & ( n0 != X0
        | n2 != X1 )
      & ( 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
      & n0 = X1
      & n3 = X0
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X0,n5)
      & leq(X1,n5) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ? [X0,X1] :
      ( n0 != times(divide(n1,n400),a_select2(sigma,n0))
      & ( n0 != X0
        | n1 != X1 )
      & ( n0 != X0
        | n2 != X1 )
      & ( 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
      & n0 = X1
      & n3 = X0
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X0,n5)
      & leq(X1,n5) ),
    inference(flattening,[],[f143]) ).

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

fof(f312,plain,
    n3 = sK31,
    inference(cnf_transformation,[],[f197]) ).

fof(f313,plain,
    n0 = sK32,
    inference(cnf_transformation,[],[f197]) ).

fof(f314,plain,
    n0 = sK31,
    inference(cnf_transformation,[],[f197]) ).

fof(f323,plain,
    ( n3 != sK31
    | n3 != sK32 ),
    inference(cnf_transformation,[],[f197]) ).

fof(f487,plain,
    ( sK31 != sK31
    | sK31 != sK32 ),
    inference(definition_unfolding,[],[f323,f312,f312]) ).

fof(f492,plain,
    sK31 = sK32,
    inference(definition_unfolding,[],[f313,f314]) ).

fof(f527,plain,
    sK31 != sK32,
    inference(trivial_inequality_removal,[],[f487]) ).

fof(f538,plain,
    $false,
    inference(global_subsumption,[],[f527,f492]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV212+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n013.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 10:10:06 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.26  % (1072980)Will run a generic schedule for satisfiability detection.
% 0.19/0.26  % (1072985)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1563372620_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.26  % (1072986)% WARNING: option uhcvi not known.
% 0.19/0.26  % (1072988)dis+10_1_sil=32000:sp=arity:random_seed=1811277190:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.26  % (1072986)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2160019886:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26  % (1072987)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=528846549:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.26  % (1072989)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4100424957:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.26  % (1072990)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=239918045:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.26  % (1072991)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=328289144:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.26  % (1072987) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1072980-1072987"...
% 0.19/0.26  % (1072990) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1072980-1072990"...
% 0.19/0.26  % (1072988) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1072980-1072988"...
% 0.19/0.26  % (1072986) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1072980-1072986"...
% 0.19/0.26  % (1072987)...printing done.
% 0.19/0.26  % (1072990)...printing done.
% 0.19/0.26  % (1072988)...printing done.
% 0.19/0.26  % (1072989) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1072980-1072989"...
% 0.19/0.26  % (1072987)Refutation found. Thanks to Tanya!
% 0.19/0.26  % SZS status Theorem for theBenchmark
% 0.19/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26  % (1072987)------------------------------
% 0.19/0.26  % (1072987)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26  % (1072987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26  % (1072987)CaDiCaL version: 2.1.3
% 0.19/0.26  % (1072987)Termination reason: Refutation
% 0.19/0.26  % (1072987)Time elapsed: 0.006 s
% 0.19/0.26  % (1072987)Peak memory usage: 11 MB
% 0.19/0.26  % (1072987)Instructions burned: 11 (million)
% 0.19/0.26  % (1072980)Success in time 0.039 s
% 0.19/0.26  % Vampire exiting
%------------------------------------------------------------------------------