↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.69s 0.84s
% Output   : Refutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   50 (  14 unt;   5 def)
%            Number of atoms       :   96 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   88 (  42   ~;  41   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    totalorderedP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

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

fof(f67,axiom,
    ! [X0] :
      ( totalorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause67) ).

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

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

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

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

fof(f206,negated_conjecture,
    ~ totalorderedP(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

fof(f210,plain,
    ( sk3 = cons(sk5,nil)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f209]) ).

fof(f214,plain,
    ~ totalorderedP(sk3),
    inference(definition_unfolding,[],[f206,f205]) ).

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

fof(f230,plain,
    ( ~ neq(sk4,nil)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f228]) ).

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

fof(f239,plain,
    ( sk3 = cons(sk5,nil)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f240,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f210,f237,f228]) ).

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

fof(f244,plain,
    ( ssItem(sk5)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f242]) ).

fof(f245,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f208,f242,f228]) ).

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

fof(f249,plain,
    ( nil != sk4
    | spl0_5 ),
    inference(avatar_component_clause,[],[f247]) ).

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

fof(f253,plain,
    ( nil = sk3
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f254,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(avatar_split_clause,[],[f207,f251,f247]) ).

fof(f272,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil = sk4
    | spl0_1 ),
    inference(resolution,[],[f102,f230]) ).

fof(f277,plain,
    ( ~ ssList(nil)
    | nil = sk4
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f272,f203]) ).

fof(f278,plain,
    ( nil = sk4
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f277,f8]) ).

fof(f279,plain,
    ( $false
    | spl0_1
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f278,f249]) ).

fof(f280,plain,
    ( spl0_1
    | spl0_5 ),
    inference(avatar_contradiction_clause,[],[f279]) ).

fof(f287,plain,
    ( ~ totalorderedP(nil)
    | ~ spl0_6 ),
    inference(superposition,[],[f214,f253]) ).

fof(f289,plain,
    ( $false
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f287,f4]) ).

fof(f290,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f289]) ).

fof(f292,plain,
    ( totalorderedP(sk3)
    | ~ ssItem(sk5)
    | ~ spl0_3 ),
    inference(superposition,[],[f67,f239]) ).

fof(f298,plain,
    ( ~ ssItem(sk5)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f292,f214]) ).

fof(f300,plain,
    ( $false
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f298,f244]) ).

fof(f301,plain,
    ( ~ spl0_3
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f300]) ).

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

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

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

cnf(s5,plain,
    ( spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f280]) ).

cnf(s6,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f290]) ).

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

cnf(s8,plain,
    ~ spl0_5,
    inference(rat,[],[s4,s6]) ).

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

cnf(s10,plain,
    spl0_4,
    inference(rat,[],[s3,s9]) ).

cnf(s11,plain,
    ~ spl0_3,
    inference(rat,[],[s7,s10]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s2,s11,s9]) ).

fof(f302,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWC275-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Mon Sep 28 08:50:19 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.00/0.11  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.13  Running first-order theorem proving
% 0.08/0.13  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.69/0.84  % (3241902)Input is clausal, will run a generic CNF schedule.
% 2.69/0.84  % (3241936)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=434837808:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.69/0.84  % (3241935)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1191257192:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.69/0.84  % (3241937)lrs+10_1_sil=8000:sp=occurrence:random_seed=3903454856:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.69/0.84  % (3241937)First to succeed.
% 2.69/0.84  % (3241937)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3241902"
% 2.69/0.84  % (3241934)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=109278078:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.69/0.84  % (3241939)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3705473144:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.69/0.84  % (3241940)dis-21_1_sil=8000:lcm=predicate:random_seed=3304082518: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.69/0.84  % (3241938)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3955251962:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.69/0.84  % (3241938)Also succeeded, but the first one will report.
% 2.69/0.84  % (3241939)Also succeeded, but the first one will report.
% 2.69/0.84  % (3241940)Instruction limit reached! 
% 2.69/0.84  % (3241940)------------------------------
% 2.69/0.84  % (3241940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/0.84  % (3241940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/0.84  % (3241940)CaDiCaL version: 2.1.3
% 2.69/0.84  % (3241940)Termination reason: Instruction limit
% 2.69/0.84  % (3241940)Termination phase: Saturation
% 2.69/0.84  % (3241940)Time elapsed: 0.038 s
% 2.69/0.84  % (3241940)Peak memory usage: 89 MB
% 2.69/0.84  % (3241940)Instructions burned: 119 (million)
% 2.69/0.84  % (3241956)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=1726578009:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.69/0.84  % (3241937)Refutation found. Thanks to Tanya!
% 2.69/0.84  % SZS status Unsatisfiable for theBenchmark
% 2.69/0.84  % SZS output start Proof for theBenchmark
% See solution above
% 2.69/0.84  % (3241937)------------------------------
% 2.69/0.84  % (3241937)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/0.84  % (3241937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/0.84  % (3241937)CaDiCaL version: 2.1.3
% 2.69/0.84  % (3241937)Termination reason: Refutation
% 2.69/0.84  % (3241937)Time elapsed: 0.004 s
% 2.69/0.84  % (3241937)Peak memory usage: 90 MB
% 2.69/0.84  % (3241937)Instructions burned: 5 (million)
% 2.69/0.84  % (3241937)------------------------------
% 2.69/0.84  % (3241937)------------------------------
% 2.69/0.84  % (3241902)Success in time 0.344 s
% 2.69/0.84  % Vampire exiting
%------------------------------------------------------------------------------