↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 0.20s 1.20s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   41 (  12 unt;   4 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  103 (  54   ~;  45   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   5 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   38 (   0 sgn  38   !;   0   ?)

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

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

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

fof(f30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).

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

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

fof(f169,axiom,
    ! [X0,X1] :
      ( l2(X0,X1)
      | ~ s1(X0)
      | ~ n0(e,X1)
      | ~ l2(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_131) ).

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

fof(f369,negated_conjecture,
    ~ l2(b,e),
    file('/export/starexec/sandbox/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(f710,definition,
    ( spl0_100
  <=> ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_100])],[avatar_definition]) ).

fof(f711,plain,
    ( ! [X0,X1] :
        ( ~ q0(X0,X1)
        | s1(X0) )
    | ~ spl0_100 ),
    inference(avatar_component_clause,[],[f710]) ).

fof(f712,plain,
    ( spl0_31
    | spl0_100 ),
    inference(avatar_split_clause,[],[f164,f710,f474]) ).

fof(f885,definition,
    ( spl0_148
  <=> ! [X2] : ~ p0(X2,X2) ),
    introduced(definition,[new_symbols(definition,[spl0_148])],[avatar_definition]) ).

fof(f886,plain,
    ( ! [X2] : ~ p0(X2,X2)
    | ~ spl0_148 ),
    inference(avatar_component_clause,[],[f885]) ).

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

fof(f1322,plain,
    ( ! [X2,X3,X0] :
        ( l2(X0,X0)
        | ~ s1(X2)
        | ~ m0(X3,X2,X0) )
    | ~ spl0_269 ),
    inference(avatar_component_clause,[],[f1321]) ).

fof(f1323,plain,
    ( spl0_148
    | spl0_269 ),
    inference(avatar_split_clause,[],[f171,f1321,f885]) ).

fof(f1420,plain,
    ( $false
    | ~ spl0_148 ),
    inference(resolution,[],[f886,f14]) ).

fof(f1421,plain,
    ~ spl0_148,
    inference(avatar_contradiction_clause,[],[f1420]) ).

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

fof(f1502,plain,
    ( spl0_148
    | ~ spl0_31 ),
    inference(avatar_split_clause,[],[f1501,f474,f885]) ).

fof(f1508,plain,
    ( ! [X0] : s1(X0)
    | ~ spl0_100 ),
    inference(resolution,[],[f711,f17]) ).

fof(f1643,plain,
    ( ! [X2,X3,X0] :
        ( ~ m0(X3,X2,X0)
        | l2(X0,X0) )
    | ~ spl0_100
    | ~ spl0_269 ),
    inference(forward_subsumption_resolution,[],[f1322,f1508]) ).

fof(f1748,plain,
    ( ! [X0] : l2(X0,X0)
    | ~ spl0_100
    | ~ spl0_269 ),
    inference(resolution,[],[f1643,f19]) ).

fof(f2450,plain,
    ( ! [X0,X1] :
        ( l2(X0,X1)
        | ~ n0(e,X1)
        | ~ l2(X1,X1) )
    | ~ spl0_100 ),
    inference(forward_subsumption_resolution,[],[f169,f1508]) ).

fof(f2451,plain,
    ( ! [X0,X1] :
        ( l2(X0,X1)
        | ~ n0(e,X1) )
    | ~ spl0_100
    | ~ spl0_269 ),
    inference(forward_subsumption_resolution,[],[f2450,f1748]) ).

fof(f2458,plain,
    ( ~ n0(e,e)
    | ~ spl0_100
    | ~ spl0_269 ),
    inference(resolution,[],[f2451,f369]) ).

fof(f2460,plain,
    ( $false
    | ~ spl0_100
    | ~ spl0_269 ),
    inference(forward_subsumption_resolution,[],[f2458,f30]) ).

fof(f2461,plain,
    ( ~ spl0_100
    | ~ spl0_269 ),
    inference(avatar_contradiction_clause,[],[f2460]) ).

cnf(s42,plain,
    ( spl0_31
    | spl0_100 ),
    inference(sat_conversion,[],[f712]) ).

cnf(s141,plain,
    ( spl0_148
    | spl0_269 ),
    inference(sat_conversion,[],[f1323]) ).

cnf(s168,plain,
    ~ spl0_148,
    inference(sat_conversion,[],[f1421]) ).

cnf(s203,plain,
    ( ~ spl0_31
    | spl0_148 ),
    inference(sat_conversion,[],[f1502]) ).

cnf(s344,plain,
    ( ~ spl0_100
    | ~ spl0_269 ),
    inference(sat_conversion,[],[f2461]) ).

cnf(s350,plain,
    ~ spl0_31,
    inference(rat,[],[s203,s168]) ).

cnf(s352,plain,
    spl0_269,
    inference(rat,[],[s141,s168]) ).

cnf(s353,plain,
    ~ spl0_100,
    inference(rat,[],[s344,s352]) ).

cnf(s435,plain,
    $false,
    inference(rat,[],[s42,s353,s350]) ).

fof(f2469,plain,
    $false,
    inference(avatar_sat_refutation,[],[s435]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN122-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  % Computer : n004.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Mon Sep 28 15:35:52 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running first-order theorem proving
% 0.10/0.23  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
% 0.20/1.20  % (466053)Input is clausal, will run a generic CNF schedule.
% 0.20/1.20  % (466062)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=993009890:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.20  % (466062)First to succeed.
% 0.20/1.20  % (466062)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-466053"
% 0.20/1.20  % (466061)lrs+10_1_sil=8000:sp=occurrence:random_seed=1814273243:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.20  % (466059)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3728305356:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.20  % (466064)dis-21_1_sil=8000:lcm=predicate:random_seed=3994960844: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)
% 0.20/1.20  % (466058)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=3796169887:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.20  % (466060)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1576389849:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.20  % (466063)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2770315363:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.20  % (466063)Also succeeded, but the first one will report.
% 0.20/1.20  % (466064)Instruction limit reached! 
% 0.20/1.20  % (466064)------------------------------
% 0.20/1.20  % (466064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.20  % (466064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.20  % (466064)CaDiCaL version: 2.1.3
% 0.20/1.20  % (466064)Termination reason: Instruction limit
% 0.20/1.20  % (466064)Termination phase: Saturation
% 0.20/1.20  % (466064)Time elapsed: 0.056 s
% 0.20/1.20  % (466064)Peak memory usage: 89 MB
% 0.20/1.20  % (466064)Instructions burned: 119 (million)
% 0.20/1.20  % (466061)Refutation not found, incomplete strategy
% 0.20/1.20  % (466061)------------------------------
% 0.20/1.20  % (466061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.20  % (466061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.20  % (466061)CaDiCaL version: 2.1.3
% 0.20/1.20  % (466061)Termination reason: Refutation not found, incomplete strategy
% 0.20/1.20  % (466061)Time elapsed: 0.063 s
% 0.20/1.20  % (466061)Peak memory usage: 90 MB
% 0.20/1.20  % (466061)Instructions burned: 98 (million)
% 0.20/1.20  % (466062)Refutation found. Thanks to Tanya!
% 0.20/1.20  % SZS status Unsatisfiable for theBenchmark
% 0.20/1.20  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.20  % (466062)------------------------------
% 0.20/1.20  % (466062)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.20  % (466062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.20  % (466062)CaDiCaL version: 2.1.3
% 0.20/1.20  % (466062)Termination reason: Refutation
% 0.20/1.20  % (466062)Time elapsed: 0.014 s
% 0.20/1.20  % (466062)Peak memory usage: 90 MB
% 0.20/1.20  % (466062)Instructions burned: 38 (million)
% 0.20/1.20  % (466062)------------------------------
% 0.20/1.20  % (466062)------------------------------
% 0.20/1.20  % (466053)Success in time 0.324 s
% 0.20/1.20  % Vampire exiting
%------------------------------------------------------------------------------