↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN134-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 : n017.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:44 PM UTC 2026

% Result   : Unsatisfiable 3.58s 1.23s
% Output   : Refutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  11 unt;   3 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  21   ~;  16   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

fof(f7,axiom,
    n0(d,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

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

fof(f173,axiom,
    ! [X2,X0,X1] :
      ( m2(X0)
      | ~ s0(X0)
      | ~ l1(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_135) ).

fof(f369,negated_conjecture,
    ~ m2(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f927,definition,
    ( spl0_134
  <=> ! [X2,X1] : ~ l1(X1,X2) ),
    introduced(definition,[new_symbols(definition,[spl0_134])],[avatar_definition]) ).

fof(f928,plain,
    ( ! [X2,X1] : ~ l1(X1,X2)
    | ~ spl0_134 ),
    inference(avatar_component_clause,[],[f927]) ).

fof(f930,definition,
    ( spl0_135
  <=> ! [X0] :
        ( m2(X0)
        | ~ s0(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_135])],[avatar_definition]) ).

fof(f931,plain,
    ( ! [X0] :
        ( ~ s0(X0)
        | m2(X0) )
    | ~ spl0_135 ),
    inference(avatar_component_clause,[],[f930]) ).

fof(f932,plain,
    ( spl0_134
    | spl0_135 ),
    inference(avatar_split_clause,[],[f173,f930,f927]) ).

fof(f965,definition,
    ( spl0_144
  <=> m2(d) ),
    introduced(definition,[new_symbols(definition,[spl0_144])],[avatar_definition]) ).

fof(f967,plain,
    ( ~ m2(d)
    | spl0_144 ),
    inference(avatar_component_clause,[],[f965]) ).

fof(f989,plain,
    ~ spl0_144,
    inference(avatar_split_clause,[],[f369,f965]) ).

fof(f1196,plain,
    l1(b,b),
    inference(resolution,[],[f40,f7]) ).

fof(f1215,plain,
    ( $false
    | ~ spl0_134 ),
    inference(forward_subsumption_resolution,[],[f1196,f928]) ).

fof(f1216,plain,
    ~ spl0_134,
    inference(avatar_contradiction_clause,[],[f1215]) ).

fof(f1221,plain,
    ( m2(d)
    | ~ spl0_135 ),
    inference(resolution,[],[f931,f1]) ).

fof(f1223,plain,
    ( $false
    | ~ spl0_135
    | spl0_144 ),
    inference(forward_subsumption_resolution,[],[f1221,f967]) ).

fof(f1224,plain,
    ( ~ spl0_135
    | spl0_144 ),
    inference(avatar_contradiction_clause,[],[f1223]) ).

cnf(s72,plain,
    ( spl0_134
    | spl0_135 ),
    inference(sat_conversion,[],[f932]) ).

cnf(s79,plain,
    ~ spl0_144,
    inference(sat_conversion,[],[f989]) ).

cnf(s137,plain,
    ~ spl0_134,
    inference(sat_conversion,[],[f1216]) ).

cnf(s140,plain,
    ( ~ spl0_135
    | spl0_144 ),
    inference(sat_conversion,[],[f1224]) ).

cnf(s143,plain,
    ~ spl0_135,
    inference(rat,[],[s140,s79]) ).

cnf(s148,plain,
    $false,
    inference(rat,[],[s72,s143,s137]) ).

fof(f1225,plain,
    $false,
    inference(avatar_sat_refutation,[],[s148]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN134-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.09/0.20  % Computer : n017.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Mon Sep 28 15:31:36 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running first-order theorem proving
% 0.09/0.24  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
% 3.58/1.23  % (3638583)Input is clausal, will run a generic CNF schedule.
% 3.58/1.23  % (3638705)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2304626209:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.58/1.23  % (3638706)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=126632833:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.58/1.23  % (3638704)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=1475467562:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.58/1.23  % (3638708)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3096760083:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.58/1.23  % (3638707)lrs+10_1_sil=8000:sp=occurrence:random_seed=1756706603:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.58/1.23  % (3638707)First to succeed.
% 3.58/1.23  % (3638708)Also succeeded, but the first one will report.
% 3.58/1.23  % (3638707)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3638583"
% 3.58/1.23  % (3638710)dis-21_1_sil=8000:lcm=predicate:random_seed=1762667249: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)
% 3.58/1.23  % (3638710)Also succeeded, but the first one will report.
% 3.58/1.23  % (3638709)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3092122956:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.58/1.23  % (3638709)Also succeeded, but the first one will report.
% 3.58/1.23  % (3638707)Refutation found. Thanks to Tanya!
% 3.58/1.23  % SZS status Unsatisfiable for theBenchmark
% 3.58/1.23  % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.23  % (3638707)------------------------------
% 3.58/1.23  % (3638707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.23  % (3638707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.23  % (3638707)CaDiCaL version: 2.1.3
% 3.58/1.23  % (3638707)Termination reason: Refutation
% 3.58/1.23  % (3638707)Time elapsed: 0.011 s
% 3.58/1.23  % (3638707)Peak memory usage: 90 MB
% 3.58/1.23  % (3638707)Instructions burned: 14 (million)
% 3.58/1.23  % (3638707)------------------------------
% 3.58/1.23  % (3638707)------------------------------
% 3.58/1.23  % (3638583)Success in time 0.436 s
% 3.58/1.23  % Vampire exiting
%------------------------------------------------------------------------------