TSTP Solution File: SEU718^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU718^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 : n023.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:51:00 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU718^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % 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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 15:52:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 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.14/0.37 % (5683)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (5677)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.14/0.37 % (5679)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.14/0.37 % (5680)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (5678)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.14/0.37 % (5681)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.14/0.37 % (5682)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.14/0.37 % (5684)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.14/0.37 % (5680)Instruction limit reached!
% 0.14/0.37 % (5680)------------------------------
% 0.14/0.37 % (5680)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5680)Termination reason: Unknown
% 0.14/0.37 % (5681)Instruction limit reached!
% 0.14/0.37 % (5681)------------------------------
% 0.14/0.37 % (5681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5681)Termination reason: Unknown
% 0.14/0.37 % (5681)Termination phase: Function definition elimination
% 0.14/0.37
% 0.14/0.37 % (5681)Memory used [KB]: 895
% 0.14/0.37 % (5681)Time elapsed: 0.003 s
% 0.14/0.37 % (5681)Instructions burned: 2 (million)
% 0.14/0.37 % (5681)------------------------------
% 0.14/0.37 % (5681)------------------------------
% 0.14/0.37 % (5680)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (5680)Memory used [KB]: 895
% 0.14/0.37 % (5680)Time elapsed: 0.003 s
% 0.14/0.37 % (5680)Instructions burned: 2 (million)
% 0.14/0.37 % (5680)------------------------------
% 0.14/0.37 % (5680)------------------------------
% 0.14/0.37 % (5684)Instruction limit reached!
% 0.14/0.37 % (5684)------------------------------
% 0.14/0.37 % (5684)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5684)Termination reason: Unknown
% 0.14/0.37 % (5684)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (5684)Memory used [KB]: 5500
% 0.14/0.37 % (5684)Time elapsed: 0.004 s
% 0.14/0.37 % (5684)Instructions burned: 3 (million)
% 0.14/0.37 % (5684)------------------------------
% 0.14/0.37 % (5684)------------------------------
% 0.14/0.37 % (5683)First to succeed.
% 0.14/0.37 % (5678)Instruction limit reached!
% 0.14/0.37 % (5678)------------------------------
% 0.14/0.37 % (5678)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5678)Termination reason: Unknown
% 0.14/0.37 % (5678)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (5678)Memory used [KB]: 5500
% 0.14/0.37 % (5678)Time elapsed: 0.005 s
% 0.14/0.37 % (5678)Instructions burned: 4 (million)
% 0.14/0.37 % (5678)------------------------------
% 0.14/0.37 % (5678)------------------------------
% 0.14/0.38 % (5682)Also succeeded, but the first one will report.
% 0.14/0.38 % (5683)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.14/0.38 thf(func_def_2, type, subset: $i > $i > $o).
% 0.14/0.38 thf(f69,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(subsumption_resolution,[],[f68,f39])).
% 0.14/0.38 thf(f39,plain,(
% 0.14/0.38 ((in @ sK6 @ sK5) != $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f24,plain,(
% 0.14/0.38 (((($true = (in @ sK3 @ (powerset @ sK5))) & ((in @ sK6 @ sK5) != $true) & ($true = (in @ sK6 @ sK4)) & ((in @ sK6 @ sK3) = $true)) & ((in @ sK5 @ (powerset @ sK4)) = $true)) & ((in @ sK3 @ (powerset @ sK4)) = $true)) & (subsetE = $true) & (powersetE1 = $true)),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f15,f23,f22,f21])).
% 0.14/0.38 thf(f21,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (? [X3] : (($true = (in @ X0 @ (powerset @ X2))) & ((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ X0))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) => (? [X2] : (? [X3] : (((in @ sK3 @ (powerset @ X2)) = $true) & ((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ sK4)) & ($true = (in @ X3 @ sK3))) & ($true = (in @ X2 @ (powerset @ sK4)))) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f22,plain,(
% 0.14/0.38 ? [X2] : (? [X3] : (((in @ sK3 @ (powerset @ X2)) = $true) & ((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ sK4)) & ($true = (in @ X3 @ sK3))) & ($true = (in @ X2 @ (powerset @ sK4)))) => (? [X3] : (($true = (in @ sK3 @ (powerset @ sK5))) & ((in @ X3 @ sK5) != $true) & ($true = (in @ X3 @ sK4)) & ($true = (in @ X3 @ sK3))) & ((in @ sK5 @ (powerset @ sK4)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f23,plain,(
% 0.14/0.38 ? [X3] : (($true = (in @ sK3 @ (powerset @ sK5))) & ((in @ X3 @ sK5) != $true) & ($true = (in @ X3 @ sK4)) & ($true = (in @ X3 @ sK3))) => (($true = (in @ sK3 @ (powerset @ sK5))) & ((in @ sK6 @ sK5) != $true) & ($true = (in @ sK6 @ sK4)) & ((in @ sK6 @ sK3) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (? [X3] : (($true = (in @ X0 @ (powerset @ X2))) & ((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ X1)) & ($true = (in @ X3 @ X0))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) & (subsetE = $true) & (powersetE1 = $true)),
% 0.14/0.38 inference(flattening,[],[f14])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 (? [X1,X0] : (? [X2] : (? [X3] : (((((in @ X3 @ X2) != $true) & ($true = (in @ X3 @ X0))) & ($true = (in @ X0 @ (powerset @ X2)))) & ($true = (in @ X3 @ X1))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) & (powersetE1 = $true)) & (subsetE = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ~((subsetE = $true) => ((powersetE1 = $true) => ! [X1,X0] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ! [X3] : (($true = (in @ X3 @ X1)) => (($true = (in @ X0 @ (powerset @ X2))) => (($true = (in @ X3 @ X0)) => ((in @ X3 @ X2) = $true))))))))),
% 0.14/0.38 inference(fool_elimination,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ~(subsetE => (powersetE1 => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => ! [X3] : ((in @ X3 @ X1) => ((in @ X0 @ (powerset @ X2)) => ((in @ X3 @ X0) => (in @ X3 @ X2))))))))),
% 0.14/0.38 inference(rectify,[],[f4])).
% 0.14/0.38 thf(f4,negated_conjecture,(
% 0.14/0.38 ~(subsetE => (powersetE1 => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X3 @ (powerset @ X4)) => ((in @ X2 @ X3) => (in @ X2 @ X4))))))))),
% 0.14/0.38 inference(negated_conjecture,[],[f3])).
% 0.14/0.38 thf(f3,conjecture,(
% 0.14/0.38 subsetE => (powersetE1 => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X3 @ (powerset @ X4)) => ((in @ X2 @ X3) => (in @ X2 @ X4)))))))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetTE1)).
% 0.14/0.38 thf(f68,plain,(
% 0.14/0.38 ((in @ sK6 @ sK5) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f67])).
% 0.14/0.38 thf(f67,plain,(
% 0.14/0.38 ((in @ sK6 @ sK5) = $true) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f64,f37])).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 ((in @ sK6 @ sK3) = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f64,plain,(
% 0.14/0.38 ( ! [X0 : $i] : (((in @ X0 @ sK3) != $true) | ((in @ X0 @ sK5) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f61])).
% 0.14/0.38 thf(f61,plain,(
% 0.14/0.38 ( ! [X0 : $i] : (((in @ X0 @ sK3) != $true) | ($true != $true) | ((in @ X0 @ sK5) = $true)) )),
% 0.14/0.38 inference(superposition,[],[f51,f57])).
% 0.14/0.38 thf(f57,plain,(
% 0.14/0.38 ((subset @ sK3 @ sK5) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f54])).
% 0.14/0.38 thf(f54,plain,(
% 0.14/0.38 ($true != $true) | ((subset @ sK3 @ sK5) = $true)),
% 0.14/0.38 inference(superposition,[],[f52,f40])).
% 0.14/0.38 thf(f40,plain,(
% 0.14/0.38 ($true = (in @ sK3 @ (powerset @ sK5)))),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f52,plain,(
% 0.14/0.38 ( ! [X2 : $i,X3 : $i] : (($true != (in @ X2 @ (powerset @ X3))) | ($true = (subset @ X2 @ X3))) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f50])).
% 0.14/0.38 thf(f50,plain,(
% 0.14/0.38 ( ! [X2 : $i,X3 : $i] : (($true != (in @ X2 @ (powerset @ X3))) | ($true = (subset @ X2 @ X3)) | ($true != $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f41,f33])).
% 0.14/0.38 thf(f33,plain,(
% 0.14/0.38 (powersetE1 = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f41,plain,(
% 0.14/0.38 ( ! [X2 : $i,X3 : $i] : (($true = (subset @ X2 @ X3)) | ($true != (in @ X2 @ (powerset @ X3))) | (powersetE1 != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ((powersetE1 = $true) | (($true != (subset @ sK7 @ sK8)) & ((in @ sK7 @ (powerset @ sK8)) = $true))) & (! [X2,X3] : (($true = (subset @ X2 @ X3)) | ($true != (in @ X2 @ (powerset @ X3)))) | (powersetE1 != $true))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f26,f27])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 ? [X0,X1] : (((subset @ X0 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1)))) => (($true != (subset @ sK7 @ sK8)) & ((in @ sK7 @ (powerset @ sK8)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f26,plain,(
% 0.14/0.38 ((powersetE1 = $true) | ? [X0,X1] : (((subset @ X0 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1))))) & (! [X2,X3] : (($true = (subset @ X2 @ X3)) | ($true != (in @ X2 @ (powerset @ X3)))) | (powersetE1 != $true))),
% 0.14/0.38 inference(rectify,[],[f25])).
% 0.14/0.38 thf(f25,plain,(
% 0.14/0.38 ((powersetE1 = $true) | ? [X0,X1] : (((subset @ X0 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1))))) & (! [X0,X1] : (((subset @ X0 @ X1) = $true) | ($true != (in @ X0 @ (powerset @ X1)))) | (powersetE1 != $true))),
% 0.14/0.38 inference(nnf_transformation,[],[f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 (powersetE1 = $true) <=> ! [X0,X1] : (((subset @ X0 @ X1) = $true) | ($true != (in @ X0 @ (powerset @ X1))))),
% 0.14/0.38 inference(ennf_transformation,[],[f11])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ! [X1,X0] : (($true = (in @ X0 @ (powerset @ X1))) => ((subset @ X0 @ X1) = $true)) <=> (powersetE1 = $true)),
% 0.14/0.38 inference(fool_elimination,[],[f10])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 (powersetE1 = ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => (subset @ X0 @ X1)))),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,axiom,(
% 0.14/0.38 (powersetE1 = ! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => (subset @ X1 @ X0)))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE1)).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (subset @ X0 @ X2)) | ($true != (in @ X1 @ X0)) | ($true = (in @ X1 @ X2))) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f44])).
% 0.14/0.38 thf(f44,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (subset @ X0 @ X2)) | ($true != (in @ X1 @ X0)) | ($true = (in @ X1 @ X2))) )),
% 0.14/0.38 inference(definition_unfolding,[],[f32,f34])).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 (subsetE = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f24])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ X1 @ X2)) | ($true != (subset @ X0 @ X2)) | ($true != (in @ X1 @ X0)) | (subsetE != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (($true = (in @ X1 @ X2)) | ($true != (subset @ X0 @ X2)) | ($true != (in @ X1 @ X0))) | (subsetE != $true)) & ((subsetE = $true) | (((in @ sK1 @ sK2) != $true) & ($true = (subset @ sK0 @ sK2)) & ($true = (in @ sK1 @ sK0))))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f19])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ? [X3,X4,X5] : (((in @ X4 @ X5) != $true) & ($true = (subset @ X3 @ X5)) & ((in @ X4 @ X3) = $true)) => (((in @ sK1 @ sK2) != $true) & ($true = (subset @ sK0 @ sK2)) & ($true = (in @ sK1 @ sK0)))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (($true = (in @ X1 @ X2)) | ($true != (subset @ X0 @ X2)) | ($true != (in @ X1 @ X0))) | (subsetE != $true)) & ((subsetE = $true) | ? [X3,X4,X5] : (((in @ X4 @ X5) != $true) & ($true = (subset @ X3 @ X5)) & ((in @ X4 @ X3) = $true)))),
% 0.14/0.38 inference(rectify,[],[f17])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 (! [X2,X0,X1] : (((in @ X0 @ X1) = $true) | ($true != (subset @ X2 @ X1)) | ((in @ X0 @ X2) != $true)) | (subsetE != $true)) & ((subsetE = $true) | ? [X2,X0,X1] : (((in @ X0 @ X1) != $true) & ($true = (subset @ X2 @ X1)) & ((in @ X0 @ X2) = $true)))),
% 0.14/0.38 inference(nnf_transformation,[],[f13])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ! [X2,X0,X1] : (((in @ X0 @ X1) = $true) | ($true != (subset @ X2 @ X1)) | ((in @ X0 @ X2) != $true)) <=> (subsetE = $true)),
% 0.14/0.38 inference(flattening,[],[f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 (subsetE = $true) <=> ! [X0,X1,X2] : ((((in @ X0 @ X1) = $true) | ((in @ X0 @ X2) != $true)) | ($true != (subset @ X2 @ X1)))),
% 0.14/0.38 inference(ennf_transformation,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 (subsetE = $true) <=> ! [X0,X1,X2] : (($true = (subset @ X2 @ X1)) => (((in @ X0 @ X2) = $true) => ((in @ X0 @ X1) = $true)))),
% 0.14/0.38 inference(fool_elimination,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 (! [X0,X1,X2] : ((subset @ X2 @ X1) => ((in @ X0 @ X2) => (in @ X0 @ X1))) = subsetE)),
% 0.14/0.38 inference(rectify,[],[f1])).
% 0.14/0.38 thf(f1,axiom,(
% 0.14/0.38 (! [X2,X1,X0] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = subsetE)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (5683)------------------------------
% 0.14/0.38 % (5683)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5683)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (5683)Memory used [KB]: 5500
% 0.14/0.38 % (5683)Time elapsed: 0.007 s
% 0.14/0.38 % (5683)Instructions burned: 5 (million)
% 0.14/0.38 % (5683)------------------------------
% 0.14/0.38 % (5683)------------------------------
% 0.14/0.38 % (5676)Success in time 0.019 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------