↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN298-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 : n004.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:50:07 PM UTC 2026

% Result   : Unsatisfiable 2.54s 1.12s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   34 (  14 unt;   2 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   57 (  29   ~;  26   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   3 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   23 (   0 sgn  23   !;   0   ?)

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

fof(f15,axiom,
    n0(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).

fof(f31,axiom,
    m0(b,b,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_31) ).

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

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

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

fof(f219,axiom,
    ! [X0] :
      ( ~ p1(X0,X0,X0)
      | q2(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_181) ).

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

fof(f227,axiom,
    ! [X0] :
      ( s2(X0)
      | ~ q2(b,X0,b)
      | ~ s1(b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_189) ).

fof(f311,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ q2(X2,X0,X2)
      | s3(X0,X1)
      | ~ s2(X0)
      | ~ m0(X2,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_273) ).

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

fof(f848,definition,
    ( spl0_116
  <=> s1(b) ),
    introduced(definition,[new_symbols(definition,[spl0_116])],[avatar_definition]) ).

fof(f850,plain,
    ( ~ s1(b)
    | spl0_116 ),
    inference(avatar_component_clause,[],[f848]) ).

fof(f852,definition,
    ( spl0_117
  <=> ! [X0] :
        ( s2(X0)
        | ~ q2(b,X0,b) ) ),
    introduced(definition,[new_symbols(definition,[spl0_117])],[avatar_definition]) ).

fof(f853,plain,
    ( ! [X0] :
        ( ~ q2(b,X0,b)
        | s2(X0) )
    | ~ spl0_117 ),
    inference(avatar_component_clause,[],[f852]) ).

fof(f854,plain,
    ( ~ spl0_116
    | spl0_117 ),
    inference(avatar_split_clause,[],[f227,f852,f848]) ).

fof(f1073,plain,
    s1(b),
    inference(resolution,[],[f163,f14]) ).

fof(f1076,plain,
    ( $false
    | spl0_116 ),
    inference(forward_subsumption_resolution,[],[f1073,f850]) ).

fof(f1077,plain,
    spl0_116,
    inference(avatar_contradiction_clause,[],[f1076]) ).

fof(f1094,plain,
    l1(b,b),
    inference(resolution,[],[f40,f15]) ).

fof(f1138,plain,
    p1(b,b,b),
    inference(resolution,[],[f104,f15]) ).

fof(f1188,plain,
    ( ~ l1(b,b)
    | s2(b)
    | ~ spl0_117 ),
    inference(resolution,[],[f224,f853]) ).

fof(f1191,plain,
    ( s2(b)
    | ~ spl0_117 ),
    inference(forward_subsumption_resolution,[],[f1188,f1094]) ).

fof(f1321,plain,
    q2(b,b,b),
    inference(resolution,[],[f219,f1138]) ).

fof(f2389,plain,
    ! [X0,X1] :
      ( s3(b,X0)
      | ~ s2(b)
      | ~ m0(b,X1,X0) ),
    inference(resolution,[],[f311,f1321]) ).

fof(f2392,plain,
    ( ! [X0,X1] :
        ( s3(b,X0)
        | ~ m0(b,X1,X0) )
    | ~ spl0_117 ),
    inference(forward_subsumption_resolution,[],[f2389,f1191]) ).

fof(f2403,plain,
    ( ! [X0,X1] : ~ m0(b,X1,X0)
    | ~ spl0_117 ),
    inference(forward_subsumption_resolution,[],[f2392,f369]) ).

fof(f2405,plain,
    ( $false
    | ~ spl0_117 ),
    inference(resolution,[],[f2403,f31]) ).

fof(f2410,plain,
    ~ spl0_117,
    inference(avatar_contradiction_clause,[],[f2405]) ).

cnf(s59,plain,
    ( ~ spl0_116
    | spl0_117 ),
    inference(sat_conversion,[],[f854]) ).

cnf(s105,plain,
    spl0_116,
    inference(sat_conversion,[],[f1077]) ).

cnf(s195,plain,
    ~ spl0_117,
    inference(sat_conversion,[],[f2410]) ).

cnf(s203,plain,
    $false,
    inference(rat,[],[s59,s195,s105]) ).

fof(f2411,plain,
    $false,
    inference(avatar_sat_refutation,[],[s203]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN298-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.10/0.26  % Computer : n004.cluster.edu
% 0.10/0.26  % Model    : x86_64 x86_64
% 0.10/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26  % Memory   : 8046.5625MB
% 0.10/0.26  % OS       : Linux 6.8.0-71-generic
% 0.10/0.27  % CPULimit : 300
% 0.10/0.27  % WCLimit  : 300
% 0.10/0.27  % DateTime : Mon Sep 28 15:40:22 UTC 2026
% 0.10/0.27  % CPUTime  : 
% 0.10/0.27  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.31  Running first-order theorem proving
% 0.26/0.31  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.54/1.12  % (479135)Input is clausal, will run a generic CNF schedule.
% 2.54/1.12  % (479189)lrs+10_1_sil=8000:sp=occurrence:random_seed=2650871030:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.54/1.12  % (479189)First to succeed.
% 2.54/1.12  % (479189)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-479135"
% 2.54/1.12  % (479187)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3041509247:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.54/1.12  % (479192)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1851124610:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.54/1.12  % (479191)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=437955797:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.54/1.12  % (479188)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3875737322:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.54/1.12  % (479186)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=1693239584:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.54/1.12  % (479194)dis-21_1_sil=8000:lcm=predicate:random_seed=1107596406: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.54/1.12  % (479192)Also succeeded, but the first one will report.
% 2.54/1.12  % (479191)Also succeeded, but the first one will report.
% 2.54/1.12  % (479194)Instruction limit reached! 
% 2.54/1.12  % (479194)------------------------------
% 2.54/1.12  % (479194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.12  % (479194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.12  % (479194)CaDiCaL version: 2.1.3
% 2.54/1.12  % (479194)Termination reason: Instruction limit
% 2.54/1.12  % (479194)Termination phase: Saturation
% 2.54/1.12  % (479194)Time elapsed: 0.056 s
% 2.54/1.12  % (479194)Peak memory usage: 89 MB
% 2.54/1.12  % (479194)Instructions burned: 119 (million)
% 2.54/1.12  % (479189)Refutation found. Thanks to Tanya!
% 2.54/1.12  % SZS status Unsatisfiable for theBenchmark
% 2.54/1.12  % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.12  % (479189)------------------------------
% 2.54/1.12  % (479189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.12  % (479189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.12  % (479189)CaDiCaL version: 2.1.3
% 2.54/1.12  % (479189)Termination reason: Refutation
% 2.54/1.12  % (479189)Time elapsed: 0.013 s
% 2.54/1.12  % (479189)Peak memory usage: 90 MB
% 2.54/1.12  % (479189)Instructions burned: 33 (million)
% 2.54/1.12  % (479189)------------------------------
% 2.54/1.12  % (479189)------------------------------
% 2.54/1.12  % (479135)Success in time 0.277 s
% 2.54/1.12  % Vampire exiting
%------------------------------------------------------------------------------