↑ 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  : LCL793_5 : TPTP v9.3.1. Released v6.0.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 : Tue Sep 29 12:00:37 PM UTC 2026

% Result   : Theorem 0.18s 0.49s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   6   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-3 aty)
%            Number of functors    :   24 (  24 usr;   5 con; 0-5 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    bool: $tType ).

tff(type_def_6,type,
    dB: $tType ).

tff(type_def_7,type,
    nat: $tType ).

tff(type_def_8,type,
    char: $tType ).

tff(type_def_9,type,
    literal: $tType ).

tff(type_def_10,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    plus_plus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

tff(func_def_1,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_2,type,
    bool_size: bool > nat ).

tff(func_def_3,type,
    app: ( dB * dB ) > dB ).

tff(func_def_4,type,
    var: nat > dB ).

tff(func_def_5,type,
    dB_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).

tff(func_def_6,type,
    dB_rec: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).

tff(func_def_7,type,
    dB_size: dB > nat ).

tff(func_def_8,type,
    lift: ( dB * nat ) > dB ).

tff(func_def_9,type,
    liftn: ( nat * dB * nat ) > dB ).

tff(func_def_10,type,
    subst: ( dB * dB * nat ) > dB ).

tff(func_def_11,type,
    substn: ( dB * dB * nat ) > dB ).

tff(func_def_12,type,
    nat_size: nat > nat ).

tff(func_def_13,type,
    semiring_1_of_nat: 
      !>[X0: $tType] : ( nat > X0 ) ).

tff(func_def_14,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

tff(func_def_15,type,
    char_size: char > nat ).

tff(func_def_16,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_17,type,
    fFalse: bool ).

tff(func_def_18,type,
    fTrue: bool ).

tff(func_def_19,type,
    t: dB ).

tff(func_def_20,type,
    u: dB ).

tff(func_def_21,type,
    ua: dB ).

tff(func_def_22,type,
    sK0: fun(nat,bool) > nat ).

tff(pred_def_1,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    monoid_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    semiring_char_0: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    comm_monoid_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    ab_semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    linordered_semidom: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    cancel_semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    cancel146912293up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    linord219039673up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_11,type,
    ordere236663937imp_le: 
      !>[X0: $tType] : $o ).

tff(pred_def_12,type,
    ordere223160158up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_13,type,
    it: dB > $o ).

tff(pred_def_14,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_15,type,
    pp: bool > $o ).

tff(f4,axiom,
    it(lift(u,zero_zero(nat))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__096IT_A_Ilift_Au_A0_J_096) ).

tff(f7,axiom,
    ! [X0: nat,X1: dB] :
      ( it(X1)
     => it(app(X1,var(X0))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_app__Var__IT) ).

tff(f117,conjecture,
    it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f118,negated_conjecture,
    ~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
    inference(negated_conjecture,[status(cth)],[f117]) ).

tff(f119,plain,
    ~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
    inference(flattening,[],[f118]) ).

tff(f124,plain,
    ! [X0: nat,X1: dB] :
      ( it(app(X1,var(X0)))
      | ~ it(X1) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f196,plain,
    it(lift(u,zero_zero(nat))),
    inference(cnf_transformation,[],[f4]) ).

tff(f199,plain,
    ! [X0: nat,X1: dB] :
      ( it(app(X1,var(X0)))
      | ~ it(X1) ),
    inference(cnf_transformation,[],[f124]) ).

tff(f337,plain,
    ~ it(app(lift(u,zero_zero(nat)),var(zero_zero(nat)))),
    inference(cnf_transformation,[],[f119]) ).

tff(f415,plain,
    ~ it(lift(u,zero_zero(nat))),
    inference(resolution,[],[f199,f337]) ).

tff(f416,plain,
    $false,
    inference(resolution,[],[f415,f196]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL793_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41  % Computer : n006.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8046.5625MB
% 0.13/0.41  % OS       : Linux 6.8.0-71-generic
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Sun Sep 27 16:50:56 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.44  Running first-order model finding
% 0.13/0.44  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.18/0.49  % (3166872)Will run a generic schedule for satisfiability detection.
% 0.18/0.49  % (3166883)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2754278027:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49  % (3166878)% WARNING: option uhcvi not known.
% 0.18/0.49  % (3166883) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3166872-3166883"...
% 0.18/0.49  % (3166883)...printing done.
% 0.18/0.49  % (3166883)Refutation found. Thanks to Tanya!
% 0.18/0.49  % SZS status Theorem for theBenchmark
% 0.18/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49  % (3166883)------------------------------
% 0.18/0.49  % (3166883)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49  % (3166883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49  % (3166883)CaDiCaL version: 2.1.3
% 0.18/0.49  % (3166883)Termination reason: Refutation
% 0.18/0.49  % (3166883)Time elapsed: 0.004 s
% 0.18/0.49  % (3166883)Peak memory usage: 12 MB
% 0.18/0.49  % (3166883)Instructions burned: 9 (million)
% 0.18/0.49  % (3166872)Success in time 0.038 s
% 0.18/0.49  % Vampire exiting
%------------------------------------------------------------------------------