↑ 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  : SWV066+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:07 PM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  14 unt;   4 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   74 (  25   ~;  23   |;  20   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( leq(n0,pv10)
      & leq(n0,pv53)
      & leq(pv10,minus(n135300,n1))
      & leq(pv53,minus(n5,n1)) )
   => ( leq(n0,pv10)
      & leq(n0,pv53)
      & leq(pv10,minus(n135300,n1))
      & leq(pv53,minus(n5,n1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0007) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(n0,pv53)
        & leq(pv10,minus(n135300,n1))
        & leq(pv53,minus(n5,n1)) )
     => ( leq(n0,pv10)
        & leq(n0,pv53)
        & leq(pv10,minus(n135300,n1))
        & leq(pv53,minus(n5,n1)) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f143,plain,
    ( ( ~ leq(n0,pv10)
      | ~ leq(n0,pv53)
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(pv53,minus(n5,n1)) )
    & leq(n0,pv10)
    & leq(n0,pv53)
    & leq(pv10,minus(n135300,n1))
    & leq(pv53,minus(n5,n1)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ( ( ~ leq(n0,pv10)
      | ~ leq(n0,pv53)
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(pv53,minus(n5,n1)) )
    & leq(n0,pv10)
    & leq(n0,pv53)
    & leq(pv10,minus(n135300,n1))
    & leq(pv53,minus(n5,n1)) ),
    inference(flattening,[],[f143]) ).

fof(f307,plain,
    leq(pv53,minus(n5,n1)),
    inference(cnf_transformation,[],[f144]) ).

fof(f308,plain,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[],[f144]) ).

fof(f309,plain,
    leq(n0,pv53),
    inference(cnf_transformation,[],[f144]) ).

fof(f310,plain,
    leq(n0,pv10),
    inference(cnf_transformation,[],[f144]) ).

fof(f311,plain,
    ( ~ leq(n0,pv10)
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(cnf_transformation,[],[f144]) ).

fof(f435,definition,
    ( spl31_1
  <=> leq(pv53,minus(n5,n1)) ),
    introduced(definition,[new_symbols(definition,[spl31_1])],[avatar_definition]) ).

fof(f437,plain,
    ( ~ leq(pv53,minus(n5,n1))
    | spl31_1 ),
    inference(avatar_component_clause,[],[f435]) ).

fof(f439,definition,
    ( spl31_2
  <=> leq(pv10,minus(n135300,n1)) ),
    introduced(definition,[new_symbols(definition,[spl31_2])],[avatar_definition]) ).

fof(f441,plain,
    ( ~ leq(pv10,minus(n135300,n1))
    | spl31_2 ),
    inference(avatar_component_clause,[],[f439]) ).

fof(f443,definition,
    ( spl31_3
  <=> leq(n0,pv53) ),
    introduced(definition,[new_symbols(definition,[spl31_3])],[avatar_definition]) ).

fof(f445,plain,
    ( ~ leq(n0,pv53)
    | spl31_3 ),
    inference(avatar_component_clause,[],[f443]) ).

fof(f447,definition,
    ( spl31_4
  <=> leq(n0,pv10) ),
    introduced(definition,[new_symbols(definition,[spl31_4])],[avatar_definition]) ).

fof(f449,plain,
    ( ~ leq(n0,pv10)
    | spl31_4 ),
    inference(avatar_component_clause,[],[f447]) ).

fof(f450,plain,
    ( ~ spl31_1
    | ~ spl31_2
    | ~ spl31_3
    | ~ spl31_4 ),
    inference(avatar_split_clause,[],[f311,f447,f443,f439,f435]) ).

fof(f451,plain,
    ( $false
    | spl31_3 ),
    inference(resolution,[],[f445,f309]) ).

fof(f452,plain,
    spl31_3,
    inference(avatar_contradiction_clause,[],[f451]) ).

fof(f453,plain,
    ( $false
    | spl31_4 ),
    inference(resolution,[],[f449,f310]) ).

fof(f454,plain,
    spl31_4,
    inference(avatar_contradiction_clause,[],[f453]) ).

fof(f455,plain,
    ( $false
    | spl31_1 ),
    inference(resolution,[],[f437,f307]) ).

fof(f456,plain,
    spl31_1,
    inference(avatar_contradiction_clause,[],[f455]) ).

fof(f457,plain,
    ( $false
    | spl31_2 ),
    inference(resolution,[],[f441,f308]) ).

fof(f458,plain,
    spl31_2,
    inference(avatar_contradiction_clause,[],[f457]) ).

cnf(s1,plain,
    ( ~ spl31_1
    | ~ spl31_2
    | ~ spl31_3
    | ~ spl31_4 ),
    inference(sat_conversion,[],[f450]) ).

cnf(s2,plain,
    spl31_3,
    inference(sat_conversion,[],[f452]) ).

cnf(s3,plain,
    spl31_4,
    inference(sat_conversion,[],[f454]) ).

cnf(s4,plain,
    spl31_1,
    inference(sat_conversion,[],[f456]) ).

cnf(s5,plain,
    spl31_2,
    inference(sat_conversion,[],[f458]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s1,s3,s2,s5,s4]) ).

fof(f459,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV066+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.17  % Computer : n002.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 09:51:22 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/0.21  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.25  % (242087)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (242098)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1358572048:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.25  % (242093)% WARNING: option uhcvi not known.
% 0.09/0.25  % (242098) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-242087-242098"...
% 0.09/0.25  % (242098)...printing done.
% 0.09/0.25  % (242098)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  % (242098)------------------------------
% 0.09/0.25  % (242098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (242098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (242098)CaDiCaL version: 2.1.3
% 0.09/0.25  % (242098)Termination reason: Refutation
% 0.09/0.25  % (242098)Time elapsed: 0.005 s
% 0.09/0.25  % (242098)Peak memory usage: 12 MB
% 0.09/0.25  % (242098)Instructions burned: 14 (million)
% 0.09/0.25  % (242087)Success in time 0.031 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------