↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 3.59s 1.49s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   67 (  10 unt;   5 def)
%            Number of atoms       :  156 (  21 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  171 (  82   ~;  84   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?)

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

fof(f58,axiom,
    ! [X0] :
      ( rearsegP(X0,nil)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause58) ).

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

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

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(f207,negated_conjecture,
    ( nil = sk2
    | ~ neq(sk1,nil)
    | ~ rearsegP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

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

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

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

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

fof(f217,plain,
    ( nil = sk4
    | ~ neq(sk3,nil)
    | ~ rearsegP(sk4,sk3) ),
    inference(definition_unfolding,[],[f207,f204,f205,f204,f205]) ).

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

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

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(f230,plain,
    ( ~ rearsegP(sk4,sk3)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f229]) ).

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(f241,plain,
    ( spl0_3
    | spl0_2 ),
    inference(avatar_split_clause,[],[f212,f233,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_1
    | ~ spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f219,f233,f238,f229]) ).

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

fof(f252,plain,
    ( neq(sk4,nil)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f253,plain,
    ( spl0_5
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f218,f233,f250]) ).

fof(f254,plain,
    ( ~ spl0_1
    | ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f217,f243,f238,f229]) ).

fof(f256,plain,
    ( neq(nil,nil)
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_demodulation,[],[f252,f245]) ).

fof(f257,plain,
    ( ~ rearsegP(sk4,nil)
    | spl0_1
    | ~ spl0_2 ),
    inference(superposition,[],[f230,f235]) ).

fof(f259,plain,
    ( ~ rearsegP(nil,nil)
    | spl0_1
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f257,f245]) ).

fof(f263,plain,
    ( ~ ssList(nil)
    | spl0_1
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(resolution,[],[f58,f259]) ).

fof(f264,plain,
    ( $false
    | spl0_1
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f263,f8]) ).

fof(f265,plain,
    ( spl0_1
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f264]) ).

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

fof(f272,plain,
    ( ~ ssList(nil)
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(resolution,[],[f226,f256]) ).

fof(f273,plain,
    ( $false
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f272,f8]) ).

fof(f274,plain,
    ( ~ spl0_4
    | ~ spl0_5 ),
    inference(avatar_contradiction_clause,[],[f273]) ).

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

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

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

fof(f291,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f290]) ).

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

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

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_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s6,plain,
    ( ~ spl0_2
    | spl0_5 ),
    inference(sat_conversion,[],[f253]) ).

cnf(s7,plain,
    ( ~ spl0_1
    | ~ spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f254]) ).

cnf(s9,plain,
    ( spl0_1
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f265]) ).

cnf(s11,plain,
    ( ~ spl0_4
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f274]) ).

cnf(s12,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f291]) ).

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

cnf(s14,plain,
    ~ spl0_2,
    inference(rat,[],[s4,s11,s5,s6,s13]) ).

cnf(s15,plain,
    ~ spl0_4,
    inference(rat,[],[s12,s13,s14]) ).

cnf(s16,plain,
    spl0_3,
    inference(rat,[],[s2,s14]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s7,s13,s15,s16]) ).

fof(f292,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC105-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.12/0.38  % Computer : n013.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 07:53:07 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/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
% 3.59/1.49  % (1010876)Input is clausal, will run a generic CNF schedule.
% 3.59/1.49  % (1010887)dis-21_1_sil=8000:lcm=predicate:random_seed=3340833944: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.49  % (1010887)Instruction limit reached! 
% 3.59/1.49  % (1010887)------------------------------
% 3.59/1.49  % (1010887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.49  % (1010887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.49  % (1010887)CaDiCaL version: 2.1.3
% 3.59/1.49  % (1010887)Termination reason: Instruction limit
% 3.59/1.49  % (1010887)Termination phase: Saturation
% 3.59/1.49  % (1010887)Time elapsed: 0.026 s
% 3.59/1.49  % (1010887)Peak memory usage: 89 MB
% 3.59/1.49  % (1010887)Instructions burned: 117 (million)
% 3.59/1.49  % (1010886)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2856165450:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.59/1.49  % (1010884)lrs+10_1_sil=8000:sp=occurrence:random_seed=3102223718:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.59/1.49  % (1010882)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2160142868:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.59/1.49  % (1010881)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=514062734:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.59/1.49  % (1010885)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3075014336:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.59/1.49  % (1010883)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2194479603:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.59/1.49  % (1010884)First to succeed.
% 3.59/1.49  % (1010886)Also succeeded, but the first one will report.
% 3.59/1.49  % (1010885)Also succeeded, but the first one will report.
% 3.59/1.49  % (1010884)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1010876"
% 3.59/1.49  % (1010889)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=2449277192:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.59/1.49  % (1010889)Also succeeded, but the first one will report.
% 3.59/1.49  % (1010897)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=182034689:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 3.59/1.49  % (1010897)Also succeeded, but the first one will report.
% 3.59/1.49  % (1010884)Refutation found. Thanks to Tanya!
% 3.59/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.59/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.49  % (1010884)------------------------------
% 3.59/1.49  % (1010884)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.49  % (1010884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.49  % (1010884)CaDiCaL version: 2.1.3
% 3.59/1.49  % (1010884)Termination reason: Refutation
% 3.59/1.49  % (1010884)Time elapsed: 0.004 s
% 3.59/1.49  % (1010884)Peak memory usage: 90 MB
% 3.59/1.49  % (1010884)Instructions burned: 3 (million)
% 3.59/1.49  % (1010884)------------------------------
% 3.59/1.49  % (1010884)------------------------------
% 3.59/1.49  % (1010876)Success in time 0.427 s
% 3.59/1.49  % Vampire exiting
%------------------------------------------------------------------------------