TSTP Solution File: ITP001^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ITP001^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:29:41 EDT 2024

% Result   : Theorem 0.16s 0.33s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   41
% Syntax   : Number of formulae    :   44 (   4 unt;  40 typ;   0 def)
%            Number of atoms       :    4 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    1 (   1   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    4 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :   36 (  36 usr;  36 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

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

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

tff(func_def_0,type,
    del: $tType ).

tff(func_def_1,type,
    bool: del ).

tff(func_def_2,type,
    ind: del ).

tff(func_def_3,type,
    arr: sTfun(del,sTfun(del,del)) ).

tff(func_def_4,type,
    mem: sTfun($i,sTfun(del,$o)) ).

tff(func_def_5,type,
    ap: sTfun($i,sTfun($i,$i)) ).

tff(func_def_6,type,
    lam: sTfun(del,sTfun(sTfun($i,$i),$i)) ).

tff(func_def_7,type,
    p: sTfun($i,$o) ).

tff(func_def_8,type,
    inj__o: sTfun($o,$i) ).

tff(func_def_10,type,
    c_2Emin_2E_3D: sTfun(del,$i) ).

tff(func_def_12,type,
    c_2Emin_2E_40: sTfun(del,$i) ).

tff(func_def_13,type,
    ty_2Ebool_2Eitself: sTfun(del,del) ).

tff(func_def_14,type,
    c_2Ebool_2E_21: sTfun(del,$i) ).

tff(func_def_16,type,
    c_2Ebool_2E_3F: sTfun(del,$i) ).

tff(func_def_17,type,
    c_2Ebool_2E_3F_21: sTfun(del,$i) ).

tff(func_def_18,type,
    c_2Ebool_2EARB: sTfun(del,$i) ).

tff(func_def_20,type,
    c_2Ebool_2ECOND: sTfun(del,$i) ).

tff(func_def_21,type,
    c_2Ebool_2EDATATYPE: sTfun(del,$i) ).

tff(func_def_23,type,
    c_2Ebool_2EIN: sTfun(del,$i) ).

tff(func_def_24,type,
    c_2Ebool_2ELET: sTfun(del,sTfun(del,$i)) ).

tff(func_def_25,type,
    c_2Ebool_2EONE__ONE: sTfun(del,sTfun(del,$i)) ).

tff(func_def_26,type,
    c_2Ebool_2EONTO: sTfun(del,sTfun(del,$i)) ).

tff(func_def_27,type,
    c_2Ebool_2ERES__ABSTRACT: sTfun(del,sTfun(del,$i)) ).

tff(func_def_28,type,
    c_2Ebool_2ERES__EXISTS: sTfun(del,$i) ).

tff(func_def_29,type,
    c_2Ebool_2ERES__EXISTS__UNIQUE: sTfun(del,$i) ).

tff(func_def_30,type,
    c_2Ebool_2ERES__FORALL: sTfun(del,$i) ).

tff(func_def_31,type,
    c_2Ebool_2ERES__SELECT: sTfun(del,$i) ).

tff(func_def_33,type,
    c_2Ebool_2ETYPE__DEFINITION: sTfun(del,sTfun(del,$i)) ).

tff(func_def_35,type,
    c_2Ebool_2Eitself__case: sTfun(del,sTfun(del,$i)) ).

tff(func_def_36,type,
    c_2Ebool_2Eliteral__case: sTfun(del,sTfun(del,$i)) ).

tff(func_def_37,type,
    c_2Ebool_2Ethe__value: sTfun(del,$i) ).

tff(func_def_39,type,
    tp__i: $tType ).

tff(func_def_40,type,
    inj__i: sTfun(tp__i,$i) ).

tff(func_def_41,type,
    surj__i: sTfun($i,tp__i) ).

tff(func_def_49,type,
    sK0: sTfun($i,sTfun(del,$i)) ).

tff(func_def_51,type,
    sK2: sTfun($i,sTfun(del,sTfun($i,$i))) ).

tff(func_def_52,type,
    sK3: sTfun(del,sTfun($i,$i)) ).

tff(func_def_53,type,
    sK4: sTfun(sTfun($i,$i),sTfun(del,sTfun(del,$i))) ).

fof(f271,plain,
    $false,
    inference(cnf_transformation,[],[f218]) ).

fof(f218,plain,
    $false,
    inference(true_and_false_elimination,[],[f74]) ).

fof(f74,negated_conjecture,
    ~ $true,
    inference(negated_conjecture,[],[f73]) ).

fof(f73,conjecture,
    $true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ebool_2ETRUTH) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : ITP001^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.02/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31  % Computer : n029.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Sat May 18 18:01:08 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a TH0_THM_EQU_NAR problem
% 0.10/0.31  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.33  % (28235)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.33  % (28237)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.33  % (28238)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.16/0.33  % (28235)Instruction limit reached!
% 0.16/0.33  % (28235)------------------------------
% 0.16/0.33  % (28235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33  % (28235)Termination reason: Unknown
% 0.16/0.33  % (28235)Termination phase: shuffling
% 0.16/0.33  
% 0.16/0.33  % (28235)Memory used [KB]: 1151
% 0.16/0.33  % (28235)Time elapsed: 0.002 s
% 0.16/0.33  % (28235)Instructions burned: 3 (million)
% 0.16/0.33  % (28235)------------------------------
% 0.16/0.33  % (28235)------------------------------
% 0.16/0.33  % (28238)Instruction limit reached!
% 0.16/0.33  % (28238)------------------------------
% 0.16/0.33  % (28238)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33  % (28238)Termination reason: Unknown
% 0.16/0.33  % (28238)Termination phase: shuffling
% 0.16/0.33  
% 0.16/0.33  % (28238)Memory used [KB]: 1151
% 0.16/0.33  % (28238)Time elapsed: 0.002 s
% 0.16/0.33  % (28238)Instructions burned: 4 (million)
% 0.16/0.33  % (28238)------------------------------
% 0.16/0.33  % (28238)------------------------------
% 0.16/0.33  % (28237)First to succeed.
% 0.16/0.33  % (28237)Refutation found. Thanks to Tanya!
% 0.16/0.33  % SZS status Theorem for theBenchmark
% 0.16/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33  % (28237)------------------------------
% 0.16/0.33  % (28237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33  % (28237)Termination reason: Refutation
% 0.16/0.33  
% 0.16/0.33  % (28237)Memory used [KB]: 5756
% 0.16/0.33  % (28237)Time elapsed: 0.006 s
% 0.16/0.33  % (28237)Instructions burned: 13 (million)
% 0.16/0.33  % (28237)------------------------------
% 0.16/0.33  % (28237)------------------------------
% 0.16/0.33  % (28230)Success in time 0.008 s
% 0.16/0.33  % Vampire---4.8 exiting
%------------------------------------------------------------------------------