↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.50s 1.36s
% Output   : Refutation 2.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   36 (  15 unt;   2 def)
%            Number of atoms       :   81 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  103 (  58   ~;  43   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn  12   !;   0   ?)

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

fof(f206,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk3
      | ~ memberP(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,plain,
    ! [X2,X0,X1] :
      ( sk3 != app(app(X1,cons(X0,nil)),X2)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssItem(X0)
      | ~ memberP(X1,X0) ),
    inference(reorient_equations,[],[f206]) ).

fof(f208,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk3
      | ~ memberP(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f209,plain,
    ! [X2,X0,X1] :
      ( sk3 != app(app(X1,cons(X0,nil)),X2)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssItem(X0)
      | ~ memberP(X2,X0) ),
    inference(reorient_equations,[],[f208]) ).

fof(f210,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f211,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f212,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f213,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f214,plain,
    sk1 = app(app(sk6,cons(sk5,nil)),sk7),
    inference(reorient_equations,[],[f213]) ).

fof(f215,negated_conjecture,
    ( memberP(sk6,sk5)
    | memberP(sk7,sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f218,plain,
    sk3 = app(app(sk6,cons(sk5,nil)),sk7),
    inference(definition_unfolding,[],[f214,f205]) ).

fof(f226,definition,
    ( spl0_1
  <=> memberP(sk7,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f228,plain,
    ( memberP(sk7,sk5)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f226]) ).

fof(f230,definition,
    ( spl0_2
  <=> memberP(sk6,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f232,plain,
    ( memberP(sk6,sk5)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f230]) ).

fof(f233,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f215,f230,f226]) ).

fof(f234,plain,
    ( sk3 != sk3
    | ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(superposition,[],[f207,f218]) ).

fof(f235,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(trivial_inequality_removal,[],[f234]) ).

fof(f236,plain,
    ( ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(forward_subsumption_resolution,[],[f235,f211]) ).

fof(f237,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(forward_subsumption_resolution,[],[f236,f212]) ).

fof(f238,plain,
    ~ memberP(sk6,sk5),
    inference(forward_subsumption_resolution,[],[f237,f210]) ).

fof(f239,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f238,f232]) ).

fof(f240,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f239]) ).

fof(f241,plain,
    ( sk3 != sk3
    | ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(superposition,[],[f209,f218]) ).

fof(f242,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(trivial_inequality_removal,[],[f241]) ).

fof(f243,plain,
    ( ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(forward_subsumption_resolution,[],[f242,f211]) ).

fof(f244,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(forward_subsumption_resolution,[],[f243,f212]) ).

fof(f245,plain,
    ~ memberP(sk7,sk5),
    inference(forward_subsumption_resolution,[],[f244,f210]) ).

fof(f246,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f245,f228]) ).

fof(f247,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f246]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f233]) ).

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f240]) ).

cnf(s3,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f247]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

fof(f248,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC185-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.13/0.40  % Computer : n001.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Mon Sep 28 08:27:03 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44  Running first-order theorem proving
% 0.13/0.44  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.50/1.36  % (210308)Input is clausal, will run a generic CNF schedule.
% 2.50/1.36  % (210316)lrs+10_1_sil=8000:sp=occurrence:random_seed=553749568:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.50/1.36  % (210316)First to succeed.
% 2.50/1.36  % (210316)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-210308"
% 2.50/1.36  % (210314)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=383642326:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.50/1.36  % (210315)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2401788973:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.50/1.36  % (210313)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=31818982:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.50/1.36  % (210317)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=541061608:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.50/1.36  % (210318)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1520911868:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.50/1.36  % (210317)Also succeeded, but the first one will report.
% 2.50/1.36  % (210318)Also succeeded, but the first one will report.
% 2.50/1.36  % (210319)dis-21_1_sil=8000:lcm=predicate:random_seed=3522837804: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.50/1.36  % (210319)Also succeeded, but the first one will report.
% 2.50/1.36  % (210316)Refutation found. Thanks to Tanya!
% 2.50/1.36  % SZS status Unsatisfiable for theBenchmark
% 2.50/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.36  % (210316)------------------------------
% 2.50/1.36  % (210316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.36  % (210316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.36  % (210316)CaDiCaL version: 2.1.3
% 2.50/1.36  % (210316)Termination reason: Refutation
% 2.50/1.36  % (210316)Time elapsed: 0.002 s
% 2.50/1.36  % (210316)Peak memory usage: 89 MB
% 2.50/1.36  % (210316)Instructions burned: 3 (million)
% 2.50/1.36  % (210316)------------------------------
% 2.50/1.36  % (210316)------------------------------
% 2.50/1.36  % (210308)Success in time 0.276 s
% 2.50/1.36  % Vampire exiting
%------------------------------------------------------------------------------