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

% Computer : n007.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:49:01 AM UTC 2026

% Result   : Theorem 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :   64 (  17 equ;   0 cnn)
%            Maximal formula atoms :    4 (   6 avg)
%            Number of connectives :   68 (  19   ~;  13   |;   7   &;  29   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0   ^;   7   !;  10   ?;  17   :)

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

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

thf(func_def_1,type,
    cP: $i > $o ).

thf(f1,conjecture,
    ? [X0: $i] :
      ( ~ ( cQ @ X0 )
      | ( ( cQ @ X0 )
        & ? [X1: $i] :
            ( ~ ( cP @ X1 )
            | ( cP @ X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCOUNTER1) ).

thf(f2,negated_conjecture,
    ~ ? [X0: $i] :
        ( ~ ( cQ @ X0 )
        | ( ( cQ @ X0 )
          & ? [X1: $i] :
              ( ~ ( cP @ X1 )
              | ( cP @ X1 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ? [X0: $i] :
        ( ~ ( cQ @ X0 )
        | ( ( cQ @ X0 )
          & ? [X1: $i] :
              ( ~ ( cP @ X1 )
              | ( cP @ X1 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ? [X0: $i] :
        ( ( ( cQ @ X0 )
         != $true )
        | ( ( ( cQ @ X0 )
            = $true )
          & ? [X1: $i] :
              ( ( ( cP @ X1 )
               != $true )
              | ( ( cP @ X1 )
                = $true ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ~ ? [X0: $i] :
        ( ( ( cQ @ X0 )
         != $true )
        | ( ( ( cQ @ X0 )
            = $true )
          & ? [X1: $i] :
              ( ( ( cP @ X1 )
               != $true )
              | ( ( cP @ X1 )
                = $true ) ) ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ! [X0: $i] :
      ( ( ( cQ @ X0 )
        = $true )
      & ( ( ( cQ @ X0 )
         != $true )
        | ! [X1: $i] :
            ( ( ( cP @ X1 )
              = $true )
            & ( ( cP @ X1 )
             != $true ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f7,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( cQ @ X0 )
       != $true )
      | ( ( cP @ X1 )
       != $true ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f8,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( cQ @ X0 )
       != $true )
      | ( ( cP @ X1 )
        = $true ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f9,plain,
    ! [X0: $i] :
      ( ( cQ @ X0 )
      = $true ),
    inference(cnf_transformation,[],[f6]) ).

thf(f12,plain,
    $false,
    inference(global_subsumption,[],[f9,f8,f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO139^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n007.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 16:32:56 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  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.19/0.27  % (3598886)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (3598891)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3609414552_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27  % Exception at run slice level
% 0.19/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.27  % (3598892)% WARNING: option uhcvi not known.
% 0.19/0.27  % (3598892)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3747972889:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27  % (3598893)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=202060069:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27  % (3598894)dis+10_1_sil=32000:sp=arity:random_seed=1512246033:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27  % (3598895)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=627490309:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27  % (3598892)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27  % (3598895)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27  % (3598892)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27  % (3598893) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3598886-3598893"...
% 0.19/0.27  % (3598896)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2482453417:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27  % (3598895) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3598886-3598895"...
% 0.19/0.27  % (3598894) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3598886-3598894"...
% 0.19/0.27  % (3598892) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3598886-3598892"...
% 0.19/0.27  % (3598896) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3598886-3598896"...
% 0.19/0.27  % (3598893)...printing done.
% 0.19/0.27  % (3598896)...printing done.
% 0.19/0.27  % (3598895)...printing done.
% 0.19/0.27  % (3598894)...printing done.
% 0.19/0.27  % (3598892)...printing done.
% 0.19/0.27  % (3598893)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  % (3598893)------------------------------
% 0.19/0.27  % (3598893)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (3598893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (3598893)CaDiCaL version: 2.1.3
% 0.19/0.27  % (3598893)Termination reason: Refutation
% 0.19/0.27  % (3598893)Time elapsed: 0.001 s
% 0.19/0.27  % (3598893)Peak memory usage: 11 MB
% 0.19/0.27  % (3598886)Success in time 0.04 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------