↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWV065+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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:08:02 PM UTC 2026

% Result   : Theorem 2.84s 1.17s
% Output   : Refutation 2.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  18 unt;   5 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   78 (  27   ~;  22   |;  22   &)
%                                         (   5 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] : leq(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_leq) ).

fof(f53,conjecture,
    ( ( leq(n0,pv10)
      & leq(n0,pv53)
      & leq(pv10,minus(n135300,n1))
      & leq(pv53,minus(n5,n1)) )
   => ( leq(n0,n0)
      & 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_0006) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(n0,pv53)
        & leq(pv10,minus(n135300,n1))
        & leq(pv53,minus(n5,n1)) )
     => ( leq(n0,n0)
        & 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,n0)
      | ~ 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,n0)
      | ~ 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(f200,plain,
    ! [X0] : leq(X0,X0),
    inference(cnf_transformation,[],[f4]) ).

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,n0)
    | ~ leq(n0,pv10)
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(cnf_transformation,[],[f144]) ).

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

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

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

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

fof(f371,definition,
    ( spl31_5
  <=> leq(n0,n0) ),
    introduced(definition,[new_symbols(definition,[spl31_5])],[avatar_definition]) ).

fof(f373,plain,
    ( ~ leq(n0,n0)
    | spl31_5 ),
    inference(avatar_component_clause,[],[f371]) ).

fof(f374,plain,
    ( ~ spl31_1
    | ~ spl31_2
    | ~ spl31_3
    | ~ spl31_4
    | ~ spl31_5 ),
    inference(avatar_split_clause,[],[f311,f371,f367,f363,f359,f355]) ).

fof(f375,plain,
    spl31_3,
    inference(avatar_split_clause,[],[f309,f363]) ).

fof(f376,plain,
    spl31_4,
    inference(avatar_split_clause,[],[f310,f367]) ).

fof(f377,plain,
    spl31_1,
    inference(avatar_split_clause,[],[f307,f355]) ).

fof(f378,plain,
    spl31_2,
    inference(avatar_split_clause,[],[f308,f359]) ).

fof(f379,plain,
    ( $false
    | spl31_5 ),
    inference(resolution,[],[f200,f373]) ).

fof(f380,plain,
    spl31_5,
    inference(avatar_contradiction_clause,[],[f379]) ).

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

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

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

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

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

cnf(s6,plain,
    spl31_5,
    inference(sat_conversion,[],[f380]) ).

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

fof(f381,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV065+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n014.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 09:48:30 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/1.17  % (1673282)Detected formulas, will run a generic FOF schedule.
% 2.84/1.17  % (1673402)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2229068322:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.84/1.17  % (1673402)First to succeed.
% 2.84/1.17  % (1673402)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1673282"
% 2.84/1.17  % (1673396)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1898641385:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.84/1.17  % (1673400)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2910420108:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.84/1.17  % (1673399)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1139110172:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.84/1.17  % (1673400)Also succeeded, but the first one will report.
% 2.84/1.17  % (1673401)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1320499787:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.84/1.17  % (1673404)dis-21_1_sil=8000:lcm=predicate:random_seed=4015631401:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.84/1.17  % (1673401)Also succeeded, but the first one will report.
% 2.84/1.17  % (1673397)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3613795412:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.84/1.17  % (1673404)Also succeeded, but the first one will report.
% 2.84/1.17  % (1673402)Refutation found. Thanks to Tanya!
% 2.84/1.17  % SZS status Theorem for theBenchmark
% 2.84/1.17  % SZS output start Proof for theBenchmark
% See solution above
% 2.84/1.17  % (1673402)------------------------------
% 2.84/1.17  % (1673402)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.84/1.17  % (1673402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/1.17  % (1673402)CaDiCaL version: 2.1.3
% 2.84/1.17  % (1673402)Termination reason: Refutation
% 2.84/1.17  % (1673402)Time elapsed: 0.004 s
% 2.84/1.17  % (1673402)Peak memory usage: 89 MB
% 2.84/1.17  % (1673402)Instructions burned: 9 (million)
% 2.84/1.17  % (1673402)------------------------------
% 2.84/1.17  % (1673402)------------------------------
% 2.84/1.17  % (1673282)Success in time 0.321 s
% 2.84/1.17  % Vampire exiting
%------------------------------------------------------------------------------