↑ 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  : SWV232+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 : n002.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:31 PM UTC 2026

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :  119 (  86 equ)
%            Maximal formula atoms :   28 (  13 avg)
%            Number of connectives :  167 (  57   ~;  24   |;  78   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (  10 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-3 aty)
%            Number of variables   :   16 (  12   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ! [X0,X1] :
        ( ( leq(n0,X0)
          & leq(n0,X1)
          & leq(X0,n5)
          & leq(X1,n5) )
       => a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
   => ! [X2,X3] :
        ( ( leq(n0,X2)
          & leq(n0,X3)
          & leq(X2,n2)
          & leq(X3,n2) )
       => ( ( ~ ( n0 = X2
                & n1 = X3 )
            & ~ ( n0 = X2
                & n2 = X3 )
            & ~ ( n0 = X3
                & n2 = X2 )
            & ~ ( n1 = X2
                & n1 = X3 )
            & ~ ( n1 = X2
                & n2 = X3 )
            & ~ ( n1 = X3
                & n2 = X2 )
            & ~ ( n2 = X2
                & n2 = X3 )
            & n0 = X3
            & n1 = X2
            & n1 = X3
            & n2 = X2 )
         => a_select2(rho,n1) = n0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0841) ).

fof(f54,negated_conjecture,
    ~ ( ! [X0,X1] :
          ( ( leq(n0,X0)
            & leq(n0,X1)
            & leq(X0,n5)
            & leq(X1,n5) )
         => a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
     => ! [X2,X3] :
          ( ( leq(n0,X2)
            & leq(n0,X3)
            & leq(X2,n2)
            & leq(X3,n2) )
         => ( ( ~ ( n0 = X2
                  & n1 = X3 )
              & ~ ( n0 = X2
                  & n2 = X3 )
              & ~ ( n0 = X3
                  & n2 = X2 )
              & ~ ( n1 = X2
                  & n1 = X3 )
              & ~ ( n1 = X2
                  & n2 = X3 )
              & ~ ( n1 = X3
                  & n2 = X2 )
              & ~ ( n2 = X2
                  & n2 = X3 )
              & n0 = X3
              & n1 = X2
              & n1 = X3
              & n2 = X2 )
           => a_select2(rho,n1) = n0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f136,plain,
    ( ? [X2,X3] :
        ( n0 != a_select2(rho,n1)
        & ( n0 != X2
          | n1 != X3 )
        & ( n0 != X2
          | n2 != X3 )
        & ( n0 != X3
          | n2 != X2 )
        & ( n1 != X2
          | n1 != X3 )
        & ( n1 != X2
          | n2 != X3 )
        & ( n1 != X3
          | n2 != X2 )
        & ( n2 != X2
          | n2 != X3 )
        & n0 = X3
        & n1 = X2
        & n1 = X3
        & n2 = X2
        & leq(n0,X2)
        & leq(n0,X3)
        & leq(X2,n2)
        & leq(X3,n2) )
    & ! [X0,X1] :
        ( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
        | ~ leq(n0,X0)
        | ~ leq(n0,X1)
        | ~ leq(X0,n5)
        | ~ leq(X1,n5) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f137,plain,
    ( ? [X2,X3] :
        ( n0 != a_select2(rho,n1)
        & ( n0 != X2
          | n1 != X3 )
        & ( n0 != X2
          | n2 != X3 )
        & ( n0 != X3
          | n2 != X2 )
        & ( n1 != X2
          | n1 != X3 )
        & ( n1 != X2
          | n2 != X3 )
        & ( n1 != X3
          | n2 != X2 )
        & ( n2 != X2
          | n2 != X3 )
        & n0 = X3
        & n1 = X2
        & n1 = X3
        & n2 = X2
        & leq(n0,X2)
        & leq(n0,X3)
        & leq(X2,n2)
        & leq(X3,n2) )
    & ! [X0,X1] :
        ( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
        | ~ leq(n0,X0)
        | ~ leq(n0,X1)
        | ~ leq(X0,n5)
        | ~ leq(X1,n5) ) ),
    inference(flattening,[],[f136]) ).

fof(f310,plain,
    ( n2 != sK31
    | n0 != sK32 ),
    inference(cnf_transformation,[],[f137]) ).

fof(f319,plain,
    n2 = sK31,
    inference(cnf_transformation,[],[f137]) ).

fof(f322,plain,
    n0 = sK32,
    inference(cnf_transformation,[],[f137]) ).

fof(f482,plain,
    ( sK31 != sK31
    | sK32 != sK32 ),
    inference(definition_unfolding,[],[f310,f319,f322]) ).

fof(f661,plain,
    $false,
    inference(trivial_inequality_removal,[],[f482]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV232+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.09/0.19  % Computer : n002.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 10:16:52 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.09/0.26  % (252677)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (252683)% WARNING: option uhcvi not known.
% 0.09/0.26  % (252683)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2174721399:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26  % (252683) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-252677-252683"...
% 0.09/0.26  % (252683)...printing done.
% 0.09/0.26  % (252683)Refutation found. Thanks to Tanya!
% 0.09/0.26  % SZS status Theorem for theBenchmark
% 0.09/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26  % (252683)------------------------------
% 0.09/0.26  % (252683)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (252683)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (252683)CaDiCaL version: 2.1.3
% 0.09/0.26  % (252683)Termination reason: Refutation
% 0.09/0.26  % (252683)Time elapsed: 0.003 s
% 0.09/0.26  % (252683)Peak memory usage: 12 MB
% 0.09/0.26  % (252683)Instructions burned: 10 (million)
% 0.09/0.26  % (252677)Success in time 0.031 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------