↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.75s 1.18s
% Output   : Refutation 2.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   55 (  11 unt;   6 def)
%            Number of atoms       :  117 (  23 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  121 (  59   ~;  56   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?)

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

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(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] :
      ( ~ ssItem(X0)
      | cons(X0,nil) != sk1
      | ~ memberP(sk2,X0) ),
    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,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

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

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

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

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

fof(f215,plain,
    ! [X0] :
      ( cons(X0,nil) != sk3
      | ~ ssItem(X0)
      | ~ memberP(sk4,X0) ),
    inference(definition_unfolding,[],[f206,f205,f204]) ).

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

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

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

fof(f238,definition,
    ( spl0_4
  <=> memberP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f239,plain,
    ( memberP(sk4,sk5)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f238]) ).

fof(f240,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f212,f238,f235]) ).

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

fof(f243,plain,
    ( sk3 = cons(sk5,nil)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f242]) ).

fof(f244,plain,
    ( ~ spl0_3
    | spl0_5 ),
    inference(avatar_split_clause,[],[f211,f242,f235]) ).

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

fof(f247,plain,
    ( ssItem(sk5)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f246]) ).

fof(f248,plain,
    ( ~ spl0_3
    | spl0_6 ),
    inference(avatar_split_clause,[],[f209,f246,f235]) ).

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

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

fof(f254,plain,
    ( nil != sk4
    | spl0_8 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f255,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f216,f253,f250]) ).

fof(f257,plain,
    ( ~ spl0_8
    | spl0_7 ),
    inference(avatar_split_clause,[],[f207,f250,f253]) ).

fof(f266,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil = sk4
    | spl0_3 ),
    inference(resolution,[],[f102,f236]) ).

fof(f271,plain,
    ( ~ ssList(nil)
    | nil = sk4
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f266,f203]) ).

fof(f272,plain,
    ( nil = sk4
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f271,f8]) ).

fof(f273,plain,
    ( $false
    | spl0_3
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f272,f254]) ).

fof(f274,plain,
    ( spl0_3
    | spl0_8 ),
    inference(avatar_contradiction_clause,[],[f273]) ).

fof(f275,plain,
    ( sk3 != sk3
    | ~ ssItem(sk5)
    | ~ memberP(sk4,sk5)
    | ~ spl0_5 ),
    inference(superposition,[],[f215,f243]) ).

fof(f280,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk4,sk5)
    | ~ spl0_5 ),
    inference(trivial_inequality_removal,[],[f275]) ).

fof(f284,plain,
    ( ~ memberP(sk4,sk5)
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f280,f247]) ).

fof(f288,plain,
    ( $false
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f284,f239]) ).

fof(f289,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f288]) ).

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

cnf(s3,plain,
    ( ~ spl0_3
    | spl0_5 ),
    inference(sat_conversion,[],[f244]) ).

cnf(s4,plain,
    ( ~ spl0_3
    | spl0_6 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s5,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f255]) ).

cnf(s6,plain,
    ( spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f257]) ).

cnf(s8,plain,
    ( spl0_3
    | spl0_8 ),
    inference(sat_conversion,[],[f274]) ).

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

cnf(s13,plain,
    ~ spl0_8,
    inference(rat,[],[s5,s6]) ).

cnf(s14,plain,
    spl0_3,
    inference(rat,[],[s8,s13]) ).

cnf(s15,plain,
    spl0_6,
    inference(rat,[],[s4,s14]) ).

cnf(s16,plain,
    spl0_5,
    inference(rat,[],[s3,s14]) ).

cnf(s17,plain,
    spl0_4,
    inference(rat,[],[s2,s14]) ).

cnf(s19,plain,
    $false,
    inference(rat,[],[s9,s15,s16,s17]) ).

fof(f291,plain,
    $false,
    inference(avatar_sat_refutation,[],[s19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC387-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 : n020.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:26:34 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
% 2.75/1.18  % (52501)Input is clausal, will run a generic CNF schedule.
% 2.75/1.18  % (52510)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1902931766:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.75/1.18  % (52510)First to succeed.
% 2.75/1.18  % (52510)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-52501"
% 2.75/1.18  % (52512)dis-21_1_sil=8000:lcm=predicate:random_seed=622403957: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.75/1.18  % (52506)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=380532620:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.75/1.18  % (52509)lrs+10_1_sil=8000:sp=occurrence:random_seed=1232720559:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.75/1.18  % (52511)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3907115071:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.75/1.18  % (52508)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2976671382:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.75/1.18  % (52507)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1353597624:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.75/1.18  % (52509)Also succeeded, but the first one will report.
% 2.75/1.18  % (52511)Also succeeded, but the first one will report.
% 2.75/1.18  % (52512)Instruction limit reached! 
% 2.75/1.18  % (52512)------------------------------
% 2.75/1.18  % (52512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.18  % (52512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.18  % (52512)CaDiCaL version: 2.1.3
% 2.75/1.18  % (52512)Termination reason: Instruction limit
% 2.75/1.18  % (52512)Termination phase: Saturation
% 2.75/1.18  % (52512)Time elapsed: 0.052 s
% 2.75/1.18  % (52512)Peak memory usage: 88 MB
% 2.75/1.18  % (52512)Instructions burned: 120 (million)
% 2.75/1.18  % (52510)Refutation found. Thanks to Tanya!
% 2.75/1.18  % SZS status Unsatisfiable for theBenchmark
% 2.75/1.18  % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.19  % (52510)------------------------------
% 2.75/1.19  % (52510)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.19  % (52510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.19  % (52510)CaDiCaL version: 2.1.3
% 2.75/1.19  % (52510)Termination reason: Refutation
% 2.75/1.19  % (52510)Time elapsed: 0.003 s
% 2.75/1.19  % (52510)Peak memory usage: 90 MB
% 2.75/1.19  % (52510)Instructions burned: 4 (million)
% 2.75/1.19  % (52510)------------------------------
% 2.75/1.19  % (52510)------------------------------
% 2.75/1.19  % (52501)Success in time 0.3 s
% 2.75/1.19  % Vampire exiting
%------------------------------------------------------------------------------