↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM664_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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 12:25:15 PM UTC 2026

% Result   : Theorem 0.10s 0.45s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (  12 unt;   0 typ;   2 def)
%            Number of atoms       :   53 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  23   ~;  18   |;   0   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    nat: $tType ).

tff(func_def_0,type,
    x: nat ).

tff(func_def_1,type,
    y: nat ).

tff(func_def_2,type,
    z: nat ).

tff(pred_def_1,type,
    less: ( nat * nat ) > $o ).

tff(f1,axiom,
    less(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

tff(f2,axiom,
    ( ~ less(y,z)
   => ( y = z ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).

tff(f4,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( less(X0,X1)
     => ( less(X1,X2)
       => less(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz15) ).

tff(f5,conjecture,
    less(x,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz16b) ).

tff(f6,negated_conjecture,
    ~ less(x,z),
    inference(negated_conjecture,[status(cth)],[f5]) ).

tff(f10,plain,
    ~ less(x,z),
    inference(flattening,[],[f6]) ).

tff(f11,plain,
    ( ( y = z )
    | less(y,z) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f13,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( less(X0,X2)
      | ~ less(X1,X2)
      | ~ less(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f14,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( less(X0,X2)
      | ~ less(X1,X2)
      | ~ less(X0,X1) ),
    inference(flattening,[],[f13]) ).

tff(f15,plain,
    less(x,y),
    inference(cnf_transformation,[],[f1]) ).

tff(f16,plain,
    ( ( y = z )
    | less(y,z) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f18,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ~ less(X1,X2)
      | less(X0,X2)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f19,plain,
    ~ less(x,z),
    inference(cnf_transformation,[],[f10]) ).

tff(f24,definition,
    ( spl0_1
  <=> less(y,z) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f26,plain,
    ( less(y,z)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f24]) ).

tff(f28,definition,
    ( spl0_2
  <=> ( y = z ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f30,plain,
    ( ( y = z )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f28]) ).

tff(f31,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f16,f28,f24]) ).

tff(f62,plain,
    ( ! [X0: nat] :
        ( ~ less(X0,y)
        | less(X0,z) )
    | ~ spl0_1 ),
    inference(resolution,[],[f18,f26]) ).

tff(f87,plain,
    ( less(x,z)
    | ~ spl0_1 ),
    inference(resolution,[],[f62,f15]) ).

tff(f88,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f87,f19]) ).

tff(f89,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f88]) ).

tff(f93,plain,
    ( ~ less(x,y)
    | ~ spl0_2 ),
    inference(superposition,[],[f19,f30]) ).

tff(f94,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f93,f15]) ).

tff(f95,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f94]) ).

cnf(s11,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f31]) ).

cnf(s50,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f89]) ).

cnf(s59,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f95]) ).

cnf(s61,plain,
    $false,
    inference(rat,[],[s11,s59,s50]) ).

tff(f96,plain,
    $false,
    inference(avatar_sat_refutation,[],[s61]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM664_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n019.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 21:01:19 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  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.10/0.45  % (3398668)Will run a generic schedule for satisfiability detection.
% 0.10/0.45  % (3398675)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2659434748:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.10/0.45  % (3398675) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3398668-3398675"...
% 0.10/0.45  % (3398675)...printing done.
% 0.10/0.45  % (3398675)Refutation found. Thanks to Tanya!
% 0.10/0.45  % SZS status Theorem for theBenchmark
% 0.10/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45  % (3398675)------------------------------
% 0.10/0.45  % (3398675)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45  % (3398675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45  % (3398675)CaDiCaL version: 2.1.3
% 0.10/0.45  % (3398675)Termination reason: Refutation
% 0.10/0.45  % (3398675)Time elapsed: 0.003 s
% 0.10/0.45  % (3398675)Peak memory usage: 12 MB
% 0.10/0.45  % (3398675)Instructions burned: 2 (million)
% 0.10/0.45  % (3398668)Success in time 0.024 s
% 0.10/0.45  % Vampire exiting
%------------------------------------------------------------------------------