↑ 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  : NUM743_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 : n010.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:33 PM UTC 2026

% Result   : Theorem 0.21s 0.54s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  14 unt;   0 typ;   2 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   76 (  36   ~;  32   |;   0   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   34 (   0 sgn  34   !;   0   ?;  34   :)

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

tff(func_def_0,type,
    x: frac ).

tff(func_def_1,type,
    y: frac ).

tff(func_def_2,type,
    z: frac ).

tff(pred_def_1,type,
    lessf: ( frac * frac ) > $o ).

tff(pred_def_2,type,
    eq: ( frac * frac ) > $o ).

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

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

tff(f4,axiom,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( lessf(X0,X1)
     => ( eq(X0,X2)
       => ( eq(X1,X3)
         => lessf(X2,X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz45) ).

tff(f5,axiom,
    ! [X0: frac] : eq(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).

tff(f6,axiom,
    ! [X0: frac,X1: frac,X2: frac] :
      ( lessf(X0,X1)
     => ( lessf(X1,X2)
       => lessf(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz50) ).

tff(f7,conjecture,
    lessf(x,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz51b) ).

tff(f8,negated_conjecture,
    ~ lessf(x,z),
    inference(negated_conjecture,[status(cth)],[f7]) ).

tff(f12,plain,
    ~ lessf(x,z),
    inference(flattening,[],[f8]) ).

tff(f13,plain,
    ( eq(y,z)
    | lessf(y,z) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f15,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( lessf(X2,X3)
      | ~ eq(X1,X3)
      | ~ eq(X0,X2)
      | ~ lessf(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f16,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( lessf(X2,X3)
      | ~ eq(X1,X3)
      | ~ eq(X0,X2)
      | ~ lessf(X0,X1) ),
    inference(flattening,[],[f15]) ).

tff(f17,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( lessf(X0,X2)
      | ~ lessf(X1,X2)
      | ~ lessf(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f18,plain,
    ! [X0: frac,X1: frac,X2: frac] :
      ( lessf(X0,X2)
      | ~ lessf(X1,X2)
      | ~ lessf(X0,X1) ),
    inference(flattening,[],[f17]) ).

tff(f19,plain,
    lessf(x,y),
    inference(cnf_transformation,[],[f1]) ).

tff(f20,plain,
    ( eq(y,z)
    | lessf(y,z) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f22,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( ~ eq(X1,X3)
      | lessf(X2,X3)
      | ~ eq(X0,X2)
      | ~ lessf(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f23,plain,
    ! [X0: frac] : eq(X0,X0),
    inference(cnf_transformation,[],[f5]) ).

tff(f24,plain,
    ! [X2: frac,X0: frac,X1: frac] :
      ( ~ lessf(X1,X2)
      | lessf(X0,X2)
      | ~ lessf(X0,X1) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f25,plain,
    ~ lessf(x,z),
    inference(cnf_transformation,[],[f12]) ).

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

tff(f32,plain,
    ( lessf(y,z)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f30]) ).

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

tff(f36,plain,
    ( eq(y,z)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f34]) ).

tff(f37,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f20,f34,f30]) ).

tff(f68,plain,
    ( ! [X0: frac] :
        ( ~ lessf(X0,y)
        | lessf(X0,z) )
    | ~ spl0_1 ),
    inference(resolution,[],[f24,f32]) ).

tff(f93,plain,
    ( lessf(x,z)
    | ~ spl0_1 ),
    inference(resolution,[],[f68,f19]) ).

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

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

tff(f152,plain,
    ( ! [X0: frac,X1: frac] :
        ( ~ eq(X1,X0)
        | lessf(X0,z)
        | ~ lessf(X1,y) )
    | ~ spl0_2 ),
    inference(resolution,[],[f22,f36]) ).

tff(f169,plain,
    ( ! [X0: frac] :
        ( ~ lessf(X0,y)
        | lessf(X0,z) )
    | ~ spl0_2 ),
    inference(resolution,[],[f152,f23]) ).

tff(f171,plain,
    ( lessf(x,z)
    | ~ spl0_2 ),
    inference(resolution,[],[f169,f19]) ).

tff(f172,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f171,f25]) ).

tff(f173,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f172]) ).

cnf(s14,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f37]) ).

cnf(s53,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f95]) ).

cnf(s93,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f173]) ).

cnf(s94,plain,
    $false,
    inference(rat,[],[s14,s93,s53]) ).

tff(f174,plain,
    $false,
    inference(avatar_sat_refutation,[],[s94]) ).

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