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

% Computer : n015.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 : Wed Sep 30 08:48:55 AM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   73 (  20 equ)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :   31 (  11   ~;   4   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :   40 (  40 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   2 usr;   4 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    cQ: $o ).

tff(func_def_1,type,
    cP: $o ).

tff(f1,conjecture,
    ( ( ( cP
       => cQ )
      & cP )
   => cQ ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM114) ).

tff(f2,negated_conjecture,
    ~ ( ( ( cP
         => cQ )
        & cP )
     => cQ ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ( ( ( cP
         => cQ )
        & cP )
     => cQ ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ~ ( ( ( ( cP = $true )
         => ( cQ = $true ) )
        & ( cP = $true ) )
     => ( cQ = $true ) ),
    inference(fool_elimination,[],[f3]) ).

tff(f5,plain,
    ( ( cQ != $true )
    & ( ( cQ = $true )
      | ( cP != $true ) )
    & ( cP = $true ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f6,plain,
    ( ( cQ != $true )
    & ( ( cQ = $true )
      | ( cP != $true ) )
    & ( cP = $true ) ),
    inference(flattening,[],[f5]) ).

tff(f7,plain,
    cP = $true,
    inference(cnf_transformation,[],[f6]) ).

tff(f8,plain,
    ( ( cQ = $true )
    | ( cP != $true ) ),
    inference(cnf_transformation,[],[f6]) ).

tff(f9,plain,
    cQ != $true,
    inference(cnf_transformation,[],[f6]) ).

tff(f12,plain,
    ( ( cQ = $true )
    | ( $true != $true ) ),
    inference(definition_unfolding,[],[f8,f7]) ).

tff(f13,plain,
    cQ = $true,
    inference(trivial_inequality_removal,[],[f12]) ).

tff(f14,plain,
    $true != $true,
    inference(superposition,[],[f9,f13]) ).

tff(f15,plain,
    $false,
    inference(trivial_inequality_removal,[],[f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO076^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  % Computer : n015.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Tue Sep 29 16:36:03 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/0.23  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.25  % (3749683)Will run a generic schedule for satisfiability detection.
% 0.10/0.25  % (3749696)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2097043549:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.10/0.25  % (3749696) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3749683-3749696"...
% 0.10/0.25  % (3749696)...printing done.
% 0.10/0.25  % (3749696)Refutation found. Thanks to Tanya!
% 0.10/0.25  % SZS status Theorem for theBenchmark
% 0.10/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25  % (3749696)------------------------------
% 0.10/0.25  % (3749696)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (3749696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (3749696)CaDiCaL version: 2.1.3
% 0.10/0.25  % (3749696)Termination reason: Refutation
% 0.10/0.25  % (3749696)Time elapsed: 0.001 s
% 0.10/0.25  % (3749696)Peak memory usage: 12 MB
% 0.10/0.25  % (3749683)Success in time 0.016 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------