↑ 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  : SWC027-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 : n017.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:04:21 PM UTC 2026

% Result   : Unsatisfiable 0.17s 0.46s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   48 (   7 unt;   2 def)
%            Number of atoms       :  103 (  29 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   95 (  40   ~;  53   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f71,axiom,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).

fof(f98,axiom,
    ! [X0,X1] :
      ( cons(X0,X1) != nil
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).

fof(f99,plain,
    ! [X0,X1] :
      ( nil != cons(X0,X1)
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    inference(reorient_equations,[],[f98]) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

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,
    ( ssItem(sk5)
    | nil = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

fof(f214,negated_conjecture,
    ( memberP(sk4,sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f216,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f219,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

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

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

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

fof(f258,plain,
    ( nil = sk4
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( nil != sk4
    | spl0_1 ),
    inference(avatar_component_clause,[],[f257]) ).

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

fof(f262,plain,
    ( nil = sk3
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f263,plain,
    ( nil != sk3
    | spl0_2 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f264,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f225,f261,f257]) ).

fof(f296,plain,
    ( ssItem(sk5)
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f207,f263]) ).

fof(f318,plain,
    ( memberP(sk4,sk5)
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f214,f263]) ).

fof(f319,plain,
    ( memberP(nil,sk5)
    | ~ spl0_1
    | spl0_2 ),
    inference(forward_demodulation,[],[f318,f258]) ).

fof(f322,plain,
    ( ~ ssItem(sk5)
    | ~ spl0_1
    | spl0_2 ),
    inference(resolution,[],[f319,f71]) ).

fof(f323,plain,
    ( $false
    | ~ spl0_1
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f322,f296]) ).

fof(f324,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_contradiction_clause,[],[f323]) ).

fof(f325,plain,
    ( nil = sk3
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f222,f259]) ).

fof(f326,plain,
    ( $false
    | spl0_1
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f325,f263]) ).

fof(f327,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_contradiction_clause,[],[f326]) ).

fof(f328,plain,
    ( ssItem(sk5)
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f206,f259]) ).

fof(f330,plain,
    ( ssList(nil)
    | ~ spl0_2 ),
    inference(superposition,[],[f202,f262]) ).

fof(f331,plain,
    ( sk3 = cons(sk5,nil)
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f209,f259]) ).

fof(f332,plain,
    ( nil = cons(sk5,nil)
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f331,f262]) ).

fof(f337,plain,
    ( nil != nil
    | ~ ssItem(sk5)
    | ~ ssList(nil)
    | spl0_1
    | ~ spl0_2 ),
    inference(superposition,[],[f99,f332]) ).

fof(f352,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(nil)
    | spl0_1
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f337]) ).

fof(f356,plain,
    ( ~ ssList(nil)
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f352,f328]) ).

fof(f361,plain,
    ( $false
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f356,f330]) ).

fof(f362,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f361]) ).

cnf(s201,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f264]) ).

cnf(s275,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f324]) ).

cnf(s281,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f327]) ).

cnf(s306,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f362]) ).

cnf(s309,plain,
    spl0_1,
    inference(rat,[],[s281,s306]) ).

cnf(s310,plain,
    spl0_2,
    inference(rat,[],[s275,s309]) ).

cnf(s311,plain,
    $false,
    inference(rat,[],[s201,s310,s309]) ).

fof(f363,plain,
    $false,
    inference(avatar_sat_refutation,[],[s311]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC027-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.12/0.38  % Computer : n017.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 07:25:51 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.17/0.46  % (3373841)Will run a generic schedule for satisfiability detection.
% 0.17/0.46  % (3373848)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2898013594:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46  % (3373847)% WARNING: option uhcvi not known.
% 0.17/0.46  % (3373848) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3373841-3373848"...
% 0.17/0.46  % (3373848)...printing done.
% 0.17/0.46  % (3373848)Refutation found. Thanks to Tanya!
% 0.17/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46  % (3373848)------------------------------
% 0.17/0.46  % (3373848)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46  % (3373848)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46  % (3373848)CaDiCaL version: 2.1.3
% 0.17/0.46  % (3373848)Termination reason: Refutation
% 0.17/0.46  % (3373848)Time elapsed: 0.005 s
% 0.17/0.46  % (3373848)Peak memory usage: 12 MB
% 0.17/0.46  % (3373848)Instructions burned: 10 (million)
% 0.17/0.46  % (3373841)Success in time 0.038 s
% 0.17/0.46  % Vampire exiting
%------------------------------------------------------------------------------