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

% Computer : n006.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:23 AM UTC 2026

% Result   : Theorem 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   16 (  15 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   91 (  11   ~;   0   |;   0   &;  80   @)
%                                         (   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     :   10 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (   0   ^;  19   !;   1   ?;  20   :)

% 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_5,type,
    ts: nat > nat > nat ).

thf(func_def_8,type,
    sK0: nat ).

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

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

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

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

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

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

thf(f10,plain,
    ! [X0: nat] :
      ( ( ts @ x @ z )
     != ( pl @ ( ts @ 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] :
      ( ( ts @ X0 @ X1 )
      = ( ts @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f3]) ).

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

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

thf(f31,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( ts @ X1 @ ( pl @ X0 @ X2 ) )
      = ( pl @ ( ts @ X0 @ X1 ) @ ( ts @ X1 @ X2 ) ) ),
    inference(constrained_superposition,[],[f17,f16]) ).

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

thf(f46,plain,
    ( ( ts @ x @ z )
   != ( ts @ z @ x ) ),
    inference(constrained_superposition,[],[f44,f14]) ).

thf(f47,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f46,f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM713^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  % Computer : n006.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 12:44:24 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.20/0.28  % (661493)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (661498)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=594809031_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28  % Exception at run slice level
% 0.20/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28  % (661499)% WARNING: option uhcvi not known.
% 0.20/0.28  % (661499)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1971111909:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28  % (661500)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2063082236:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28  % (661499)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28  % (661499)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28  % (661506)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=757579418:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28  % Exception at run slice level
% 0.20/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28  % (661499) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-661493-661499"...
% 0.20/0.28  % (661500) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-661493-661500"...
% 0.20/0.28  % (661504)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1485482033:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28  % (661499)...printing done.
% 0.20/0.28  % (661500)...printing done.
% 0.20/0.28  % (661499)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status Theorem for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (661499)------------------------------
% 0.20/0.28  % (661499)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (661499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (661499)CaDiCaL version: 2.1.3
% 0.20/0.28  % (661499)Termination reason: Refutation
% 0.20/0.28  % (661499)Time elapsed: 0.004 s
% 0.20/0.28  % (661499)Peak memory usage: 12 MB
% 0.20/0.28  % (661499)Instructions burned: 5 (million)
% 0.20/0.28  % (661493)Success in time 0.036 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------