↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n001.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:06 PM UTC 2026

% Result   : Unsatisfiable 0.16s 1.50s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   50 (   9 unt;   4 def)
%            Number of atoms       :  106 (  22 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  105 (  49   ~;  52   |;   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    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn   5   !;   0   ?)

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

fof(f82,axiom,
    ! [X0] :
      ( ~ rearsegP(nil,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause82) ).

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

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

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

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

fof(f206,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

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

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

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

fof(f213,negated_conjecture,
    ( nil = sk3
    | rearsegP(sk4,sk3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

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

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

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

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

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

fof(f231,plain,
    ( rearsegP(sk4,sk3)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f229]) ).

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

fof(f234,plain,
    ( nil != sk3
    | spl0_2 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f235,plain,
    ( nil = sk3
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f236,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f213,f233,f229]) ).

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

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

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

fof(f245,plain,
    ( nil = sk4
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f243]) ).

fof(f246,plain,
    ( spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f211,f243,f229]) ).

fof(f247,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f210,f243,f238]) ).

fof(f248,plain,
    ( ~ spl0_4
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f219,f233,f243]) ).

fof(f249,plain,
    ( spl0_2
    | spl0_4 ),
    inference(avatar_split_clause,[],[f216,f243,f233]) ).

fof(f250,plain,
    ( rearsegP(nil,sk3)
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(superposition,[],[f231,f245]) ).

fof(f260,plain,
    ( ~ ssList(sk3)
    | nil = sk3
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f82,f250]) ).

fof(f265,plain,
    ( nil = sk3
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f260,f202]) ).

fof(f266,plain,
    ( $false
    | ~ spl0_1
    | spl0_2
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f265,f234]) ).

fof(f267,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f266]) ).

fof(f270,plain,
    ( neq(nil,nil)
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(superposition,[],[f240,f235]) ).

fof(f277,plain,
    ( ~ ssList(nil)
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(resolution,[],[f270,f226]) ).

fof(f278,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f277,f8]) ).

fof(f279,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f278]) ).

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

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

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

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

cnf(s6,plain,
    ( spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f249]) ).

cnf(s7,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f267]) ).

cnf(s8,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f279]) ).

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

cnf(s10,plain,
    ~ spl0_2,
    inference(rat,[],[s4,s5,s8]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC028-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37  % Computer : n001.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8046.5625MB
% 0.13/0.37  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 28 07:36:33 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41  Running first-order theorem proving
% 0.13/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/1.50  % (189099)Input is clausal, will run a generic CNF schedule.
% 0.16/1.50  % (189111)dis-21_1_sil=8000:lcm=predicate:random_seed=4104577832: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)
% 0.16/1.50  % (189111)Instruction limit reached! 
% 0.16/1.50  % (189111)------------------------------
% 0.16/1.50  % (189111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50  % (189111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50  % (189111)CaDiCaL version: 2.1.3
% 0.16/1.50  % (189111)Termination reason: Instruction limit
% 0.16/1.50  % (189111)Termination phase: Saturation
% 0.16/1.50  % (189111)Time elapsed: 0.029 s
% 0.16/1.50  % (189111)Peak memory usage: 89 MB
% 0.16/1.50  % (189111)Instructions burned: 122 (million)
% 0.16/1.50  % (189106)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1587142444:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.16/1.50  % (189110)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2800189994:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.16/1.50  % (189108)lrs+10_1_sil=8000:sp=occurrence:random_seed=3807619509:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.16/1.50  % (189105)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=1980704824:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.16/1.50  % (189109)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2550151526:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.16/1.50  % (189107)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=99790928:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.16/1.50  % (189109)Also succeeded, but the first one will report.
% 0.16/1.50  % (189108)First to succeed.
% 0.16/1.50  % (189108)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-189099"
% 0.16/1.50  % (189110)Also succeeded, but the first one will report.
% 0.16/1.50  % (189113)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=1807609914:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 0.16/1.50  % (189113)Also succeeded, but the first one will report.
% 0.16/1.50  % (189108)Refutation found. Thanks to Tanya!
% 0.16/1.50  % SZS status Unsatisfiable for theBenchmark
% 0.16/1.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.50  % (189108)------------------------------
% 0.16/1.50  % (189108)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50  % (189108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50  % (189108)CaDiCaL version: 2.1.3
% 0.16/1.50  % (189108)Termination reason: Refutation
% 0.16/1.50  % (189108)Time elapsed: 0.004 s
% 0.16/1.50  % (189108)Peak memory usage: 90 MB
% 0.16/1.50  % (189108)Instructions burned: 3 (million)
% 0.16/1.50  % (189108)------------------------------
% 0.16/1.50  % (189108)------------------------------
% 0.16/1.50  % (189099)Success in time 0.445 s
% 0.16/1.50  % Vampire exiting
%------------------------------------------------------------------------------