↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n008.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:05:02 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.43s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   46 (  23 unt;   5 def)
%            Number of atoms       :   94 (  17 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   89 (  41   ~;  43   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn  12   !;   0   ?)

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

fof(f206,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | X0 = X1
      | app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | X0 = X1
      | sk3 != app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) ),
    inference(reorient_equations,[],[f206]) ).

fof(f208,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f209,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f210,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f211,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f212,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f213,plain,
    sk1 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(reorient_equations,[],[f212]) ).

fof(f214,negated_conjecture,
    sk5 != sk6,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f217,plain,
    sk3 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(definition_unfolding,[],[f213,f205]) ).

fof(f368,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3)
      | ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | X0 = X1
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f207]) ).

fof(f369,plain,
    ~ ssItem(sk5),
    inference(consistent_polarity_flipping,[],[f208]) ).

fof(f370,plain,
    ~ ssItem(sk6),
    inference(consistent_polarity_flipping,[],[f209]) ).

fof(f419,plain,
    ( sk3 != sk3
    | ssItem(sk6)
    | ~ ssList(sk7)
    | ~ ssList(sk8)
    | sk5 = sk6
    | ssItem(sk5) ),
    inference(superposition,[],[f368,f217]) ).

fof(f420,plain,
    ( ssItem(sk6)
    | ~ ssList(sk7)
    | ~ ssList(sk8)
    | sk5 = sk6
    | ssItem(sk5) ),
    inference(trivial_inequality_removal,[],[f419]) ).

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

fof(f424,plain,
    ( ssItem(sk5)
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f422]) ).

fof(f426,definition,
    ( spl0_11
  <=> sk5 = sk6 ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f428,plain,
    ( sk5 = sk6
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f426]) ).

fof(f430,definition,
    ( spl0_12
  <=> ssList(sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f432,plain,
    ( ~ ssList(sk8)
    | spl0_12 ),
    inference(avatar_component_clause,[],[f430]) ).

fof(f434,definition,
    ( spl0_13
  <=> ssList(sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f436,plain,
    ( ~ ssList(sk7)
    | spl0_13 ),
    inference(avatar_component_clause,[],[f434]) ).

fof(f438,definition,
    ( spl0_14
  <=> ssItem(sk6) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f440,plain,
    ( ssItem(sk6)
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f438]) ).

fof(f441,plain,
    ( spl0_10
    | spl0_11
    | ~ spl0_12
    | ~ spl0_13
    | spl0_14 ),
    inference(avatar_split_clause,[],[f420,f438,f434,f430,f426,f422]) ).

fof(f442,plain,
    ( $false
    | spl0_12 ),
    inference(resolution,[],[f432,f211]) ).

fof(f443,plain,
    spl0_12,
    inference(avatar_contradiction_clause,[],[f442]) ).

fof(f444,plain,
    ( $false
    | spl0_13 ),
    inference(resolution,[],[f436,f210]) ).

fof(f445,plain,
    spl0_13,
    inference(avatar_contradiction_clause,[],[f444]) ).

fof(f446,plain,
    ( $false
    | ~ spl0_10 ),
    inference(resolution,[],[f424,f369]) ).

fof(f447,plain,
    ~ spl0_10,
    inference(avatar_contradiction_clause,[],[f446]) ).

fof(f449,plain,
    ( sk5 != sk5
    | ~ spl0_11 ),
    inference(superposition,[],[f214,f428]) ).

fof(f451,plain,
    ( $false
    | ~ spl0_11 ),
    inference(trivial_inequality_removal,[],[f449]) ).

fof(f452,plain,
    ~ spl0_11,
    inference(avatar_contradiction_clause,[],[f451]) ).

fof(f453,plain,
    ( $false
    | ~ spl0_14 ),
    inference(resolution,[],[f440,f370]) ).

fof(f454,plain,
    ~ spl0_14,
    inference(avatar_contradiction_clause,[],[f453]) ).

cnf(s11,plain,
    ( spl0_10
    | spl0_11
    | ~ spl0_12
    | ~ spl0_13
    | spl0_14 ),
    inference(sat_conversion,[],[f441]) ).

cnf(s12,plain,
    spl0_12,
    inference(sat_conversion,[],[f443]) ).

cnf(s13,plain,
    spl0_13,
    inference(sat_conversion,[],[f445]) ).

cnf(s14,plain,
    ~ spl0_10,
    inference(sat_conversion,[],[f447]) ).

cnf(s15,plain,
    ~ spl0_11,
    inference(sat_conversion,[],[f452]) ).

cnf(s16,plain,
    ~ spl0_14,
    inference(sat_conversion,[],[f454]) ).

cnf(s17,plain,
    $false,
    inference(rat,[],[s11,s16,s13,s12,s15,s14]) ).

fof(f455,plain,
    $false,
    inference(avatar_sat_refutation,[],[s17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC189-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.36  % Computer : n008.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 28 08:22:39 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  Running first-order model finding
% 0.10/0.39  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43  % (2096505)Will run a generic schedule for satisfiability detection.
% 0.10/0.43  % (2096516)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3539513075:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.43  % (2096516) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2096505-2096516"...
% 0.10/0.43  % (2096516)...printing done.
% 0.10/0.43  % (2096516)Refutation found. Thanks to Tanya!
% 0.10/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.43  % (2096516)------------------------------
% 0.10/0.43  % (2096516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43  % (2096516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43  % (2096516)CaDiCaL version: 2.1.3
% 0.10/0.43  % (2096516)Termination reason: Refutation
% 0.10/0.43  % (2096516)Time elapsed: 0.004 s
% 0.10/0.43  % (2096516)Peak memory usage: 12 MB
% 0.10/0.43  % (2096516)Instructions burned: 9 (million)
% 0.10/0.43  % (2096505)Success in time 0.032 s
% 0.10/0.43  % Vampire exiting
%------------------------------------------------------------------------------