↑ 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  : SWV002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:19:56 PM UTC 2026

% Result   : Unsatisfiable 0.27s 0.33s
% Output   : Refutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   26 (  12 unt;   1 def)
%            Number of atoms       :   44 (   3 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  15   ~;  17   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X2,X0,X1] :
      ( ~ less_than(X2,X1)
      | ~ less_than(X0,X2)
      | less_than(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( less_than(X1,X0)
      | less_than(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',all_related) ).

fof(f9,axiom,
    ! [X0] : ~ less_than(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).

fof(f19,negated_conjecture,
    less_than(a(j),a(k)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f20,negated_conjecture,
    ! [X0] :
      ( ~ less_than(a(X0),a(k))
      | ~ less_than(X0,j)
      | less_than(X0,i) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f23,negated_conjecture,
    ~ less_than(q,i),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f24,negated_conjecture,
    ~ less_than(j,q),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

fof(f25,negated_conjecture,
    less_than(a(q),a(j)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f66,plain,
    ! [X0] :
      ( ~ less_than(X0,a(j))
      | less_than(X0,a(k)) ),
    inference(resolution,[],[f7,f19]) ).

fof(f130,plain,
    less_than(a(q),a(k)),
    inference(resolution,[],[f66,f25]) ).

fof(f203,definition,
    ( spl0_12
  <=> less_than(q,j) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f204,plain,
    ( less_than(q,j)
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f203]) ).

fof(f205,plain,
    ( ~ less_than(q,j)
    | spl0_12 ),
    inference(avatar_component_clause,[],[f203]) ).

fof(f212,plain,
    ( less_than(j,q)
    | j = q
    | spl0_12 ),
    inference(resolution,[],[f205,f8]) ).

fof(f213,plain,
    ( j = q
    | spl0_12 ),
    inference(forward_subsumption_resolution,[],[f212,f24]) ).

fof(f264,plain,
    ( less_than(a(j),a(j))
    | spl0_12 ),
    inference(superposition,[],[f25,f213]) ).

fof(f273,plain,
    ( $false
    | spl0_12 ),
    inference(forward_subsumption_resolution,[],[f264,f9]) ).

fof(f274,plain,
    spl0_12,
    inference(avatar_contradiction_clause,[],[f273]) ).

fof(f283,plain,
    ( ~ less_than(q,j)
    | less_than(q,i) ),
    inference(resolution,[],[f130,f20]) ).

fof(f286,plain,
    ( less_than(q,i)
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f283,f204]) ).

fof(f287,plain,
    ( $false
    | ~ spl0_12 ),
    inference(forward_subsumption_resolution,[],[f286,f23]) ).

fof(f288,plain,
    ~ spl0_12,
    inference(avatar_contradiction_clause,[],[f287]) ).

cnf(s20,plain,
    spl0_12,
    inference(sat_conversion,[],[f274]) ).

cnf(s22,plain,
    ~ spl0_12,
    inference(sat_conversion,[],[f288]) ).

cnf(s24,plain,
    $false,
    inference(rat,[],[s20,s22]) ).

fof(f289,plain,
    $false,
    inference(avatar_sat_refutation,[],[s24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23  % Computer : n007.cluster.edu
% 0.11/0.23  % Model    : x86_64 x86_64
% 0.11/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23  % Memory   : 8046.5625MB
% 0.11/0.23  % OS       : Linux 6.8.0-71-generic
% 0.11/0.23  % CPULimit : 300
% 0.11/0.23  % WCLimit  : 300
% 0.11/0.23  % DateTime : Mon Sep 28 09:39:56 UTC 2026
% 0.11/0.23  % CPUTime  : 
% 0.11/0.23  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.28  Running first-order model finding
% 0.11/0.28  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.27/0.33  % (2277472)Will run a generic schedule for satisfiability detection.
% 0.27/0.33  % (2277480)dis+10_1_sil=32000:sp=arity:random_seed=517343070:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.33  % (2277477)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2628277395_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.33  % TRYING [1]
% 0.27/0.33  % TRYING [2]
% 0.27/0.33  % TRYING [3]
% 0.27/0.33  % TRYING [4]
% 0.27/0.33  % (2277480) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2277472-2277480"...
% 0.27/0.33  % TRYING [5]
% 0.27/0.33  % (2277480)...printing done.
% 0.27/0.33  % (2277478)% WARNING: option uhcvi not known.
% 0.27/0.33  % (2277480)Refutation found. Thanks to Tanya!
% 0.27/0.33  % SZS status Unsatisfiable for theBenchmark
% 0.27/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.33  % (2277480)------------------------------
% 0.27/0.33  % (2277480)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.33  % (2277480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.33  % (2277480)CaDiCaL version: 2.1.3
% 0.27/0.33  % (2277480)Termination reason: Refutation
% 0.27/0.33  % (2277480)Time elapsed: 0.006 s
% 0.27/0.33  % (2277480)Peak memory usage: 12 MB
% 0.27/0.33  % (2277480)Instructions burned: 8 (million)
% 0.27/0.33  % (2277472)Success in time 0.03 s
% 0.27/0.33  % Vampire exiting
%------------------------------------------------------------------------------