TSTP Solution File: SEU508^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU508^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 : n002.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:14 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU508^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 17:18:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 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.15/0.38 % (2613)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.38 % (2614)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.15/0.38 % (2616)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (2616)Instruction limit reached!
% 0.15/0.38 % (2616)------------------------------
% 0.15/0.38 % (2616)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (2616)Termination reason: Unknown
% 0.15/0.38 % (2616)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (2616)Memory used [KB]: 895
% 0.15/0.38 % (2616)Time elapsed: 0.003 s
% 0.15/0.38 % (2616)Instructions burned: 2 (million)
% 0.15/0.38 % (2616)------------------------------
% 0.15/0.38 % (2616)------------------------------
% 0.15/0.39 % (2614)Instruction limit reached!
% 0.15/0.39 % (2614)------------------------------
% 0.15/0.39 % (2614)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2614)Termination reason: Unknown
% 0.15/0.39 % (2614)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (2614)Memory used [KB]: 5500
% 0.15/0.39 % (2614)Time elapsed: 0.005 s
% 0.15/0.39 % (2614)Instructions burned: 4 (million)
% 0.15/0.39 % (2614)------------------------------
% 0.15/0.39 % (2614)------------------------------
% 0.15/0.39 % (2620)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.39 % (2620)Instruction limit reached!
% 0.15/0.39 % (2620)------------------------------
% 0.15/0.39 % (2620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2620)Termination reason: Unknown
% 0.15/0.39 % (2620)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (2620)Memory used [KB]: 5500
% 0.15/0.39 % (2620)Time elapsed: 0.004 s
% 0.15/0.39 % (2620)Instructions burned: 3 (million)
% 0.15/0.39 % (2620)------------------------------
% 0.15/0.39 % (2620)------------------------------
% 0.15/0.39 % (2615)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.15/0.39 % (2613)First to succeed.
% 0.15/0.39 % (2617)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (2617)Instruction limit reached!
% 0.15/0.39 % (2617)------------------------------
% 0.15/0.39 % (2617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2617)Termination reason: Unknown
% 0.15/0.39 % (2617)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (2617)Memory used [KB]: 895
% 0.15/0.39 % (2617)Time elapsed: 0.003 s
% 0.15/0.39 % (2617)Instructions burned: 2 (million)
% 0.15/0.39 % (2617)------------------------------
% 0.15/0.39 % (2617)------------------------------
% 0.15/0.39 % (2618)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.15/0.39 % (2619)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (2613)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.15/0.39 thf(func_def_14, type, sK1: $i > $o).
% 0.15/0.39 thf(func_def_18, type, ph4: !>[X0: $tType]:(X0)).
% 0.15/0.39 thf(f113,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(avatar_sat_refutation,[],[f52,f61,f89,f96,f102,f112])).
% 0.15/0.39 thf(f112,plain,(
% 0.15/0.39 spl3_1 | ~spl3_2),
% 0.15/0.39 inference(avatar_contradiction_clause,[],[f111])).
% 0.15/0.39 thf(f111,plain,(
% 0.15/0.39 $false | (spl3_1 | ~spl3_2)),
% 0.15/0.39 inference(subsumption_resolution,[],[f107,f46])).
% 0.15/0.39 thf(f46,plain,(
% 0.15/0.39 ((sK1 @ sK0) != $true) | spl3_1),
% 0.15/0.39 inference(avatar_component_clause,[],[f45])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 spl3_1 <=> ((sK1 @ sK0) = $true)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.15/0.39 thf(f107,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $true) | ~spl3_2),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f106])).
% 0.15/0.39 thf(f106,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $true) | ($true = $false) | ~spl3_2),
% 0.15/0.39 inference(superposition,[],[f31,f51])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $true) | ~spl3_2),
% 0.15/0.39 inference(avatar_component_clause,[],[f49])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 spl3_2 <=> ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $true)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (((in @ X2 @ (dsetconstr @ X1 @ X3)) = $false) | ($true = (X3 @ X2))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((in @ X2 @ (dsetconstr @ X1 @ X3)) => (X3 @ X2)) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f29])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((^[Y0 : $i > $o]: ((in @ X2 @ (dsetconstr @ X1 @ Y0)) => (Y0 @ X2))) @ X3))) )),
% 0.15/0.39 inference(pi_clausification,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X2 @ (dsetconstr @ X1 @ Y0)) => (Y0 @ X2)))) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ (dsetconstr @ X1 @ Y1)) => (Y1 @ Y0))))) @ X2) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ (dsetconstr @ X1 @ Y1)) => (Y1 @ Y0)))))) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (Y2 @ Y1))))))) @ X1))) )),
% 0.15/0.39 inference(pi_clausification,[],[f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (Y2 @ Y1)))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f21,f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 (! [X0 : $i > $o,X1,X2] : ((in @ X1 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X0 @ X3)))) => (X0 @ X1)) = dsetconstrER)),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (! [X1 : $i > $o,X2,X0] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)) = dsetconstrER)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER)).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 (dsetconstrER = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 (dsetconstrER = $true) & (dsetconstrI = $true) & (((sK1 @ sK0) != (in @ sK0 @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))))) & ((in @ sK0 @ sK2) = $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != (X1 @ X0)) & ((in @ X0 @ X2) = $true)) => (((sK1 @ sK0) != (in @ sK0 @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))))) & ((in @ sK0 @ sK2) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 (dsetconstrER = $true) & (dsetconstrI = $true) & ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != (X1 @ X0)) & ((in @ X0 @ X2) = $true))),
% 0.15/0.39 inference(flattening,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != (X1 @ X0)) & ((in @ X0 @ X2) = $true)) & (dsetconstrER = $true)) & (dsetconstrI = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~((dsetconstrI = $true) => ((dsetconstrER = $true) => ! [X0,X1 : $i > $o,X2] : (((in @ X0 @ X2) = $true) => ((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = (X1 @ X0)))))),
% 0.15/0.39 inference(fool_elimination,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ~(dsetconstrI => (dsetconstrER => ! [X0,X1 : $i > $o,X2] : ((in @ X0 @ X2) => ((in @ X0 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X1 @ X3)))) <=> (X1 @ X0)))))),
% 0.15/0.39 inference(rectify,[],[f4])).
% 0.15/0.39 thf(f4,negated_conjecture,(
% 0.15/0.39 ~(dsetconstrI => (dsetconstrER => ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ X0) => ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) <=> (X1 @ X2)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f3])).
% 0.15/0.39 thf(f3,conjecture,(
% 0.15/0.39 dsetconstrI => (dsetconstrER => ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ X0) => ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) <=> (X1 @ X2))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setbeta)).
% 0.15/0.39 thf(f102,plain,(
% 0.15/0.39 ~spl3_1 | ~spl3_4),
% 0.15/0.39 inference(avatar_contradiction_clause,[],[f101])).
% 0.15/0.39 thf(f101,plain,(
% 0.15/0.39 $false | (~spl3_1 | ~spl3_4)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f97])).
% 0.15/0.39 thf(f97,plain,(
% 0.15/0.39 ($true = $false) | (~spl3_1 | ~spl3_4)),
% 0.15/0.39 inference(superposition,[],[f60,f47])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $true) | ~spl3_1),
% 0.15/0.39 inference(avatar_component_clause,[],[f45])).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $false) | ~spl3_4),
% 0.15/0.39 inference(avatar_component_clause,[],[f58])).
% 0.15/0.39 thf(f58,plain,(
% 0.15/0.39 spl3_4 <=> ((sK1 @ sK0) = $false)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.15/0.39 thf(f96,plain,(
% 0.15/0.39 ~spl3_5),
% 0.15/0.39 inference(avatar_contradiction_clause,[],[f95])).
% 0.15/0.39 thf(f95,plain,(
% 0.15/0.39 $false | ~spl3_5),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f92])).
% 0.15/0.39 thf(f92,plain,(
% 0.15/0.39 ($true = $false) | ~spl3_5),
% 0.15/0.39 inference(superposition,[],[f18,f87])).
% 0.15/0.39 thf(f87,plain,(
% 0.15/0.39 ((in @ sK0 @ sK2) = $false) | ~spl3_5),
% 0.15/0.39 inference(avatar_component_clause,[],[f85])).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 spl3_5 <=> ((in @ sK0 @ sK2) = $false)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_5])])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ((in @ sK0 @ sK2) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f89,plain,(
% 0.15/0.39 spl3_5 | spl3_4 | ~spl3_3),
% 0.15/0.39 inference(avatar_split_clause,[],[f79,f54,f58,f85])).
% 0.15/0.39 thf(f54,plain,(
% 0.15/0.39 spl3_3 <=> ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $false)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.15/0.39 thf(f79,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $false) | ((in @ sK0 @ sK2) = $false) | ~spl3_3),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f72])).
% 0.15/0.39 thf(f72,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $false) | ((in @ sK0 @ sK2) = $false) | ($true = $false) | ~spl3_3),
% 0.15/0.39 inference(superposition,[],[f43,f56])).
% 0.15/0.39 thf(f56,plain,(
% 0.15/0.39 ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $false) | ~spl3_3),
% 0.15/0.39 inference(avatar_component_clause,[],[f54])).
% 0.15/0.39 thf(f43,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = (in @ X1 @ (dsetconstr @ X3 @ X2))) | ($false = (X2 @ X1)) | ((in @ X1 @ X3) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f42])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = ((X2 @ X1) => (in @ X1 @ (dsetconstr @ X3 @ X2)))) | ((in @ X1 @ X3) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = ((in @ X1 @ X3) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ X3 @ X2)))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ X1 @ Y0) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ X2))))) @ X3))) )),
% 0.15/0.39 inference(pi_clausification,[],[f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ Y0) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ X2)))))) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f38])).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 ( ! [X2 : $i > $o,X1 : $i] : (($true = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ Y1 @ Y0))))))) @ X2))) )),
% 0.15/0.39 inference(pi_clausification,[],[f37])).
% 0.15/0.39 thf(f37,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ Y1 @ Y0)))))))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1))))))))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1)))))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f20,f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 (dsetconstrI = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (dsetconstrI = ! [X0,X1 : $i > $o,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI)).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 (dsetconstrI = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f61,plain,(
% 0.15/0.39 spl3_3 | spl3_4),
% 0.15/0.39 inference(avatar_split_clause,[],[f34,f58,f54])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $false) | ((sK1 @ sK0) = $false)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) != (sK1 @ sK0))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f19])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ((sK1 @ sK0) != (in @ sK0 @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f15])).
% 0.15/0.39 thf(f52,plain,(
% 0.15/0.39 spl3_1 | spl3_2),
% 0.15/0.39 inference(avatar_split_clause,[],[f33,f49,f45])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ((sK1 @ sK0) = $true) | ((in @ sK0 @ (dsetconstr @ sK2 @ sK1)) = $true)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f32])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (2613)------------------------------
% 0.15/0.39 % (2613)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (2613)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (2613)Memory used [KB]: 5628
% 0.15/0.39 % (2613)Time elapsed: 0.011 s
% 0.15/0.39 % (2613)Instructions burned: 7 (million)
% 0.15/0.39 % (2613)------------------------------
% 0.15/0.39 % (2613)------------------------------
% 0.15/0.39 % (2612)Success in time 0.022 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------