↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n013.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:56 PM UTC 2026

% Result   : Unsatisfiable 3.39s 1.38s
% Output   : Refutation 3.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   49 (  18 unt;   5 def)
%            Number of atoms       :  101 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  103 (  51   ~;  47   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f80,axiom,
    ! [X0] :
      ( ~ segmentP(nil,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause80) ).

fof(f101,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

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

fof(f206,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ~ neq(sk1,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f212,negated_conjecture,
    ( segmentP(sk3,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f215,plain,
    neq(sk4,nil),
    inference(definition_unfolding,[],[f206,f204]) ).

fof(f216,plain,
    ~ neq(sk3,nil),
    inference(definition_unfolding,[],[f207,f205]) ).

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

fof(f229,definition,
    ( spl0_2
  <=> segmentP(sk3,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f231,plain,
    ( segmentP(sk3,sk5)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f229]) ).

fof(f232,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f212,f229,f225]) ).

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

fof(f241,plain,
    ( neq(sk5,nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f239]) ).

fof(f242,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f210,f239,f225]) ).

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

fof(f246,plain,
    ( ssList(sk5)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f244]) ).

fof(f247,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f209,f244,f225]) ).

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

fof(f255,plain,
    ( nil = sk3
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f257,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f215,f225]) ).

fof(f276,plain,
    ( ~ ssList(sk3)
    | ~ ssList(nil)
    | nil = sk3 ),
    inference(resolution,[],[f102,f216]) ).

fof(f279,plain,
    ( ~ ssList(nil)
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f276,f202]) ).

fof(f280,plain,
    nil = sk3,
    inference(forward_subsumption_resolution,[],[f279,f8]) ).

fof(f281,plain,
    spl0_7,
    inference(avatar_split_clause,[],[f280,f253]) ).

fof(f284,plain,
    ( segmentP(nil,sk5)
    | ~ spl0_2
    | ~ spl0_7 ),
    inference(superposition,[],[f231,f255]) ).

fof(f285,plain,
    ( ~ neq(nil,nil)
    | ~ spl0_7 ),
    inference(superposition,[],[f216,f255]) ).

fof(f290,plain,
    ( ~ ssList(sk5)
    | nil = sk5
    | ~ spl0_2
    | ~ spl0_7 ),
    inference(resolution,[],[f284,f80]) ).

fof(f291,plain,
    ( nil = sk5
    | ~ spl0_2
    | ~ spl0_5
    | ~ spl0_7 ),
    inference(forward_subsumption_resolution,[],[f290,f246]) ).

fof(f334,plain,
    ( neq(nil,nil)
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7 ),
    inference(superposition,[],[f241,f291]) ).

fof(f338,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7 ),
    inference(forward_subsumption_resolution,[],[f334,f285]) ).

fof(f339,plain,
    ( ~ spl0_2
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7 ),
    inference(avatar_contradiction_clause,[],[f338]) ).

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

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f242]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f247]) ).

cnf(s6,plain,
    spl0_1,
    inference(sat_conversion,[],[f257]) ).

cnf(s7,plain,
    spl0_7,
    inference(sat_conversion,[],[f281]) ).

cnf(s8,plain,
    ( ~ spl0_2
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f339]) ).

cnf(s9,plain,
    spl0_5,
    inference(rat,[],[s4,s6]) ).

cnf(s10,plain,
    spl0_4,
    inference(rat,[],[s3,s6]) ).

cnf(s11,plain,
    ~ spl0_2,
    inference(rat,[],[s8,s7,s9,s10]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s1,s11,s6]) ).

fof(f341,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC206-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n013.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 08:26:52 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 3.39/1.38  % (1022746)Input is clausal, will run a generic CNF schedule.
% 3.39/1.38  % (1022752)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1645153602:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.39/1.38  % (1022754)lrs+10_1_sil=8000:sp=occurrence:random_seed=2464695349:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.39/1.38  % (1022755)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1389153627:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.39/1.38  % (1022753)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3770396835:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.39/1.38  % (1022757)dis-21_1_sil=8000:lcm=predicate:random_seed=4184489729: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.39/1.38  % (1022751)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=2758290267:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.39/1.38  % (1022756)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=126274053:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.39/1.38  % (1022754)First to succeed.
% 3.39/1.38  % (1022755)Also succeeded, but the first one will report.
% 3.39/1.38  % (1022754)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1022746"
% 3.39/1.38  % (1022756)Also succeeded, but the first one will report.
% 3.39/1.38  % (1022757)Instruction limit reached! 
% 3.39/1.38  % (1022757)------------------------------
% 3.39/1.38  % (1022757)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.38  % (1022757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.38  % (1022757)CaDiCaL version: 2.1.3
% 3.39/1.38  % (1022757)Termination reason: Instruction limit
% 3.39/1.38  % (1022757)Termination phase: Saturation
% 3.39/1.38  % (1022757)Time elapsed: 0.050 s
% 3.39/1.38  % (1022757)Peak memory usage: 88 MB
% 3.39/1.38  % (1022757)Instructions burned: 119 (million)
% 3.39/1.38  % (1022765)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=1466809358:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.39/1.38  % (1022765)Also succeeded, but the first one will report.
% 3.39/1.38  % (1022754)Refutation found. Thanks to Tanya!
% 3.39/1.38  % SZS status Unsatisfiable for theBenchmark
% 3.39/1.38  % SZS output start Proof for theBenchmark
% See solution above
% 3.39/1.38  % (1022754)------------------------------
% 3.39/1.38  % (1022754)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.38  % (1022754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.38  % (1022754)CaDiCaL version: 2.1.3
% 3.39/1.38  % (1022754)Termination reason: Refutation
% 3.39/1.38  % (1022754)Time elapsed: 0.005 s
% 3.39/1.38  % (1022754)Peak memory usage: 89 MB
% 3.39/1.38  % (1022754)Instructions burned: 4 (million)
% 3.39/1.38  % (1022754)------------------------------
% 3.39/1.38  % (1022754)------------------------------
% 3.39/1.38  % (1022746)Success in time 0.42 s
% 3.39/1.38  % Vampire exiting
%------------------------------------------------------------------------------