↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.65s 1.34s
% Output   : Refutation 2.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (  14 unt;   4 def)
%            Number of atoms       :   95 (  19 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   91 (  43   ~;  44   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 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(f80,axiom,
    ! [X0] :
      ( ~ segmentP(nil,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause80) ).

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

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

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

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

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

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

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

fof(f213,negated_conjecture,
    ( neq(sk5,nil)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f214,negated_conjecture,
    ( segmentP(sk4,sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

fof(f216,plain,
    nil = sk4,
    inference(definition_unfolding,[],[f204,f205]) ).

fof(f219,plain,
    sk3 != sk4,
    inference(definition_unfolding,[],[f207,f216,f206]) ).

fof(f221,plain,
    ( ssList(sk5)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f209,f216]) ).

fof(f225,plain,
    ( neq(sk5,sk4)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f213,f216,f216]) ).

fof(f226,plain,
    ( segmentP(sk4,sk5)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f214,f216]) ).

fof(f229,plain,
    ! [X0] :
      ( ~ segmentP(sk4,X0)
      | ~ ssList(X0)
      | sk4 = X0 ),
    inference(definition_unfolding,[],[f80,f216,f216]) ).

fof(f237,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f118]) ).

fof(f243,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f237]) ).

fof(f256,definition,
    ( spl0_4
  <=> sk3 = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f257,plain,
    ( sk3 = sk4
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f256]) ).

fof(f263,definition,
    ( spl0_6
  <=> segmentP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f264,plain,
    ( segmentP(sk4,sk5)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f265,plain,
    ( spl0_4
    | spl0_6 ),
    inference(avatar_split_clause,[],[f226,f263,f256]) ).

fof(f267,definition,
    ( spl0_7
  <=> neq(sk5,sk4) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f268,plain,
    ( neq(sk5,sk4)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f269,plain,
    ( spl0_4
    | spl0_7 ),
    inference(avatar_split_clause,[],[f225,f267,f256]) ).

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

fof(f272,plain,
    ( ssList(sk5)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f271]) ).

fof(f273,plain,
    ( spl0_4
    | spl0_8 ),
    inference(avatar_split_clause,[],[f221,f271,f256]) ).

fof(f276,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f257,f219]) ).

fof(f277,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f276]) ).

fof(f279,plain,
    ( ~ ssList(sk5)
    | sk4 = sk5
    | ~ spl0_6 ),
    inference(resolution,[],[f229,f264]) ).

fof(f282,plain,
    ( sk4 = sk5
    | ~ spl0_6
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f279,f272]) ).

fof(f283,plain,
    ( neq(sk4,sk4)
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(superposition,[],[f268,f282]) ).

fof(f293,plain,
    ( ~ ssList(sk4)
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(resolution,[],[f243,f283]) ).

fof(f294,plain,
    ( $false
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f293,f203]) ).

fof(f295,plain,
    ( ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f294]) ).

cnf(s4,plain,
    ( spl0_4
    | spl0_6 ),
    inference(sat_conversion,[],[f265]) ).

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

cnf(s6,plain,
    ( spl0_4
    | spl0_8 ),
    inference(sat_conversion,[],[f273]) ).

cnf(s8,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f277]) ).

cnf(s9,plain,
    ( ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f295]) ).

cnf(s10,plain,
    spl0_8,
    inference(rat,[],[s6,s8]) ).

cnf(s11,plain,
    spl0_7,
    inference(rat,[],[s5,s8]) ).

cnf(s12,plain,
    ~ spl0_6,
    inference(rat,[],[s9,s10,s11]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s4,s12,s8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC037-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.37  % Computer : n016.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 07:37:33 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  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
% 2.65/1.34  % (3456418)Input is clausal, will run a generic CNF schedule.
% 2.65/1.34  % (3456427)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=205051458:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.65/1.34  % (3456427)First to succeed.
% 2.65/1.34  % (3456427)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3456418"
% 2.65/1.34  % (3456428)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1034468475:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.65/1.34  % (3456426)lrs+10_1_sil=8000:sp=occurrence:random_seed=1974886240:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.65/1.34  % (3456423)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=1857029817:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.65/1.34  % (3456425)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=679415405:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.65/1.34  % (3456424)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3896893918:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.65/1.34  % (3456426)Also succeeded, but the first one will report.
% 2.65/1.34  % (3456429)dis-21_1_sil=8000:lcm=predicate:random_seed=2944961810: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.65/1.34  % (3456428)Also succeeded, but the first one will report.
% 2.65/1.34  % (3456429)Instruction limit reached! 
% 2.65/1.34  % (3456429)------------------------------
% 2.65/1.34  % (3456429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.34  % (3456429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.34  % (3456429)CaDiCaL version: 2.1.3
% 2.65/1.34  % (3456429)Termination reason: Instruction limit
% 2.65/1.34  % (3456429)Termination phase: Saturation
% 2.65/1.34  % (3456429)Time elapsed: 0.071 s
% 2.65/1.34  % (3456429)Peak memory usage: 90 MB
% 2.65/1.34  % (3456429)Instructions burned: 117 (million)
% 2.65/1.34  % (3456427)Refutation found. Thanks to Tanya!
% 2.65/1.34  % SZS status Unsatisfiable for theBenchmark
% 2.65/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.34  % (3456427)------------------------------
% 2.65/1.34  % (3456427)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.34  % (3456427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.34  % (3456427)CaDiCaL version: 2.1.3
% 2.65/1.34  % (3456427)Termination reason: Refutation
% 2.65/1.34  % (3456427)Time elapsed: 0.002 s
% 2.65/1.34  % (3456427)Peak memory usage: 89 MB
% 2.65/1.34  % (3456427)Instructions burned: 3 (million)
% 2.65/1.34  % (3456427)------------------------------
% 2.65/1.34  % (3456427)------------------------------
% 2.65/1.34  % (3456418)Success in time 0.294 s
% 2.65/1.34  % Vampire exiting
%------------------------------------------------------------------------------