↑ 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  : ALG280^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 : n004.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 07:45:30 AM UTC 2026

% Result   : Theorem 0.07s 0.26s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   39 (  38 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  173 (   8   ~;   0   |;  18   &; 144   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   54 (   0   ^;  51   !;   3   ?;  54   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    cE: a ).

thf(func_def_1,type,
    cP: a > a > a ).

thf(func_def_2,type,
    cJ: a > a ).

thf(func_def_4,type,
    sK0: a ).

thf(f1,conjecture,
    ( ( ! [X1: a] :
          ( ( cP @ ( cJ @ X1 ) @ X1 )
          = cE )
      & ! [X0: a] :
          ( ( cP @ cE @ X0 )
          = X0 )
      & ! [X0: a,X1: a,X2: a] :
          ( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
          = ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
   => ! [X3: a] :
        ( ( cP @ X3 @ cE )
        = X3 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM17_pme) ).

thf(f2,negated_conjecture,
    ~ ( ( ! [X1: a] :
            ( ( cP @ ( cJ @ X1 ) @ X1 )
            = cE )
        & ! [X0: a] :
            ( ( cP @ cE @ X0 )
            = X0 )
        & ! [X0: a,X1: a,X2: a] :
            ( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
            = ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
     => ! [X3: a] :
          ( ( cP @ X3 @ cE )
          = X3 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ! [X0: a] :
            ( cE
            = ( cP @ ( cJ @ X0 ) @ X0 ) )
        & ! [X1: a] :
            ( ( cP @ cE @ X1 )
            = X1 )
        & ! [X2: a,X3: a,X4: a] :
            ( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
            = ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) )
     => ! [X5: a] :
          ( ( cP @ X5 @ cE )
          = X5 ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ( ? [X5: a] :
        ( ( cP @ X5 @ cE )
       != X5 )
    & ! [X0: a] :
        ( cE
        = ( cP @ ( cJ @ X0 ) @ X0 ) )
    & ! [X1: a] :
        ( ( cP @ cE @ X1 )
        = X1 )
    & ! [X2: a,X3: a,X4: a] :
        ( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
        = ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
    inference(ennf_transformation,[],[f3]) ).

thf(f5,plain,
    ( ? [X5: a] :
        ( ( cP @ X5 @ cE )
       != X5 )
    & ! [X0: a] :
        ( cE
        = ( cP @ ( cJ @ X0 ) @ X0 ) )
    & ! [X1: a] :
        ( ( cP @ cE @ X1 )
        = X1 )
    & ! [X2: a,X3: a,X4: a] :
        ( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
        = ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
    inference(flattening,[],[f4]) ).

thf(f6,plain,
    ( ? [X0: a] :
        ( ( cP @ X0 @ cE )
       != X0 )
    & ! [X1: a] :
        ( cE
        = ( cP @ ( cJ @ X1 ) @ X1 ) )
    & ! [X2: a] :
        ( ( cP @ cE @ X2 )
        = X2 )
    & ! [X3: a,X4: a,X5: a] :
        ( ( cP @ ( cP @ X3 @ X4 ) @ X5 )
        = ( cP @ X3 @ ( cP @ X4 @ X5 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ( ( sK0
     != ( cP @ sK0 @ cE ) )
    & ! [X1: a] :
        ( cE
        = ( cP @ ( cJ @ X1 ) @ X1 ) )
    & ! [X2: a] :
        ( ( cP @ cE @ X2 )
        = X2 )
    & ! [X3: a,X4: a,X5: a] :
        ( ( cP @ ( cP @ X3 @ X4 ) @ X5 )
        = ( cP @ X3 @ ( cP @ X4 @ X5 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).

thf(f8,plain,
    ! [X3: a,X4: a,X5: a] :
      ( ( cP @ ( cP @ X3 @ X4 ) @ X5 )
      = ( cP @ X3 @ ( cP @ X4 @ X5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ! [X2: a] :
      ( ( cP @ cE @ X2 )
      = X2 ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X1: a] :
      ( cE
      = ( cP @ ( cJ @ X1 ) @ X1 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ( sK0
   != ( cP @ sK0 @ cE ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ! [X0: a,X1: a] :
      ( ( cP @ cE @ X1 )
      = ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) ) ),
    inference(constrained_superposition,[],[f8,f10]) ).

thf(f16,plain,
    ! [X0: a,X1: a] :
      ( ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) )
      = X1 ),
    inference(forward_demodulation,[],[f13,f9]) ).

thf(f19,plain,
    ! [X0: a] :
      ( ( cP @ ( cJ @ ( cJ @ X0 ) ) @ cE )
      = X0 ),
    inference(constrained_superposition,[],[f16,f10]) ).

thf(f21,plain,
    ! [X0: a,X1: a] :
      ( ( cP @ X1 @ X0 )
      = ( cP @ ( cJ @ ( cJ @ X1 ) ) @ X0 ) ),
    inference(constrained_superposition,[],[f16,f16]) ).

thf(f24,plain,
    ! [X0: a] :
      ( ( cP @ X0 @ cE )
      = X0 ),
    inference(forward_demodulation,[],[f19,f21]) ).

thf(f31,plain,
    sK0 != sK0,
    inference(constrained_superposition,[],[f11,f24]) ).

thf(f32,plain,
    $false,
    inference(trivial_inequality_removal,[],[f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ALG280^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19  % Computer : n004.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 17:36:22 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/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.07/0.26  % (1613418)Will run a generic schedule for satisfiability detection.
% 0.07/0.26  % (1613423)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=250437405_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.26  % Exception at run slice level
% 0.07/0.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.07/0.26  % (1613424)% WARNING: option uhcvi not known.
% 0.07/0.26  % (1613424)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2229295750:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.26  % (1613427)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4012297583:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.26  % (1613424)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.26  % (1613424)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.26  % (1613427)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.26  % (1613429)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2374487480:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.26  % (1613427) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1613418-1613427"...
% 0.07/0.26  % (1613426)dis+10_1_sil=32000:sp=arity:random_seed=1261004615:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.26  % (1613428)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2197458922:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.26  % (1613427)...printing done.
% 0.07/0.26  % (1613424) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1613418-1613424"...
% 0.07/0.26  % (1613427)Refutation found. Thanks to Tanya!
% 0.07/0.26  % SZS status Theorem for theBenchmark
% 0.07/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26  % (1613427)------------------------------
% 0.07/0.26  % (1613427)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26  % (1613427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26  % (1613427)CaDiCaL version: 2.1.3
% 0.07/0.26  % (1613427)Termination reason: Refutation
% 0.07/0.26  % (1613427)Time elapsed: 0.003 s
% 0.07/0.26  % (1613427)Peak memory usage: 12 MB
% 0.07/0.26  % (1613427)Instructions burned: 3 (million)
% 0.07/0.26  % (1613418)Success in time 0.036 s
% 0.07/0.26  % Vampire exiting
%------------------------------------------------------------------------------