↑ 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  : SWV062+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:06 PM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   7 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :   12 (   5 avg)
%            Number of connectives :   68 (  19   ~;  15   |;  32   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

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

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

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

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

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

fof(f308,plain,
    leq(pv41,minus(n5,n1)),
    inference(cnf_transformation,[],[f144]) ).

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

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

fof(f311,plain,
    leq(n0,pv41),
    inference(cnf_transformation,[],[f144]) ).

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

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

fof(f382,plain,
    $false,
    inference(global_subsumption,[],[f313,f312,f311,f310,f309,f308,f307]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV062+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.07/0.18  % Computer : n002.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 09:51:37 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/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.21/0.27  % (242647)Will run a generic schedule for satisfiability detection.
% 0.21/0.27  % (242660)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3603227902_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.27  % (242661)% WARNING: option uhcvi not known.
% 0.21/0.27  % (242661)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3641413987:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.27  % (242662)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3384211022:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.27  % (242663)dis+10_1_sil=32000:sp=arity:random_seed=2454250091:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.27  % (242664)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=327122695:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27  % (242665)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1425496402:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.27  % (242666)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2113018800:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.27  % (242662) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-242647-242662"...
% 0.21/0.27  % (242663) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-242647-242663"...
% 0.21/0.27  % (242661) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-242647-242661"...
% 0.21/0.27  % (242662)...printing done.
% 0.21/0.27  % (242663)...printing done.
% 0.21/0.27  % (242662)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (242662)------------------------------
% 0.21/0.28  % (242662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (242662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (242662)CaDiCaL version: 2.1.3
% 0.21/0.28  % (242662)Termination reason: Refutation
% 0.21/0.28  % (242662)Time elapsed: 0.005 s
% 0.21/0.28  % (242662)Peak memory usage: 11 MB
% 0.21/0.28  % (242662)Instructions burned: 8 (million)
% 0.21/0.28  % (242647)Success in time 0.05 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------