↑ 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  : SWV447^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 : n011.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:40:08 AM UTC 2026

% Result   : Theorem 0.11s 0.26s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   47 (  14 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :   88 (   8   ~;   0   |;   0   &;  80   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   23 (   8   ^;  14   !;   1   ?;  23   :)

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

thf(func_def_1,type,
    cons: $i > $i > $i ).

thf(func_def_2,type,
    map: ( $i > $i ) > $i > $i ).

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

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

thf(f1,axiom,
    ! [X0: $i > $i] :
      ( ( map @ X0 @ nil )
      = nil ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

thf(f2,axiom,
    ! [X0: $i > $i,X1: $i,X2: $i] :
      ( ( map @ X0 @ ( cons @ X1 @ X2 ) )
      = ( cons @ ( X0 @ X1 ) @ ( map @ X0 @ X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

thf(f3,conjecture,
    ! [X0: $i] :
      ( ( map
        @ ^ [X1: $i] : X1
        @ ( cons @ X0 @ nil ) )
      = ( cons @ X0 @ nil ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test) ).

thf(f4,negated_conjecture,
    ~ ! [X0: $i] :
        ( ( map
          @ ^ [X1: $i] : X1
          @ ( cons @ X0 @ nil ) )
        = ( cons @ X0 @ nil ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ~ ! [X0: $i] :
        ( ( map
          @ ^ [X1: $i] : X1
          @ ( cons @ X0 @ nil ) )
        = ( cons @ X0 @ nil ) ),
    inference(rectify,[],[f4]) ).

thf(f6,plain,
    ~ ! [X0: $i] :
        ( ( cons @ X0 @ nil )
        = ( map
          @ ^ [Y0: $i] : Y0
          @ ( cons @ X0 @ nil ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ? [X0: $i] :
      ( ( cons @ X0 @ nil )
     != ( map
        @ ^ [Y0: $i] : Y0
        @ ( cons @ X0 @ nil ) ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f8,plain,
    ( ( cons @ sK0 @ nil )
   != ( map
      @ ^ [Y0: $i] : Y0
      @ ( cons @ sK0 @ nil ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f7]) ).

thf(f9,plain,
    ! [X0: $i > $i] :
      ( nil
      = ( map @ X0 @ nil ) ),
    inference(cnf_transformation,[],[f1]) ).

thf(f10,plain,
    ! [X2: $i,X0: $i > $i,X1: $i] :
      ( ( map @ X0 @ ( cons @ X1 @ X2 ) )
      = ( cons @ ( X0 @ X1 ) @ ( map @ X0 @ X2 ) ) ),
    inference(cnf_transformation,[],[f2]) ).

thf(f11,plain,
    ( ( cons @ sK0 @ nil )
   != ( map
      @ ^ [Y0: $i] : Y0
      @ ( cons @ sK0 @ nil ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f12,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( map @ X0 @ ( cons @ X1 @ nil ) )
      = ( cons @ ( X0 @ X1 ) @ nil ) ),
    inference(constrained_superposition,[],[f10,f9]) ).

thf(f24,plain,
    ( ( cons @ sK0 @ nil )
   != ( cons
      @ ( ^ [Y0: $i] : Y0
        @ sK0 )
      @ nil ) ),
    inference(constrained_superposition,[],[f11,f12]) ).

thf(f31,plain,
    ( ( cons @ sK0 @ nil )
   != ( cons @ sK0 @ nil ) ),
    inference(beta-eta_normalization,[],[f24]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV447^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17  % Computer : n011.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.18  % CPULimit : 300
% 0.11/0.18  % WCLimit  : 300
% 0.11/0.18  % DateTime : Tue Sep 29 16:04:46 UTC 2026
% 0.11/0.18  % CPUTime  : 
% 0.11/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21  Running first-order model finding
% 0.11/0.21  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.11/0.26  % (267988)Will run a generic schedule for satisfiability detection.
% 0.11/0.26  % (267995)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1265066964:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.26  % (267995) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-267988-267995"...
% 0.11/0.26  % (267995)...printing done.
% 0.11/0.26  % (267994)% WARNING: option uhcvi not known.
% 0.11/0.26  % (267995)Refutation found. Thanks to Tanya!
% 0.11/0.26  % SZS status Theorem for theBenchmark
% 0.11/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.26  % (267995)------------------------------
% 0.11/0.26  % (267995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26  % (267995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26  % (267995)CaDiCaL version: 2.1.3
% 0.11/0.26  % (267995)Termination reason: Refutation
% 0.11/0.26  % (267995)Time elapsed: 0.002 s
% 0.11/0.26  % (267995)Peak memory usage: 12 MB
% 0.11/0.26  % (267995)Instructions burned: 5 (million)
% 0.11/0.26  % (267988)Success in time 0.038 s
% 0.11/0.26  % Vampire exiting
%------------------------------------------------------------------------------