↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.64s 1.35s
% Output   : Refutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   53 (  11 unt;   6 def)
%            Number of atoms       :  127 (  14 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  146 (  72   ~;  68   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    7 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f57,axiom,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).

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,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

fof(f210,negated_conjecture,
    ! [X0] :
      ( nil = sk2
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ segmentP(sk2,X0)
      | ~ segmentP(sk1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

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

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

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

fof(f216,plain,
    ! [X0] :
      ( nil = sk4
      | ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0) ),
    inference(definition_unfolding,[],[f210,f204,f204,f205]) ).

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

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

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

fof(f239,plain,
    ( ! [X0] :
        ( ~ neq(X0,nil)
        | ~ segmentP(sk3,X0)
        | ~ segmentP(sk4,X0)
        | ~ ssList(X0) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f238]) ).

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

fof(f243,plain,
    ( spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f218,f241,f238]) ).

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

fof(f247,plain,
    ( spl0_6
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f217,f241,f245]) ).

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

fof(f251,plain,
    ( spl0_4
    | spl0_7 ),
    inference(avatar_split_clause,[],[f216,f249,f238]) ).

fof(f252,plain,
    ( spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f215,f249,f245]) ).

fof(f254,definition,
    ( spl0_8
  <=> segmentP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f255,plain,
    ( segmentP(sk4,sk3)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f257,plain,
    ( spl0_8
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f208,f245,f254]) ).

fof(f259,definition,
    ( spl0_9
  <=> neq(sk3,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f260,plain,
    ( neq(sk3,nil)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f261,plain,
    ( spl0_9
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f207,f245,f259]) ).

fof(f264,plain,
    ( ~ spl0_7
    | spl0_5 ),
    inference(avatar_split_clause,[],[f206,f241,f249]) ).

fof(f269,plain,
    ( ~ segmentP(sk3,sk3)
    | ~ segmentP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ spl0_4
    | ~ spl0_9 ),
    inference(resolution,[],[f239,f260]) ).

fof(f270,plain,
    ( ~ segmentP(sk3,sk3)
    | ~ ssList(sk3)
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f269,f255]) ).

fof(f272,plain,
    ( ~ segmentP(sk3,sk3)
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f270,f202]) ).

fof(f294,plain,
    ( ~ ssList(sk3)
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(resolution,[],[f57,f272]) ).

fof(f298,plain,
    ( $false
    | ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f294,f202]) ).

fof(f299,plain,
    ( ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f298]) ).

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

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

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

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

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

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

cnf(s9,plain,
    ( spl0_5
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f264]) ).

cnf(s15,plain,
    ( ~ spl0_4
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f299]) ).

cnf(s17,plain,
    spl0_7,
    inference(rat,[],[s15,s7,s8,s5,s6]) ).

cnf(s18,plain,
    spl0_5,
    inference(rat,[],[s9,s17]) ).

cnf(s20,plain,
    spl0_6,
    inference(rat,[],[s4,s18]) ).

cnf(s21,plain,
    spl0_4,
    inference(rat,[],[s3,s18]) ).

cnf(s24,plain,
    spl0_9,
    inference(rat,[],[s8,s20]) ).

cnf(s25,plain,
    spl0_8,
    inference(rat,[],[s7,s20]) ).

cnf(s27,plain,
    $false,
    inference(rat,[],[s15,s24,s21,s25]) ).

fof(f300,plain,
    $false,
    inference(avatar_sat_refutation,[],[s27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC059-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n010.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Mon Sep 28 07:40:03 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  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.64/1.35  % (1745676)Input is clausal, will run a generic CNF schedule.
% 2.64/1.35  % (1745685)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1245228686:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.64/1.35  % (1745685)First to succeed.
% 2.64/1.35  % (1745685)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1745676"
% 2.64/1.35  % (1745686)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3086848959:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.64/1.35  % (1745684)lrs+10_1_sil=8000:sp=occurrence:random_seed=2129104381:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.64/1.35  % (1745681)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=3232565675:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.64/1.35  % (1745683)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=138284683:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.64/1.35  % (1745682)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2680177759:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.64/1.35  % (1745686)Also succeeded, but the first one will report.
% 2.64/1.35  % (1745684)Also succeeded, but the first one will report.
% 2.64/1.35  % (1745687)dis-21_1_sil=8000:lcm=predicate:random_seed=2209792514: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.64/1.35  % (1745687)Also succeeded, but the first one will report.
% 2.64/1.35  % (1745685)Refutation found. Thanks to Tanya!
% 2.64/1.35  % SZS status Unsatisfiable for theBenchmark
% 2.64/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.35  % (1745685)------------------------------
% 2.64/1.35  % (1745685)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.35  % (1745685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.35  % (1745685)CaDiCaL version: 2.1.3
% 2.64/1.35  % (1745685)Termination reason: Refutation
% 2.64/1.35  % (1745685)Time elapsed: 0.002 s
% 2.64/1.35  % (1745685)Peak memory usage: 89 MB
% 2.64/1.35  % (1745685)Instructions burned: 3 (million)
% 2.64/1.35  % (1745685)------------------------------
% 2.64/1.35  % (1745685)------------------------------
% 2.64/1.35  % (1745676)Success in time 0.291 s
% 2.64/1.35  % Vampire exiting
%------------------------------------------------------------------------------