TSTP Solution File: SEU524^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU524^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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:21 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU524^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:54:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.34 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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36 % (15216)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.13/0.36 % (15213)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.13/0.36 % (15219)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.13/0.36 % (15216)Instruction limit reached!
% 0.13/0.36 % (15216)------------------------------
% 0.13/0.36 % (15216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (15216)Termination reason: Unknown
% 0.13/0.36 % (15216)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (15216)Memory used [KB]: 895
% 0.13/0.36 % (15216)Time elapsed: 0.003 s
% 0.13/0.36 % (15216)Instructions burned: 2 (million)
% 0.13/0.36 % (15216)------------------------------
% 0.13/0.36 % (15216)------------------------------
% 0.13/0.36 % (15214)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.13/0.36 % (15215)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.36 % (15218)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.36 % (15217)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.13/0.36 % (15219)Instruction limit reached!
% 0.13/0.36 % (15219)------------------------------
% 0.13/0.36 % (15219)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (15219)Termination reason: Unknown
% 0.13/0.36 % (15219)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (15219)Memory used [KB]: 5500
% 0.13/0.36 % (15219)Time elapsed: 0.003 s
% 0.13/0.36 % (15219)Instructions burned: 3 (million)
% 0.13/0.36 % (15219)------------------------------
% 0.13/0.36 % (15219)------------------------------
% 0.13/0.36 % (15213)Instruction limit reached!
% 0.13/0.36 % (15213)------------------------------
% 0.13/0.36 % (15213)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (15213)Termination reason: Unknown
% 0.13/0.36 % (15213)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (15213)Memory used [KB]: 5500
% 0.13/0.36 % (15213)Time elapsed: 0.004 s
% 0.13/0.36 % (15213)Instructions burned: 5 (million)
% 0.13/0.36 % (15213)------------------------------
% 0.13/0.36 % (15213)------------------------------
% 0.13/0.36 % (15215)Instruction limit reached!
% 0.13/0.36 % (15215)------------------------------
% 0.13/0.36 % (15215)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (15215)Termination reason: Unknown
% 0.13/0.36 % (15215)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (15215)Memory used [KB]: 5500
% 0.13/0.36 % (15215)Time elapsed: 0.003 s
% 0.13/0.36 % (15215)Instructions burned: 3 (million)
% 0.13/0.36 % (15215)------------------------------
% 0.13/0.36 % (15215)------------------------------
% 0.13/0.36 % (15212)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.13/0.37 % (15217)First to succeed.
% 0.13/0.37 % (15214)Also succeeded, but the first one will report.
% 0.13/0.37 % (15218)Also succeeded, but the first one will report.
% 0.13/0.37 % (15217)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.37 thf(func_def_1, type, powerset: $i > $i).
% 0.13/0.37 thf(func_def_2, type, setunion: $i > $i).
% 0.13/0.37 thf(func_def_8, type, sK0: $i > $i > $i).
% 0.13/0.37 thf(f69,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(subsumption_resolution,[],[f66,f33])).
% 0.13/0.37 thf(f33,plain,(
% 0.13/0.37 ((in @ sK4 @ sK3) = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f23])).
% 0.13/0.37 thf(f23,plain,(
% 0.13/0.37 (setunionI = $true) & (((in @ sK4 @ (powerset @ (setunion @ sK3))) != $true) & ((in @ sK4 @ sK3) = $true)) & (powersetI = $true)),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f16,f22])).
% 0.13/0.37 thf(f22,plain,(
% 0.13/0.37 ? [X0,X1] : (((in @ X1 @ (powerset @ (setunion @ X0))) != $true) & ((in @ X1 @ X0) = $true)) => (((in @ sK4 @ (powerset @ (setunion @ sK3))) != $true) & ((in @ sK4 @ sK3) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f16,plain,(
% 0.13/0.37 (setunionI = $true) & ? [X0,X1] : (((in @ X1 @ (powerset @ (setunion @ X0))) != $true) & ((in @ X1 @ X0) = $true)) & (powersetI = $true)),
% 0.13/0.37 inference(flattening,[],[f15])).
% 0.13/0.37 thf(f15,plain,(
% 0.13/0.37 (? [X0,X1] : (((in @ X1 @ (powerset @ (setunion @ X0))) != $true) & ((in @ X1 @ X0) = $true)) & (setunionI = $true)) & (powersetI = $true)),
% 0.13/0.37 inference(ennf_transformation,[],[f9])).
% 0.13/0.37 thf(f9,plain,(
% 0.13/0.37 ~((powersetI = $true) => ((setunionI = $true) => ! [X0,X1] : (((in @ X1 @ X0) = $true) => ((in @ X1 @ (powerset @ (setunion @ X0))) = $true))))),
% 0.13/0.37 inference(fool_elimination,[],[f8])).
% 0.13/0.37 thf(f8,plain,(
% 0.13/0.37 ~(powersetI => (setunionI => ! [X0,X1] : ((in @ X1 @ X0) => (in @ X1 @ (powerset @ (setunion @ X0))))))),
% 0.13/0.37 inference(rectify,[],[f4])).
% 0.13/0.37 thf(f4,negated_conjecture,(
% 0.13/0.37 ~(powersetI => (setunionI => ! [X0,X2] : ((in @ X2 @ X0) => (in @ X2 @ (powerset @ (setunion @ X0))))))),
% 0.13/0.37 inference(negated_conjecture,[],[f3])).
% 0.13/0.37 thf(f3,conjecture,(
% 0.13/0.37 powersetI => (setunionI => ! [X0,X2] : ((in @ X2 @ X0) => (in @ X2 @ (powerset @ (setunion @ X0)))))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subPowSU)).
% 0.13/0.37 thf(f66,plain,(
% 0.13/0.37 ((in @ sK4 @ sK3) != $true)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f63])).
% 0.13/0.37 thf(f63,plain,(
% 0.13/0.37 ((in @ sK4 @ sK3) != $true) | ($true != $true)),
% 0.13/0.37 inference(superposition,[],[f34,f61])).
% 0.13/0.37 thf(f61,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ (setunion @ X1))) = $true) | ((in @ X0 @ X1) != $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f60])).
% 0.13/0.37 thf(f60,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ (setunion @ X1))) = $true) | ((in @ X0 @ X1) != $true) | ($true != $true)) )),
% 0.13/0.37 inference(duplicate_literal_removal,[],[f56])).
% 0.13/0.37 thf(f56,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ (setunion @ X1))) = $true) | ((in @ X0 @ X1) != $true) | ($true != $true) | ((in @ X0 @ (powerset @ (setunion @ X1))) = $true)) )),
% 0.13/0.37 inference(superposition,[],[f55,f49])).
% 0.13/0.37 thf(f49,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((in @ X1 @ (powerset @ X0)) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f40])).
% 0.13/0.37 thf(f40,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) = $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f31,f32])).
% 0.13/0.37 thf(f32,plain,(
% 0.13/0.37 (powersetI = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f23])).
% 0.13/0.37 thf(f31,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((in @ X1 @ (powerset @ X0)) = $true) | (powersetI != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f21])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 (! [X0,X1] : ((((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ((in @ (sK0 @ X1 @ X0) @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | (! [X5] : (((in @ X5 @ sK2) != $true) | ((in @ X5 @ sK1) = $true)) & ((in @ sK2 @ (powerset @ sK1)) != $true)))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f20,f19])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ((in @ (sK0 @ X1 @ X0) @ X0) != $true)))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 ? [X3,X4] : (! [X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) & ((in @ X4 @ (powerset @ X3)) != $true)) => (! [X5] : (((in @ X5 @ sK2) != $true) | ((in @ X5 @ sK1) = $true)) & ((in @ sK2 @ (powerset @ sK1)) != $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | ? [X3,X4] : (! [X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) & ((in @ X4 @ (powerset @ X3)) != $true)))),
% 0.13/0.37 inference(rectify,[],[f17])).
% 0.13/0.37 thf(f17,plain,(
% 0.13/0.37 (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) | (powersetI != $true)) & ((powersetI = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ((in @ X1 @ (powerset @ X0)) != $true)))),
% 0.13/0.37 inference(nnf_transformation,[],[f12])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((in @ X1 @ (powerset @ X0)) = $true)) <=> (powersetI = $true)),
% 0.13/0.37 inference(ennf_transformation,[],[f11])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 ! [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((in @ X1 @ (powerset @ X0)) = $true)) <=> (powersetI = $true)),
% 0.13/0.37 inference(fool_elimination,[],[f10])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 0.13/0.37 inference(rectify,[],[f1])).
% 0.13/0.37 thf(f1,axiom,(
% 0.13/0.37 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))) = powersetI)),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI)).
% 0.13/0.37 thf(f55,plain,(
% 0.13/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (sK0 @ X0 @ (setunion @ X1)) @ X2) != $true) | ((in @ X2 @ X1) != $true) | ((in @ X0 @ (powerset @ (setunion @ X1))) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f54])).
% 0.13/0.37 thf(f54,plain,(
% 0.13/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ (setunion @ X1))) = $true) | ((in @ (sK0 @ X0 @ (setunion @ X1)) @ X2) != $true) | ($true != $true) | ((in @ X2 @ X1) != $true)) )),
% 0.13/0.37 inference(superposition,[],[f50,f48])).
% 0.13/0.37 thf(f48,plain,(
% 0.13/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X2)) = $true) | ((in @ X1 @ X0) != $true) | ((in @ X0 @ X2) != $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f44])).
% 0.13/0.37 thf(f44,plain,(
% 0.13/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X2)) = $true) | ((in @ X1 @ X0) != $true) | ($true != $true) | ((in @ X0 @ X2) != $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f39,f35])).
% 0.13/0.37 thf(f35,plain,(
% 0.13/0.37 (setunionI = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f23])).
% 0.13/0.37 thf(f39,plain,(
% 0.13/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X2)) = $true) | ((in @ X0 @ X2) != $true) | ((in @ X1 @ X0) != $true) | (setunionI != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f27])).
% 0.13/0.37 thf(f27,plain,(
% 0.13/0.37 (! [X0,X1,X2] : (((in @ X1 @ (setunion @ X2)) = $true) | ((in @ X0 @ X2) != $true) | ((in @ X1 @ X0) != $true)) | (setunionI != $true)) & ((setunionI = $true) | (($true != (in @ sK6 @ (setunion @ sK7))) & ((in @ sK5 @ sK7) = $true) & ((in @ sK6 @ sK5) = $true)))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f25,f26])).
% 0.13/0.37 thf(f26,plain,(
% 0.13/0.37 ? [X3,X4,X5] : (($true != (in @ X4 @ (setunion @ X5))) & ((in @ X3 @ X5) = $true) & ((in @ X4 @ X3) = $true)) => (($true != (in @ sK6 @ (setunion @ sK7))) & ((in @ sK5 @ sK7) = $true) & ((in @ sK6 @ sK5) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f25,plain,(
% 0.13/0.37 (! [X0,X1,X2] : (((in @ X1 @ (setunion @ X2)) = $true) | ((in @ X0 @ X2) != $true) | ((in @ X1 @ X0) != $true)) | (setunionI != $true)) & ((setunionI = $true) | ? [X3,X4,X5] : (($true != (in @ X4 @ (setunion @ X5))) & ((in @ X3 @ X5) = $true) & ((in @ X4 @ X3) = $true)))),
% 0.13/0.37 inference(rectify,[],[f24])).
% 0.13/0.37 thf(f24,plain,(
% 0.13/0.37 (! [X1,X2,X0] : (((in @ X2 @ (setunion @ X0)) = $true) | ((in @ X1 @ X0) != $true) | ((in @ X2 @ X1) != $true)) | (setunionI != $true)) & ((setunionI = $true) | ? [X1,X2,X0] : (((in @ X2 @ (setunion @ X0)) != $true) & ((in @ X1 @ X0) = $true) & ((in @ X2 @ X1) = $true)))),
% 0.13/0.37 inference(nnf_transformation,[],[f14])).
% 0.13/0.37 thf(f14,plain,(
% 0.13/0.37 ! [X1,X2,X0] : (((in @ X2 @ (setunion @ X0)) = $true) | ((in @ X1 @ X0) != $true) | ((in @ X2 @ X1) != $true)) <=> (setunionI = $true)),
% 0.13/0.37 inference(flattening,[],[f13])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 ! [X1,X0,X2] : ((((in @ X2 @ (setunion @ X0)) = $true) | ((in @ X1 @ X0) != $true)) | ((in @ X2 @ X1) != $true)) <=> (setunionI = $true)),
% 0.13/0.37 inference(ennf_transformation,[],[f7])).
% 0.13/0.37 thf(f7,plain,(
% 0.13/0.37 ! [X1,X0,X2] : (((in @ X2 @ X1) = $true) => (((in @ X1 @ X0) = $true) => ((in @ X2 @ (setunion @ X0)) = $true))) <=> (setunionI = $true)),
% 0.13/0.37 inference(fool_elimination,[],[f6])).
% 0.13/0.37 thf(f6,plain,(
% 0.13/0.37 (! [X0,X1,X2] : ((in @ X2 @ X1) => ((in @ X1 @ X0) => (in @ X2 @ (setunion @ X0)))) = setunionI)),
% 0.13/0.37 inference(rectify,[],[f2])).
% 0.13/0.37 thf(f2,axiom,(
% 0.13/0.37 (! [X0,X1,X2] : ((in @ X2 @ X1) => ((in @ X1 @ X0) => (in @ X2 @ (setunion @ X0)))) = setunionI)),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionI)).
% 0.13/0.37 thf(f50,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((in @ X1 @ (powerset @ X0)) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f41])).
% 0.13/0.37 thf(f41,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((in @ X1 @ (powerset @ X0)) = $true) | ($true != $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f30,f32])).
% 0.13/0.37 thf(f30,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((in @ X1 @ (powerset @ X0)) = $true) | (powersetI != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f21])).
% 0.13/0.37 thf(f34,plain,(
% 0.13/0.37 ((in @ sK4 @ (powerset @ (setunion @ sK3))) != $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f23])).
% 0.13/0.37 % SZS output end Proof for theBenchmark
% 0.13/0.37 % (15217)------------------------------
% 0.13/0.37 % (15217)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (15217)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (15217)Memory used [KB]: 5500
% 0.13/0.37 % (15217)Time elapsed: 0.007 s
% 0.13/0.37 % (15217)Instructions burned: 6 (million)
% 0.13/0.37 % (15217)------------------------------
% 0.13/0.37 % (15217)------------------------------
% 0.13/0.37 % (15211)Success in time 0.018 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------