TSTP Solution File: SEU675^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU675^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 : 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:50:33 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU675^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.11 % 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.11/0.31 % Computer : n026.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 15:56:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH0_THM_EQU_NAR problem
% 0.11/0.32 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.11/0.34 % (13923)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.34 % (13920)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.34 % (13924)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.11/0.34 % (13920)Instruction limit reached!
% 0.11/0.34 % (13920)------------------------------
% 0.11/0.34 % (13920)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (13920)Termination reason: Unknown
% 0.11/0.34 % (13920)Termination phase: shuffling
% 0.11/0.34
% 0.11/0.34 % (13920)Memory used [KB]: 895
% 0.11/0.34 % (13920)Time elapsed: 0.002 s
% 0.11/0.34 % (13920)Instructions burned: 2 (million)
% 0.11/0.34 % (13920)------------------------------
% 0.11/0.34 % (13920)------------------------------
% 0.11/0.34 % (13922)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.11/0.34 % (13924)Instruction limit reached!
% 0.11/0.34 % (13924)------------------------------
% 0.11/0.34 % (13924)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (13924)Termination reason: Unknown
% 0.11/0.34 % (13924)Termination phase: Property scanning
% 0.11/0.34
% 0.11/0.34 % (13924)Memory used [KB]: 1023
% 0.11/0.34 % (13924)Time elapsed: 0.003 s
% 0.11/0.34 % (13924)Instructions burned: 3 (million)
% 0.11/0.34 % (13924)------------------------------
% 0.11/0.34 % (13924)------------------------------
% 0.11/0.34 % (13922)Refutation not found, incomplete strategy
% 0.11/0.34 % (13922)------------------------------
% 0.11/0.34 % (13922)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (13922)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 % (13922)Memory used [KB]: 5500
% 0.11/0.34 % (13922)Time elapsed: 0.003 s
% 0.11/0.34 % (13922)Instructions burned: 3 (million)
% 0.11/0.34 % (13922)------------------------------
% 0.11/0.34 % (13922)------------------------------
% 0.11/0.34 % (13917)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.11/0.34 % (13921)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.11/0.34 % (13921)Instruction limit reached!
% 0.11/0.34 % (13921)------------------------------
% 0.11/0.34 % (13921)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (13921)Termination reason: Unknown
% 0.11/0.34 % (13921)Termination phase: Unused predicate definition removal
% 0.11/0.34
% 0.11/0.34 % (13921)Memory used [KB]: 1023
% 0.11/0.34 % (13921)Time elapsed: 0.003 s
% 0.11/0.34 % (13921)Instructions burned: 2 (million)
% 0.11/0.34 % (13921)------------------------------
% 0.11/0.34 % (13921)------------------------------
% 0.11/0.34 % (13923)First to succeed.
% 0.11/0.34 % (13919)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.11/0.35 % (13923)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% 0.11/0.35 thf(func_def_0, type, in: $i > $i > $o).
% 0.11/0.35 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.11/0.35 thf(func_def_3, type, powerset: $i > $i).
% 0.11/0.35 thf(func_def_4, type, dsetconstr: $i > ($i > $o) > $i).
% 0.11/0.35 thf(func_def_7, type, subset: $i > $i > $o).
% 0.11/0.35 thf(func_def_8, type, kpair: $i > $i > $i).
% 0.11/0.35 thf(func_def_9, type, cartprod: $i > $i > $i).
% 0.11/0.35 thf(func_def_10, type, singleton: $i > $o).
% 0.11/0.35 thf(func_def_11, type, ex1: $i > ($i > $o) > $o).
% 0.11/0.35 thf(func_def_12, type, breln: $i > $i > $i > $o).
% 0.11/0.35 thf(func_def_13, type, func: $i > $i > $i > $o).
% 0.11/0.35 thf(func_def_14, type, funcSet: $i > $i > $i).
% 0.11/0.35 thf(func_def_29, type, sK2: $i > $o).
% 0.11/0.35 thf(func_def_37, type, ph8: !>[X0: $tType]:(X0)).
% 0.11/0.35 thf(func_def_38, type, sK9: $i > $i).
% 0.11/0.35 thf(f110,plain,(
% 0.11/0.35 $false),
% 0.11/0.35 inference(avatar_sat_refutation,[],[f70,f75,f106,f109])).
% 0.11/0.35 thf(f109,plain,(
% 0.11/0.35 ~spl6_1),
% 0.11/0.35 inference(avatar_contradiction_clause,[],[f108])).
% 0.11/0.35 thf(f108,plain,(
% 0.11/0.35 $false | ~spl6_1),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f107])).
% 0.11/0.35 thf(f107,plain,(
% 0.11/0.35 ($true = $false) | ~spl6_1),
% 0.11/0.35 inference(backward_demodulation,[],[f79,f66])).
% 0.11/0.35 thf(f66,plain,(
% 0.11/0.35 ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false) | ~spl6_1),
% 0.11/0.35 inference(avatar_component_clause,[],[f64])).
% 0.11/0.35 thf(f64,plain,(
% 0.11/0.35 spl6_1 <=> ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)),
% 0.11/0.35 introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.11/0.35 thf(f79,plain,(
% 0.11/0.35 ($true = (subset @ sK5 @ (cartprod @ sK3 @ sK4)))),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f78])).
% 0.11/0.35 thf(f78,plain,(
% 0.11/0.35 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))))))))) & (subset @ sK5 @ (cartprod @ sK3 @ sK4))) = $true)),
% 0.11/0.35 inference(beta_eta_normalization,[],[f77])).
% 0.11/0.35 thf(f77,plain,(
% 0.11/0.35 ($true = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK3) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))))))))) & (subset @ Y0 @ (cartprod @ sK3 @ sK4)))) @ sK5))),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f76])).
% 0.11/0.35 thf(f76,plain,(
% 0.11/0.35 ($true = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK3) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))))))))) & (subset @ Y0 @ (cartprod @ sK3 @ sK4)))) @ sK5)) | ($true != $true)),
% 0.11/0.35 inference(superposition,[],[f61,f62])).
% 0.11/0.35 thf(f62,plain,(
% 0.11/0.35 ((in @ sK5 @ (dsetconstr @ (powerset @ (cartprod @ sK3 @ sK4)) @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK3) => (?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))) & ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ sK4 @ (^[Y3 : $i]: (in @ (kpair @ Y1 @ Y3) @ Y0)))))))))) & (subset @ Y0 @ (cartprod @ sK3 @ sK4)))))) = $true)),
% 0.11/0.35 inference(beta_eta_normalization,[],[f49])).
% 0.11/0.35 thf(f49,plain,(
% 0.11/0.35 ($true = (in @ sK5 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y1)) @ (^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: ((!! @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y3) => ((^[Y7 : $i]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: (?? @ $i @ (^[Y10 : $i]: ((in @ Y10 @ Y9) & ((setadjoin @ Y10 @ emptyset) = Y9))))) @ (dsetconstr @ Y7 @ (^[Y9 : $i]: (Y8 @ Y9))))))) @ Y4 @ (^[Y7 : $i]: (in @ (kpair @ Y6 @ Y7) @ Y5)))))) & ((^[Y6 : $i]: ((^[Y7 : $i]: ((^[Y8 : $i]: (subset @ Y8 @ (cartprod @ Y6 @ Y7))))))) @ Y3 @ Y4 @ Y5))))))) @ Y0 @ Y1 @ Y2)))))) @ sK3 @ sK4)))),
% 0.11/0.35 inference(definition_unfolding,[],[f39,f44])).
% 0.11/0.35 thf(f44,plain,(
% 0.11/0.35 (funcSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y1)) @ (^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: ((!! @ $i @ (^[Y6 : $i]: ((in @ Y6 @ Y3) => ((^[Y7 : $i]: ((^[Y8 : $i > $o]: ((^[Y9 : $i]: (?? @ $i @ (^[Y10 : $i]: ((in @ Y10 @ Y9) & ((setadjoin @ Y10 @ emptyset) = Y9))))) @ (dsetconstr @ Y7 @ (^[Y9 : $i]: (Y8 @ Y9))))))) @ Y4 @ (^[Y7 : $i]: (in @ (kpair @ Y6 @ Y7) @ Y5)))))) & ((^[Y6 : $i]: ((^[Y7 : $i]: ((^[Y8 : $i]: (subset @ Y8 @ (cartprod @ Y6 @ Y7))))))) @ Y3 @ Y4 @ Y5))))))) @ Y0 @ Y1 @ Y2)))))))),
% 0.11/0.35 inference(definition_unfolding,[],[f37,f43])).
% 0.11/0.35 thf(f43,plain,(
% 0.11/0.35 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((^[Y4 : $i]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (?? @ $i @ (^[Y7 : $i]: ((in @ Y7 @ Y6) & ((setadjoin @ Y7 @ emptyset) = Y6))))) @ (dsetconstr @ Y4 @ (^[Y6 : $i]: (Y5 @ Y6))))))) @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))) & ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (subset @ Y5 @ (cartprod @ Y3 @ Y4))))))) @ Y0 @ Y1 @ Y2))))))))),
% 0.11/0.35 inference(definition_unfolding,[],[f32,f42,f31])).
% 0.11/0.35 thf(f31,plain,(
% 0.11/0.35 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f11])).
% 0.11/0.35 thf(f11,plain,(
% 0.11/0.35 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.11/0.35 inference(fool_elimination,[],[f10])).
% 0.11/0.35 thf(f10,plain,(
% 0.11/0.35 ((^[X0 : $i, X1 : $i, X2 : $i] : (subset @ X2 @ (cartprod @ X0 @ X1))) = breln)),
% 0.11/0.35 inference(rectify,[],[f4])).
% 0.11/0.35 thf(f4,axiom,(
% 0.11/0.35 ((^[X0 : $i, X4 : $i, X5 : $i] : (subset @ X5 @ (cartprod @ X0 @ X4))) = breln)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln)).
% 0.11/0.35 thf(f42,plain,(
% 0.11/0.35 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.11/0.35 inference(definition_unfolding,[],[f41,f36])).
% 0.11/0.35 thf(f36,plain,(
% 0.11/0.35 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f17])).
% 0.11/0.35 thf(f17,plain,(
% 0.11/0.35 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.11/0.35 inference(fool_elimination,[],[f16])).
% 0.11/0.35 thf(f16,plain,(
% 0.11/0.35 (singleton = (^[X0 : $i] : (? [X1] : (((setadjoin @ X1 @ emptyset) = X0) & (in @ X1 @ X0)))))),
% 0.11/0.35 inference(rectify,[],[f2])).
% 0.11/0.35 thf(f2,axiom,(
% 0.11/0.35 (singleton = (^[X0 : $i] : (? [X2] : (((setadjoin @ X2 @ emptyset) = X0) & (in @ X2 @ X0)))))),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton)).
% 0.11/0.35 thf(f41,plain,(
% 0.11/0.35 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f18])).
% 0.11/0.35 thf(f18,plain,(
% 0.11/0.35 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 0.11/0.35 inference(fool_elimination,[],[f3])).
% 0.11/0.35 thf(f3,axiom,(
% 0.11/0.35 ((^[X0 : $i, X1 : $i > $o] : (singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : (X1 @ X2))))) = ex1)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1)).
% 0.11/0.35 thf(f32,plain,(
% 0.11/0.35 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (ex1 @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))) & (breln @ Y0 @ Y1 @ Y2))))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f15])).
% 0.11/0.35 thf(f15,plain,(
% 0.11/0.35 (func = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (ex1 @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))) & (breln @ Y0 @ Y1 @ Y2))))))))),
% 0.11/0.35 inference(fool_elimination,[],[f14])).
% 0.11/0.35 thf(f14,plain,(
% 0.11/0.35 ((^[X0 : $i, X1 : $i, X2 : $i] : ((breln @ X0 @ X1 @ X2) & ! [X3] : ((in @ X3 @ X0) => (ex1 @ X1 @ (^[X4 : $i] : (in @ (kpair @ X3 @ X4) @ X2)))))) = func)),
% 0.11/0.35 inference(rectify,[],[f5])).
% 0.11/0.35 thf(f5,axiom,(
% 0.11/0.35 ((^[X0 : $i, X4 : $i, X6 : $i] : ((breln @ X0 @ X4 @ X6) & ! [X2] : ((in @ X2 @ X0) => (ex1 @ X4 @ (^[X3 : $i] : (in @ (kpair @ X2 @ X3) @ X6)))))) = func)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',func)).
% 0.11/0.35 thf(f37,plain,(
% 0.11/0.35 (funcSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y1)) @ (^[Y2 : $i]: (func @ Y0 @ Y1 @ Y2)))))))),
% 0.11/0.35 inference(cnf_transformation,[],[f13])).
% 0.11/0.35 thf(f13,plain,(
% 0.11/0.35 (funcSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (powerset @ (cartprod @ Y0 @ Y1)) @ (^[Y2 : $i]: (func @ Y0 @ Y1 @ Y2)))))))),
% 0.11/0.35 inference(fool_elimination,[],[f12])).
% 0.11/0.35 thf(f12,plain,(
% 0.11/0.35 (funcSet = (^[X0 : $i, X1 : $i] : (dsetconstr @ (powerset @ (cartprod @ X0 @ X1)) @ (^[X2 : $i] : (func @ X0 @ X1 @ X2)))))),
% 0.11/0.35 inference(rectify,[],[f6])).
% 0.11/0.35 thf(f6,axiom,(
% 0.11/0.35 (funcSet = (^[X0 : $i, X4 : $i] : (dsetconstr @ (powerset @ (cartprod @ X0 @ X4)) @ (^[X7 : $i] : (func @ X0 @ X4 @ X7)))))),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcSet)).
% 0.11/0.35 thf(f39,plain,(
% 0.11/0.35 ((in @ sK5 @ (funcSet @ sK3 @ sK4)) = $true)),
% 0.11/0.35 inference(cnf_transformation,[],[f30])).
% 0.11/0.35 thf(f30,plain,(
% 0.11/0.35 (((func @ sK3 @ sK4 @ sK5) != $true) & ((in @ sK5 @ (funcSet @ sK3 @ sK4)) = $true)) & (dsetconstrER = $true)),
% 0.11/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f23,f29])).
% 0.11/0.35 thf(f29,plain,(
% 0.11/0.35 ? [X0,X1,X2] : (($true != (func @ X0 @ X1 @ X2)) & ((in @ X2 @ (funcSet @ X0 @ X1)) = $true)) => (((func @ sK3 @ sK4 @ sK5) != $true) & ((in @ sK5 @ (funcSet @ sK3 @ sK4)) = $true))),
% 0.11/0.35 introduced(choice_axiom,[])).
% 0.11/0.35 thf(f23,plain,(
% 0.11/0.35 ? [X0,X1,X2] : (($true != (func @ X0 @ X1 @ X2)) & ((in @ X2 @ (funcSet @ X0 @ X1)) = $true)) & (dsetconstrER = $true)),
% 0.11/0.35 inference(ennf_transformation,[],[f22])).
% 0.11/0.35 thf(f22,plain,(
% 0.11/0.35 ~((dsetconstrER = $true) => ! [X0,X1,X2] : (((in @ X2 @ (funcSet @ X0 @ X1)) = $true) => ($true = (func @ X0 @ X1 @ X2))))),
% 0.11/0.35 inference(fool_elimination,[],[f21])).
% 0.11/0.35 thf(f21,plain,(
% 0.11/0.35 ~(dsetconstrER => ! [X0,X1,X2] : ((in @ X2 @ (funcSet @ X0 @ X1)) => (func @ X0 @ X1 @ X2)))),
% 0.11/0.35 inference(rectify,[],[f8])).
% 0.11/0.35 thf(f8,negated_conjecture,(
% 0.11/0.35 ~(dsetconstrER => ! [X0,X4,X7] : ((in @ X7 @ (funcSet @ X0 @ X4)) => (func @ X0 @ X4 @ X7)))),
% 0.11/0.35 inference(negated_conjecture,[],[f7])).
% 0.11/0.35 thf(f7,conjecture,(
% 0.11/0.35 dsetconstrER => ! [X0,X4,X7] : ((in @ X7 @ (funcSet @ X0 @ X4)) => (func @ X0 @ X4 @ X7))),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',infuncsetfunc)).
% 0.11/0.35 thf(f61,plain,(
% 0.11/0.35 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (($true != (in @ X3 @ (dsetconstr @ X4 @ X5))) | ((X5 @ X3) = $true)) )),
% 0.11/0.35 inference(beta_eta_normalization,[],[f60])).
% 0.11/0.35 thf(f60,plain,(
% 0.11/0.35 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (((in @ X3 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X5 @ Y0)))) != $true) | ((X5 @ X3) = $true)) )),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f47])).
% 0.11/0.35 thf(f47,plain,(
% 0.11/0.35 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (((X5 @ X3) = $true) | ($true != $true) | ((in @ X3 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X5 @ Y0)))) != $true)) )),
% 0.11/0.35 inference(definition_unfolding,[],[f33,f38])).
% 0.11/0.35 thf(f38,plain,(
% 0.11/0.35 (dsetconstrER = $true)),
% 0.11/0.35 inference(cnf_transformation,[],[f30])).
% 0.11/0.35 thf(f33,plain,(
% 0.11/0.35 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (((X5 @ X3) = $true) | ((in @ X3 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X5 @ Y0)))) != $true) | (dsetconstrER != $true)) )),
% 0.11/0.35 inference(cnf_transformation,[],[f28])).
% 0.11/0.35 thf(f28,plain,(
% 0.11/0.35 ((dsetconstrER = $true) | (($true != (sK2 @ sK0)) & ((in @ sK0 @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK2 @ Y0)))) = $true))) & (! [X3,X4,X5 : $i > $o] : (((X5 @ X3) = $true) | ((in @ X3 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X5 @ Y0)))) != $true)) | (dsetconstrER != $true))),
% 0.11/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f26,f27])).
% 0.11/0.35 thf(f27,plain,(
% 0.11/0.35 ? [X0,X1,X2 : $i > $o] : (((X2 @ X0) != $true) & ($true = (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0)))))) => (($true != (sK2 @ sK0)) & ((in @ sK0 @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK2 @ Y0)))) = $true))),
% 0.11/0.35 introduced(choice_axiom,[])).
% 0.11/0.35 thf(f26,plain,(
% 0.11/0.35 ((dsetconstrER = $true) | ? [X0,X1,X2 : $i > $o] : (((X2 @ X0) != $true) & ($true = (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0))))))) & (! [X3,X4,X5 : $i > $o] : (((X5 @ X3) = $true) | ((in @ X3 @ (dsetconstr @ X4 @ (^[Y0 : $i]: (X5 @ Y0)))) != $true)) | (dsetconstrER != $true))),
% 0.11/0.35 inference(rectify,[],[f25])).
% 0.11/0.35 thf(f25,plain,(
% 0.11/0.35 ((dsetconstrER = $true) | ? [X0,X1,X2 : $i > $o] : (((X2 @ X0) != $true) & ($true = (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0))))))) & (! [X0,X1,X2 : $i > $o] : (((X2 @ X0) = $true) | ($true != (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0)))))) | (dsetconstrER != $true))),
% 0.11/0.35 inference(nnf_transformation,[],[f24])).
% 0.11/0.35 thf(f24,plain,(
% 0.11/0.35 (dsetconstrER = $true) <=> ! [X0,X1,X2 : $i > $o] : (((X2 @ X0) = $true) | ($true != (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0))))))),
% 0.11/0.35 inference(ennf_transformation,[],[f20])).
% 0.11/0.35 thf(f20,plain,(
% 0.11/0.35 (dsetconstrER = $true) <=> ! [X0,X1,X2 : $i > $o] : (($true = (in @ X0 @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X2 @ Y0))))) => ((X2 @ X0) = $true))),
% 0.11/0.35 inference(fool_elimination,[],[f19])).
% 0.11/0.35 thf(f19,plain,(
% 0.11/0.35 (! [X0,X1,X2 : $i > $o] : ((in @ X0 @ (dsetconstr @ X1 @ (^[X3 : $i] : (X2 @ X3)))) => (X2 @ X0)) = dsetconstrER)),
% 0.11/0.35 inference(rectify,[],[f1])).
% 0.11/0.35 thf(f1,axiom,(
% 0.11/0.35 (! [X2,X0,X1 : $i > $o] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)) = dsetconstrER)),
% 0.11/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.11/0.35 thf(f106,plain,(
% 0.11/0.35 ~spl6_2 | ~spl6_3),
% 0.11/0.35 inference(avatar_contradiction_clause,[],[f105])).
% 0.11/0.35 thf(f105,plain,(
% 0.11/0.35 $false | (~spl6_2 | ~spl6_3)),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f104])).
% 0.11/0.35 thf(f104,plain,(
% 0.11/0.35 ($true = $false) | (~spl6_2 | ~spl6_3)),
% 0.11/0.35 inference(backward_demodulation,[],[f100,f103])).
% 0.11/0.35 thf(f103,plain,(
% 0.11/0.35 ((in @ (sK9 @ sK7) @ (setadjoin @ (sK9 @ sK7) @ emptyset)) = $false) | (~spl6_2 | ~spl6_3)),
% 0.11/0.35 inference(equality_resolution,[],[f102])).
% 0.11/0.35 thf(f102,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((setadjoin @ (sK9 @ sK7) @ emptyset) != (setadjoin @ X1 @ emptyset)) | ((in @ X1 @ (setadjoin @ (sK9 @ sK7) @ emptyset)) = $false)) ) | (~spl6_2 | ~spl6_3)),
% 0.11/0.35 inference(forward_demodulation,[],[f101,f99])).
% 0.11/0.35 thf(f99,plain,(
% 0.11/0.35 ((dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))) = (setadjoin @ (sK9 @ sK7) @ emptyset)) | ~spl6_3),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f97])).
% 0.11/0.35 thf(f97,plain,(
% 0.11/0.35 ((dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))) = (setadjoin @ (sK9 @ sK7) @ emptyset)) | ($true = $false) | ~spl6_3),
% 0.11/0.35 inference(superposition,[],[f74,f88])).
% 0.11/0.35 thf(f88,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ sK3) = $false) | ((setadjoin @ (sK9 @ X1) @ emptyset) = (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ X1 @ Y0) @ sK5))))) )),
% 0.11/0.35 inference(equality_proxy_clausification,[],[f86])).
% 0.11/0.35 thf(f86,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ sK3) = $false) | (((setadjoin @ (sK9 @ X1) @ emptyset) = (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ X1 @ Y0) @ sK5)))) = $true)) )),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f85])).
% 0.11/0.35 thf(f85,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ sK3) = $false) | (((in @ (sK9 @ X1) @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ X1 @ Y0) @ sK5)))) & ((setadjoin @ (sK9 @ X1) @ emptyset) = (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ X1 @ Y0) @ sK5))))) = $true)) )),
% 0.11/0.35 inference(beta_eta_normalization,[],[f84])).
% 0.11/0.35 thf(f84,plain,(
% 0.11/0.35 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5)))))) @ (sK9 @ X1)) = $true) | ((in @ X1 @ sK3) = $false)) )),
% 0.11/0.35 inference(sigma_clausification,[],[f83])).
% 0.11/0.35 thf(f83,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5))))))) = $true) | ((in @ X1 @ sK3) = $false)) )),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f82])).
% 0.11/0.35 thf(f82,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (($true = ((in @ X1 @ sK3) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ X1 @ Y1) @ sK5)))))))))) )),
% 0.11/0.35 inference(beta_eta_normalization,[],[f81])).
% 0.11/0.35 thf(f81,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5))))))))) @ X1))) )),
% 0.11/0.35 inference(pi_clausification,[],[f80])).
% 0.11/0.35 thf(f80,plain,(
% 0.11/0.35 ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))))))))) = $true)),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f78])).
% 0.11/0.35 thf(f74,plain,(
% 0.11/0.35 ($true = (in @ sK7 @ sK3)) | ~spl6_3),
% 0.11/0.35 inference(avatar_component_clause,[],[f72])).
% 0.11/0.35 thf(f72,plain,(
% 0.11/0.35 spl6_3 <=> ($true = (in @ sK7 @ sK3))),
% 0.11/0.35 introduced(avatar_definition,[new_symbols(naming,[spl6_3])])).
% 0.11/0.35 thf(f101,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false) | ((setadjoin @ (sK9 @ sK7) @ emptyset) != (setadjoin @ X1 @ emptyset))) ) | (~spl6_2 | ~spl6_3)),
% 0.11/0.35 inference(backward_demodulation,[],[f69,f99])).
% 0.11/0.35 thf(f69,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))) != (setadjoin @ X1 @ emptyset)) | ((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false)) ) | ~spl6_2),
% 0.11/0.35 inference(avatar_component_clause,[],[f68])).
% 0.11/0.35 thf(f68,plain,(
% 0.11/0.35 spl6_2 <=> ! [X1] : (((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false) | ((dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))) != (setadjoin @ X1 @ emptyset)))),
% 0.11/0.35 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.11/0.35 thf(f100,plain,(
% 0.11/0.35 ((in @ (sK9 @ sK7) @ (setadjoin @ (sK9 @ sK7) @ emptyset)) = $true) | ~spl6_3),
% 0.11/0.35 inference(backward_demodulation,[],[f92,f99])).
% 0.11/0.35 thf(f92,plain,(
% 0.11/0.35 ($true = (in @ (sK9 @ sK7) @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))))) | ~spl6_3),
% 0.11/0.35 inference(trivial_inequality_removal,[],[f90])).
% 0.11/0.35 thf(f90,plain,(
% 0.11/0.35 ($true = (in @ (sK9 @ sK7) @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))))) | ($true = $false) | ~spl6_3),
% 0.11/0.35 inference(superposition,[],[f74,f87])).
% 0.11/0.35 thf(f87,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ sK3) = $false) | ((in @ (sK9 @ X1) @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ X1 @ Y0) @ sK5)))) = $true)) )),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f85])).
% 0.11/0.35 thf(f75,plain,(
% 0.11/0.35 spl6_1 | spl6_3),
% 0.11/0.35 inference(avatar_split_clause,[],[f55,f72,f64])).
% 0.11/0.35 thf(f55,plain,(
% 0.11/0.35 ($true = (in @ sK7 @ sK3)) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f53])).
% 0.11/0.35 thf(f53,plain,(
% 0.11/0.35 ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false) | (((in @ sK7 @ sK3) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5)))))))) = $false)),
% 0.11/0.35 inference(beta_eta_normalization,[],[f52])).
% 0.11/0.35 thf(f52,plain,(
% 0.11/0.35 (((^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5))))))))) @ sK7) = $false) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)),
% 0.11/0.35 inference(sigma_clausification,[],[f51])).
% 0.11/0.35 thf(f51,plain,(
% 0.11/0.35 ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))))))))) = $false) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f50])).
% 0.11/0.35 thf(f50,plain,(
% 0.11/0.35 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK3) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y2 : $i]: (in @ (kpair @ Y0 @ Y2) @ sK5)))))))))) & (subset @ sK5 @ (cartprod @ sK3 @ sK4))) != $true)),
% 0.11/0.35 inference(beta_eta_normalization,[],[f48])).
% 0.11/0.35 thf(f48,plain,(
% 0.11/0.35 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((^[Y4 : $i]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: (?? @ $i @ (^[Y7 : $i]: ((in @ Y7 @ Y6) & ((setadjoin @ Y7 @ emptyset) = Y6))))) @ (dsetconstr @ Y4 @ (^[Y6 : $i]: (Y5 @ Y6))))))) @ Y1 @ (^[Y4 : $i]: (in @ (kpair @ Y3 @ Y4) @ Y2)))))) & ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: (subset @ Y5 @ (cartprod @ Y3 @ Y4))))))) @ Y0 @ Y1 @ Y2))))))) @ sK3 @ sK4 @ sK5))),
% 0.11/0.35 inference(definition_unfolding,[],[f40,f43])).
% 0.11/0.35 thf(f40,plain,(
% 0.11/0.35 ((func @ sK3 @ sK4 @ sK5) != $true)),
% 0.11/0.35 inference(cnf_transformation,[],[f30])).
% 0.11/0.35 thf(f70,plain,(
% 0.11/0.35 spl6_1 | spl6_2),
% 0.11/0.35 inference(avatar_split_clause,[],[f59,f68,f64])).
% 0.11/0.35 thf(f59,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false) | ((dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))) != (setadjoin @ X1 @ emptyset)) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)) )),
% 0.11/0.35 inference(equality_proxy_clausification,[],[f58])).
% 0.11/0.35 thf(f58,plain,(
% 0.11/0.35 ( ! [X1 : $i] : ((((setadjoin @ X1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false) | ((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) = $false)) )),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f57])).
% 0.11/0.35 thf(f57,plain,(
% 0.11/0.35 ( ! [X1 : $i] : (((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false) | (((in @ X1 @ (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5)))) & ((setadjoin @ X1 @ emptyset) = (dsetconstr @ sK4 @ (^[Y0 : $i]: (in @ (kpair @ sK7 @ Y0) @ sK5))))) = $false)) )),
% 0.11/0.35 inference(beta_eta_normalization,[],[f56])).
% 0.11/0.35 thf(f56,plain,(
% 0.11/0.35 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5)))))) @ X1) = $false) | ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false)) )),
% 0.11/0.35 inference(pi_clausification,[],[f54])).
% 0.11/0.35 thf(f54,plain,(
% 0.11/0.35 ((subset @ sK5 @ (cartprod @ sK3 @ sK4)) = $false) | ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5)))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK4 @ (^[Y1 : $i]: (in @ (kpair @ sK7 @ Y1) @ sK5))))))) = $false)),
% 0.11/0.35 inference(binary_proxy_clausification,[],[f53])).
% 0.11/0.35 % SZS output end Proof for theBenchmark
% 0.11/0.35 % (13923)------------------------------
% 0.11/0.35 % (13923)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (13923)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (13923)Memory used [KB]: 5628
% 0.11/0.35 % (13923)Time elapsed: 0.011 s
% 0.11/0.35 % (13923)Instructions burned: 13 (million)
% 0.11/0.35 % (13923)------------------------------
% 0.11/0.35 % (13923)------------------------------
% 0.11/0.35 % (13916)Success in time 0.021 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------