↑ 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  : NUM652_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:11 PM UTC 2026

% Result   : Theorem 0.14s 0.53s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  12 unt;   0 typ;   2 def)
%            Number of atoms       :   60 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   73 (  41   ~;  15   |;   4   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 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(pred_def_1,type,
    more: ( nat * nat ) > $o ).

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

tff(f1,axiom,
    ( ~ more(x,y)
   => ( x = y ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

tff(f3,axiom,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ~ ~ ( ( more(X0,X1)
               => ~ less(X0,X1) )
             => ~ ( less(X0,X1)
                 => ( X0 != X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10b) ).

tff(f4,conjecture,
    ~ less(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10c) ).

tff(f5,negated_conjecture,
    ~ ~ less(x,y),
    inference(negated_conjecture,[status(cth)],[f4]) ).

tff(f9,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ( ( more(X0,X1)
           => ~ less(X0,X1) )
         => ~ ( less(X0,X1)
             => ( X0 != X1 ) ) ) ),
    inference(flattening,[],[f3]) ).

tff(f10,plain,
    less(x,y),
    inference(flattening,[],[f5]) ).

tff(f11,plain,
    ( ( x = y )
    | more(x,y) ),
    inference(ennf_transformation,[],[f1]) ).

tff(f13,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ~ less(X0,X1) )
      & ( ~ less(X0,X1)
        | ~ more(X0,X1) )
      & ( ~ more(X0,X1)
        | ( X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f9]) ).

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

tff(f15,plain,
    ( ( x = y )
    | more(x,y) ),
    inference(cnf_transformation,[],[f11]) ).

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

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

tff(f20,plain,
    less(x,y),
    inference(cnf_transformation,[],[f10]) ).

tff(f24,plain,
    ! [X1: nat] : ~ less(X1,X1),
    inference(equality_resolution,[],[f19]) ).

tff(f27,definition,
    ( spl0_1
  <=> more(x,y) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

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

tff(f33,plain,
    ( ( x = y )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f31]) ).

tff(f34,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f15,f31,f27]) ).

tff(f36,plain,
    ( less(x,x)
    | ~ spl0_2 ),
    inference(superposition,[],[f20,f33]) ).

tff(f37,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f36,f24]) ).

tff(f38,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f37]) ).

tff(f39,plain,
    ~ more(x,y),
    inference(resolution,[],[f18,f20]) ).

tff(f40,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f39,f27]) ).

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

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f38]) ).

cnf(s3,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f40]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

tff(f41,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM652_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.46  % Computer : n014.cluster.edu
% 0.11/0.46  % Model    : x86_64 x86_64
% 0.11/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.46  % Memory   : 8046.5625MB
% 0.11/0.46  % OS       : Linux 6.8.0-71-generic
% 0.11/0.46  % CPULimit : 300
% 0.11/0.46  % WCLimit  : 300
% 0.11/0.46  % DateTime : Sun Sep 27 20:57:32 UTC 2026
% 0.11/0.46  % CPUTime  : 
% 0.11/0.46  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.50  Running first-order model finding
% 0.14/0.50  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.14/0.53  % (1153796)Will run a generic schedule for satisfiability detection.
% 0.14/0.53  % (1153807)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2403193990:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.53  % (1153807) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1153796-1153807"...
% 0.14/0.53  % (1153807)...printing done.
% 0.14/0.53  % (1153802)% WARNING: option uhcvi not known.
% 0.14/0.53  % (1153807)Refutation found. Thanks to Tanya!
% 0.14/0.53  % SZS status Theorem for theBenchmark
% 0.14/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.54  % (1153807)------------------------------
% 0.14/0.54  % (1153807)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.54  % (1153807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.54  % (1153807)CaDiCaL version: 2.1.3
% 0.14/0.54  % (1153807)Termination reason: Refutation
% 0.14/0.54  % (1153807)Time elapsed: 0.001 s
% 0.14/0.54  % (1153807)Peak memory usage: 12 MB
% 0.14/0.54  % (1153807)Instructions burned: 1 (million)
% 0.14/0.54  % (1153796)Success in time 0.029 s
% 0.14/0.54  % Vampire exiting
%------------------------------------------------------------------------------