↑ 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  : NUM670^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:19:16 AM UTC 2026

% Result   : Theorem 0.36s 0.41s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  16 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   90 (  12   ~;   0   |;   0   &;  78   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   19 (   0   ^;  18   !;   1   ?;  19   :)

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

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

thf(func_def_0,type,
    x: nat ).

thf(func_def_1,type,
    y: nat ).

thf(func_def_2,type,
    z: nat ).

thf(func_def_3,type,
    pl: nat > nat > nat ).

thf(func_def_7,type,
    sK0: nat ).

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

thf(f1,axiom,
    ~ ! [X0: nat] :
        ( x
       != ( pl @ y @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

thf(f3,axiom,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).

thf(f4,axiom,
    ! [X0: nat,X1: nat,X2: nat] :
      ( ( pl @ ( pl @ X0 @ X1 ) @ X2 )
      = ( pl @ X0 @ ( pl @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz5) ).

thf(f5,conjecture,
    ~ ! [X0: nat] :
        ( ( pl @ x @ z )
       != ( pl @ ( pl @ y @ z ) @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).

thf(f6,negated_conjecture,
    ~ ~ ! [X0: nat] :
          ( ( pl @ x @ z )
         != ( pl @ ( pl @ y @ z ) @ X0 ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

thf(f10,plain,
    ! [X0: nat] :
      ( ( pl @ x @ z )
     != ( pl @ ( pl @ y @ z ) @ X0 ) ),
    inference(flattening,[],[f6]) ).

thf(f11,plain,
    ? [X0: nat] :
      ( x
      = ( pl @ y @ X0 ) ),
    inference(ennf_transformation,[],[f1]) ).

thf(f13,plain,
    ( x
    = ( pl @ y @ sK0 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f11]) ).

thf(f14,plain,
    ( x
    = ( pl @ y @ sK0 ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f16,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f17,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( pl @ ( pl @ X0 @ X1 ) @ X2 )
      = ( pl @ X0 @ ( pl @ X1 @ X2 ) ) ),
    inference(cnf_transformation,[],[f4]) ).

thf(f18,plain,
    ! [X0: nat] :
      ( ( pl @ x @ z )
     != ( pl @ ( pl @ y @ z ) @ X0 ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f31,plain,
    ! [X0: nat] :
      ( ( pl @ y @ ( pl @ sK0 @ X0 ) )
      = ( pl @ x @ X0 ) ),
    inference(constrained_superposition,[],[f17,f14]) ).

thf(f37,plain,
    ! [X0: nat] :
      ( ( pl @ x @ z )
     != ( pl @ y @ ( pl @ z @ X0 ) ) ),
    inference(constrained_superposition,[],[f18,f17]) ).

thf(f46,plain,
    ! [X0: nat] :
      ( ( pl @ x @ z )
     != ( pl @ y @ ( pl @ X0 @ z ) ) ),
    inference(constrained_superposition,[],[f37,f16]) ).

thf(f53,plain,
    ( ( pl @ x @ z )
   != ( pl @ x @ z ) ),
    inference(constrained_superposition,[],[f46,f31]) ).

thf(f54,plain,
    $false,
    inference(trivial_inequality_removal,[],[f53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM670^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.28  % Computer : n013.cluster.edu
% 0.11/0.28  % Model    : x86_64 x86_64
% 0.11/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.28  % Memory   : 8046.5625MB
% 0.11/0.28  % OS       : Linux 6.8.0-71-generic
% 0.11/0.29  % CPULimit : 300
% 0.11/0.29  % WCLimit  : 300
% 0.11/0.29  % DateTime : Tue Sep 29 12:33:51 UTC 2026
% 0.11/0.29  % CPUTime  : 
% 0.11/0.29  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.30/0.34  Running first-order model finding
% 0.30/0.34  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.36/0.41  % (2036905)Will run a generic schedule for satisfiability detection.
% 0.36/0.41  % (2036910)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=703892020_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.41  % Exception at run slice level
% 0.36/0.41  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.41  % (2036911)% WARNING: option uhcvi not known.
% 0.36/0.41  % (2036913)dis+10_1_sil=32000:sp=arity:random_seed=1542695374:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.41  % (2036911)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2991121048:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.41  % (2036912)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2684514805:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.41  % (2036914)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2616012005:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.41  % (2036914)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.41  % (2036911)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.41  % (2036916)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3765377089:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.41  % (2036915)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2034589543:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.41  % (2036911)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.36/0.41  % (2036914) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2036905-2036914"...
% 0.36/0.41  % (2036911) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2036905-2036911"...
% 0.36/0.41  % (2036913) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2036905-2036913"...
% 0.36/0.41  % (2036915) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2036905-2036915"...
% 0.36/0.41  % (2036918)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2347258872:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.36/0.41  % Exception at run slice level
% 0.36/0.41  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.41  % (2036914)...printing done.
% 0.36/0.41  % (2036911)...printing done.
% 0.36/0.41  % (2036913)...printing done.
% 0.36/0.41  % (2036915)...printing done.
% 0.36/0.41  % (2036914)Refutation found. Thanks to Tanya!
% 0.36/0.41  % SZS status Theorem for theBenchmark
% 0.36/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.41  % (2036914)------------------------------
% 0.36/0.41  % (2036914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.41  % (2036914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.41  % (2036914)CaDiCaL version: 2.1.3
% 0.36/0.41  % (2036914)Termination reason: Refutation
% 0.36/0.41  % (2036914)Time elapsed: 0.006 s
% 0.36/0.41  % (2036914)Peak memory usage: 12 MB
% 0.36/0.41  % (2036914)Instructions burned: 4 (million)
% 0.36/0.41  % (2036905)Success in time 0.056 s
% 0.36/0.41  % Vampire exiting
%------------------------------------------------------------------------------