TSTP Solution File: SET002^3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET002^3 : TPTP v8.2.0. Released v8.1.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 : n008.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 : Tue May 21 03:07:33 EDT 2024

% Result   : Theorem 0.15s 0.40s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET002^3 : TPTP v8.2.0. Released v8.1.0.
% 0.12/0.15  % 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.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 20 13:06:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_EQU_NAR problem
% 0.15/0.36  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.15/0.38  % (12750)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38  % (12747)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.38  % (12749)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.15/0.38  % (12751)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.15/0.38  % (12748)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.15/0.38  % (12752)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.15/0.38  % (12753)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38  % (12754)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.15/0.38  % (12750)Instruction limit reached!
% 0.15/0.38  % (12750)------------------------------
% 0.15/0.38  % (12750)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (12750)Termination reason: Unknown
% 0.15/0.38  % (12750)Termination phase: shuffling
% 0.15/0.38  
% 0.15/0.38  % (12750)Memory used [KB]: 1023
% 0.15/0.38  % (12750)Time elapsed: 0.003 s
% 0.15/0.38  % (12750)Instructions burned: 2 (million)
% 0.15/0.38  % (12750)------------------------------
% 0.15/0.38  % (12750)------------------------------
% 0.15/0.38  % (12751)Instruction limit reached!
% 0.15/0.38  % (12751)------------------------------
% 0.15/0.38  % (12751)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (12751)Termination reason: Unknown
% 0.15/0.38  % (12751)Termination phase: shuffling
% 0.15/0.38  
% 0.15/0.38  % (12751)Memory used [KB]: 1023
% 0.15/0.38  % (12751)Time elapsed: 0.004 s
% 0.15/0.38  % (12751)Instructions burned: 3 (million)
% 0.15/0.38  % (12751)------------------------------
% 0.15/0.38  % (12751)------------------------------
% 0.15/0.38  % (12754)Instruction limit reached!
% 0.15/0.38  % (12754)------------------------------
% 0.15/0.38  % (12754)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (12754)Termination reason: Unknown
% 0.15/0.38  % (12754)Termination phase: shuffling
% 0.15/0.38  
% 0.15/0.38  % (12754)Memory used [KB]: 1023
% 0.15/0.38  % (12754)Time elapsed: 0.004 s
% 0.15/0.38  % (12754)Instructions burned: 4 (million)
% 0.15/0.38  % (12754)------------------------------
% 0.15/0.38  % (12754)------------------------------
% 0.15/0.38  % (12748)Instruction limit reached!
% 0.15/0.38  % (12748)------------------------------
% 0.15/0.38  % (12748)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (12748)Termination reason: Unknown
% 0.15/0.38  % (12748)Termination phase: Property scanning
% 0.15/0.38  
% 0.15/0.38  % (12748)Memory used [KB]: 1023
% 0.15/0.38  % (12748)Time elapsed: 0.004 s
% 0.15/0.38  % (12748)Instructions burned: 5 (million)
% 0.15/0.38  % (12748)------------------------------
% 0.15/0.38  % (12748)------------------------------
% 0.15/0.39  % (12752)Refutation not found, incomplete strategy
% 0.15/0.39  % (12752)------------------------------
% 0.15/0.39  % (12752)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (12752)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39  
% 0.15/0.39  
% 0.15/0.39  % (12752)Memory used [KB]: 5500
% 0.15/0.39  % (12752)Time elapsed: 0.007 s
% 0.15/0.39  % (12752)Instructions burned: 8 (million)
% 0.15/0.39  % (12752)------------------------------
% 0.15/0.39  % (12752)------------------------------
% 0.15/0.39  % (12753)Instruction limit reached!
% 0.15/0.39  % (12753)------------------------------
% 0.15/0.39  % (12753)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (12753)Termination reason: Unknown
% 0.15/0.39  % (12753)Termination phase: Saturation
% 0.15/0.39  
% 0.15/0.39  % (12753)Memory used [KB]: 5628
% 0.15/0.39  % (12753)Time elapsed: 0.012 s
% 0.15/0.39  % (12753)Instructions burned: 19 (million)
% 0.15/0.39  % (12753)------------------------------
% 0.15/0.39  % (12753)------------------------------
% 0.15/0.39  % (12749)Instruction limit reached!
% 0.15/0.39  % (12749)------------------------------
% 0.15/0.39  % (12749)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (12749)Termination reason: Unknown
% 0.15/0.39  % (12749)Termination phase: Saturation
% 0.15/0.39  
% 0.15/0.39  % (12749)Memory used [KB]: 5756
% 0.15/0.39  % (12749)Time elapsed: 0.015 s
% 0.15/0.39  % (12749)Instructions burned: 27 (million)
% 0.15/0.39  % (12749)------------------------------
% 0.15/0.39  % (12749)------------------------------
% 0.15/0.40  % (12755)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.15/0.40  % (12756)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.15/0.40  % (12757)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.40  % (12758)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.15/0.40  % (12747)First to succeed.
% 0.15/0.40  % (12757)Instruction limit reached!
% 0.15/0.40  % (12757)------------------------------
% 0.15/0.40  % (12757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40  % (12757)Termination reason: Unknown
% 0.15/0.40  % (12757)Termination phase: shuffling
% 0.15/0.40  
% 0.15/0.40  % (12757)Memory used [KB]: 1023
% 0.15/0.40  % (12757)Time elapsed: 0.004 s
% 0.15/0.40  % (12757)Instructions burned: 4 (million)
% 0.15/0.40  % (12757)------------------------------
% 0.15/0.40  % (12757)------------------------------
% 0.15/0.40  % (12759)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.40  % (12747)Refutation found. Thanks to Tanya!
% 0.15/0.40  % SZS status Theorem for theBenchmark
% 0.15/0.40  % SZS output start Proof for theBenchmark
% 0.15/0.40  thf(type_def_5, type, mworld: $tType).
% 0.15/0.40  thf(func_def_0, type, mworld: $tType).
% 0.15/0.40  thf(func_def_1, type, mrel: mworld > mworld > $o).
% 0.15/0.40  thf(func_def_2, type, mactual: mworld).
% 0.15/0.40  thf(func_def_3, type, mlocal: (mworld > $o) > $o).
% 0.15/0.40  thf(func_def_5, type, mnot: (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_6, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_7, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_8, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_9, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_10, type, mbox: (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_11, type, mdia: (mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_12, type, mforall_di: ($i > mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_13, type, mexists_di: ($i > mworld > $o) > mworld > $o).
% 0.15/0.40  thf(func_def_14, type, qmltpeq: $i > $i > mworld > $o).
% 0.15/0.40  thf(func_def_15, type, member: $i > $i > mworld > $o).
% 0.15/0.40  thf(func_def_16, type, subset: $i > $i > mworld > $o).
% 0.15/0.40  thf(func_def_17, type, union: $i > $i > $i).
% 0.15/0.40  thf(func_def_31, type, sK0: mworld > mworld).
% 0.15/0.40  thf(func_def_35, type, sK2: $i > $i > $i).
% 0.15/0.40  thf(func_def_37, type, sK4: $i > $i > $i).
% 0.15/0.40  thf(f298,plain,(
% 0.15/0.40    $false),
% 0.15/0.40    inference(trivial_inequality_removal,[],[f294])).
% 0.15/0.40  thf(f294,plain,(
% 0.15/0.40    ($true = $false)),
% 0.15/0.40    inference(superposition,[],[f221,f290])).
% 0.15/0.40  thf(f290,plain,(
% 0.15/0.40    ($false = (subset @ sK3 @ sK3 @ mactual))),
% 0.15/0.40    inference(trivial_inequality_removal,[],[f287])).
% 0.15/0.40  thf(f287,plain,(
% 0.15/0.40    ($false = (subset @ sK3 @ sK3 @ mactual)) | ($true = $false)),
% 0.15/0.40    inference(superposition,[],[f258,f151])).
% 0.15/0.40  thf(f151,plain,(
% 0.15/0.40    ($false = (qmltpeq @ (union @ sK3 @ sK3) @ sK3 @ mactual))),
% 0.15/0.40    inference(beta_eta_normalization,[],[f150])).
% 0.15/0.40  thf(f150,plain,(
% 0.15/0.40    (((^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0 @ mactual)) @ sK3) = $false)),
% 0.15/0.40    inference(sigma_clausification,[],[f149])).
% 0.15/0.40  thf(f149,plain,(
% 0.15/0.40    ((!! @ $i @ (^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0 @ mactual))) != $true)),
% 0.15/0.40    inference(beta_eta_normalization,[],[f133])).
% 0.15/0.40  thf(f133,plain,(
% 0.15/0.40    (((^[Y0 : mworld > $o]: (Y0 @ mactual)) @ ((^[Y0 : $i > mworld > $o]: ((^[Y1 : mworld]: (!! @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0)))) != $true)),
% 0.15/0.40    inference(definition_unfolding,[],[f116,f106,f115])).
% 0.15/0.40  thf(f115,plain,(
% 0.15/0.40    (mforall_di = (^[Y0 : $i > mworld > $o]: ((^[Y1 : mworld]: (!! @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f38])).
% 0.15/0.40  thf(f38,plain,(
% 0.15/0.40    (mforall_di = (^[Y0 : $i > mworld > $o]: ((^[Y1 : mworld]: (!! @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.40    inference(fool_elimination,[],[f37])).
% 0.15/0.40  thf(f37,plain,(
% 0.15/0.40    ((^[X0 : $i > mworld > $o, X1 : mworld] : (! [X2] : (X0 @ X2 @ X1))) = mforall_di)),
% 0.15/0.40    inference(rectify,[],[f10])).
% 0.15/0.40  thf(f10,axiom,(
% 0.15/0.40    ((^[X1 : $i > mworld > $o, X2 : mworld] : (! [X5] : (X1 @ X5 @ X2))) = mforall_di)),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_di_def)).
% 0.15/0.40  thf(f106,plain,(
% 0.15/0.40    (mlocal = (^[Y0 : mworld > $o]: (Y0 @ mactual)))),
% 0.15/0.40    inference(cnf_transformation,[],[f67])).
% 0.15/0.40  thf(f67,plain,(
% 0.15/0.40    (mlocal = (^[Y0 : mworld > $o]: (Y0 @ mactual)))),
% 0.15/0.40    inference(fool_elimination,[],[f1])).
% 0.15/0.40  thf(f1,axiom,(
% 0.15/0.40    (mlocal = (^[X0 : mworld > $o] : (X0 @ mactual)))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def)).
% 0.15/0.40  thf(f116,plain,(
% 0.15/0.40    ($true != (mlocal @ (mforall_di @ (^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f86])).
% 0.15/0.40  thf(f86,plain,(
% 0.15/0.40    ($true != (mlocal @ (mforall_di @ (^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0)))))),
% 0.15/0.40    inference(flattening,[],[f44])).
% 0.15/0.40  thf(f44,plain,(
% 0.15/0.40    ~($true = (mlocal @ (mforall_di @ (^[Y0 : $i]: (qmltpeq @ (union @ Y0 @ Y0) @ Y0)))))),
% 0.15/0.40    inference(fool_elimination,[],[f43])).
% 0.15/0.40  thf(f43,plain,(
% 0.15/0.40    ~(mlocal @ (mforall_di @ (^[X0 : $i] : (qmltpeq @ (union @ X0 @ X0) @ X0))))),
% 0.15/0.40    inference(rectify,[],[f29])).
% 0.15/0.40  thf(f29,negated_conjecture,(
% 0.15/0.40    ~(mlocal @ (mforall_di @ (^[X3 : $i] : (qmltpeq @ (union @ X3 @ X3) @ X3))))),
% 0.15/0.40    inference(negated_conjecture,[],[f28])).
% 0.15/0.40  thf(f28,conjecture,(
% 0.15/0.40    (mlocal @ (mforall_di @ (^[X3 : $i] : (qmltpeq @ (union @ X3 @ X3) @ X3))))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_union)).
% 0.15/0.40  thf(f258,plain,(
% 0.15/0.40    ( ! [X2 : $i,X1 : $i] : (($true = (qmltpeq @ (union @ X1 @ X2) @ X2 @ mactual)) | ((subset @ X1 @ X2 @ mactual) = $false)) )),
% 0.15/0.40    inference(binary_proxy_clausification,[],[f257])).
% 0.15/0.40  thf(f257,plain,(
% 0.15/0.40    ( ! [X2 : $i,X1 : $i] : (($true = ((subset @ X1 @ X2 @ mactual) => (qmltpeq @ (union @ X1 @ X2) @ X2 @ mactual)))) )),
% 0.15/0.40    inference(beta_eta_normalization,[],[f256])).
% 0.15/0.40  thf(f256,plain,(
% 0.15/0.40    ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((subset @ X1 @ Y0 @ mactual) => (qmltpeq @ (union @ X1 @ Y0) @ Y0 @ mactual))) @ X2))) )),
% 0.15/0.40    inference(pi_clausification,[],[f255])).
% 0.15/0.40  thf(f255,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((subset @ X1 @ Y0 @ mactual) => (qmltpeq @ (union @ X1 @ Y0) @ Y0 @ mactual)))))) )),
% 0.15/0.40    inference(beta_eta_normalization,[],[f254])).
% 0.15/0.40  thf(f254,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1 @ mactual) => (qmltpeq @ (union @ Y0 @ Y1) @ Y1 @ mactual))))) @ X1))) )),
% 0.15/0.40    inference(pi_clausification,[],[f253])).
% 0.15/0.40  thf(f253,plain,(
% 0.15/0.40    ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ Y1 @ mactual) => (qmltpeq @ (union @ Y0 @ Y1) @ Y1 @ mactual)))))))),
% 0.15/0.40    inference(beta_eta_normalization,[],[f125])).
% 0.15/0.40  thf(f125,plain,(
% 0.15/0.40    ($true = ((^[Y0 : mworld > $o]: (Y0 @ mactual)) @ ((^[Y0 : $i > mworld > $o]: ((^[Y1 : mworld]: (!! @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i]: ((^[Y1 : $i > mworld > $o]: ((^[Y2 : mworld]: (!! @ $i @ (^[Y3 : $i]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : $i]: ((^[Y2 : mworld > $o]: ((^[Y3 : mworld > $o]: ((^[Y4 : mworld]: ((Y2 @ Y4) => (Y3 @ Y4))))))) @ (subset @ Y0 @ Y1) @ (qmltpeq @ (union @ Y0 @ Y1) @ Y1))))))))),
% 0.15/0.40    inference(definition_unfolding,[],[f101,f106,f115,f115,f113])).
% 0.15/0.40  thf(f113,plain,(
% 0.15/0.40    (mimplies = (^[Y0 : mworld > $o]: ((^[Y1 : mworld > $o]: ((^[Y2 : mworld]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f32])).
% 0.15/0.40  thf(f32,plain,(
% 0.15/0.40    (mimplies = (^[Y0 : mworld > $o]: ((^[Y1 : mworld > $o]: ((^[Y2 : mworld]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.15/0.40    inference(fool_elimination,[],[f31])).
% 0.15/0.40  thf(f31,plain,(
% 0.15/0.40    ((^[X0 : mworld > $o, X1 : mworld > $o, X2 : mworld] : ((X0 @ X2) => (X1 @ X2))) = mimplies)),
% 0.15/0.40    inference(rectify,[],[f5])).
% 0.15/0.40  thf(f5,axiom,(
% 0.15/0.40    ((^[X1 : mworld > $o, X3 : mworld > $o, X2 : mworld] : ((X1 @ X2) => (X3 @ X2))) = mimplies)),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def)).
% 0.15/0.40  thf(f101,plain,(
% 0.15/0.40    ($true = (mlocal @ (mforall_di @ (^[Y0 : $i]: (mforall_di @ (^[Y1 : $i]: (mimplies @ (subset @ Y0 @ Y1) @ (qmltpeq @ (union @ Y0 @ Y1) @ Y1))))))))),
% 0.15/0.40    inference(cnf_transformation,[],[f40])).
% 0.15/0.40  thf(f40,plain,(
% 0.15/0.40    ($true = (mlocal @ (mforall_di @ (^[Y0 : $i]: (mforall_di @ (^[Y1 : $i]: (mimplies @ (subset @ Y0 @ Y1) @ (qmltpeq @ (union @ Y0 @ Y1) @ Y1))))))))),
% 0.15/0.40    inference(fool_elimination,[],[f39])).
% 0.15/0.40  thf(f39,plain,(
% 0.15/0.40    (mlocal @ (mforall_di @ (^[X0 : $i] : (mforall_di @ (^[X1 : $i] : (mimplies @ (subset @ X0 @ X1) @ (qmltpeq @ (union @ X0 @ X1) @ X1)))))))),
% 0.15/0.40    inference(rectify,[],[f21])).
% 0.15/0.40  thf(f21,axiom,(
% 0.15/0.40    (mlocal @ (mforall_di @ (^[X3 : $i] : (mforall_di @ (^[X8 : $i] : (mimplies @ (subset @ X3 @ X8) @ (qmltpeq @ (union @ X3 @ X8) @ X8)))))))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_union)).
% 0.15/0.40  thf(f221,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = (subset @ X1 @ X1 @ mactual))) )),
% 0.15/0.40    inference(beta_eta_normalization,[],[f220])).
% 0.15/0.40  thf(f220,plain,(
% 0.15/0.40    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (subset @ Y0 @ Y0 @ mactual)) @ X1))) )),
% 0.15/0.40    inference(pi_clausification,[],[f219])).
% 0.15/0.40  thf(f219,plain,(
% 0.15/0.40    ($true = (!! @ $i @ (^[Y0 : $i]: (subset @ Y0 @ Y0 @ mactual))))),
% 0.15/0.40    inference(beta_eta_normalization,[],[f118])).
% 0.15/0.40  thf(f118,plain,(
% 0.15/0.40    (((^[Y0 : mworld > $o]: (Y0 @ mactual)) @ ((^[Y0 : $i > mworld > $o]: ((^[Y1 : mworld]: (!! @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i]: (subset @ Y0 @ Y0)))) = $true)),
% 0.15/0.40    inference(definition_unfolding,[],[f90,f106,f115])).
% 0.15/0.40  thf(f90,plain,(
% 0.15/0.40    ($true = (mlocal @ (mforall_di @ (^[Y0 : $i]: (subset @ Y0 @ Y0)))))),
% 0.15/0.40    inference(cnf_transformation,[],[f34])).
% 0.15/0.40  thf(f34,plain,(
% 0.15/0.40    ($true = (mlocal @ (mforall_di @ (^[Y0 : $i]: (subset @ Y0 @ Y0)))))),
% 0.15/0.40    inference(fool_elimination,[],[f33])).
% 0.15/0.40  thf(f33,plain,(
% 0.15/0.40    (mlocal @ (mforall_di @ (^[X0 : $i] : (subset @ X0 @ X0))))),
% 0.15/0.40    inference(rectify,[],[f26])).
% 0.15/0.40  thf(f26,axiom,(
% 0.15/0.40    (mlocal @ (mforall_di @ (^[X3 : $i] : (subset @ X3 @ X3))))),
% 0.15/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset)).
% 0.15/0.40  % SZS output end Proof for theBenchmark
% 0.15/0.40  % (12747)------------------------------
% 0.15/0.40  % (12747)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40  % (12747)Termination reason: Refutation
% 0.15/0.40  
% 0.15/0.40  % (12747)Memory used [KB]: 5884
% 0.15/0.40  % (12747)Time elapsed: 0.021 s
% 0.15/0.40  % (12747)Instructions burned: 33 (million)
% 0.15/0.40  % (12747)------------------------------
% 0.15/0.40  % (12747)------------------------------
% 0.15/0.40  % (12746)Success in time 0.02 s
% 0.15/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------