↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC364-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 : n005.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:03:39 PM UTC 2026

% Result   : Unsatisfiable 3.59s 1.08s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   56 (  15 unt;   5 def)
%            Number of atoms       :  130 (   9 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  143 (  69   ~;  69   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   6 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?)

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

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

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause86) ).

fof(f187,axiom,
    ! [X2,X3,X0,X1] :
      ( app(app(X0,X1),X2) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | segmentP(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause173) ).

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

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

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)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

fof(f213,negated_conjecture,
    ( app(cons(sk5,nil),sk3) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f214,plain,
    ( sk4 = app(cons(sk5,nil),sk3)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f213]) ).

fof(f215,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

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

fof(f223,plain,
    ( ~ segmentP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f215,f204,f205]) ).

fof(f228,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

fof(f233,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f218]) ).

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

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

fof(f241,plain,
    ( ~ segmentP(sk4,sk3)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f239]) ).

fof(f242,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f223,f239,f235]) ).

fof(f244,definition,
    ( spl0_3
  <=> sk4 = app(cons(sk5,nil),sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f246,plain,
    ( sk4 = app(cons(sk5,nil),sk3)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f244]) ).

fof(f247,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f214,f244,f235]) ).

fof(f249,definition,
    ( spl0_4
  <=> ssItem(sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f251,plain,
    ( ssItem(sk5)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f249]) ).

fof(f252,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f212,f249,f235]) ).

fof(f256,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f233,f235]) ).

fof(f258,plain,
    sk4 = app(sk4,nil),
    inference(resolution,[],[f73,f203]) ).

fof(f295,definition,
    ( spl0_6
  <=> ssList(cons(sk5,nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f296,plain,
    ( ssList(cons(sk5,nil))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f295]) ).

fof(f297,plain,
    ( ~ ssList(cons(sk5,nil))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f295]) ).

fof(f303,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sk5)
    | spl0_6 ),
    inference(resolution,[],[f297,f86]) ).

fof(f304,plain,
    ( ~ ssItem(sk5)
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f303,f8]) ).

fof(f305,plain,
    ( $false
    | ~ spl0_4
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f304,f251]) ).

fof(f306,plain,
    ( ~ spl0_4
    | spl0_6 ),
    inference(avatar_contradiction_clause,[],[f305]) ).

fof(f478,plain,
    ( ! [X0] :
        ( segmentP(app(sk4,X0),sk3)
        | ~ ssList(cons(sk5,nil))
        | ~ ssList(sk3)
        | ~ ssList(app(sk4,X0))
        | ~ ssList(X0) )
    | ~ spl0_3 ),
    inference(superposition,[],[f228,f246]) ).

fof(f485,plain,
    ( ! [X0] :
        ( segmentP(app(sk4,X0),sk3)
        | ~ ssList(sk3)
        | ~ ssList(app(sk4,X0))
        | ~ ssList(X0) )
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f478,f296]) ).

fof(f489,plain,
    ( ! [X0] :
        ( segmentP(app(sk4,X0),sk3)
        | ~ ssList(app(sk4,X0))
        | ~ ssList(X0) )
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f485,f202]) ).

fof(f517,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk4)
    | ~ ssList(nil)
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(superposition,[],[f489,f258]) ).

fof(f520,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | spl0_2
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f517,f241]) ).

fof(f523,plain,
    ( ~ ssList(nil)
    | spl0_2
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f520,f203]) ).

fof(f524,plain,
    ( $false
    | spl0_2
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f523,f8]) ).

fof(f525,plain,
    ( spl0_2
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f524]) ).

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

cnf(s2,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f247]) ).

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

cnf(s7,plain,
    spl0_1,
    inference(sat_conversion,[],[f256]) ).

cnf(s9,plain,
    ( ~ spl0_4
    | spl0_6 ),
    inference(sat_conversion,[],[f306]) ).

cnf(s10,plain,
    ( spl0_2
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f525]) ).

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

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

cnf(s13,plain,
    spl0_3,
    inference(rat,[],[s2,s7]) ).

cnf(s14,plain,
    spl0_2,
    inference(rat,[],[s10,s12,s13]) ).

cnf(s15,plain,
    $false,
    inference(rat,[],[s1,s14,s7]) ).

fof(f526,plain,
    $false,
    inference(avatar_sat_refutation,[],[s15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC364-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.09/0.20  % Computer : n005.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 09:17:46 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running first-order theorem proving
% 0.09/0.24  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.59/1.08  % (661913)Input is clausal, will run a generic CNF schedule.
% 3.59/1.08  % (661924)dis-21_1_sil=8000:lcm=predicate:random_seed=3713333359: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.59/1.08  % (661924)Instruction limit reached! 
% 3.59/1.08  % (661924)------------------------------
% 3.59/1.08  % (661924)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.08  % (661924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.08  % (661924)CaDiCaL version: 2.1.3
% 3.59/1.08  % (661924)Termination reason: Instruction limit
% 3.59/1.08  % (661924)Termination phase: Saturation
% 3.59/1.08  % (661924)Time elapsed: 0.036 s
% 3.59/1.08  % (661924)Peak memory usage: 90 MB
% 3.59/1.08  % (661924)Instructions burned: 121 (million)
% 3.59/1.08  % (661923)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1020410172:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.59/1.08  % (661921)lrs+10_1_sil=8000:sp=occurrence:random_seed=3784608065:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.59/1.08  % (661918)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=670964567:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.59/1.08  % (661920)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=619086548:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.59/1.08  % (661922)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=877888116:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.59/1.08  % (661919)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=362375220:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.59/1.08  % (661921)First to succeed.
% 3.59/1.08  % (661921)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-661913"
% 3.59/1.08  % (661922)Also succeeded, but the first one will report.
% 3.59/1.08  % (661923)Also succeeded, but the first one will report.
% 3.59/1.08  % (661932)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=4246250927:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.59/1.08  % (661932)Also succeeded, but the first one will report.
% 3.59/1.08  % (661921)Refutation found. Thanks to Tanya!
% 3.59/1.08  % SZS status Unsatisfiable for theBenchmark
% 3.59/1.08  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.08  % (661921)------------------------------
% 3.59/1.08  % (661921)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.08  % (661921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.08  % (661921)CaDiCaL version: 2.1.3
% 3.59/1.08  % (661921)Termination reason: Refutation
% 3.59/1.08  % (661921)Time elapsed: 0.009 s
% 3.59/1.08  % (661921)Peak memory usage: 90 MB
% 3.59/1.08  % (661921)Instructions burned: 12 (million)
% 3.59/1.08  % (661921)------------------------------
% 3.59/1.08  % (661921)------------------------------
% 3.59/1.08  % (661913)Success in time 0.453 s
% 3.59/1.08  % Vampire exiting
%------------------------------------------------------------------------------