↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 4.20s 1.36s
% Output   : Refutation 4.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   45 (  17 unt;   4 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   76 (  39   ~;  33   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   15 (  14 usr;   5 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?)

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

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

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

fof(f34,axiom,
    n0(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_34) ).

fof(f36,axiom,
    q0(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_36) ).

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

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(f219,axiom,
    ! [X0] :
      ( ~ p1(X0,X0,X0)
      | q2(X0,X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_181) ).

fof(f228,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_190) ).

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

fof(f369,negated_conjecture,
    ~ s3(d,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f816,definition,
    ( spl0_108
  <=> ! [X2] : ~ s1(X2) ),
    introduced(definition,[new_symbols(definition,[spl0_108])],[avatar_definition]) ).

fof(f817,plain,
    ( ! [X2] : ~ s1(X2)
    | ~ spl0_108 ),
    inference(avatar_component_clause,[],[f816]) ).

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

fof(f820,plain,
    ( ! [X0,X1] :
        ( ~ q0(X0,X1)
        | s1(X0) )
    | ~ spl0_109 ),
    inference(avatar_component_clause,[],[f819]) ).

fof(f821,plain,
    ( spl0_108
    | spl0_109 ),
    inference(avatar_split_clause,[],[f164,f819,f816]) ).

fof(f855,plain,
    ( s2(d)
    | ~ s1(a) ),
    inference(forward_subsumption_resolution,[],[f228,f1]) ).

fof(f983,definition,
    ( spl0_149
  <=> s1(a) ),
    introduced(definition,[new_symbols(definition,[spl0_149])],[avatar_definition]) ).

fof(f985,plain,
    ( ~ s1(a)
    | spl0_149 ),
    inference(avatar_component_clause,[],[f983]) ).

fof(f987,definition,
    ( spl0_150
  <=> s2(d) ),
    introduced(definition,[new_symbols(definition,[spl0_150])],[avatar_definition]) ).

fof(f989,plain,
    ( s2(d)
    | ~ spl0_150 ),
    inference(avatar_component_clause,[],[f987]) ).

fof(f990,plain,
    ( ~ spl0_149
    | spl0_150 ),
    inference(avatar_split_clause,[],[f855,f987,f983]) ).

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

fof(f1074,plain,
    ( $false
    | ~ spl0_108 ),
    inference(forward_subsumption_resolution,[],[f1073,f817]) ).

fof(f1075,plain,
    ~ spl0_108,
    inference(avatar_contradiction_clause,[],[f1074]) ).

fof(f1084,plain,
    ( s1(a)
    | ~ spl0_109 ),
    inference(resolution,[],[f820,f36]) ).

fof(f1087,plain,
    ( $false
    | ~ spl0_109
    | spl0_149 ),
    inference(forward_subsumption_resolution,[],[f1084,f985]) ).

fof(f1088,plain,
    ( ~ spl0_109
    | spl0_149 ),
    inference(avatar_contradiction_clause,[],[f1087]) ).

fof(f1140,plain,
    p1(d,d,d),
    inference(resolution,[],[f104,f34]) ).

fof(f1318,plain,
    q2(d,d,d),
    inference(resolution,[],[f219,f1140]) ).

fof(f2386,plain,
    ! [X0,X1] :
      ( s3(d,X0)
      | ~ s2(d)
      | ~ m0(d,X1,X0) ),
    inference(resolution,[],[f311,f1318]) ).

fof(f2401,plain,
    ( ! [X0,X1] :
        ( ~ m0(d,X1,X0)
        | s3(d,X0) )
    | ~ spl0_150 ),
    inference(forward_subsumption_resolution,[],[f2386,f989]) ).

fof(f3395,plain,
    ( ! [X0] : s3(d,X0)
    | ~ spl0_150 ),
    inference(resolution,[],[f2401,f19]) ).

fof(f3398,plain,
    ( $false
    | ~ spl0_150 ),
    inference(resolution,[],[f3395,f369]) ).

fof(f3399,plain,
    ~ spl0_150,
    inference(avatar_contradiction_clause,[],[f3398]) ).

cnf(s55,plain,
    ( spl0_108
    | spl0_109 ),
    inference(sat_conversion,[],[f821]) ).

cnf(s77,plain,
    ( ~ spl0_149
    | spl0_150 ),
    inference(sat_conversion,[],[f990]) ).

cnf(s104,plain,
    ~ spl0_108,
    inference(sat_conversion,[],[f1075]) ).

cnf(s106,plain,
    ( ~ spl0_109
    | spl0_149 ),
    inference(sat_conversion,[],[f1088]) ).

cnf(s232,plain,
    ~ spl0_150,
    inference(sat_conversion,[],[f3399]) ).

cnf(s243,plain,
    ~ spl0_149,
    inference(rat,[],[s77,s232]) ).

cnf(s244,plain,
    ~ spl0_109,
    inference(rat,[],[s106,s243]) ).

cnf(s251,plain,
    $false,
    inference(rat,[],[s55,s244,s104]) ).

fof(f3400,plain,
    $false,
    inference(avatar_sat_refutation,[],[s251]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.17  % Computer : n019.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Mon Sep 28 15:38:33 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  Running first-order theorem proving
% 0.10/0.20  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
% 4.20/1.36  % (4101391)Input is clausal, will run a generic CNF schedule.
% 4.20/1.36  % (4101457)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3218009552:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.20/1.36  % (4101455)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=4016593546:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.20/1.36  % (4101460)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3647011084:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.20/1.36  % (4101462)dis-21_1_sil=8000:lcm=predicate:random_seed=1772379278: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)
% 4.20/1.36  % (4101459)lrs+10_1_sil=8000:sp=occurrence:random_seed=4221664282:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.20/1.36  % (4101458)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2406645111:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.20/1.36  % (4101461)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1174481279:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.20/1.36  % (4101459)First to succeed.
% 4.20/1.36  % (4101459)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4101391"
% 4.20/1.36  % (4101461)Also succeeded, but the first one will report.
% 4.20/1.36  % (4101460)Also succeeded, but the first one will report.
% 4.20/1.36  % (4101462)Instruction limit reached! 
% 4.20/1.36  % (4101462)------------------------------
% 4.20/1.36  % (4101462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.20/1.36  % (4101462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.20/1.36  % (4101462)CaDiCaL version: 2.1.3
% 4.20/1.36  % (4101462)Termination reason: Instruction limit
% 4.20/1.36  % (4101462)Termination phase: Saturation
% 4.20/1.36  % (4101462)Time elapsed: 0.055 s
% 4.20/1.36  % (4101462)Peak memory usage: 89 MB
% 4.20/1.36  % (4101462)Instructions burned: 117 (million)
% 4.20/1.36  % (4101521)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2829541453:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.20/1.36  % (4101521)Refutation not found, incomplete strategy
% 4.20/1.36  % (4101521)------------------------------
% 4.20/1.36  % (4101521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.20/1.36  % (4101521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.20/1.36  % (4101521)CaDiCaL version: 2.1.3
% 4.20/1.36  % (4101521)Termination reason: Refutation not found, incomplete strategy
% 4.20/1.36  % (4101521)Time elapsed: 0.001 s
% 4.20/1.36  % (4101521)Peak memory usage: 87 MB
% 4.20/1.36  % (4101521)Instructions burned: 1 (million)
% 4.20/1.36  % (4101459)Refutation found. Thanks to Tanya!
% 4.20/1.36  % SZS status Unsatisfiable for theBenchmark
% 4.20/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 4.20/1.36  % (4101459)------------------------------
% 4.20/1.36  % (4101459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.20/1.36  % (4101459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.20/1.36  % (4101459)CaDiCaL version: 2.1.3
% 4.20/1.36  % (4101459)Termination reason: Refutation
% 4.20/1.36  % (4101459)Time elapsed: 0.037 s
% 4.20/1.36  % (4101459)Peak memory usage: 90 MB
% 4.20/1.36  % (4101459)Instructions burned: 51 (million)
% 4.20/1.36  % (4101459)------------------------------
% 4.20/1.36  % (4101459)------------------------------
% 4.20/1.36  % (4101391)Success in time 0.519 s
% 4.20/1.36  % Vampire exiting
%------------------------------------------------------------------------------