↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC016-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.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:02:03 PM UTC 2026

% Result   : Unsatisfiable 3.51s 1.39s
% Output   : Refutation 3.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   58 (   8 unt;   8 def)
%            Number of atoms       :  145 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  171 (  84   ~;  79   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ( ssList(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( neq(sk5,nil)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( frontsegP(sk4,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( frontsegP(sk3,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( nil = sk2
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f212,negated_conjecture,
    ! [X0] :
      ( nil = sk2
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk2,X0)
      | ~ frontsegP(sk1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f213,negated_conjecture,
    ( nil != sk1
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f214,negated_conjecture,
    ! [X0] :
      ( nil != sk1
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk2,X0)
      | ~ frontsegP(sk1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f217,plain,
    ( nil = sk4
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f211,f204,f204]) ).

fof(f218,plain,
    ! [X0] :
      ( nil = sk4
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(definition_unfolding,[],[f212,f204,f204,f205]) ).

fof(f219,plain,
    ( nil != sk3
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f213,f205,f204]) ).

fof(f220,plain,
    ! [X0] :
      ( nil != sk3
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(definition_unfolding,[],[f214,f205,f204,f205]) ).

fof(f240,definition,
    ( spl0_4
  <=> ! [X0] :
        ( ~ ssList(X0)
        | ~ frontsegP(sk3,X0)
        | ~ frontsegP(sk4,X0)
        | ~ neq(X0,nil) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f241,plain,
    ( ! [X0] :
        ( ~ neq(X0,nil)
        | ~ frontsegP(sk3,X0)
        | ~ frontsegP(sk4,X0)
        | ~ ssList(X0) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f240]) ).

fof(f243,definition,
    ( spl0_5
  <=> nil = sk3 ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f245,plain,
    ( spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f220,f243,f240]) ).

fof(f247,definition,
    ( spl0_6
  <=> neq(sk4,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f249,plain,
    ( spl0_6
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f219,f243,f247]) ).

fof(f251,definition,
    ( spl0_7
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f253,plain,
    ( spl0_4
    | spl0_7 ),
    inference(avatar_split_clause,[],[f218,f251,f240]) ).

fof(f254,plain,
    ( spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f217,f251,f247]) ).

fof(f257,definition,
    ( spl0_8
  <=> frontsegP(sk3,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f258,plain,
    ( frontsegP(sk3,sk5)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( ~ spl0_6
    | spl0_8 ),
    inference(avatar_split_clause,[],[f210,f257,f247]) ).

fof(f261,definition,
    ( spl0_9
  <=> frontsegP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f262,plain,
    ( frontsegP(sk4,sk5)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f263,plain,
    ( ~ spl0_6
    | spl0_9 ),
    inference(avatar_split_clause,[],[f209,f261,f247]) ).

fof(f265,definition,
    ( spl0_10
  <=> neq(sk5,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f266,plain,
    ( neq(sk5,nil)
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f267,plain,
    ( ~ spl0_6
    | spl0_10 ),
    inference(avatar_split_clause,[],[f208,f265,f247]) ).

fof(f269,definition,
    ( spl0_11
  <=> ssList(sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f270,plain,
    ( ssList(sk5)
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f271,plain,
    ( ~ spl0_6
    | spl0_11 ),
    inference(avatar_split_clause,[],[f207,f269,f247]) ).

fof(f274,plain,
    ( ~ spl0_7
    | spl0_5 ),
    inference(avatar_split_clause,[],[f206,f243,f251]) ).

fof(f278,plain,
    ( ~ frontsegP(sk3,sk5)
    | ~ frontsegP(sk4,sk5)
    | ~ ssList(sk5)
    | ~ spl0_4
    | ~ spl0_10 ),
    inference(resolution,[],[f241,f266]) ).

fof(f279,plain,
    ( ~ frontsegP(sk4,sk5)
    | ~ ssList(sk5)
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f278,f258]) ).

fof(f281,plain,
    ( ~ ssList(sk5)
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f279,f262]) ).

fof(f289,plain,
    ( $false
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f281,f270]) ).

fof(f290,plain,
    ( ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(avatar_contradiction_clause,[],[f289]) ).

cnf(s3,plain,
    ( spl0_4
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f245]) ).

cnf(s4,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f249]) ).

cnf(s5,plain,
    ( spl0_4
    | spl0_7 ),
    inference(sat_conversion,[],[f253]) ).

cnf(s6,plain,
    ( spl0_6
    | spl0_7 ),
    inference(sat_conversion,[],[f254]) ).

cnf(s7,plain,
    ( ~ spl0_6
    | spl0_8 ),
    inference(sat_conversion,[],[f259]) ).

cnf(s8,plain,
    ( ~ spl0_6
    | spl0_9 ),
    inference(sat_conversion,[],[f263]) ).

cnf(s9,plain,
    ( ~ spl0_6
    | spl0_10 ),
    inference(sat_conversion,[],[f267]) ).

cnf(s10,plain,
    ( ~ spl0_6
    | spl0_11 ),
    inference(sat_conversion,[],[f271]) ).

cnf(s11,plain,
    ( spl0_5
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f274]) ).

cnf(s13,plain,
    ( ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11 ),
    inference(sat_conversion,[],[f290]) ).

cnf(s14,plain,
    spl0_4,
    inference(rat,[],[s11,s3,s5]) ).

cnf(s15,plain,
    ~ spl0_6,
    inference(rat,[],[s13,s7,s8,s9,s10,s14]) ).

cnf(s16,plain,
    spl0_7,
    inference(rat,[],[s6,s15]) ).

cnf(s17,plain,
    ~ spl0_5,
    inference(rat,[],[s4,s15]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s11,s16,s17]) ).

fof(f291,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC016-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n020.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 07:27:20 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  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
% 3.51/1.39  % (17391)Input is clausal, will run a generic CNF schedule.
% 3.51/1.39  % (17397)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3164087706:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.51/1.39  % (17398)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3768406306:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.51/1.39  % (17400)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3636679659:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.51/1.39  % (17399)lrs+10_1_sil=8000:sp=occurrence:random_seed=3353541930:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.51/1.39  % (17396)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=147118317:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.51/1.39  % (17400)First to succeed.
% 3.51/1.39  % (17399)Also succeeded, but the first one will report.
% 3.51/1.39  % (17400)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17391"
% 3.51/1.39  % (17401)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1553227563:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.51/1.39  % (17402)dis-21_1_sil=8000:lcm=predicate:random_seed=2096411028: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)
% 3.51/1.39  % (17402)Also succeeded, but the first one will report.
% 3.51/1.39  % (17401)Also succeeded, but the first one will report.
% 3.51/1.39  % (17400)Refutation found. Thanks to Tanya!
% 3.51/1.39  % SZS status Unsatisfiable for theBenchmark
% 3.51/1.39  % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.39  % (17400)------------------------------
% 3.51/1.39  % (17400)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.39  % (17400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.39  % (17400)CaDiCaL version: 2.1.3
% 3.51/1.39  % (17400)Termination reason: Refutation
% 3.51/1.39  % (17400)Time elapsed: 0.004 s
% 3.51/1.39  % (17400)Peak memory usage: 89 MB
% 3.51/1.39  % (17400)Instructions burned: 3 (million)
% 3.51/1.39  % (17400)------------------------------
% 3.51/1.39  % (17400)------------------------------
% 3.51/1.39  % (17391)Success in time 0.436 s
% 3.51/1.39  % Vampire exiting
%------------------------------------------------------------------------------