TSTP Solution File: SEU627^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU627^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 : n005.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:50:07 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU627^2 : TPTP v8.2.0. Released v3.7.0.
% 0.14/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.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 16:39:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.21/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.21/0.39 % (20556)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.21/0.39 % (20555)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.21/0.39 % (20557)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.21/0.39 % (20558)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.39 % (20559)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.21/0.39 % (20560)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.21/0.39 % (20561)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.39 % (20562)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.21/0.39 % (20558)Instruction limit reached!
% 0.21/0.39 % (20558)------------------------------
% 0.21/0.39 % (20558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (20558)Termination reason: Unknown
% 0.21/0.39 % (20558)Termination phase: shuffling
% 0.21/0.39 % (20559)Instruction limit reached!
% 0.21/0.39 % (20559)------------------------------
% 0.21/0.39 % (20559)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39
% 0.21/0.39 % (20558)Memory used [KB]: 895
% 0.21/0.39 % (20558)Time elapsed: 0.003 s
% 0.21/0.39 % (20558)Instructions burned: 2 (million)
% 0.21/0.39 % (20558)------------------------------
% 0.21/0.39 % (20558)------------------------------
% 0.21/0.39 % (20559)Termination reason: Unknown
% 0.21/0.39 % (20559)Termination phase: shuffling
% 0.21/0.39
% 0.21/0.39 % (20559)Memory used [KB]: 895
% 0.21/0.39 % (20559)Time elapsed: 0.003 s
% 0.21/0.39 % (20559)Instructions burned: 2 (million)
% 0.21/0.39 % (20559)------------------------------
% 0.21/0.39 % (20559)------------------------------
% 0.21/0.39 % (20562)Instruction limit reached!
% 0.21/0.39 % (20562)------------------------------
% 0.21/0.39 % (20562)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (20562)Termination reason: Unknown
% 0.21/0.39 % (20562)Termination phase: Property scanning
% 0.21/0.39
% 0.21/0.39 % (20562)Memory used [KB]: 1023
% 0.21/0.39 % (20562)Time elapsed: 0.004 s
% 0.21/0.39 % (20562)Instructions burned: 3 (million)
% 0.21/0.39 % (20562)------------------------------
% 0.21/0.39 % (20562)------------------------------
% 0.21/0.39 % (20556)Instruction limit reached!
% 0.21/0.39 % (20556)------------------------------
% 0.21/0.39 % (20556)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (20556)Termination reason: Unknown
% 0.21/0.39 % (20556)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (20556)Memory used [KB]: 5500
% 0.21/0.39 % (20556)Time elapsed: 0.005 s
% 0.21/0.39 % (20556)Instructions burned: 4 (million)
% 0.21/0.39 % (20556)------------------------------
% 0.21/0.39 % (20556)------------------------------
% 0.21/0.40 % (20560)First to succeed.
% 0.21/0.40 % (20561)Instruction limit reached!
% 0.21/0.40 % (20561)------------------------------
% 0.21/0.40 % (20561)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (20561)Termination reason: Unknown
% 0.21/0.40 % (20561)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (20561)Memory used [KB]: 5628
% 0.21/0.40 % (20561)Time elapsed: 0.014 s
% 0.21/0.40 % (20561)Instructions burned: 18 (million)
% 0.21/0.40 % (20561)------------------------------
% 0.21/0.40 % (20561)------------------------------
% 0.21/0.40 % (20555)Also succeeded, but the first one will report.
% 0.21/0.40 % (20560)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% 0.21/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.40 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.21/0.40 thf(func_def_3, type, powerset: $i > $i).
% 0.21/0.40 thf(func_def_4, type, subset: $i > $i > $o).
% 0.21/0.40 thf(func_def_7, type, binunion: $i > $i > $i).
% 0.21/0.40 thf(func_def_13, type, sK0: $i > $i > $i).
% 0.21/0.40 thf(f123,plain,(
% 0.21/0.40 $false),
% 0.21/0.40 inference(avatar_sat_refutation,[],[f104,f113,f122])).
% 0.21/0.40 thf(f122,plain,(
% 0.21/0.40 ~spl17_1),
% 0.21/0.40 inference(avatar_contradiction_clause,[],[f121])).
% 0.21/0.40 thf(f121,plain,(
% 0.21/0.40 $false | ~spl17_1),
% 0.21/0.40 inference(subsumption_resolution,[],[f120,f60])).
% 0.21/0.40 thf(f60,plain,(
% 0.21/0.40 ($true = (in @ sK11 @ sK10))),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f41,plain,(
% 0.21/0.40 (upairset2E = $true) & (upairinpowunion = $true) & (singletoninpowunion = $true) & (subsetI2 = $true) & (($true = (in @ sK11 @ sK10)) & (($true = (in @ sK12 @ sK9)) & ($true != (subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))))))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12])],[f38,f40,f39])).
% 0.21/0.40 thf(f39,plain,(
% 0.21/0.40 ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((subset @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X0))) != $true))) => (($true = (in @ sK11 @ sK10)) & ? [X3] : (((in @ X3 @ sK9) = $true) & ((subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))) != $true)))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f40,plain,(
% 0.21/0.40 ? [X3] : (((in @ X3 @ sK9) = $true) & ((subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))) != $true)) => (($true = (in @ sK12 @ sK9)) & ($true != (subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f38,plain,(
% 0.21/0.40 (upairset2E = $true) & (upairinpowunion = $true) & (singletoninpowunion = $true) & (subsetI2 = $true) & ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((subset @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X0))) != $true)))),
% 0.21/0.40 inference(rectify,[],[f21])).
% 0.21/0.40 thf(f21,plain,(
% 0.21/0.40 (upairset2E = $true) & (upairinpowunion = $true) & (singletoninpowunion = $true) & (subsetI2 = $true) & ? [X2,X1,X0] : (((in @ X0 @ X1) = $true) & ? [X3] : (($true = (in @ X3 @ X2)) & ($true != (subset @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))))))),
% 0.21/0.40 inference(flattening,[],[f20])).
% 0.21/0.40 thf(f20,plain,(
% 0.21/0.40 (((? [X2,X1,X0] : (((in @ X0 @ X1) = $true) & ? [X3] : (($true = (in @ X3 @ X2)) & ($true != (subset @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X2)))))) & (upairinpowunion = $true)) & (upairset2E = $true)) & (singletoninpowunion = $true)) & (subsetI2 = $true)),
% 0.21/0.40 inference(ennf_transformation,[],[f17])).
% 0.21/0.40 thf(f17,plain,(
% 0.21/0.40 ~((subsetI2 = $true) => ((singletoninpowunion = $true) => ((upairset2E = $true) => ((upairinpowunion = $true) => ! [X1,X0,X2] : (((in @ X0 @ X1) = $true) => ! [X3] : (($true = (in @ X3 @ X2)) => ($true = (subset @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f16])).
% 0.21/0.40 thf(f16,plain,(
% 0.21/0.40 ~(subsetI2 => (singletoninpowunion => (upairset2E => (upairinpowunion => ! [X0,X1,X2] : ((in @ X0 @ X1) => ! [X3] : ((in @ X3 @ X2) => (subset @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X1 @ X2)))))))))),
% 0.21/0.40 inference(rectify,[],[f6])).
% 0.21/0.40 thf(f6,negated_conjecture,(
% 0.21/0.40 ~(subsetI2 => (singletoninpowunion => (upairset2E => (upairinpowunion => ! [X2,X0,X1] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X1) => (subset @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X0 @ X1)))))))))),
% 0.21/0.40 inference(negated_conjecture,[],[f5])).
% 0.21/0.40 thf(f5,conjecture,(
% 0.21/0.40 subsetI2 => (singletoninpowunion => (upairset2E => (upairinpowunion => ! [X2,X0,X1] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X1) => (subset @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ X0 @ X1))))))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ubforcartprodlem1)).
% 0.21/0.40 thf(f120,plain,(
% 0.21/0.40 ($true != (in @ sK11 @ sK10)) | ~spl17_1),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f119])).
% 0.21/0.40 thf(f119,plain,(
% 0.21/0.40 ($true != $true) | ($true != (in @ sK11 @ sK10)) | ~spl17_1),
% 0.21/0.40 inference(superposition,[],[f116,f87])).
% 0.21/0.40 thf(f87,plain,(
% 0.21/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ (setadjoin @ X4 @ emptyset) @ (powerset @ (binunion @ X3 @ X5)))) | ((in @ X4 @ X3) != $true)) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f79])).
% 0.21/0.40 thf(f79,plain,(
% 0.21/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X4 @ X3) != $true) | ($true = (in @ (setadjoin @ X4 @ emptyset) @ (powerset @ (binunion @ X3 @ X5))))) )),
% 0.21/0.40 inference(definition_unfolding,[],[f55,f62])).
% 0.21/0.40 thf(f62,plain,(
% 0.21/0.40 (singletoninpowunion = $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f55,plain,(
% 0.21/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ X3) != $true) | ($true = (in @ (setadjoin @ X4 @ emptyset) @ (powerset @ (binunion @ X3 @ X5)))) | (singletoninpowunion != $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f37])).
% 0.21/0.40 thf(f37,plain,(
% 0.21/0.40 ((singletoninpowunion = $true) | (($true = (in @ sK7 @ sK6)) & ((in @ (setadjoin @ sK7 @ emptyset) @ (powerset @ (binunion @ sK6 @ sK8))) != $true))) & (! [X3,X4,X5] : (((in @ X4 @ X3) != $true) | ($true = (in @ (setadjoin @ X4 @ emptyset) @ (powerset @ (binunion @ X3 @ X5))))) | (singletoninpowunion != $true))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f35,f36])).
% 0.21/0.40 thf(f36,plain,(
% 0.21/0.40 ? [X0,X1,X2] : (($true = (in @ X1 @ X0)) & ((in @ (setadjoin @ X1 @ emptyset) @ (powerset @ (binunion @ X0 @ X2))) != $true)) => (($true = (in @ sK7 @ sK6)) & ((in @ (setadjoin @ sK7 @ emptyset) @ (powerset @ (binunion @ sK6 @ sK8))) != $true))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f35,plain,(
% 0.21/0.40 ((singletoninpowunion = $true) | ? [X0,X1,X2] : (($true = (in @ X1 @ X0)) & ((in @ (setadjoin @ X1 @ emptyset) @ (powerset @ (binunion @ X0 @ X2))) != $true))) & (! [X3,X4,X5] : (((in @ X4 @ X3) != $true) | ($true = (in @ (setadjoin @ X4 @ emptyset) @ (powerset @ (binunion @ X3 @ X5))))) | (singletoninpowunion != $true))),
% 0.21/0.40 inference(rectify,[],[f34])).
% 0.21/0.40 thf(f34,plain,(
% 0.21/0.40 ((singletoninpowunion = $true) | ? [X1,X2,X0] : (((in @ X2 @ X1) = $true) & ($true != (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X1 @ X0)))))) & (! [X1,X2,X0] : (((in @ X2 @ X1) != $true) | ($true = (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X1 @ X0))))) | (singletoninpowunion != $true))),
% 0.21/0.40 inference(nnf_transformation,[],[f23])).
% 0.21/0.40 thf(f23,plain,(
% 0.21/0.40 (singletoninpowunion = $true) <=> ! [X1,X2,X0] : (((in @ X2 @ X1) != $true) | ($true = (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X1 @ X0)))))),
% 0.21/0.40 inference(ennf_transformation,[],[f13])).
% 0.21/0.40 thf(f13,plain,(
% 0.21/0.40 (singletoninpowunion = $true) <=> ! [X2,X1,X0] : (((in @ X2 @ X1) = $true) => ($true = (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X1 @ X0)))))),
% 0.21/0.40 inference(fool_elimination,[],[f12])).
% 0.21/0.40 thf(f12,plain,(
% 0.21/0.40 (singletoninpowunion = ! [X0,X1,X2] : ((in @ X2 @ X1) => (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X1 @ X0)))))),
% 0.21/0.40 inference(rectify,[],[f2])).
% 0.21/0.40 thf(f2,axiom,(
% 0.21/0.40 (singletoninpowunion = ! [X1,X0,X2] : ((in @ X2 @ X0) => (in @ (setadjoin @ X2 @ emptyset) @ (powerset @ (binunion @ X0 @ X1)))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletoninpowunion)).
% 0.21/0.40 thf(f116,plain,(
% 0.21/0.40 ((in @ (setadjoin @ sK11 @ emptyset) @ (powerset @ (binunion @ sK10 @ sK9))) != $true) | ~spl17_1),
% 0.21/0.40 inference(subsumption_resolution,[],[f115,f58])).
% 0.21/0.40 thf(f58,plain,(
% 0.21/0.40 ($true != (subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))))),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f115,plain,(
% 0.21/0.40 ((in @ (setadjoin @ sK11 @ emptyset) @ (powerset @ (binunion @ sK10 @ sK9))) != $true) | ($true = (subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ~spl17_1),
% 0.21/0.40 inference(superposition,[],[f85,f99])).
% 0.21/0.40 thf(f99,plain,(
% 0.21/0.40 ((setadjoin @ sK11 @ emptyset) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ~spl17_1),
% 0.21/0.40 inference(avatar_component_clause,[],[f97])).
% 0.21/0.40 thf(f97,plain,(
% 0.21/0.40 spl17_1 <=> ((setadjoin @ sK11 @ emptyset) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))))),
% 0.21/0.40 introduced(avatar_definition,[new_symbols(naming,[spl17_1])])).
% 0.21/0.40 thf(f85,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((subset @ X1 @ X0) = $true)) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f69])).
% 0.21/0.40 thf(f69,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((subset @ X1 @ X0) = $true) | ($true != $true)) )),
% 0.21/0.40 inference(definition_unfolding,[],[f50,f61])).
% 0.21/0.40 thf(f61,plain,(
% 0.21/0.40 (subsetI2 = $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f50,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X0) != $true) | ((subset @ X1 @ X0) = $true) | (subsetI2 != $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f29])).
% 0.21/0.40 thf(f29,plain,(
% 0.21/0.40 (! [X0,X1] : ((((in @ (sK0 @ X1 @ X0) @ X0) != $true) & ($true = (in @ (sK0 @ X1 @ X0) @ X1))) | ((subset @ X1 @ X0) = $true)) | (subsetI2 != $true)) & ((subsetI2 = $true) | (! [X5] : (($true = (in @ X5 @ sK1)) | ($true != (in @ X5 @ sK2))) & ((subset @ sK2 @ sK1) != $true)))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f28,f27])).
% 0.21/0.40 thf(f27,plain,(
% 0.21/0.40 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) => (((in @ (sK0 @ X1 @ X0) @ X0) != $true) & ($true = (in @ (sK0 @ X1 @ X0) @ X1))))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f28,plain,(
% 0.21/0.40 ? [X3,X4] : (! [X5] : (((in @ X5 @ X3) = $true) | ($true != (in @ X5 @ X4))) & ((subset @ X4 @ X3) != $true)) => (! [X5] : (($true = (in @ X5 @ sK1)) | ($true != (in @ X5 @ sK2))) & ((subset @ sK2 @ sK1) != $true))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f26,plain,(
% 0.21/0.40 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X3,X4] : (! [X5] : (((in @ X5 @ X3) = $true) | ($true != (in @ X5 @ X4))) & ((subset @ X4 @ X3) != $true)))),
% 0.21/0.40 inference(rectify,[],[f25])).
% 0.21/0.40 thf(f25,plain,(
% 0.21/0.40 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) & ((subset @ X1 @ X0) != $true)))),
% 0.21/0.40 inference(nnf_transformation,[],[f24])).
% 0.21/0.40 thf(f24,plain,(
% 0.21/0.40 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) | ((subset @ X1 @ X0) = $true)) <=> (subsetI2 = $true)),
% 0.21/0.40 inference(ennf_transformation,[],[f9])).
% 0.21/0.40 thf(f9,plain,(
% 0.21/0.40 ! [X1,X0] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((subset @ X1 @ X0) = $true)) <=> (subsetI2 = $true)),
% 0.21/0.40 inference(fool_elimination,[],[f8])).
% 0.21/0.40 thf(f8,plain,(
% 0.21/0.40 (subsetI2 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)))),
% 0.21/0.40 inference(rectify,[],[f1])).
% 0.21/0.40 thf(f1,axiom,(
% 0.21/0.40 (subsetI2 = ! [X1,X0] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2)).
% 0.21/0.40 thf(f113,plain,(
% 0.21/0.40 ~spl17_2),
% 0.21/0.40 inference(avatar_contradiction_clause,[],[f112])).
% 0.21/0.40 thf(f112,plain,(
% 0.21/0.40 $false | ~spl17_2),
% 0.21/0.40 inference(subsumption_resolution,[],[f111,f60])).
% 0.21/0.40 thf(f111,plain,(
% 0.21/0.40 ($true != (in @ sK11 @ sK10)) | ~spl17_2),
% 0.21/0.40 inference(subsumption_resolution,[],[f110,f59])).
% 0.21/0.40 thf(f59,plain,(
% 0.21/0.40 ($true = (in @ sK12 @ sK9))),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f110,plain,(
% 0.21/0.40 ($true != (in @ sK12 @ sK9)) | ($true != (in @ sK11 @ sK10)) | ~spl17_2),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f109])).
% 0.21/0.40 thf(f109,plain,(
% 0.21/0.40 ($true != (in @ sK12 @ sK9)) | ($true != $true) | ($true != (in @ sK11 @ sK10)) | ~spl17_2),
% 0.21/0.40 inference(superposition,[],[f107,f88])).
% 0.21/0.40 thf(f88,plain,(
% 0.21/0.40 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((in @ (setadjoin @ X5 @ (setadjoin @ X7 @ emptyset)) @ (powerset @ (binunion @ X4 @ X6))) = $true) | ((in @ X7 @ X6) != $true) | ($true != (in @ X5 @ X4))) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f83])).
% 0.21/0.40 thf(f83,plain,(
% 0.21/0.40 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ X4)) | ($true != $true) | ((in @ (setadjoin @ X5 @ (setadjoin @ X7 @ emptyset)) @ (powerset @ (binunion @ X4 @ X6))) = $true) | ((in @ X7 @ X6) != $true)) )),
% 0.21/0.40 inference(definition_unfolding,[],[f65,f63])).
% 0.21/0.40 thf(f63,plain,(
% 0.21/0.40 (upairinpowunion = $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f65,plain,(
% 0.21/0.40 ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $i] : (((in @ X7 @ X6) != $true) | ((in @ (setadjoin @ X5 @ (setadjoin @ X7 @ emptyset)) @ (powerset @ (binunion @ X4 @ X6))) = $true) | ($true != (in @ X5 @ X4)) | (upairinpowunion != $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f46])).
% 0.21/0.40 thf(f46,plain,(
% 0.21/0.40 ((upairinpowunion = $true) | ((((in @ sK16 @ sK15) = $true) & ($true != (in @ (setadjoin @ sK14 @ (setadjoin @ sK16 @ emptyset)) @ (powerset @ (binunion @ sK13 @ sK15))))) & ($true = (in @ sK14 @ sK13)))) & (! [X4,X5,X6] : (! [X7] : (((in @ X7 @ X6) != $true) | ((in @ (setadjoin @ X5 @ (setadjoin @ X7 @ emptyset)) @ (powerset @ (binunion @ X4 @ X6))) = $true)) | ($true != (in @ X5 @ X4))) | (upairinpowunion != $true))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16])],[f43,f45,f44])).
% 0.21/0.40 thf(f44,plain,(
% 0.21/0.40 ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X2)) & ((in @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X0 @ X2))) != $true)) & ($true = (in @ X1 @ X0))) => (? [X3] : (((in @ X3 @ sK15) = $true) & ((in @ (setadjoin @ sK14 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ sK13 @ sK15))) != $true)) & ($true = (in @ sK14 @ sK13)))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f45,plain,(
% 0.21/0.40 ? [X3] : (((in @ X3 @ sK15) = $true) & ((in @ (setadjoin @ sK14 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ sK13 @ sK15))) != $true)) => (((in @ sK16 @ sK15) = $true) & ($true != (in @ (setadjoin @ sK14 @ (setadjoin @ sK16 @ emptyset)) @ (powerset @ (binunion @ sK13 @ sK15)))))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f43,plain,(
% 0.21/0.40 ((upairinpowunion = $true) | ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X2)) & ((in @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X0 @ X2))) != $true)) & ($true = (in @ X1 @ X0)))) & (! [X4,X5,X6] : (! [X7] : (((in @ X7 @ X6) != $true) | ((in @ (setadjoin @ X5 @ (setadjoin @ X7 @ emptyset)) @ (powerset @ (binunion @ X4 @ X6))) = $true)) | ($true != (in @ X5 @ X4))) | (upairinpowunion != $true))),
% 0.21/0.40 inference(rectify,[],[f42])).
% 0.21/0.40 thf(f42,plain,(
% 0.21/0.40 ((upairinpowunion = $true) | ? [X1,X0,X2] : (? [X3] : (($true = (in @ X3 @ X2)) & ((in @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))) != $true)) & ((in @ X0 @ X1) = $true))) & (! [X1,X0,X2] : (! [X3] : (($true != (in @ X3 @ X2)) | ((in @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))) = $true)) | ((in @ X0 @ X1) != $true)) | (upairinpowunion != $true))),
% 0.21/0.40 inference(nnf_transformation,[],[f22])).
% 0.21/0.40 thf(f22,plain,(
% 0.21/0.40 (upairinpowunion = $true) <=> ! [X1,X0,X2] : (! [X3] : (($true != (in @ X3 @ X2)) | ((in @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))) = $true)) | ((in @ X0 @ X1) != $true))),
% 0.21/0.40 inference(ennf_transformation,[],[f11])).
% 0.21/0.40 thf(f11,plain,(
% 0.21/0.40 (upairinpowunion = $true) <=> ! [X0,X1,X2] : (((in @ X0 @ X1) = $true) => ! [X3] : (($true = (in @ X3 @ X2)) => ((in @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))) = $true)))),
% 0.21/0.40 inference(fool_elimination,[],[f10])).
% 0.21/0.40 thf(f10,plain,(
% 0.21/0.40 (upairinpowunion = ! [X0,X1,X2] : ((in @ X0 @ X1) => ! [X3] : ((in @ X3 @ X2) => (in @ (setadjoin @ X0 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X1 @ X2))))))),
% 0.21/0.40 inference(rectify,[],[f4])).
% 0.21/0.40 thf(f4,axiom,(
% 0.21/0.40 (upairinpowunion = ! [X2,X0,X1] : ((in @ X2 @ X0) => ! [X3] : ((in @ X3 @ X1) => (in @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ (powerset @ (binunion @ X0 @ X1))))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairinpowunion)).
% 0.21/0.40 thf(f107,plain,(
% 0.21/0.40 ((in @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))) != $true) | ~spl17_2),
% 0.21/0.40 inference(subsumption_resolution,[],[f106,f58])).
% 0.21/0.40 thf(f106,plain,(
% 0.21/0.40 ($true = (subset @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ((in @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))) != $true) | ~spl17_2),
% 0.21/0.40 inference(superposition,[],[f85,f103])).
% 0.21/0.40 thf(f103,plain,(
% 0.21/0.40 ((setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ~spl17_2),
% 0.21/0.40 inference(avatar_component_clause,[],[f101])).
% 0.21/0.40 thf(f101,plain,(
% 0.21/0.40 spl17_2 <=> ((setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))))),
% 0.21/0.40 introduced(avatar_definition,[new_symbols(naming,[spl17_2])])).
% 0.21/0.40 thf(f104,plain,(
% 0.21/0.40 spl17_1 | spl17_2),
% 0.21/0.40 inference(avatar_split_clause,[],[f95,f101,f97])).
% 0.21/0.40 thf(f95,plain,(
% 0.21/0.40 ((setadjoin @ sK11 @ emptyset) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ((setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9))))),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f94])).
% 0.21/0.40 thf(f94,plain,(
% 0.21/0.40 ((setadjoin @ sK11 @ emptyset) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ((setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) = (sK0 @ (setadjoin @ (setadjoin @ sK11 @ emptyset) @ (setadjoin @ (setadjoin @ sK11 @ (setadjoin @ sK12 @ emptyset)) @ emptyset)) @ (powerset @ (binunion @ sK10 @ sK9)))) | ($true != $true)),
% 0.21/0.40 inference(superposition,[],[f58,f93])).
% 0.21/0.40 thf(f93,plain,(
% 0.21/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((subset @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = $true) | ((sK0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = X0) | ((sK0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = X1)) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f92])).
% 0.21/0.40 thf(f92,plain,(
% 0.21/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((sK0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = X1) | ((sK0 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = X0) | ($true != $true) | ((subset @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ X2) = $true)) )),
% 0.21/0.40 inference(superposition,[],[f84,f86])).
% 0.21/0.40 thf(f86,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK0 @ X1 @ X0) @ X1)) | ((subset @ X1 @ X0) = $true)) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f70])).
% 0.21/0.40 thf(f70,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true = (in @ (sK0 @ X1 @ X0) @ X1)) | ((subset @ X1 @ X0) = $true)) )),
% 0.21/0.40 inference(definition_unfolding,[],[f49,f61])).
% 0.21/0.40 thf(f49,plain,(
% 0.21/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK0 @ X1 @ X0) @ X1)) | ((subset @ X1 @ X0) = $true) | (subsetI2 != $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f29])).
% 0.21/0.40 thf(f84,plain,(
% 0.21/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X1) | (X0 = X2)) )),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f73])).
% 0.21/0.40 thf(f73,plain,(
% 0.21/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X2) | (X0 = X1) | ($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | ($true != $true)) )),
% 0.21/0.40 inference(definition_unfolding,[],[f54,f64])).
% 0.21/0.40 thf(f64,plain,(
% 0.21/0.40 (upairset2E = $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f54,plain,(
% 0.21/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X2) | (X0 = X1) | (upairset2E != $true)) )),
% 0.21/0.40 inference(cnf_transformation,[],[f33])).
% 0.21/0.40 thf(f33,plain,(
% 0.21/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X2) | (X0 = X1)) | (upairset2E != $true)) & ((upairset2E = $true) | (((in @ sK3 @ (setadjoin @ sK5 @ (setadjoin @ sK4 @ emptyset))) = $true) & (sK5 != sK3) & (sK4 != sK3)))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f31,f32])).
% 0.21/0.40 thf(f32,plain,(
% 0.21/0.40 ? [X3,X4,X5] : (($true = (in @ X3 @ (setadjoin @ X5 @ (setadjoin @ X4 @ emptyset)))) & (X3 != X5) & (X3 != X4)) => (((in @ sK3 @ (setadjoin @ sK5 @ (setadjoin @ sK4 @ emptyset))) = $true) & (sK5 != sK3) & (sK4 != sK3))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f31,plain,(
% 0.21/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X2) | (X0 = X1)) | (upairset2E != $true)) & ((upairset2E = $true) | ? [X3,X4,X5] : (($true = (in @ X3 @ (setadjoin @ X5 @ (setadjoin @ X4 @ emptyset)))) & (X3 != X5) & (X3 != X4)))),
% 0.21/0.40 inference(rectify,[],[f30])).
% 0.21/0.40 thf(f30,plain,(
% 0.21/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X2) | (X0 = X1)) | (upairset2E != $true)) & ((upairset2E = $true) | ? [X0,X1,X2] : (($true = (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) & (X0 != X2) & (X0 != X1)))),
% 0.21/0.40 inference(nnf_transformation,[],[f19])).
% 0.21/0.40 thf(f19,plain,(
% 0.21/0.40 ! [X0,X1,X2] : (($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) | (X0 = X2) | (X0 = X1)) <=> (upairset2E = $true)),
% 0.21/0.40 inference(flattening,[],[f18])).
% 0.21/0.40 thf(f18,plain,(
% 0.21/0.40 ! [X0,X1,X2] : (((X0 = X1) | (X0 = X2)) | ($true != (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset))))) <=> (upairset2E = $true)),
% 0.21/0.40 inference(ennf_transformation,[],[f15])).
% 0.21/0.40 thf(f15,plain,(
% 0.21/0.40 ! [X0,X1,X2] : (($true = (in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset)))) => ((X0 = X1) | (X0 = X2))) <=> (upairset2E = $true)),
% 0.21/0.40 inference(fool_elimination,[],[f14])).
% 0.21/0.40 thf(f14,plain,(
% 0.21/0.40 (upairset2E = ! [X0,X1,X2] : ((in @ X0 @ (setadjoin @ X2 @ (setadjoin @ X1 @ emptyset))) => ((X0 = X2) | (X0 = X1))))),
% 0.21/0.40 inference(rectify,[],[f3])).
% 0.21/0.40 thf(f3,axiom,(
% 0.21/0.40 (upairset2E = ! [X4,X3,X2] : ((in @ X4 @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset))) => ((X2 = X4) | (X3 = X4))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairset2E)).
% 0.21/0.40 % SZS output end Proof for theBenchmark
% 0.21/0.40 % (20560)------------------------------
% 0.21/0.40 % (20560)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (20560)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (20560)Memory used [KB]: 5628
% 0.21/0.40 % (20560)Time elapsed: 0.015 s
% 0.21/0.40 % (20560)Instructions burned: 13 (million)
% 0.21/0.40 % (20560)------------------------------
% 0.21/0.40 % (20560)------------------------------
% 0.21/0.40 % (20554)Success in time 0.017 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------