TSTP Solution File: SEU580^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU580^2 : TPTP v8.2.0. Released v3.7.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 : n007.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:49:44 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU580^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/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 : n007.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 : Sun May 19 16:37:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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 % (30294)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 % (30292)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 % (30290)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (30291)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 % (30288)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 % (30289)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 % (30293)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 % (30294)Instruction limit reached!
% 0.15/0.38 % (30294)------------------------------
% 0.15/0.38 % (30294)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (30294)Termination reason: Unknown
% 0.15/0.38 % (30294)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (30294)Memory used [KB]: 5500
% 0.15/0.38 % (30294)Time elapsed: 0.003 s
% 0.15/0.38 % (30294)Instructions burned: 3 (million)
% 0.15/0.38 % (30294)------------------------------
% 0.15/0.38 % (30294)------------------------------
% 0.15/0.39 % (30290)Instruction limit reached!
% 0.15/0.39 % (30290)------------------------------
% 0.15/0.39 % (30290)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30290)Termination reason: Unknown
% 0.15/0.39 % (30290)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (30290)Memory used [KB]: 5500
% 0.15/0.39 % (30291)Instruction limit reached!
% 0.15/0.39 % (30291)------------------------------
% 0.15/0.39 % (30291)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30291)Termination reason: Unknown
% 0.15/0.39 % (30291)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (30291)Memory used [KB]: 5500
% 0.15/0.39 % (30291)Time elapsed: 0.003 s
% 0.15/0.39 % (30291)Instructions burned: 3 (million)
% 0.15/0.39 % (30291)------------------------------
% 0.15/0.39 % (30291)------------------------------
% 0.15/0.39 % (30290)Time elapsed: 0.003 s
% 0.15/0.39 % (30290)Instructions burned: 3 (million)
% 0.15/0.39 % (30290)------------------------------
% 0.15/0.39 % (30290)------------------------------
% 0.15/0.39 % (30288)Instruction limit reached!
% 0.15/0.39 % (30288)------------------------------
% 0.15/0.39 % (30288)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30288)Termination reason: Unknown
% 0.15/0.39 % (30288)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (30288)Memory used [KB]: 5500
% 0.15/0.39 % (30288)Time elapsed: 0.004 s
% 0.15/0.39 % (30288)Instructions burned: 4 (million)
% 0.15/0.39 % (30288)------------------------------
% 0.15/0.39 % (30288)------------------------------
% 0.15/0.39 % (30287)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.39 % (30292)First to succeed.
% 0.15/0.39 % (30289)Also succeeded, but the first one will report.
% 0.15/0.39 % (30292)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.39 thf(func_def_2, type, dsetconstr: $i > ($i > $o) > $i).
% 0.15/0.39 thf(func_def_12, type, sK2: $i > $i > $i).
% 0.15/0.39 thf(func_def_13, type, sK3: $i > $o).
% 0.15/0.39 thf(func_def_16, type, sK6: $i > $o).
% 0.15/0.39 thf(func_def_19, type, ph9: !>[X0: $tType]:(X0)).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f59])).
% 0.15/0.39 thf(f59,plain,(
% 0.15/0.39 ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f45,f57])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i > $o] : (((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X0)) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f56])).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i > $o] : (($true != $true) | ((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X0)) = $true)) )),
% 0.15/0.39 inference(duplicate_literal_removal,[],[f54])).
% 0.15/0.39 thf(f54,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i > $o] : (((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X0)) = $true) | ($true != $true) | ((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X0)) = $true)) )),
% 0.15/0.39 inference(superposition,[],[f44,f51])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true = (in @ (sK2 @ (dsetconstr @ X0 @ X1) @ X2) @ X0)) | ((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X2)) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ (dsetconstr @ X0 @ X1) @ (powerset @ X2)) = $true) | ($true = (in @ (sK2 @ (dsetconstr @ X0 @ X1) @ X2) @ X0)) | ($true != $true)) )),
% 0.15/0.39 inference(superposition,[],[f47,f48])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ (sK2 @ X4 @ X3) @ X4)) | ((in @ X4 @ (powerset @ X3)) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ X4 @ (powerset @ X3)) = $true) | ($true != $true) | ($true = (in @ (sK2 @ X4 @ X3) @ X4))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f28,f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 (powersetI = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 (powersetI = $true) & (dsetconstrEL = $true) & ($true != (in @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (sK3 @ Y0))) @ (powerset @ sK4)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 ? [X0 : $i > $o,X1] : ((in @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ (powerset @ X1)) != $true) => ($true != (in @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (sK3 @ Y0))) @ (powerset @ sK4)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 (powersetI = $true) & (dsetconstrEL = $true) & ? [X0 : $i > $o,X1] : ((in @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ (powerset @ X1)) != $true)),
% 0.15/0.39 inference(flattening,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (? [X0 : $i > $o,X1] : ((in @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ (powerset @ X1)) != $true) & (powersetI = $true)) & (dsetconstrEL = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 ~((dsetconstrEL = $true) => ((powersetI = $true) => ! [X0 : $i > $o,X1] : ((in @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ (powerset @ X1)) = $true)))),
% 0.15/0.39 inference(fool_elimination,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 ~(dsetconstrEL => (powersetI => ! [X0 : $i > $o,X1] : (in @ (dsetconstr @ X1 @ (^[X2 : $i] : (X0 @ X2))) @ (powerset @ X1))))),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,negated_conjecture,(
% 0.15/0.39 ~(dsetconstrEL => (powersetI => ! [X1 : $i > $o,X0] : (in @ (dsetconstr @ X0 @ (^[X2 : $i] : (X1 @ X2))) @ (powerset @ X0))))),
% 0.15/0.39 inference(negated_conjecture,[],[f3])).
% 0.15/0.39 thf(f3,conjecture,(
% 0.15/0.39 dsetconstrEL => (powersetI => ! [X1 : $i > $o,X0] : (in @ (dsetconstr @ X0 @ (^[X2 : $i] : (X1 @ X2))) @ (powerset @ X0)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',sepInPowerset)).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ X4 @ (powerset @ X3)) = $true) | ($true = (in @ (sK2 @ X4 @ X3) @ X4)) | (powersetI != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f20])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 ((powersetI = $true) | (((in @ sK1 @ (powerset @ sK0)) != $true) & ! [X2] : (($true != (in @ X2 @ sK1)) | ($true = (in @ X2 @ sK0))))) & (! [X3,X4] : (((in @ X4 @ (powerset @ X3)) = $true) | (($true = (in @ (sK2 @ X4 @ X3) @ X4)) & ($true != (in @ (sK2 @ X4 @ X3) @ X3)))) | (powersetI != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f19,f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true))) => (((in @ sK1 @ (powerset @ sK0)) != $true) & ! [X2] : (($true != (in @ X2 @ sK1)) | ($true = (in @ X2 @ sK0))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ! [X3,X4] : (? [X5] : (((in @ X5 @ X4) = $true) & ($true != (in @ X5 @ X3))) => (($true = (in @ (sK2 @ X4 @ X3) @ X4)) & ($true != (in @ (sK2 @ X4 @ X3) @ X3))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)))) & (! [X3,X4] : (((in @ X4 @ (powerset @ X3)) = $true) | ? [X5] : (((in @ X5 @ X4) = $true) & ($true != (in @ X5 @ X3)))) | (powersetI != $true))),
% 0.15/0.39 inference(rectify,[],[f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)))) & (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) | (powersetI != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 (powersetI = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)))),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 (powersetI = $true) <=> ! [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.15/0.39 inference(fool_elimination,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 (powersetI = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (powersetI = ! [X0,X4] : (! [X2] : ((in @ X2 @ X4) => (in @ X2 @ X0)) => (in @ X4 @ (powerset @ X0))))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI)).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != (in @ X2 @ (dsetconstr @ X0 @ X1))) | ((in @ X2 @ X0) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f46])).
% 0.15/0.39 thf(f46,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ($true != $true) | ((in @ X2 @ X0) = $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f36,f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 (dsetconstrEL = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f22])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true) | (dsetconstrEL != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 (! [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true)) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | (($true = (in @ sK7 @ (dsetconstr @ sK5 @ (^[Y0 : $i]: (sK6 @ Y0))))) & ($true != (in @ sK7 @ sK5))))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f24,f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ? [X3,X4 : $i > $o,X5] : (($true = (in @ X5 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X4 @ Y0))))) & ($true != (in @ X5 @ X3))) => (($true = (in @ sK7 @ (dsetconstr @ sK5 @ (^[Y0 : $i]: (sK6 @ Y0))))) & ($true != (in @ sK7 @ sK5)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 (! [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true)) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X3,X4 : $i > $o,X5] : (($true = (in @ X5 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X4 @ Y0))))) & ($true != (in @ X5 @ X3))))),
% 0.15/0.39 inference(rectify,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 (! [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true)) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ((in @ X2 @ X0) != $true)))),
% 0.15/0.39 inference(nnf_transformation,[],[f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ! [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X2 @ X0) = $true)) <=> (dsetconstrEL = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 ! [X0,X1 : $i > $o,X2] : (((in @ X2 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) => ((in @ X2 @ X0) = $true)) <=> (dsetconstrEL = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 (dsetconstrEL = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (dsetconstrEL = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrEL)).
% 0.15/0.39 thf(f44,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK2 @ X4 @ X3) @ X3)) | ((in @ X4 @ (powerset @ X3)) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true != (in @ (sK2 @ X4 @ X3) @ X3)) | ((in @ X4 @ (powerset @ X3)) = $true) | ($true != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f27,f33])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ X4 @ (powerset @ X3)) = $true) | ($true != (in @ (sK2 @ X4 @ X3) @ X3)) | (powersetI != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f20])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 ($true != (in @ (dsetconstr @ sK4 @ sK3) @ (powerset @ sK4)))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f31])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ($true != (in @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (sK3 @ Y0))) @ (powerset @ sK4)))),
% 0.15/0.39 inference(cnf_transformation,[],[f22])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (30292)------------------------------
% 0.15/0.39 % (30292)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (30292)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (30292)Memory used [KB]: 5500
% 0.15/0.39 % (30292)Time elapsed: 0.006 s
% 0.15/0.39 % (30292)Instructions burned: 5 (million)
% 0.15/0.39 % (30292)------------------------------
% 0.15/0.39 % (30292)------------------------------
% 0.15/0.39 % (30286)Success in time 0.017 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------