↑ 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  : SYO206_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 : n011.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 02:30:25 PM UTC 2026

% Result   : Theorem 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :  162 (  69 equ)
%            Maximal formula atoms :   16 (  10 avg)
%            Number of connectives :   81 (  33   ~;  32   |;  10   &)
%                                         (   5 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  158 (  98 fml;  60 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   15 (   9   !;   6   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_2,type,
    sK0: $o > $o ).

tff(f1,conjecture,
    ? [X0: $o] :
    ! [X1: $o] :
      ( ( (X0) = (X1) )
      = ( (X1) = (X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT265) ).

tff(f2,negated_conjecture,
    ~ ? [X0: $o] :
      ! [X1: $o] :
        ( ( (X0) = (X1) )
        = ( (X1) = (X0) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ? [X0: $o] :
      ! [X1: $o] :
        ( ( (X0) = (X1) )
        = ( (X1) = (X0) ) ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ~ ? [X0: $o] :
      ! [X1: $o] :
        ( ( ( $true = (X0) )
        <=> ( $true = (X1) ) )
      <=> ( ( $true = (X1) )
        <=> ( $true = (X0) ) ) ),
    inference(fool_elimination,[],[f3]) ).

tff(f5,plain,
    ! [X0: $o] :
    ? [X1: $o] :
      ( ( ( $true = (X0) )
      <=> ( $true = (X1) ) )
    <~> ( ( $true = (X1) )
      <=> ( $true = (X0) ) ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f6,plain,
    ! [X0: $o] :
    ? [X1: $o] :
      ( ( ( ( ( $true != (X0) )
            | ( $true != (X1) ) )
          & ( ( $true = (X0) )
            | ( $true = (X1) ) ) )
        | ( ( ( $true != (X1) )
            | ( $true != (X0) ) )
          & ( ( $true = (X1) )
            | ( $true = (X0) ) ) ) )
      & ( ( ( ( $true = (X1) )
            | ( $true != (X0) ) )
          & ( ( $true = (X0) )
            | ( $true != (X1) ) ) )
        | ( ( ( $true = (X0) )
            | ( $true != (X1) ) )
          & ( ( $true = (X1) )
            | ( $true != (X0) ) ) ) ) ),
    inference(nnf_transformation,[],[f5]) ).

tff(f7,plain,
    ! [X0: $o] :
      ( ( ( ( ( $true != (X0) )
            | ( $true != sK0((X0)) ) )
          & ( ( $true = (X0) )
            | ( $true = sK0((X0)) ) ) )
        | ( ( ( $true != sK0((X0)) )
            | ( $true != (X0) ) )
          & ( ( $true = sK0((X0)) )
            | ( $true = (X0) ) ) ) )
      & ( ( ( ( $true = sK0((X0)) )
            | ( $true != (X0) ) )
          & ( ( $true = (X0) )
            | ( $true != sK0((X0)) ) ) )
        | ( ( ( $true = (X0) )
            | ( $true != sK0((X0)) ) )
          & ( ( $true = sK0((X0)) )
            | ( $true != (X0) ) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f6]) ).

tff(f10,plain,
    ! [X0: $o] :
      ( ( $true = sK0((X0)) )
      | ( $true != (X0) )
      | ( $true = sK0((X0)) )
      | ( $true != (X0) ) ),
    inference(cnf_transformation,[],[f7]) ).

tff(f15,plain,
    ! [X0: $o] :
      ( ( $true != (X0) )
      | ( $true != sK0((X0)) )
      | ( $true != sK0((X0)) )
      | ( $true != (X0) ) ),
    inference(cnf_transformation,[],[f7]) ).

tff(f18,plain,
    ( ( $true != sK0($true) )
    | ( $true != sK0($true) )
    | ( $true != $true ) ),
    inference(equality_resolution,[],[f15]) ).

tff(f22,plain,
    ( ( $true = sK0($true) )
    | ( $true = sK0($true) )
    | ( $true != $true ) ),
    inference(equality_resolution,[],[f10]) ).

tff(f25,plain,
    ( ( $true = sK0($true) )
    | ( $true != $true ) ),
    inference(duplicate_literal_removal,[],[f22]) ).

tff(f26,plain,
    $true = sK0($true),
    inference(trivial_inequality_removal,[],[f25]) ).

tff(f28,plain,
    ( ( $true != sK0($true) )
    | ( $true != $true ) ),
    inference(duplicate_literal_removal,[],[f18]) ).

tff(f29,plain,
    $true != sK0($true),
    inference(trivial_inequality_removal,[],[f28]) ).

tff(f30,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f29,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO206_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.08/0.18  % Computer : n011.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 17:32:16 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.26  % (3564746)Will run a generic schedule for satisfiability detection.
% 0.21/0.26  % (3564754)dis+10_1_sil=32000:sp=arity:random_seed=483771914:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.26  % (3564754) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3564746-3564754"...
% 0.21/0.26  % (3564754)...printing done.
% 0.21/0.26  % (3564752)% WARNING: option uhcvi not known.
% 0.21/0.26  % (3564754)Refutation found. Thanks to Tanya!
% 0.21/0.26  % SZS status Theorem for theBenchmark
% 0.21/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.26  % (3564754)------------------------------
% 0.21/0.26  % (3564754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26  % (3564754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26  % (3564754)CaDiCaL version: 2.1.3
% 0.21/0.26  % (3564754)Termination reason: Refutation
% 0.21/0.26  % (3564754)Time elapsed: 0.001 s
% 0.21/0.26  % (3564754)Peak memory usage: 11 MB
% 0.21/0.26  % (3564754)Instructions burned: 1 (million)
% 0.21/0.26  % (3564746)Success in time 0.034 s
% 0.21/0.26  % Vampire exiting
%------------------------------------------------------------------------------