↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.67s 1.15s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   45 (  14 unt;   5 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  112 (  57   ~;  50   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   6 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   38 (   0 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    n0(e,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).

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(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(f169,axiom,
    ! [X0,X1] :
      ( l2(X0,X1)
      | ~ s1(X0)
      | ~ n0(e,X1)
      | ~ l2(X1,X1) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',rule_133) ).

fof(f369,negated_conjecture,
    ~ l2(a,b),
    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(f693,definition,
    ( spl0_95
  <=> ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_95])],[avatar_definition]) ).

fof(f694,plain,
    ( ! [X0,X1] :
        ( ~ q0(X0,X1)
        | s1(X0) )
    | ~ spl0_95 ),
    inference(avatar_component_clause,[],[f693]) ).

fof(f695,plain,
    ( spl0_31
    | spl0_95 ),
    inference(avatar_split_clause,[],[f164,f693,f474]) ).

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

fof(f1122,plain,
    ( ! [X2] : ~ p0(X2,X2)
    | ~ spl0_214 ),
    inference(avatar_component_clause,[],[f1121]) ).

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

fof(f1287,plain,
    ( ! [X2,X3,X0] :
        ( l2(X0,X0)
        | ~ s1(X2)
        | ~ m0(X3,X2,X0) )
    | ~ spl0_259 ),
    inference(avatar_component_clause,[],[f1286]) ).

fof(f1288,plain,
    ( spl0_214
    | spl0_259 ),
    inference(avatar_split_clause,[],[f171,f1286,f1121]) ).

fof(f1322,definition,
    ( spl0_269
  <=> l2(a,b) ),
    introduced(definition,[new_symbols(definition,[spl0_269])],[avatar_definition]) ).

fof(f1323,plain,
    ( ~ l2(a,b)
    | spl0_269 ),
    inference(avatar_component_clause,[],[f1322]) ).

fof(f1389,plain,
    ~ spl0_269,
    inference(avatar_split_clause,[],[f369,f1322]) ).

fof(f1424,plain,
    ( $false
    | ~ spl0_214 ),
    inference(resolution,[],[f1122,f14]) ).

fof(f1425,plain,
    ~ spl0_214,
    inference(avatar_contradiction_clause,[],[f1424]) ).

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

fof(f1504,plain,
    ( spl0_214
    | ~ spl0_31 ),
    inference(avatar_split_clause,[],[f1503,f474,f1121]) ).

fof(f1510,plain,
    ( ! [X0] : s1(X0)
    | ~ spl0_95 ),
    inference(resolution,[],[f694,f17]) ).

fof(f1644,plain,
    ( ! [X2,X3,X0] :
        ( ~ m0(X3,X2,X0)
        | l2(X0,X0) )
    | ~ spl0_95
    | ~ spl0_259 ),
    inference(forward_subsumption_resolution,[],[f1287,f1510]) ).

fof(f1748,plain,
    ( ! [X0] : l2(X0,X0)
    | ~ spl0_95
    | ~ spl0_259 ),
    inference(resolution,[],[f1644,f19]) ).

fof(f2455,plain,
    ( ! [X0,X1] :
        ( l2(X0,X1)
        | ~ n0(e,X1)
        | ~ l2(X1,X1) )
    | ~ spl0_95 ),
    inference(forward_subsumption_resolution,[],[f169,f1510]) ).

fof(f2456,plain,
    ( ! [X0,X1] :
        ( l2(X0,X1)
        | ~ n0(e,X1) )
    | ~ spl0_95
    | ~ spl0_259 ),
    inference(forward_subsumption_resolution,[],[f2455,f1748]) ).

fof(f2462,plain,
    ( ~ n0(e,b)
    | ~ spl0_95
    | ~ spl0_259
    | spl0_269 ),
    inference(resolution,[],[f2456,f1323]) ).

fof(f2465,plain,
    ( $false
    | ~ spl0_95
    | ~ spl0_259
    | spl0_269 ),
    inference(forward_subsumption_resolution,[],[f2462,f11]) ).

fof(f2466,plain,
    ( ~ spl0_95
    | ~ spl0_259
    | spl0_269 ),
    inference(avatar_contradiction_clause,[],[f2465]) ).

cnf(s40,plain,
    ( spl0_31
    | spl0_95 ),
    inference(sat_conversion,[],[f695]) ).

cnf(s137,plain,
    ( spl0_214
    | spl0_259 ),
    inference(sat_conversion,[],[f1288]) ).

cnf(s153,plain,
    ~ spl0_269,
    inference(sat_conversion,[],[f1389]) ).

cnf(s171,plain,
    ~ spl0_214,
    inference(sat_conversion,[],[f1425]) ).

cnf(s206,plain,
    ( ~ spl0_31
    | spl0_214 ),
    inference(sat_conversion,[],[f1504]) ).

cnf(s346,plain,
    ( ~ spl0_95
    | ~ spl0_259
    | spl0_269 ),
    inference(sat_conversion,[],[f2466]) ).

cnf(s351,plain,
    ~ spl0_31,
    inference(rat,[],[s206,s171]) ).

cnf(s360,plain,
    spl0_259,
    inference(rat,[],[s137,s171]) ).

cnf(s361,plain,
    ~ spl0_95,
    inference(rat,[],[s346,s153,s360]) ).

cnf(s439,plain,
    $false,
    inference(rat,[],[s40,s361,s351]) ).

fof(f2472,plain,
    $false,
    inference(avatar_sat_refutation,[],[s439]) ).

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