↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN176-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:49:50 PM UTC 2026

% Result   : Unsatisfiable 2.53s 1.12s
% Output   : Refutation 2.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   53 (  17 unt;   6 def)
%            Number of atoms       :  114 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  125 (  64   ~;  55   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   7 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    n0(d,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f14,axiom,
    ! [X0] : p0(b,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

fof(f17,axiom,
    ! [X0] : q0(X0,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).

fof(f19,axiom,
    ! [X0,X1] : m0(X0,d,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).

fof(f24,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_24) ).

fof(f39,axiom,
    ! [X0,X1] :
      ( ~ n0(X1,X0)
      | k1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_001) ).

fof(f163,axiom,
    ! [X0] :
      ( ~ p0(X0,X0)
      | s1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_125) ).

fof(f164,axiom,
    ! [X2,X0,X1] :
      ( s1(X0)
      | ~ q0(X0,X1)
      | ~ s1(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_126) ).

fof(f171,axiom,
    ! [X2,X3,X0,X1] :
      ( l2(X0,X0)
      | ~ p0(X1,X1)
      | ~ s1(X2)
      | ~ m0(X3,X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_133) ).

fof(f221,axiom,
    ! [X0,X1] :
      ( q2(X0,c,X1)
      | ~ k1(X1)
      | ~ l0(c)
      | ~ l2(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_183) ).

fof(f369,negated_conjecture,
    ! [X0] : ~ q2(e,c,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f474,definition,
    ( spl0_31
  <=> ! [X1] : ~ s1(X1) ),
    introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).

fof(f475,plain,
    ( ! [X1] : ~ s1(X1)
    | ~ spl0_31 ),
    inference(avatar_component_clause,[],[f474]) ).

fof(f822,definition,
    ( spl0_131
  <=> ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_131])],[avatar_definition]) ).

fof(f823,plain,
    ( ! [X0,X1] :
        ( ~ q0(X0,X1)
        | s1(X0) )
    | ~ spl0_131 ),
    inference(avatar_component_clause,[],[f822]) ).

fof(f824,plain,
    ( spl0_31
    | spl0_131 ),
    inference(avatar_split_clause,[],[f164,f822,f474]) ).

fof(f887,definition,
    ( spl0_149
  <=> ! [X1] : ~ p0(X1,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_149])],[avatar_definition]) ).

fof(f888,plain,
    ( ! [X1] : ~ p0(X1,X1)
    | ~ spl0_149 ),
    inference(avatar_component_clause,[],[f887]) ).

fof(f890,definition,
    ( spl0_150
  <=> ! [X2,X0,X3] :
        ( l2(X0,X0)
        | ~ s1(X2)
        | ~ m0(X3,X2,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_150])],[avatar_definition]) ).

fof(f891,plain,
    ( ! [X2,X3,X0] :
        ( l2(X0,X0)
        | ~ s1(X2)
        | ~ m0(X3,X2,X0) )
    | ~ spl0_150 ),
    inference(avatar_component_clause,[],[f890]) ).

fof(f892,plain,
    ( spl0_149
    | spl0_150 ),
    inference(avatar_split_clause,[],[f171,f890,f887]) ).

fof(f915,definition,
    ( spl0_157
  <=> l0(c) ),
    introduced(definition,[new_symbols(definition,[spl0_157])],[avatar_definition]) ).

fof(f916,plain,
    ( ~ l0(c)
    | spl0_157 ),
    inference(avatar_component_clause,[],[f915]) ).

fof(f1323,definition,
    ( spl0_269
  <=> ! [X0,X1] :
        ( q2(X0,c,X1)
        | ~ l2(X1,X0)
        | ~ k1(X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_269])],[avatar_definition]) ).

fof(f1324,plain,
    ( ! [X0,X1] :
        ( q2(X0,c,X1)
        | ~ l2(X1,X0)
        | ~ k1(X1) )
    | ~ spl0_269 ),
    inference(avatar_component_clause,[],[f1323]) ).

fof(f1325,plain,
    ( ~ spl0_157
    | spl0_269 ),
    inference(avatar_split_clause,[],[f221,f1323,f915]) ).

fof(f1409,plain,
    ( $false
    | spl0_157 ),
    inference(forward_subsumption_resolution,[],[f916,f24]) ).

fof(f1410,plain,
    spl0_157,
    inference(avatar_contradiction_clause,[],[f1409]) ).

fof(f1417,plain,
    ( $false
    | ~ spl0_149 ),
    inference(resolution,[],[f888,f14]) ).

fof(f1418,plain,
    ~ spl0_149,
    inference(avatar_contradiction_clause,[],[f1417]) ).

fof(f1474,plain,
    k1(e),
    inference(resolution,[],[f39,f3]) ).

fof(f1500,plain,
    ( ! [X0] : ~ p0(X0,X0)
    | ~ spl0_31 ),
    inference(forward_subsumption_resolution,[],[f163,f475]) ).

fof(f1501,plain,
    ( spl0_149
    | ~ spl0_31 ),
    inference(avatar_split_clause,[],[f1500,f474,f887]) ).

fof(f1507,plain,
    ( ! [X0] : s1(X0)
    | ~ spl0_131 ),
    inference(resolution,[],[f823,f17]) ).

fof(f1640,plain,
    ( ! [X2,X3,X0] :
        ( ~ m0(X3,X2,X0)
        | l2(X0,X0) )
    | ~ spl0_131
    | ~ spl0_150 ),
    inference(forward_subsumption_resolution,[],[f891,f1507]) ).

fof(f1744,plain,
    ( ! [X0] : l2(X0,X0)
    | ~ spl0_131
    | ~ spl0_150 ),
    inference(resolution,[],[f1640,f19]) ).

fof(f2163,plain,
    ( ! [X0] :
        ( ~ l2(X0,e)
        | ~ k1(X0) )
    | ~ spl0_269 ),
    inference(resolution,[],[f1324,f369]) ).

fof(f2171,plain,
    ( ~ k1(e)
    | ~ spl0_131
    | ~ spl0_150
    | ~ spl0_269 ),
    inference(resolution,[],[f2163,f1744]) ).

fof(f2172,plain,
    ( $false
    | ~ spl0_131
    | ~ spl0_150
    | ~ spl0_269 ),
    inference(forward_subsumption_resolution,[],[f2171,f1474]) ).

fof(f2173,plain,
    ( ~ spl0_131
    | ~ spl0_150
    | ~ spl0_269 ),
    inference(avatar_contradiction_clause,[],[f2172]) ).

cnf(s59,plain,
    ( spl0_31
    | spl0_131 ),
    inference(sat_conversion,[],[f824]) ).

cnf(s69,plain,
    ( spl0_149
    | spl0_150 ),
    inference(sat_conversion,[],[f892]) ).

cnf(s143,plain,
    ( ~ spl0_157
    | spl0_269 ),
    inference(sat_conversion,[],[f1325]) ).

cnf(s163,plain,
    spl0_157,
    inference(sat_conversion,[],[f1410]) ).

cnf(s167,plain,
    ~ spl0_149,
    inference(sat_conversion,[],[f1418]) ).

cnf(s204,plain,
    ( ~ spl0_31
    | spl0_149 ),
    inference(sat_conversion,[],[f1501]) ).

cnf(s322,plain,
    ( ~ spl0_131
    | ~ spl0_150
    | ~ spl0_269 ),
    inference(sat_conversion,[],[f2173]) ).

cnf(s324,plain,
    ~ spl0_31,
    inference(rat,[],[s204,s167]) ).

cnf(s325,plain,
    spl0_269,
    inference(rat,[],[s143,s163]) ).

cnf(s391,plain,
    spl0_150,
    inference(rat,[],[s69,s167]) ).

cnf(s392,plain,
    ~ spl0_131,
    inference(rat,[],[s322,s325,s391]) ).

cnf(s398,plain,
    $false,
    inference(rat,[],[s59,s392,s324]) ).

fof(f2174,plain,
    $false,
    inference(avatar_sat_refutation,[],[s398]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN176-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.18  % Computer : n014.cluster.edu
% 0.12/0.18  % Model    : x86_64 x86_64
% 0.12/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18  % Memory   : 8046.5625MB
% 0.12/0.18  % OS       : Linux 6.8.0-71-generic
% 0.12/0.18  % CPULimit : 300
% 0.12/0.18  % WCLimit  : 300
% 0.12/0.18  % DateTime : Mon Sep 28 15:37:46 UTC 2026
% 0.12/0.19  % CPUTime  : 
% 0.12/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.22  Running first-order theorem proving
% 0.12/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.12  % (1861462)Input is clausal, will run a generic CNF schedule.
% 2.53/1.12  % (1861518)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3323122252:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.53/1.12  % (1861518)First to succeed.
% 2.53/1.12  % (1861518)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1861462"
% 2.53/1.12  % (1861514)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=583734733:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.53/1.12  % (1861516)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4016764423:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.53/1.12  % (1861515)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1787860149:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.53/1.12  % (1861517)lrs+10_1_sil=8000:sp=occurrence:random_seed=1944707194:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.53/1.12  % (1861520)dis-21_1_sil=8000:lcm=predicate:random_seed=3448212035:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.53/1.12  % (1861519)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=683022864:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.53/1.12  % (1861519)Also succeeded, but the first one will report.
% 2.53/1.12  % (1861520)Also succeeded, but the first one will report.
% 2.53/1.12  % (1861517)Also succeeded, but the first one will report.
% 2.53/1.12  % (1861518)Refutation found. Thanks to Tanya!
% 2.53/1.12  % SZS status Unsatisfiable for theBenchmark
% 2.53/1.12  % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.12  % (1861518)------------------------------
% 2.53/1.12  % (1861518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.12  % (1861518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.12  % (1861518)CaDiCaL version: 2.1.3
% 2.53/1.12  % (1861518)Termination reason: Refutation
% 2.53/1.12  % (1861518)Time elapsed: 0.012 s
% 2.53/1.12  % (1861518)Peak memory usage: 90 MB
% 2.53/1.12  % (1861518)Instructions burned: 33 (million)
% 2.53/1.12  % (1861518)------------------------------
% 2.53/1.12  % (1861518)------------------------------
% 2.53/1.12  % (1861462)Success in time 0.283 s
% 2.53/1.12  % Vampire exiting
%------------------------------------------------------------------------------