↑ 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  : SWC185-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 : n007.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:01 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   34 (  15 unt;   2 def)
%            Number of atoms       :   77 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   99 (  56   ~;  41   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 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,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | app(app(X1,cons(X0,nil)),X2) != sk3
      | ~ memberP(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

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

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

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

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

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

fof(f215,negated_conjecture,
    ( memberP(sk6,sk5)
    | memberP(sk7,sk5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f218,plain,
    sk3 = app(app(sk6,cons(sk5,nil)),sk7),
    inference(definition_unfolding,[],[f214,f205]) ).

fof(f250,definition,
    ( spl0_1
  <=> memberP(sk7,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f252,plain,
    ( memberP(sk7,sk5)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f254,definition,
    ( spl0_2
  <=> memberP(sk6,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f257,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f215,f254,f250]) ).

fof(f300,plain,
    ( sk3 != sk3
    | ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(superposition,[],[f207,f218]) ).

fof(f301,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(trivial_inequality_removal,[],[f300]) ).

fof(f302,plain,
    ( ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(forward_subsumption_resolution,[],[f301,f211]) ).

fof(f303,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk6,sk5) ),
    inference(forward_subsumption_resolution,[],[f302,f212]) ).

fof(f304,plain,
    ~ memberP(sk6,sk5),
    inference(forward_subsumption_resolution,[],[f303,f210]) ).

fof(f307,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f304,f254]) ).

fof(f308,plain,
    ( sk3 != sk3
    | ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(superposition,[],[f209,f218]) ).

fof(f309,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(trivial_inequality_removal,[],[f308]) ).

fof(f310,plain,
    ( ~ ssList(sk7)
    | ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(forward_subsumption_resolution,[],[f309,f211]) ).

fof(f311,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk7,sk5) ),
    inference(forward_subsumption_resolution,[],[f310,f212]) ).

fof(f312,plain,
    ~ memberP(sk7,sk5),
    inference(forward_subsumption_resolution,[],[f311,f210]) ).

fof(f313,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f312,f252]) ).

fof(f314,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f313]) ).

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

cnf(s13,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f307]) ).

cnf(s14,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f314]) ).

cnf(s19,plain,
    $false,
    inference(rat,[],[s1,s13,s14]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC185-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.11/0.39  % Computer : n007.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Mon Sep 28 08:19:10 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.18/0.46  % (2242075)Will run a generic schedule for satisfiability detection.
% 0.18/0.46  % (2242083)dis+10_1_sil=32000:sp=arity:random_seed=2517623855:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.46  % (2242083) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2242075-2242083"...
% 0.18/0.46  % (2242081)% WARNING: option uhcvi not known.
% 0.18/0.46  % (2242083)...printing done.
% 0.18/0.46  % (2242083)Refutation found. Thanks to Tanya!
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46  % (2242083)------------------------------
% 0.18/0.46  % (2242083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46  % (2242083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46  % (2242083)CaDiCaL version: 2.1.3
% 0.18/0.46  % (2242083)Termination reason: Refutation
% 0.18/0.46  % (2242083)Time elapsed: 0.002 s
% 0.18/0.46  % (2242083)Peak memory usage: 12 MB
% 0.18/0.46  % (2242083)Instructions burned: 5 (million)
% 0.18/0.46  % (2242075)Success in time 0.031 s
% 0.18/0.46  % Vampire exiting
%------------------------------------------------------------------------------