↑ 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  : SWC381-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n006.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:48 PM UTC 2026

% Result   : Unsatisfiable 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   41 (  11 unt;   5 def)
%            Number of atoms       :   90 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  100 (  51   ~;  44   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

fof(f206,negated_conjecture,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f213,negated_conjecture,
    ! [X0] :
      ( ~ ssItem(X0)
      | cons(X0,nil) != sk1
      | ~ memberP(sk2,X0)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f214,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f215,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

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

fof(f217,negated_conjecture,
    ( memberP(sk4,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f220,plain,
    ( neq(sk4,nil)
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f206,f204,f204]) ).

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

fof(f251,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f220]) ).

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

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

fof(f265,plain,
    ( memberP(sk4,sk5)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f266,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f217,f263,f259]) ).

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

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

fof(f271,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f216,f268,f259]) ).

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

fof(f275,plain,
    ( ssItem(sk5)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f273]) ).

fof(f276,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f214,f273,f259]) ).

fof(f278,definition,
    ( spl0_5
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ memberP(sk4,X0)
        | cons(X0,nil) != sk3 ) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f279,plain,
    ( ! [X0] :
        ( ~ memberP(sk4,X0)
        | ~ ssItem(X0)
        | cons(X0,nil) != sk3 )
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f280,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f226,f278,f259]) ).

fof(f285,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f251,f259]) ).

fof(f328,plain,
    ( ~ ssItem(sk5)
    | sk3 != cons(sk5,nil)
    | ~ spl0_2
    | ~ spl0_5 ),
    inference(resolution,[],[f279,f265]) ).

fof(f329,plain,
    ( sk3 != cons(sk5,nil)
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f328,f275]) ).

fof(f330,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f329,f270]) ).

fof(f331,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(avatar_contradiction_clause,[],[f330]) ).

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

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

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

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

cnf(s9,plain,
    spl0_1,
    inference(sat_conversion,[],[f285]) ).

cnf(s20,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f331]) ).

cnf(s25,plain,
    spl0_5,
    inference(rat,[],[s4,s9]) ).

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

cnf(s27,plain,
    spl0_3,
    inference(rat,[],[s2,s9]) ).

cnf(s28,plain,
    ~ spl0_2,
    inference(rat,[],[s20,s25,s26,s27]) ).

cnf(s29,plain,
    $false,
    inference(rat,[],[s1,s28,s9]) ).

fof(f332,plain,
    $false,
    inference(avatar_sat_refutation,[],[s29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC381-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n006.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 09:22:25 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.28  % (3835796)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (3835805)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2218837943:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28  % (3835802)% WARNING: option uhcvi not known.
% 0.20/0.28  % (3835805) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3835796-3835805"...
% 0.20/0.28  % (3835805)...printing done.
% 0.20/0.28  % (3835805)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (3835805)------------------------------
% 0.20/0.28  % (3835805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (3835805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (3835805)CaDiCaL version: 2.1.3
% 0.20/0.28  % (3835805)Termination reason: Refutation
% 0.20/0.28  % (3835805)Time elapsed: 0.004 s
% 0.20/0.28  % (3835805)Peak memory usage: 12 MB
% 0.20/0.28  % (3835805)Instructions burned: 11 (million)
% 0.20/0.28  % (3835796)Success in time 0.042 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------