↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 3.61s 1.49s
% Output   : Refutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   40 (   9 unt;   4 def)
%            Number of atoms       :   79 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   74 (  35   ~;  35   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    3 (   0 sgn   3   !;   0   ?)

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

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,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk2,X0)
      | ~ frontsegP(sk1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

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

fof(f211,negated_conjecture,
    ( nil = sk3
    | frontsegP(sk4,sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f214,plain,
    ! [X0] :
      ( ~ neq(X0,nil)
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(definition_unfolding,[],[f206,f204,f205]) ).

fof(f215,plain,
    ( nil != sk4
    | nil != sk3 ),
    inference(definition_unfolding,[],[f207,f204,f205]) ).

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

fof(f227,plain,
    ( frontsegP(sk4,sk3)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f225]) ).

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

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

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

fof(f236,plain,
    ( neq(sk3,nil)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f234]) ).

fof(f237,plain,
    ( spl0_3
    | spl0_2 ),
    inference(avatar_split_clause,[],[f210,f229,f234]) ).

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

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

fof(f243,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f208,f239,f234]) ).

fof(f244,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f215,f239,f229]) ).

fof(f245,plain,
    ( ~ ssList(sk3)
    | ~ frontsegP(sk4,sk3)
    | ~ frontsegP(sk3,sk3)
    | ~ spl0_3 ),
    inference(resolution,[],[f214,f236]) ).

fof(f246,plain,
    ( ~ ssList(sk3)
    | ~ frontsegP(sk4,sk3)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f245,f61]) ).

fof(f247,plain,
    ( ~ frontsegP(sk4,sk3)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f246,f202]) ).

fof(f248,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f247,f227]) ).

fof(f249,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f248]) ).

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

cnf(s2,plain,
    ( spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f237]) ).

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

cnf(s4,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f243]) ).

cnf(s5,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f244]) ).

cnf(s6,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f249]) ).

cnf(s7,plain,
    spl0_1,
    inference(rat,[],[s5,s1,s3]) ).

cnf(s8,plain,
    ~ spl0_3,
    inference(rat,[],[s6,s7]) ).

cnf(s9,plain,
    spl0_4,
    inference(rat,[],[s4,s8]) ).

cnf(s10,plain,
    spl0_2,
    inference(rat,[],[s2,s8]) ).

cnf(s11,plain,
    $false,
    inference(rat,[],[s5,s9,s10]) ).

fof(f250,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC020-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 : n006.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.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 07:27:25 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.61/1.49  % (3795580)Input is clausal, will run a generic CNF schedule.
% 3.61/1.49  % (3795586)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1191026832:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.61/1.49  % (3795589)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=46577154:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.61/1.49  % (3795585)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=243093272:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.61/1.49  % (3795588)lrs+10_1_sil=8000:sp=occurrence:random_seed=1530395145:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.61/1.49  % (3795587)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=224500947:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.61/1.49  % (3795591)dis-21_1_sil=8000:lcm=predicate:random_seed=2980172513: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.61/1.49  % (3795590)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3953192444:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.61/1.49  % (3795589)Also succeeded, but the first one will report.
% 3.61/1.49  % (3795588)First to succeed.
% 3.61/1.49  % (3795588)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3795580"
% 3.61/1.49  % (3795591)Also succeeded, but the first one will report.
% 3.61/1.49  % (3795590)Also succeeded, but the first one will report.
% 3.61/1.49  % (3795588)Refutation found. Thanks to Tanya!
% 3.61/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.61/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.49  % (3795588)------------------------------
% 3.61/1.49  % (3795588)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.49  % (3795588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.49  % (3795588)CaDiCaL version: 2.1.3
% 3.61/1.49  % (3795588)Termination reason: Refutation
% 3.61/1.49  % (3795588)Time elapsed: 0.003 s
% 3.61/1.49  % (3795588)Peak memory usage: 89 MB
% 3.61/1.49  % (3795588)Instructions burned: 2 (million)
% 3.61/1.49  % (3795588)------------------------------
% 3.61/1.49  % (3795588)------------------------------
% 3.61/1.49  % (3795580)Success in time 0.436 s
% 3.61/1.49  % Vampire exiting
%------------------------------------------------------------------------------