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

% Computer : n013.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:21:16 AM UTC 2026

% Result   : Theorem 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   62 (  16 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   61 (  18   ~;   2   |;   5   &;  36   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   26 (   0   ^;  11   !;  15   ?;  26   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    parent: $i > $i > $o ).

thf(func_def_8,type,
    vNOT: $o > $o ).

thf(func_def_10,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_11,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_12,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(f1,axiom,
    parent @ kronus @ zeus,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

thf(f2,axiom,
    ~ ( parent @ sutekh @ horus ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

thf(f3,conjecture,
    ? [X0: $i > $o,X1: $i,X2: $i] :
      ( ~ ( X0 @ X2 )
      & ( X0 @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hotwo) ).

thf(f4,negated_conjecture,
    ~ ? [X0: $i > $o,X1: $i,X2: $i] :
        ( ~ ( X0 @ X2 )
        & ( X0 @ X1 ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    parent @ kronus @ zeus,
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ( ( parent @ kronus @ zeus )
    = $true ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ~ ( parent @ sutekh @ horus ),
    inference(rectify,[],[f2]) ).

thf(f8,plain,
    ( ( parent @ sutekh @ horus )
   != $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ~ ? [X0: $i > $o,X1: $i,X2: $i] :
        ( ~ ( X0 @ X2 )
        & ( X0 @ X1 ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ~ ? [X0: $i > $o,X1: $i,X2: $i] :
        ( ( ( X0 @ X2 )
         != $true )
        & ( ( X0 @ X1 )
          = $true ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ( ( parent @ sutekh @ horus )
   != $true ),
    inference(flattening,[],[f8]) ).

thf(f12,plain,
    ~ ? [X0: $i > $o,X1: $i,X2: $i] :
        ( ( ( X0 @ X2 )
         != $true )
        & ( ( X0 @ X1 )
          = $true ) ),
    inference(flattening,[],[f10]) ).

thf(f13,plain,
    ! [X0: $i > $o,X1: $i,X2: $i] :
      ( ( ( X0 @ X2 )
        = $true )
      | ( ( X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f12]) ).

thf(f14,plain,
    ( ( parent @ kronus @ zeus )
    = $true ),
    inference(cnf_transformation,[],[f6]) ).

thf(f15,plain,
    ( ( parent @ sutekh @ horus )
   != $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f16,plain,
    ! [X2: $i,X0: $i > $o,X1: $i] :
      ( ( ( X0 @ X1 )
       != $true )
      | ( ( X0 @ X2 )
        = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f25,plain,
    ! [X0: $i,X1: $i] : ( X0 = X1 ),
    inference(leibniz_equality_elimination,[],[f16]) ).

thf(f50,plain,
    ! [X0: $i] :
      ( $true
     != ( parent @ X0 @ horus ) ),
    inference(constrained_superposition,[],[f15,f25]) ).

thf(f54,plain,
    ! [X0: $i,X1: $i] :
      ( $true
     != ( parent @ X1 @ X0 ) ),
    inference(constrained_superposition,[],[f50,f25]) ).

thf(f494,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f14,f54]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ136^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n013.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 : Tue Sep 29 13:25:51 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.19/0.27  % (2097050)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (2097057)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2589202850:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27  % (2097056)% WARNING: option uhcvi not known.
% 0.19/0.27  % (2097057) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2097050-2097057"...
% 0.19/0.27  % (2097057)...printing done.
% 0.19/0.27  % (2097055)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=113719881_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27  % (2097056)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=133658695:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27  % (2097058)dis+10_1_sil=32000:sp=arity:random_seed=762556273:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27  % (2097057)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Theorem for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (2097057)------------------------------
% 0.19/0.27  % (2097057)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (2097057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (2097057)CaDiCaL version: 2.1.3
% 0.19/0.27  % (2097057)Termination reason: Refutation
% 0.19/0.27  % (2097057)Time elapsed: 0.006 s
% 0.19/0.27  % (2097057)Peak memory usage: 12 MB
% 0.19/0.27  % (2097057)Instructions burned: 17 (million)
% 0.19/0.27  % (2097050)Success in time 0.041 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------