↑ 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  : SWC096-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:04:39 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.44s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :   56 (  22 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   67 (  37   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   11 (  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f216,negated_conjecture,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | cons(X0,nil) != sk1
      | app(X1,cons(X0,nil)) != sk2
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f217,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | cons(X0,nil) != sk1
      | sk2 != app(X1,cons(X0,nil))
      | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f216]) ).

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

fof(f219,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

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

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

fof(f222,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

fof(f223,plain,
    ( sk4 = app(sk6,cons(sk5,nil))
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f222]) ).

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

fof(f233,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | cons(X0,nil) != sk3
      | sk4 != app(X1,cons(X0,nil))
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f217,f205,f204]) ).

fof(f258,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f226]) ).

fof(f265,plain,
    ! [X0,X1] :
      ( sk4 != app(X1,cons(X0,nil))
      | ~ ssList(X1)
      | cons(X0,nil) != sk3
      | ~ ssItem(X0) ),
    inference(global_subsumption,[],[f233,f258]) ).

fof(f286,plain,
    ssItem(sk5),
    inference(forward_subsumption_resolution,[],[f218,f258]) ).

fof(f320,plain,
    ssList(sk6),
    inference(forward_subsumption_resolution,[],[f219,f258]) ).

fof(f324,plain,
    sk3 = cons(sk5,nil),
    inference(forward_subsumption_resolution,[],[f221,f258]) ).

fof(f326,plain,
    ! [X0] :
      ( sk4 != app(X0,sk3)
      | ~ ssList(X0)
      | sk3 != sk3
      | ~ ssItem(sk5) ),
    inference(superposition,[],[f265,f324]) ).

fof(f343,plain,
    ! [X0] :
      ( sk4 != app(X0,sk3)
      | ~ ssList(X0)
      | ~ ssItem(sk5) ),
    inference(trivial_inequality_removal,[],[f326]) ).

fof(f348,plain,
    ! [X0] :
      ( sk4 != app(X0,sk3)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f343,f286]) ).

fof(f364,plain,
    sk4 = app(sk6,cons(sk5,nil)),
    inference(forward_subsumption_resolution,[],[f223,f258]) ).

fof(f365,plain,
    sk4 = app(sk6,sk3),
    inference(forward_demodulation,[],[f364,f324]) ).

fof(f375,plain,
    ( sk4 != sk4
    | ~ ssList(sk6) ),
    inference(superposition,[],[f348,f365]) ).

fof(f379,plain,
    ~ ssList(sk6),
    inference(trivial_inequality_removal,[],[f375]) ).

fof(f380,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f379,f320]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC096-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.10/0.37  % Computer : n008.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 07:52:39 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  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.44  % (2086012)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (2086019)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3995521641:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44  % (2086019) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2086012-2086019"...
% 0.10/0.44  % (2086019)...printing done.
% 0.10/0.44  % (2086019)Refutation found. Thanks to Tanya!
% 0.10/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (2086019)------------------------------
% 0.10/0.44  % (2086019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (2086019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (2086019)CaDiCaL version: 2.1.3
% 0.10/0.44  % (2086019)Termination reason: Refutation
% 0.10/0.44  % (2086019)Time elapsed: 0.005 s
% 0.10/0.44  % (2086019)Peak memory usage: 12 MB
% 0.10/0.44  % (2086019)Instructions burned: 12 (million)
% 0.10/0.44  % (2086012)Success in time 0.037 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------