↑ 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  : SWV077+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 : n014.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:09 PM UTC 2026

% Result   : Theorem 0.24s 0.29s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
%            Number of atoms       :   49 (   8 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   61 (  23   ~;  14   |;  18   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).

fof(f53,conjecture,
    ( ( leq(n0,pv31)
      & leq(pv31,minus(n5,n1)) )
   => ( leq(n0,pv31)
      & leq(pv31,minus(n5,n1))
      & ( n0 != pv40
       => ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( n0 = pv40
       => true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0018) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1)) )
     => ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1))
        & ( n0 != pv40
         => ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( n0 = pv40
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f135,plain,
    ( ( ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1))
      | ( ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) )
        & n0 != pv40 )
      | ( ~ true
        & n0 = pv40 ) )
    & leq(n0,pv31)
    & leq(pv31,minus(n5,n1)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f136,plain,
    ( ( ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1))
      | ( ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) )
        & n0 != pv40 )
      | ( ~ true
        & n0 = pv40 ) )
    & leq(n0,pv31)
    & leq(pv31,minus(n5,n1)) ),
    inference(flattening,[],[f135]) ).

fof(f298,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f300,plain,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[],[f136]) ).

fof(f301,plain,
    leq(n0,pv31),
    inference(cnf_transformation,[],[f136]) ).

fof(f305,plain,
    ( ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ true ),
    inference(cnf_transformation,[],[f136]) ).

fof(f368,plain,
    ( ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ true ),
    inference(duplicate_literal_removal,[],[f305]) ).

fof(f372,plain,
    $false,
    inference(global_subsumption,[],[f298,f368,f301,f300]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV077+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n014.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 09:49:15 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24  Running first-order model finding
% 0.09/0.24  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.24/0.29  % (1676014)Will run a generic schedule for satisfiability detection.
% 0.24/0.29  % (1676021)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3726772055:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.29  % (1676021) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1676014-1676021"...
% 0.24/0.29  % (1676021)...printing done.
% 0.24/0.29  % (1676020)% WARNING: option uhcvi not known.
% 0.24/0.29  % (1676021)Refutation found. Thanks to Tanya!
% 0.24/0.29  % SZS status Theorem for theBenchmark
% 0.24/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.29  % (1676021)------------------------------
% 0.24/0.29  % (1676021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.29  % (1676021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.29  % (1676021)CaDiCaL version: 2.1.3
% 0.24/0.29  % (1676021)Termination reason: Refutation
% 0.24/0.29  % (1676021)Time elapsed: 0.003 s
% 0.24/0.29  % (1676021)Peak memory usage: 11 MB
% 0.24/0.29  % (1676021)Instructions burned: 8 (million)
% 0.24/0.29  % (1676014)Success in time 0.035 s
% 0.24/0.29  % Vampire exiting
%------------------------------------------------------------------------------