↑ 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  : SWV132+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 : n015.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:18 PM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  10 unt;   2 def)
%            Number of atoms       :  126 (   0 equ)
%            Maximal formula atoms :   26 (   6 avg)
%            Number of connectives :  145 (  39   ~;  28   |;  50   &)
%                                         (   2 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( ~ leq(tptp_float_0_001,pv1341)
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_best7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_worst7,n3) ) )
   => leq(s_best7,n3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0002) ).

fof(f54,negated_conjecture,
    ~ ( ( ~ leq(tptp_float_0_001,pv1341)
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_best7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_sworst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_best7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_sworst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_best7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_sworst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_worst7) )
        & ( gt(loopcounter,n0)
         => leq(s_best7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_worst7,n3) ) )
     => leq(s_best7,n3) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f136,plain,
    ( ~ leq(s_best7,n3)
    & ~ leq(tptp_float_0_001,pv1341)
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f137,plain,
    ( ~ leq(s_best7,n3)
    & ~ leq(tptp_float_0_001,pv1341)
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) ) ),
    inference(flattening,[],[f136]) ).

fof(f311,plain,
    ( leq(tptp_float_0_001,pv1341)
    | leq(s_best7,n3) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f320,plain,
    ~ leq(tptp_float_0_001,pv1341),
    inference(cnf_transformation,[],[f137]) ).

fof(f321,plain,
    ~ leq(s_best7,n3),
    inference(cnf_transformation,[],[f137]) ).

fof(f516,plain,
    leq(s_best7,n3),
    inference(consistent_polarity_flipping,[],[f321]) ).

fof(f517,plain,
    leq(tptp_float_0_001,pv1341),
    inference(consistent_polarity_flipping,[],[f320]) ).

fof(f526,plain,
    ( ~ leq(tptp_float_0_001,pv1341)
    | ~ leq(s_best7,n3) ),
    inference(consistent_polarity_flipping,[],[f311]) ).

fof(f541,definition,
    ( spl31_2
  <=> leq(tptp_float_0_001,pv1341) ),
    introduced(definition,[new_symbols(definition,[spl31_2])],[avatar_definition]) ).

fof(f556,definition,
    ( spl31_5
  <=> leq(s_best7,n3) ),
    introduced(definition,[new_symbols(definition,[spl31_5])],[avatar_definition]) ).

fof(f559,plain,
    ( ~ spl31_5
    | ~ spl31_2 ),
    inference(avatar_split_clause,[],[f526,f541,f556]) ).

fof(f580,plain,
    spl31_2,
    inference(avatar_split_clause,[],[f517,f541]) ).

fof(f581,plain,
    spl31_5,
    inference(avatar_split_clause,[],[f516,f556]) ).

cnf(s4,plain,
    ( ~ spl31_2
    | ~ spl31_5 ),
    inference(sat_conversion,[],[f559]) ).

cnf(s13,plain,
    spl31_2,
    inference(sat_conversion,[],[f580]) ).

cnf(s14,plain,
    spl31_5,
    inference(sat_conversion,[],[f581]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s4,s14,s13]) ).

fof(f582,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV132+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 : n015.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:02:47 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/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.09/0.25  % (2517160)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (2517166)% WARNING: option uhcvi not known.
% 0.09/0.25  % (2517166)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2306914505:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25  % (2517166) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2517160-2517166"...
% 0.09/0.25  % (2517166)...printing done.
% 0.09/0.25  % (2517166)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Theorem for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (2517166)------------------------------
% 0.09/0.25  % (2517166)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (2517166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (2517166)CaDiCaL version: 2.1.3
% 0.09/0.25  % (2517166)Termination reason: Refutation
% 0.09/0.25  % (2517166)Time elapsed: 0.004 s
% 0.09/0.25  % (2517166)Peak memory usage: 12 MB
% 0.09/0.25  % (2517166)Instructions burned: 12 (million)
% 0.09/0.25  % (2517160)Success in time 0.028 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------