↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 4.74s 1.46s
% Output   : Refutation 4.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   48 (  18 unt;   3 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   80 (  42   ~;  35   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   4 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   36 (   0 sgn  36   !;   0   ?)

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

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

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

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

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

fof(f43,axiom,
    ! [X0,X1] :
      ( ~ m0(X1,X1,X0)
      | m1(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_005) ).

fof(f44,axiom,
    ! [X0,X1] :
      ( ~ m0(X1,X1,X0)
      | m1(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_006) ).

fof(f78,axiom,
    ! [X0,X1] :
      ( ~ m0(X0,X1,e)
      | n1(X0,e,e)
      | ~ k1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_040) ).

fof(f188,axiom,
    ! [X0,X1] :
      ( ~ m1(X1,X1,X0)
      | p2(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_150) ).

fof(f190,axiom,
    ! [X2,X0,X1] :
      ( ~ p2(X0,X1,X0)
      | ~ n1(X2,X1,X2)
      | ~ p0(X0,X1)
      | p2(X0,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_152) ).

fof(f214,axiom,
    ! [X0,X1] :
      ( ~ m1(X1,X0,X1)
      | p2(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_176) ).

fof(f276,axiom,
    ! [X0] :
      ( ~ p2(X0,X0,X0)
      | m3(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_238) ).

fof(f289,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m3(X1,X2,X3)
      | p3(X0,X1,X1)
      | ~ p2(X0,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_251) ).

fof(f369,negated_conjecture,
    ~ p3(b,e,e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f582,definition,
    ( spl0_50
  <=> ! [X0] : p2(X0,X0,X0) ),
    introduced(definition,[new_symbols(definition,[spl0_50])],[avatar_definition]) ).

fof(f583,plain,
    ( ! [X0] : p2(X0,X0,X0)
    | ~ spl0_50 ),
    inference(avatar_component_clause,[],[f582]) ).

fof(f767,plain,
    k1(e),
    inference(resolution,[],[f39,f30]) ).

fof(f879,plain,
    m1(e,b,e),
    inference(resolution,[],[f43,f31]) ).

fof(f880,plain,
    ! [X0] : m1(X0,X0,X0),
    inference(resolution,[],[f44,f19]) ).

fof(f912,plain,
    ! [X0] : p2(X0,X0,X0),
    inference(resolution,[],[f188,f880]) ).

fof(f921,plain,
    spl0_50,
    inference(avatar_split_clause,[],[f912,f582]) ).

fof(f948,plain,
    p2(b,e,b),
    inference(resolution,[],[f214,f879]) ).

fof(f996,plain,
    ( ! [X0] : m3(X0,X0,X0)
    | ~ spl0_50 ),
    inference(resolution,[],[f276,f583]) ).

fof(f1131,plain,
    ! [X0] :
      ( n1(X0,e,e)
      | ~ k1(X0) ),
    inference(resolution,[],[f78,f19]) ).

fof(f1614,plain,
    ( ! [X0,X1] :
        ( ~ p2(X0,X1,X1)
        | p3(X0,X1,X1) )
    | ~ spl0_50 ),
    inference(resolution,[],[f289,f996]) ).

fof(f1736,definition,
    ( spl0_126
  <=> p2(b,e,e) ),
    introduced(definition,[new_symbols(definition,[spl0_126])],[avatar_definition]) ).

fof(f1737,plain,
    ( ~ p2(b,e,e)
    | spl0_126 ),
    inference(avatar_component_clause,[],[f1736]) ).

fof(f1738,plain,
    ( p2(b,e,e)
    | ~ spl0_126 ),
    inference(avatar_component_clause,[],[f1736]) ).

fof(f1772,plain,
    ! [X0] :
      ( ~ n1(X0,e,X0)
      | ~ p0(b,e)
      | p2(b,e,e) ),
    inference(resolution,[],[f190,f948]) ).

fof(f1915,definition,
    ( spl0_133
  <=> ! [X1] : ~ n1(X1,e,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_133])],[avatar_definition]) ).

fof(f1916,plain,
    ( ! [X1] : ~ n1(X1,e,X1)
    | ~ spl0_133 ),
    inference(avatar_component_clause,[],[f1915]) ).

fof(f1935,plain,
    ( ~ k1(e)
    | ~ spl0_133 ),
    inference(resolution,[],[f1916,f1131]) ).

fof(f1939,plain,
    ( $false
    | ~ spl0_133 ),
    inference(forward_subsumption_resolution,[],[f1935,f767]) ).

fof(f1940,plain,
    ~ spl0_133,
    inference(avatar_contradiction_clause,[],[f1939]) ).

fof(f2292,plain,
    ( p3(b,e,e)
    | ~ spl0_50
    | ~ spl0_126 ),
    inference(resolution,[],[f1614,f1738]) ).

fof(f2295,plain,
    ( $false
    | ~ spl0_50
    | ~ spl0_126 ),
    inference(forward_subsumption_resolution,[],[f2292,f369]) ).

fof(f2296,plain,
    ( ~ spl0_50
    | ~ spl0_126 ),
    inference(avatar_contradiction_clause,[],[f2295]) ).

fof(f2297,plain,
    ! [X0] :
      ( ~ n1(X0,e,X0)
      | p2(b,e,e) ),
    inference(forward_subsumption_resolution,[],[f1772,f14]) ).

fof(f2298,plain,
    ( ! [X0] : ~ n1(X0,e,X0)
    | spl0_126 ),
    inference(forward_subsumption_resolution,[],[f2297,f1737]) ).

fof(f2299,plain,
    ( spl0_133
    | spl0_126 ),
    inference(avatar_split_clause,[],[f2298,f1736,f1915]) ).

cnf(s93,plain,
    spl0_50,
    inference(sat_conversion,[],[f921]) ).

cnf(s140,plain,
    ~ spl0_133,
    inference(sat_conversion,[],[f1940]) ).

cnf(s151,plain,
    ( ~ spl0_50
    | ~ spl0_126 ),
    inference(sat_conversion,[],[f2296]) ).

cnf(s152,plain,
    ( spl0_126
    | spl0_133 ),
    inference(sat_conversion,[],[f2299]) ).

cnf(s153,plain,
    spl0_126,
    inference(rat,[],[s152,s140]) ).

cnf(s154,plain,
    ~ spl0_50,
    inference(rat,[],[s151,s153]) ).

cnf(s159,plain,
    $false,
    inference(rat,[],[s93,s154]) ).

fof(f2300,plain,
    $false,
    inference(avatar_sat_refutation,[],[s159]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN266-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.20  % Computer : n016.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:45:08 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24  Running first-order theorem proving
% 0.10/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
% 4.74/1.46  % (3721899)Input is clausal, will run a generic CNF schedule.
% 4.74/1.46  % (3721937)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1376598164:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.74/1.46  % (3721936)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3596629062:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.74/1.46  % (3721940)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1781769351:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.74/1.46  % (3721939)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1632725548:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.74/1.46  % (3721935)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=244786547:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.74/1.46  % (3721941)dis-21_1_sil=8000:lcm=predicate:random_seed=2874165432: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.74/1.46  % (3721938)lrs+10_1_sil=8000:sp=occurrence:random_seed=862155190:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.74/1.46  % (3721938)First to succeed.
% 4.74/1.46  % (3721940)Also succeeded, but the first one will report.
% 4.74/1.46  % (3721938)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3721899"
% 4.74/1.46  % (3721939)Also succeeded, but the first one will report.
% 4.74/1.46  % (3721941)Instruction limit reached! 
% 4.74/1.46  % (3721941)------------------------------
% 4.74/1.46  % (3721941)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.46  % (3721941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.46  % (3721941)CaDiCaL version: 2.1.3
% 4.74/1.46  % (3721941)Termination reason: Instruction limit
% 4.74/1.46  % (3721941)Termination phase: Saturation
% 4.74/1.46  % (3721941)Time elapsed: 0.080 s
% 4.74/1.46  % (3721941)Peak memory usage: 89 MB
% 4.74/1.46  % (3721941)Instructions burned: 117 (million)
% 4.74/1.46  % (3721959)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=558061228:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.74/1.46  % (3721959)Refutation not found, incomplete strategy
% 4.74/1.46  % (3721959)------------------------------
% 4.74/1.46  % (3721959)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.46  % (3721959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.46  % (3721959)CaDiCaL version: 2.1.3
% 4.74/1.46  % (3721959)Termination reason: Refutation not found, incomplete strategy
% 4.74/1.46  % (3721959)Time elapsed: 0.001 s
% 4.74/1.46  % (3721959)Peak memory usage: 87 MB
% 4.74/1.46  % (3721959)Instructions burned: 1 (million)
% 4.74/1.46  % (3721938)Refutation found. Thanks to Tanya!
% 4.74/1.46  % SZS status Unsatisfiable for theBenchmark
% 4.74/1.46  % SZS output start Proof for theBenchmark
% See solution above
% 4.74/1.46  % (3721938)------------------------------
% 4.74/1.46  % (3721938)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.46  % (3721938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.46  % (3721938)CaDiCaL version: 2.1.3
% 4.74/1.46  % (3721938)Termination reason: Refutation
% 4.74/1.46  % (3721938)Time elapsed: 0.035 s
% 4.74/1.46  % (3721938)Peak memory usage: 90 MB
% 4.74/1.46  % (3721938)Instructions burned: 33 (million)
% 4.74/1.46  % (3721938)------------------------------
% 4.74/1.46  % (3721938)------------------------------
% 4.74/1.46  % (3721899)Success in time 0.592 s
% 4.74/1.46  % Vampire exiting
%------------------------------------------------------------------------------