TSTP Solution File: SEU517^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU517^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 : n026.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:18 EDT 2024
% Result : Theorem 0.24s 0.42s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU517^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.13/0.38 % Computer : n026.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun May 19 16:15:38 EDT 2024
% 0.13/0.38 % CPUTime :
% 0.13/0.38 This is a TH0_THM_EQU_NAR problem
% 0.13/0.38 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.40 % (25115)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.40 % (25113)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.40 % (25114)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.40 % (25112)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.40 % (25111)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.40 % (25116)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.40 % (25117)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.40 % (25118)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.40 % (25114)Instruction limit reached!
% 0.13/0.40 % (25114)------------------------------
% 0.13/0.40 % (25114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (25114)Termination reason: Unknown
% 0.13/0.40 % (25114)Termination phase: Property scanning
% 0.13/0.40
% 0.13/0.40 % (25115)Instruction limit reached!
% 0.13/0.40 % (25115)------------------------------
% 0.13/0.40 % (25115)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (25115)Termination reason: Unknown
% 0.13/0.40 % (25115)Termination phase: Property scanning
% 0.13/0.40
% 0.13/0.40 % (25115)Memory used [KB]: 895
% 0.13/0.40 % (25115)Time elapsed: 0.003 s
% 0.13/0.40 % (25115)Instructions burned: 2 (million)
% 0.13/0.40 % (25115)------------------------------
% 0.13/0.40 % (25115)------------------------------
% 0.13/0.40 % (25114)Memory used [KB]: 895
% 0.13/0.40 % (25114)Time elapsed: 0.003 s
% 0.13/0.40 % (25114)Instructions burned: 2 (million)
% 0.13/0.40 % (25114)------------------------------
% 0.13/0.40 % (25114)------------------------------
% 0.13/0.40 % (25118)Instruction limit reached!
% 0.13/0.40 % (25118)------------------------------
% 0.13/0.40 % (25118)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (25118)Termination reason: Unknown
% 0.13/0.40 % (25118)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (25118)Memory used [KB]: 5500
% 0.13/0.40 % (25118)Time elapsed: 0.003 s
% 0.13/0.40 % (25118)Instructions burned: 3 (million)
% 0.13/0.40 % (25118)------------------------------
% 0.13/0.40 % (25118)------------------------------
% 0.13/0.40 % (25112)Instruction limit reached!
% 0.13/0.40 % (25112)------------------------------
% 0.13/0.40 % (25112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (25112)Termination reason: Unknown
% 0.13/0.40 % (25112)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (25112)Memory used [KB]: 5500
% 0.13/0.40 % (25112)Time elapsed: 0.005 s
% 0.13/0.40 % (25112)Instructions burned: 4 (million)
% 0.13/0.40 % (25112)------------------------------
% 0.13/0.40 % (25112)------------------------------
% 0.13/0.41 % (25117)Instruction limit reached!
% 0.13/0.41 % (25117)------------------------------
% 0.13/0.41 % (25117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (25117)Termination reason: Unknown
% 0.13/0.41 % (25117)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (25117)Memory used [KB]: 5628
% 0.13/0.41 % (25117)Time elapsed: 0.013 s
% 0.13/0.41 % (25117)Instructions burned: 19 (million)
% 0.13/0.41 % (25117)------------------------------
% 0.13/0.41 % (25117)------------------------------
% 0.13/0.41 % (25119)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.13/0.41 % (25113)Instruction limit reached!
% 0.13/0.41 % (25113)------------------------------
% 0.13/0.41 % (25113)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (25120)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.13/0.41 % (25113)Termination reason: Unknown
% 0.13/0.41 % (25113)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (25113)Memory used [KB]: 5628
% 0.13/0.41 % (25113)Time elapsed: 0.018 s
% 0.13/0.41 % (25113)Instructions burned: 28 (million)
% 0.13/0.41 % (25113)------------------------------
% 0.13/0.41 % (25113)------------------------------
% 0.13/0.42 % (25116)First to succeed.
% 0.13/0.42 % (25121)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.24/0.42 % (25122)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.24/0.42 % (25121)Instruction limit reached!
% 0.24/0.42 % (25121)------------------------------
% 0.24/0.42 % (25121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42 % (25121)Termination reason: Unknown
% 0.24/0.42 % (25121)Termination phase: Saturation
% 0.24/0.42
% 0.24/0.42 % (25121)Memory used [KB]: 5500
% 0.24/0.42 % (25121)Time elapsed: 0.004 s
% 0.24/0.42 % (25121)Instructions burned: 4 (million)
% 0.24/0.42 % (25121)------------------------------
% 0.24/0.42 % (25121)------------------------------
% 0.24/0.42 % (25116)Refutation found. Thanks to Tanya!
% 0.24/0.42 % SZS status Theorem for theBenchmark
% 0.24/0.42 % SZS output start Proof for theBenchmark
% 0.24/0.42 thf(func_def_0, type, in: $i > $i > $o).
% 0.24/0.42 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.24/0.42 thf(func_def_10, type, sK0: $i > $o).
% 0.24/0.42 thf(func_def_13, type, sK3: $i > $o).
% 0.24/0.42 thf(func_def_18, type, sK8: $i > $i > $i).
% 0.24/0.42 thf(func_def_19, type, sK9: $i > $i > $i).
% 0.24/0.42 thf(func_def_22, type, ph12: !>[X0: $tType]:(X0)).
% 0.24/0.42 thf(f188,plain,(
% 0.24/0.42 $false),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f167])).
% 0.24/0.42 thf(f167,plain,(
% 0.24/0.42 (sK10 != sK10)),
% 0.24/0.42 inference(superposition,[],[f55,f136])).
% 0.24/0.42 thf(f136,plain,(
% 0.24/0.42 ( ! [X0 : $i] : (((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f135])).
% 0.24/0.42 thf(f135,plain,(
% 0.24/0.42 ( ! [X0 : $i] : (($true != $true) | ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0)) )),
% 0.24/0.42 inference(beta_eta_normalization,[],[f129])).
% 0.24/0.42 thf(f129,plain,(
% 0.24/0.42 ( ! [X0 : $i] : (($true != ((^[Y0 : $i]: ($true)) @ (sK8 @ X0 @ (dsetconstr @ X0 @ (^[Y0 : $i]: ($true)))))) | ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0)) )),
% 0.24/0.42 inference(primitive_instantiation,[],[f119])).
% 0.24/0.42 thf(f119,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(subsumption_resolution,[],[f115,f117])).
% 0.24/0.42 thf(f117,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true = (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f116])).
% 0.24/0.42 thf(f116,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ($true != $true) | ($true = (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(duplicate_literal_removal,[],[f111])).
% 0.24/0.42 thf(f111,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != $true) | ($true = (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ((dsetconstr @ X0 @ X1) = X0) | ((dsetconstr @ X0 @ X1) = X0) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1))))) )),
% 0.24/0.42 inference(superposition,[],[f108,f80])).
% 0.24/0.42 thf(f80,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true = (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0)) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f79])).
% 0.24/0.42 thf(f79,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((dsetconstr @ X1 @ X2) = X0) | ($true = (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0)) | ($true != $true) | ((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true)) )),
% 0.24/0.42 inference(superposition,[],[f74,f70])).
% 0.24/0.42 thf(f70,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true = (in @ (sK9 @ X5 @ X4) @ X4)) | (X4 = X5) | ((in @ (sK8 @ X5 @ X4) @ X5) = $true)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f67])).
% 0.24/0.42 thf(f67,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true = (in @ (sK9 @ X5 @ X4) @ X4)) | ((in @ (sK8 @ X5 @ X4) @ X5) = $true) | (X4 = X5) | ($true != $true)) )),
% 0.24/0.42 inference(definition_unfolding,[],[f47,f54])).
% 0.24/0.42 thf(f54,plain,(
% 0.24/0.42 (setext = $true)),
% 0.24/0.42 inference(cnf_transformation,[],[f37])).
% 0.24/0.42 thf(f37,plain,(
% 0.24/0.42 (sK10 != (dsetconstr @ sK10 @ (^[Y0 : $i]: ($true)))) & (setext = $true) & (dsetconstrEL = $true) & (dsetconstrI = $true)),
% 0.24/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f18,f36])).
% 0.24/0.42 thf(f36,plain,(
% 0.24/0.42 ? [X0] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) => (sK10 != (dsetconstr @ sK10 @ (^[Y0 : $i]: ($true))))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f18,plain,(
% 0.24/0.42 ? [X0] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) & (setext = $true) & (dsetconstrEL = $true) & (dsetconstrI = $true)),
% 0.24/0.42 inference(flattening,[],[f17])).
% 0.24/0.42 thf(f17,plain,(
% 0.24/0.42 ((? [X0] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) != X0) & (setext = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)),
% 0.24/0.42 inference(ennf_transformation,[],[f8])).
% 0.24/0.42 thf(f8,plain,(
% 0.24/0.42 ~((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((setext = $true) => ! [X0] : ((dsetconstr @ X0 @ (^[Y0 : $i]: ($true))) = X0))))),
% 0.24/0.42 inference(fool_elimination,[],[f7])).
% 0.24/0.42 thf(f7,plain,(
% 0.24/0.42 ~(dsetconstrI => (dsetconstrEL => (setext => ! [X0] : (X0 = (dsetconstr @ X0 @ (^[X1 : $i] : ($true)))))))),
% 0.24/0.42 inference(rectify,[],[f5])).
% 0.24/0.42 thf(f5,negated_conjecture,(
% 0.24/0.42 ~(dsetconstrI => (dsetconstrEL => (setext => ! [X0] : (X0 = (dsetconstr @ X0 @ (^[X2 : $i] : ($true)))))))),
% 0.24/0.42 inference(negated_conjecture,[],[f4])).
% 0.24/0.42 thf(f4,conjecture,(
% 0.24/0.42 dsetconstrI => (dsetconstrEL => (setext => ! [X0] : (X0 = (dsetconstr @ X0 @ (^[X2 : $i] : ($true))))))),
% 0.24/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setoftrueEq)).
% 0.24/0.42 thf(f47,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (((in @ (sK8 @ X5 @ X4) @ X5) = $true) | (X4 = X5) | ($true = (in @ (sK9 @ X5 @ X4) @ X4)) | (setext != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f35])).
% 0.24/0.42 thf(f35,plain,(
% 0.24/0.42 ((setext = $true) | (! [X2] : (($true != (in @ X2 @ sK7)) | ($true = (in @ X2 @ sK6))) & (sK7 != sK6) & ! [X3] : (((in @ X3 @ sK7) = $true) | ($true != (in @ X3 @ sK6))))) & (! [X4,X5] : ((((in @ (sK8 @ X5 @ X4) @ X5) = $true) & ($true != (in @ (sK8 @ X5 @ X4) @ X4))) | (X4 = X5) | (((in @ (sK9 @ X5 @ X4) @ X5) != $true) & ($true = (in @ (sK9 @ X5 @ X4) @ X4)))) | (setext != $true))),
% 0.24/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f31,f34,f33,f32])).
% 0.24/0.42 thf(f32,plain,(
% 0.24/0.42 ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & (X0 != X1) & ! [X3] : (($true = (in @ X3 @ X1)) | ($true != (in @ X3 @ X0)))) => (! [X2] : (($true != (in @ X2 @ sK7)) | ($true = (in @ X2 @ sK6))) & (sK7 != sK6) & ! [X3] : (((in @ X3 @ sK7) = $true) | ($true != (in @ X3 @ sK6))))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f33,plain,(
% 0.24/0.42 ! [X4,X5] : (? [X6] : (((in @ X6 @ X5) = $true) & ($true != (in @ X6 @ X4))) => (((in @ (sK8 @ X5 @ X4) @ X5) = $true) & ($true != (in @ (sK8 @ X5 @ X4) @ X4))))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f34,plain,(
% 0.24/0.42 ! [X4,X5] : (? [X7] : (($true != (in @ X7 @ X5)) & ($true = (in @ X7 @ X4))) => (((in @ (sK9 @ X5 @ X4) @ X5) != $true) & ($true = (in @ (sK9 @ X5 @ X4) @ X4))))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f31,plain,(
% 0.24/0.42 ((setext = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & (X0 != X1) & ! [X3] : (($true = (in @ X3 @ X1)) | ($true != (in @ X3 @ X0))))) & (! [X4,X5] : (? [X6] : (((in @ X6 @ X5) = $true) & ($true != (in @ X6 @ X4))) | (X4 = X5) | ? [X7] : (($true != (in @ X7 @ X5)) & ($true = (in @ X7 @ X4)))) | (setext != $true))),
% 0.24/0.42 inference(rectify,[],[f30])).
% 0.24/0.42 thf(f30,plain,(
% 0.24/0.42 ((setext = $true) | ? [X0,X1] : (! [X3] : (($true != (in @ X3 @ X1)) | ($true = (in @ X3 @ X0))) & (X0 != X1) & ! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)))) & (! [X0,X1] : (? [X3] : (($true = (in @ X3 @ X1)) & ($true != (in @ X3 @ X0))) | (X0 = X1) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) | (setext != $true))),
% 0.24/0.42 inference(nnf_transformation,[],[f20])).
% 0.24/0.42 thf(f20,plain,(
% 0.24/0.42 (setext = $true) <=> ! [X0,X1] : (? [X3] : (($true = (in @ X3 @ X1)) & ($true != (in @ X3 @ X0))) | (X0 = X1) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)))),
% 0.24/0.42 inference(flattening,[],[f19])).
% 0.24/0.42 thf(f19,plain,(
% 0.24/0.42 ! [X0,X1] : (((X0 = X1) | ? [X3] : (($true = (in @ X3 @ X1)) & ($true != (in @ X3 @ X0)))) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) <=> (setext = $true)),
% 0.24/0.42 inference(ennf_transformation,[],[f12])).
% 0.24/0.42 thf(f12,plain,(
% 0.24/0.42 ! [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => (! [X3] : (($true = (in @ X3 @ X1)) => ($true = (in @ X3 @ X0))) => (X0 = X1))) <=> (setext = $true)),
% 0.24/0.42 inference(fool_elimination,[],[f11])).
% 0.24/0.42 thf(f11,plain,(
% 0.24/0.42 (setext = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (! [X3] : ((in @ X3 @ X1) => (in @ X3 @ X0)) => (X0 = X1))))),
% 0.24/0.42 inference(rectify,[],[f3])).
% 0.24/0.42 thf(f3,axiom,(
% 0.24/0.42 (setext = ! [X0,X4] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X4)) => (! [X2] : ((in @ X2 @ X4) => (in @ X2 @ X0)) => (X0 = X4))))),
% 0.24/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setext)).
% 0.24/0.42 thf(f74,plain,(
% 0.24/0.42 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (($true != (in @ X2 @ (dsetconstr @ X1 @ X0))) | ((in @ X2 @ X1) = $true)) )),
% 0.24/0.42 inference(beta_eta_normalization,[],[f73])).
% 0.24/0.42 thf(f73,plain,(
% 0.24/0.42 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) | ((in @ X2 @ X1) = $true)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f60])).
% 0.24/0.42 thf(f60,plain,(
% 0.24/0.42 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X2 @ X1) = $true) | ($true != $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))) )),
% 0.24/0.42 inference(definition_unfolding,[],[f44,f53])).
% 0.24/0.42 thf(f53,plain,(
% 0.24/0.42 (dsetconstrEL = $true)),
% 0.24/0.42 inference(cnf_transformation,[],[f37])).
% 0.24/0.42 thf(f44,plain,(
% 0.24/0.42 ( ! [X2 : $i,X0 : $i > $o,X1 : $i] : (((in @ X2 @ X1) = $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) | (dsetconstrEL != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f29])).
% 0.24/0.42 thf(f29,plain,(
% 0.24/0.42 (! [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) = $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | (($true != (in @ sK5 @ sK4)) & ($true = (in @ sK5 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (sK3 @ Y0)))))))),
% 0.24/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f27,f28])).
% 0.24/0.42 thf(f28,plain,(
% 0.24/0.42 ? [X3 : $i > $o,X4,X5] : (((in @ X5 @ X4) != $true) & ($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0)))))) => (($true != (in @ sK5 @ sK4)) & ($true = (in @ sK5 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (sK3 @ Y0))))))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f27,plain,(
% 0.24/0.42 (! [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) = $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X3 : $i > $o,X4,X5] : (((in @ X5 @ X4) != $true) & ($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0)))))))),
% 0.24/0.42 inference(rectify,[],[f26])).
% 0.24/0.42 thf(f26,plain,(
% 0.24/0.42 (! [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) = $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))) | (dsetconstrEL != $true)) & ((dsetconstrEL = $true) | ? [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) != $true) & ($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))))),
% 0.24/0.42 inference(nnf_transformation,[],[f21])).
% 0.24/0.42 thf(f21,plain,(
% 0.24/0.42 ! [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) = $true) | ($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0)))))) <=> (dsetconstrEL = $true)),
% 0.24/0.42 inference(ennf_transformation,[],[f10])).
% 0.24/0.42 thf(f10,plain,(
% 0.24/0.42 (dsetconstrEL = $true) <=> ! [X0 : $i > $o,X1,X2] : (($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) => ((in @ X2 @ X1) = $true))),
% 0.24/0.42 inference(fool_elimination,[],[f9])).
% 0.24/0.42 thf(f9,plain,(
% 0.24/0.42 (! [X0 : $i > $o,X1,X2] : ((in @ X2 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X0 @ X3)))) => (in @ X2 @ X1)) = dsetconstrEL)),
% 0.24/0.42 inference(rectify,[],[f2])).
% 0.24/0.42 thf(f2,axiom,(
% 0.24/0.42 (! [X1 : $i > $o,X0,X2] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)) = dsetconstrEL)),
% 0.24/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL)).
% 0.24/0.42 thf(f108,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != (in @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f107])).
% 0.24/0.42 thf(f107,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != (in @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ($true != $true) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(duplicate_literal_removal,[],[f103])).
% 0.24/0.42 thf(f103,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != (in @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0) | ($true != $true) | ($true != (in @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0)) )),
% 0.24/0.42 inference(superposition,[],[f84,f94])).
% 0.24/0.42 thf(f94,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ($true != (X2 @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)))) | ($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1)) | ((dsetconstr @ X1 @ X2) = X0)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f93])).
% 0.24/0.42 thf(f93,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != $true) | ((dsetconstr @ X1 @ X2) = X0) | ((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1)) | ($true != (X2 @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2))))) )),
% 0.24/0.42 inference(superposition,[],[f82,f77])).
% 0.24/0.42 thf(f77,plain,(
% 0.24/0.42 ( ! [X3 : $i > $o,X4 : $i,X5 : $i] : (($true = (in @ X5 @ (dsetconstr @ X4 @ X3))) | ($true != (X3 @ X5)) | ((in @ X5 @ X4) != $true)) )),
% 0.24/0.42 inference(beta_eta_normalization,[],[f76])).
% 0.24/0.42 thf(f76,plain,(
% 0.24/0.42 ( ! [X3 : $i > $o,X4 : $i,X5 : $i] : (($true != (X3 @ X5)) | ($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0))))) | ((in @ X5 @ X4) != $true)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f59])).
% 0.24/0.42 thf(f59,plain,(
% 0.24/0.42 ( ! [X3 : $i > $o,X4 : $i,X5 : $i] : (($true != $true) | ($true != (X3 @ X5)) | ((in @ X5 @ X4) != $true) | ($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0)))))) )),
% 0.24/0.42 inference(definition_unfolding,[],[f38,f52])).
% 0.24/0.42 thf(f52,plain,(
% 0.24/0.42 (dsetconstrI = $true)),
% 0.24/0.42 inference(cnf_transformation,[],[f37])).
% 0.24/0.42 thf(f38,plain,(
% 0.24/0.42 ( ! [X3 : $i > $o,X4 : $i,X5 : $i] : (($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0))))) | ((in @ X5 @ X4) != $true) | ($true != (X3 @ X5)) | (dsetconstrI != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f25])).
% 0.24/0.42 thf(f25,plain,(
% 0.24/0.42 ((dsetconstrI = $true) | (((in @ sK2 @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK0 @ Y0)))) != $true) & ($true = (in @ sK2 @ sK1)) & ($true = (sK0 @ sK2)))) & (! [X3 : $i > $o,X4,X5] : (($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0))))) | ((in @ X5 @ X4) != $true) | ($true != (X3 @ X5))) | (dsetconstrI != $true))),
% 0.24/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f24])).
% 0.24/0.42 thf(f24,plain,(
% 0.24/0.42 ? [X0 : $i > $o,X1,X2] : (($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) & ((in @ X2 @ X1) = $true) & ($true = (X0 @ X2))) => (((in @ sK2 @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK0 @ Y0)))) != $true) & ($true = (in @ sK2 @ sK1)) & ($true = (sK0 @ sK2)))),
% 0.24/0.42 introduced(choice_axiom,[])).
% 0.24/0.42 thf(f23,plain,(
% 0.24/0.42 ((dsetconstrI = $true) | ? [X0 : $i > $o,X1,X2] : (($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) & ((in @ X2 @ X1) = $true) & ($true = (X0 @ X2)))) & (! [X3 : $i > $o,X4,X5] : (($true = (in @ X5 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X3 @ Y0))))) | ((in @ X5 @ X4) != $true) | ($true != (X3 @ X5))) | (dsetconstrI != $true))),
% 0.24/0.42 inference(rectify,[],[f22])).
% 0.24/0.42 thf(f22,plain,(
% 0.24/0.42 ((dsetconstrI = $true) | ? [X0 : $i > $o,X1,X2] : (($true != (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) & ((in @ X2 @ X1) = $true) & ($true = (X0 @ X2)))) & (! [X0 : $i > $o,X1,X2] : (($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) | ((in @ X2 @ X1) != $true) | ($true != (X0 @ X2))) | (dsetconstrI != $true))),
% 0.24/0.42 inference(nnf_transformation,[],[f16])).
% 0.24/0.42 thf(f16,plain,(
% 0.24/0.42 (dsetconstrI = $true) <=> ! [X0 : $i > $o,X1,X2] : (($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) | ((in @ X2 @ X1) != $true) | ($true != (X0 @ X2)))),
% 0.24/0.42 inference(flattening,[],[f15])).
% 0.24/0.42 thf(f15,plain,(
% 0.24/0.42 ! [X0 : $i > $o,X1,X2] : ((($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))) | ($true != (X0 @ X2))) | ((in @ X2 @ X1) != $true)) <=> (dsetconstrI = $true)),
% 0.24/0.42 inference(ennf_transformation,[],[f14])).
% 0.24/0.42 thf(f14,plain,(
% 0.24/0.42 ! [X0 : $i > $o,X1,X2] : (((in @ X2 @ X1) = $true) => (($true = (X0 @ X2)) => ($true = (in @ X2 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))))))) <=> (dsetconstrI = $true)),
% 0.24/0.42 inference(fool_elimination,[],[f13])).
% 0.24/0.42 thf(f13,plain,(
% 0.24/0.42 (dsetconstrI = ! [X0 : $i > $o,X1,X2] : ((in @ X2 @ X1) => ((X0 @ X2) => (in @ X2 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X0 @ X3)))))))),
% 0.24/0.42 inference(rectify,[],[f1])).
% 0.24/0.42 thf(f1,axiom,(
% 0.24/0.42 (dsetconstrI = ! [X1 : $i > $o,X0,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
% 0.24/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI)).
% 0.24/0.42 thf(f82,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ (dsetconstr @ X1 @ X2))) | ((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true) | ((dsetconstr @ X1 @ X2) = X0)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f81])).
% 0.24/0.42 thf(f81,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ (dsetconstr @ X1 @ X2))) | ((dsetconstr @ X1 @ X2) = X0) | ($true != $true) | ((in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1) = $true)) )),
% 0.24/0.42 inference(superposition,[],[f74,f71])).
% 0.24/0.42 thf(f71,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true = (in @ (sK9 @ X5 @ X4) @ X4)) | (X4 = X5) | ($true != (in @ (sK8 @ X5 @ X4) @ X4))) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f69])).
% 0.24/0.42 thf(f69,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true != $true) | ($true = (in @ (sK9 @ X5 @ X4) @ X4)) | (X4 = X5) | ($true != (in @ (sK8 @ X5 @ X4) @ X4))) )),
% 0.24/0.42 inference(definition_unfolding,[],[f45,f54])).
% 0.24/0.42 thf(f45,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true != (in @ (sK8 @ X5 @ X4) @ X4)) | (X4 = X5) | ($true = (in @ (sK9 @ X5 @ X4) @ X4)) | (setext != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f35])).
% 0.24/0.42 thf(f84,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0)) | ((dsetconstr @ X1 @ X2) = X0) | ($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1)) | ($true != (X2 @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2))))) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f83])).
% 0.24/0.42 thf(f83,plain,(
% 0.24/0.42 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ (sK9 @ X0 @ (dsetconstr @ X1 @ X2)) @ X0)) | ((dsetconstr @ X1 @ X2) = X0) | ($true != (in @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2)) @ X1)) | ($true != $true) | ($true != (X2 @ (sK8 @ X0 @ (dsetconstr @ X1 @ X2))))) )),
% 0.24/0.42 inference(superposition,[],[f72,f77])).
% 0.24/0.42 thf(f72,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true != (in @ (sK8 @ X5 @ X4) @ X4)) | ((in @ (sK9 @ X5 @ X4) @ X5) != $true) | (X4 = X5)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f68])).
% 0.24/0.42 thf(f68,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (((in @ (sK9 @ X5 @ X4) @ X5) != $true) | ($true != $true) | ($true != (in @ (sK8 @ X5 @ X4) @ X4)) | (X4 = X5)) )),
% 0.24/0.42 inference(definition_unfolding,[],[f46,f54])).
% 0.24/0.42 thf(f46,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (($true != (in @ (sK8 @ X5 @ X4) @ X4)) | (X4 = X5) | ((in @ (sK9 @ X5 @ X4) @ X5) != $true) | (setext != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f35])).
% 0.24/0.42 thf(f115,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (((dsetconstr @ X0 @ X1) = X0) | ($true != (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1))))) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f114])).
% 0.24/0.42 thf(f114,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (($true != $true) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0) | ($true != (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0))) )),
% 0.24/0.42 inference(duplicate_literal_removal,[],[f112])).
% 0.24/0.42 thf(f112,plain,(
% 0.24/0.42 ( ! [X0 : $i,X1 : $i > $o] : (((dsetconstr @ X0 @ X1) = X0) | ($true != (X1 @ (sK8 @ X0 @ (dsetconstr @ X0 @ X1)))) | ((dsetconstr @ X0 @ X1) = X0) | ($true != (in @ (sK9 @ X0 @ (dsetconstr @ X0 @ X1)) @ X0)) | ($true != $true)) )),
% 0.24/0.42 inference(superposition,[],[f108,f75])).
% 0.24/0.42 thf(f75,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (((in @ (sK8 @ X5 @ X4) @ X5) = $true) | (X4 = X5) | ((in @ (sK9 @ X5 @ X4) @ X5) != $true)) )),
% 0.24/0.42 inference(trivial_inequality_removal,[],[f66])).
% 0.24/0.42 thf(f66,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : ((X4 = X5) | ($true != $true) | ((in @ (sK9 @ X5 @ X4) @ X5) != $true) | ((in @ (sK8 @ X5 @ X4) @ X5) = $true)) )),
% 0.24/0.42 inference(definition_unfolding,[],[f48,f54])).
% 0.24/0.42 thf(f48,plain,(
% 0.24/0.42 ( ! [X4 : $i,X5 : $i] : (((in @ (sK8 @ X5 @ X4) @ X5) = $true) | (X4 = X5) | ((in @ (sK9 @ X5 @ X4) @ X5) != $true) | (setext != $true)) )),
% 0.24/0.42 inference(cnf_transformation,[],[f35])).
% 0.24/0.42 thf(f55,plain,(
% 0.24/0.42 (sK10 != (dsetconstr @ sK10 @ (^[Y0 : $i]: ($true))))),
% 0.24/0.42 inference(cnf_transformation,[],[f37])).
% 0.24/0.42 % SZS output end Proof for theBenchmark
% 0.24/0.42 % (25116)------------------------------
% 0.24/0.42 % (25116)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42 % (25116)Termination reason: Refutation
% 0.24/0.42
% 0.24/0.42 % (25116)Memory used [KB]: 5628
% 0.24/0.42 % (25116)Time elapsed: 0.022 s
% 0.24/0.42 % (25116)Instructions burned: 28 (million)
% 0.24/0.42 % (25116)------------------------------
% 0.24/0.42 % (25116)------------------------------
% 0.24/0.42 % (25110)Success in time 0.033 s
% 0.24/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------