↑ 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  : SWV211+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 : n026.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.28s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :  322 ( 305 equ)
%            Maximal formula atoms :   78 (  26 avg)
%            Number of connectives :  528 ( 218   ~;  72   |; 234   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   47 (  16 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
          & n1 = X0 )
       => n0 = times(divide(n1,n400),a_select2(sigma,n0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0001) ).

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
            & n1 = 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
      & n1 = 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
      & n1 = X0
      & leq(n0,X0)
      & leq(n0,X1)
      & leq(X0,n5)
      & leq(X1,n5) ),
    inference(flattening,[],[f143]) ).

fof(f315,plain,
    ( n1 != sK32
    | n0 != sK31 ),
    inference(cnf_transformation,[],[f144]) ).

fof(f354,plain,
    n1 = sK31,
    inference(cnf_transformation,[],[f144]) ).

fof(f355,plain,
    n0 = sK32,
    inference(cnf_transformation,[],[f144]) ).

fof(f356,plain,
    n0 = sK31,
    inference(cnf_transformation,[],[f144]) ).

fof(f512,plain,
    sK31 = sK32,
    inference(definition_unfolding,[],[f355,f356]) ).

fof(f533,plain,
    ( sK31 != sK32
    | sK31 != sK31 ),
    inference(definition_unfolding,[],[f315,f354,f356]) ).

fof(f566,plain,
    sK31 != sK32,
    inference(trivial_inequality_removal,[],[f533]) ).

fof(f579,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f512,f566]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV211+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  % Computer : n026.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Mon Sep 28 10:13:07 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/0.23  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.28  % (3749389)Will run a generic schedule for satisfiability detection.
% 0.19/0.28  % (3749398)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1100141513:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28  % (3749395)% WARNING: option uhcvi not known.
% 0.19/0.28  % (3749398) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3749389-3749398"...
% 0.19/0.28  % (3749398)...printing done.
% 0.19/0.28  % (3749394)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4128526848_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28  % (3749399)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2881367315:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28  % (3749395)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1638472915:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28  % (3749396)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=242669558:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28  % (3749398)Refutation found. Thanks to Tanya!
% 0.19/0.28  % SZS status Theorem for theBenchmark
% 0.19/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28  % (3749398)------------------------------
% 0.19/0.28  % (3749398)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28  % (3749398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28  % (3749398)CaDiCaL version: 2.1.3
% 0.19/0.28  % (3749398)Termination reason: Refutation
% 0.19/0.28  % (3749398)Time elapsed: 0.005 s
% 0.19/0.28  % (3749398)Peak memory usage: 12 MB
% 0.19/0.28  % (3749398)Instructions burned: 17 (million)
% 0.19/0.28  % (3749389)Success in time 0.039 s
% 0.19/0.28  % Vampire exiting
%------------------------------------------------------------------------------