TSTP Solution File: SET096^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET096^1 : TPTP v8.2.0. Released v3.6.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 : n014.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:08:47 EDT 2024
% Result : Theorem 0.21s 0.37s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET096^1 : TPTP v8.2.0. Released v3.6.0.
% 0.13/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.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 13:03:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.36 % (19812)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 (3000ds/2Mi)
% 0.21/0.36 % (19812)Instruction limit reached!
% 0.21/0.36 % (19812)------------------------------
% 0.21/0.36 % (19812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.36 % (19812)Termination reason: Unknown
% 0.21/0.36 % (19812)Termination phase: shuffling
% 0.21/0.36
% 0.21/0.36 % (19812)Memory used [KB]: 1023
% 0.21/0.36 % (19812)Time elapsed: 0.002 s
% 0.21/0.36 % (19812)Instructions burned: 2 (million)
% 0.21/0.36 % (19812)------------------------------
% 0.21/0.36 % (19812)------------------------------
% 0.21/0.37 % (19815)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.21/0.37 % (19814)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.37 % (19808)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.21/0.37 % (19815)Instruction limit reached!
% 0.21/0.37 % (19815)------------------------------
% 0.21/0.37 % (19815)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (19815)Termination reason: Unknown
% 0.21/0.37 % (19815)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (19815)Memory used [KB]: 5500
% 0.21/0.37 % (19815)Time elapsed: 0.003 s
% 0.21/0.37 % (19815)Instructions burned: 4 (million)
% 0.21/0.37 % (19815)------------------------------
% 0.21/0.37 % (19815)------------------------------
% 0.21/0.37 % (19809)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 (3000ds/4Mi)
% 0.21/0.37 % (19814)First to succeed.
% 0.21/0.37 % (19811)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.37 % (19811)Instruction limit reached!
% 0.21/0.37 % (19811)------------------------------
% 0.21/0.37 % (19811)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (19811)Termination reason: Unknown
% 0.21/0.37 % (19811)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (19811)Memory used [KB]: 1023
% 0.21/0.37 % (19811)Time elapsed: 0.002 s
% 0.21/0.37 % (19811)Instructions burned: 3 (million)
% 0.21/0.37 % (19811)------------------------------
% 0.21/0.37 % (19811)------------------------------
% 0.21/0.37 % (19809)Instruction limit reached!
% 0.21/0.37 % (19809)------------------------------
% 0.21/0.37 % (19809)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (19809)Termination reason: Unknown
% 0.21/0.37 % (19809)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (19809)Memory used [KB]: 5500
% 0.21/0.37 % (19809)Time elapsed: 0.004 s
% 0.21/0.37 % (19809)Instructions burned: 4 (million)
% 0.21/0.37 % (19809)------------------------------
% 0.21/0.37 % (19809)------------------------------
% 0.21/0.37 % (19814)Refutation found. Thanks to Tanya!
% 0.21/0.37 % SZS status Theorem for theBenchmark
% 0.21/0.37 % SZS output start Proof for theBenchmark
% 0.21/0.37 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_3, type, emptyset: $i > $o).
% 0.21/0.37 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.21/0.37 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.21/0.37 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.37 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.37 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.37 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.37 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.21/0.37 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.21/0.37 thf(func_def_29, type, sK1: $i > $o).
% 0.21/0.37 thf(func_def_31, type, ph3: !>[X0: $tType]:(X0)).
% 0.21/0.37 thf(f104,plain,(
% 0.21/0.37 $false),
% 0.21/0.37 inference(avatar_sat_refutation,[],[f95,f99,f102])).
% 0.21/0.37 thf(f102,plain,(
% 0.21/0.37 ~spl2_1),
% 0.21/0.37 inference(avatar_contradiction_clause,[],[f101])).
% 0.21/0.37 thf(f101,plain,(
% 0.21/0.37 $false | ~spl2_1),
% 0.21/0.37 inference(subsumption_resolution,[],[f100,f80])).
% 0.21/0.37 thf(f80,plain,(
% 0.21/0.37 ((sK1 @ sK0) != $false)),
% 0.21/0.37 inference(backward_demodulation,[],[f77,f79])).
% 0.21/0.37 thf(f79,plain,(
% 0.21/0.37 (sK4 = sK0)),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f78])).
% 0.21/0.37 thf(f78,plain,(
% 0.21/0.37 (sK4 = sK0) | ($false != $false)),
% 0.21/0.37 inference(superposition,[],[f77,f75])).
% 0.21/0.37 thf(f75,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($false = (sK1 @ X1)) | (sK0 = X1)) )),
% 0.21/0.37 inference(equality_proxy_clausification,[],[f74])).
% 0.21/0.37 thf(f74,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($true = (sK0 = X1)) | ($false = (sK1 @ X1))) )),
% 0.21/0.37 inference(binary_proxy_clausification,[],[f73])).
% 0.21/0.37 thf(f73,plain,(
% 0.21/0.37 ( ! [X1 : $i] : ((((sK1 @ X1) => (sK0 = X1)) = $true)) )),
% 0.21/0.37 inference(beta_eta_normalization,[],[f72])).
% 0.21/0.37 thf(f72,plain,(
% 0.21/0.37 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK1 @ Y0) => (sK0 = Y0))) @ X1) = $true)) )),
% 0.21/0.37 inference(pi_clausification,[],[f71])).
% 0.21/0.37 thf(f71,plain,(
% 0.21/0.37 ((!! @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) => (sK0 = Y0)))) = $true)),
% 0.21/0.37 inference(beta_eta_normalization,[],[f67])).
% 0.21/0.37 thf(f67,plain,(
% 0.21/0.37 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))) @ sK1 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ sK0)))),
% 0.21/0.37 inference(definition_unfolding,[],[f65,f52,f56])).
% 0.21/0.37 thf(f56,plain,(
% 0.21/0.37 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.21/0.37 inference(cnf_transformation,[],[f32])).
% 0.21/0.37 thf(f32,plain,(
% 0.21/0.37 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.21/0.37 inference(fool_elimination,[],[f31])).
% 0.21/0.37 thf(f31,plain,(
% 0.21/0.37 ((^[X0 : $i, X1 : $i] : ((X0 = X1))) = singleton)),
% 0.21/0.37 inference(rectify,[],[f5])).
% 0.21/0.37 thf(f5,axiom,(
% 0.21/0.37 ((^[X0 : $i, X3 : $i] : ((X0 = X3))) = singleton)),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton)).
% 0.21/0.37 thf(f52,plain,(
% 0.21/0.37 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.21/0.37 inference(cnf_transformation,[],[f24])).
% 0.21/0.37 thf(f24,plain,(
% 0.21/0.37 (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
% 0.21/0.37 inference(fool_elimination,[],[f23])).
% 0.21/0.37 thf(f23,plain,(
% 0.21/0.37 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((X0 @ X2) => (X1 @ X2)))) = subset)),
% 0.21/0.37 inference(rectify,[],[f12])).
% 0.21/0.37 thf(f12,axiom,(
% 0.21/0.37 ((^[X0 : $i > $o, X2 : $i > $o] : (! [X3] : ((X0 @ X3) => (X2 @ X3)))) = subset)),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset)).
% 0.21/0.37 thf(f65,plain,(
% 0.21/0.37 ((subset @ sK1 @ (singleton @ sK0)) = $true)),
% 0.21/0.37 inference(cnf_transformation,[],[f48])).
% 0.21/0.37 thf(f48,plain,(
% 0.21/0.37 ((subset @ sK1 @ (singleton @ sK0)) = $true) & (sK1 != (singleton @ sK0)) & (emptyset != sK1)),
% 0.21/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f46,f47])).
% 0.21/0.37 thf(f47,plain,(
% 0.21/0.37 ? [X0,X1 : $i > $o] : (((subset @ X1 @ (singleton @ X0)) = $true) & ((singleton @ X0) != X1) & (emptyset != X1)) => (((subset @ sK1 @ (singleton @ sK0)) = $true) & (sK1 != (singleton @ sK0)) & (emptyset != sK1))),
% 0.21/0.37 introduced(choice_axiom,[])).
% 0.21/0.37 thf(f46,plain,(
% 0.21/0.37 ? [X0,X1 : $i > $o] : (((subset @ X1 @ (singleton @ X0)) = $true) & ((singleton @ X0) != X1) & (emptyset != X1))),
% 0.21/0.37 inference(flattening,[],[f45])).
% 0.21/0.37 thf(f45,plain,(
% 0.21/0.37 ? [X0,X1 : $i > $o] : (((emptyset != X1) & ((singleton @ X0) != X1)) & ((subset @ X1 @ (singleton @ X0)) = $true))),
% 0.21/0.37 inference(ennf_transformation,[],[f39])).
% 0.21/0.37 thf(f39,plain,(
% 0.21/0.37 ~! [X0,X1 : $i > $o] : (((subset @ X1 @ (singleton @ X0)) = $true) => ((emptyset = X1) | ((singleton @ X0) = X1)))),
% 0.21/0.37 inference(fool_elimination,[],[f38])).
% 0.21/0.37 thf(f38,plain,(
% 0.21/0.37 ~! [X0,X1 : $i > $o] : ((subset @ X1 @ (singleton @ X0)) => ((emptyset = X1) | ((singleton @ X0) = X1)))),
% 0.21/0.37 inference(rectify,[],[f16])).
% 0.21/0.37 thf(f16,negated_conjecture,(
% 0.21/0.37 ~! [X2,X0 : $i > $o] : ((subset @ X0 @ (singleton @ X2)) => ((emptyset = X0) | ((singleton @ X2) = X0)))),
% 0.21/0.37 inference(negated_conjecture,[],[f15])).
% 0.21/0.37 thf(f15,conjecture,(
% 0.21/0.37 ! [X2,X0 : $i > $o] : ((subset @ X0 @ (singleton @ X2)) => ((emptyset = X0) | ((singleton @ X2) = X0)))),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.21/0.37 thf(f77,plain,(
% 0.21/0.37 ((sK1 @ sK4) != $false)),
% 0.21/0.37 inference(beta_eta_normalization,[],[f76])).
% 0.21/0.37 thf(f76,plain,(
% 0.21/0.37 ((sK1 @ sK4) != ((^[Y0 : $i]: ($false)) @ sK4))),
% 0.21/0.37 inference(negative_extensionality,[],[f69])).
% 0.21/0.37 thf(f69,plain,(
% 0.21/0.37 (sK1 != (^[Y0 : $i]: ($false)))),
% 0.21/0.37 inference(definition_unfolding,[],[f63,f62])).
% 0.21/0.37 thf(f62,plain,(
% 0.21/0.37 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.21/0.37 inference(cnf_transformation,[],[f37])).
% 0.21/0.37 thf(f37,plain,(
% 0.21/0.37 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.21/0.37 inference(fool_elimination,[],[f3])).
% 0.21/0.37 thf(f3,axiom,(
% 0.21/0.37 (emptyset = (^[X0 : $i] : ($false)))),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyset)).
% 0.21/0.37 thf(f63,plain,(
% 0.21/0.37 (emptyset != sK1)),
% 0.21/0.37 inference(cnf_transformation,[],[f48])).
% 0.21/0.37 thf(f100,plain,(
% 0.21/0.37 ((sK1 @ sK0) = $false) | ~spl2_1),
% 0.21/0.37 inference(backward_demodulation,[],[f96,f90])).
% 0.21/0.37 thf(f90,plain,(
% 0.21/0.37 (sK0 = sK5) | ~spl2_1),
% 0.21/0.37 inference(avatar_component_clause,[],[f88])).
% 0.21/0.37 thf(f88,plain,(
% 0.21/0.37 spl2_1 <=> (sK0 = sK5)),
% 0.21/0.37 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.21/0.37 thf(f96,plain,(
% 0.21/0.37 ($false = (sK1 @ sK5))),
% 0.21/0.37 inference(subsumption_resolution,[],[f85,f75])).
% 0.21/0.37 thf(f85,plain,(
% 0.21/0.37 ($false = (sK1 @ sK5)) | (sK0 != sK5)),
% 0.21/0.37 inference(equality_proxy_clausification,[],[f84])).
% 0.21/0.37 thf(f84,plain,(
% 0.21/0.37 ($false = (sK1 @ sK5)) | ((sK0 = sK5) = $false)),
% 0.21/0.37 inference(binary_proxy_clausification,[],[f82])).
% 0.21/0.37 thf(f82,plain,(
% 0.21/0.37 ((sK0 = sK5) != (sK1 @ sK5))),
% 0.21/0.37 inference(negative_extensionality,[],[f70])).
% 0.21/0.37 thf(f70,plain,(
% 0.21/0.37 ((= @ sK0) != sK1)),
% 0.21/0.37 inference(beta_eta_normalization,[],[f68])).
% 0.21/0.37 thf(f68,plain,(
% 0.21/0.37 (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ sK0) != sK1)),
% 0.21/0.37 inference(definition_unfolding,[],[f64,f56])).
% 0.21/0.37 thf(f64,plain,(
% 0.21/0.37 (sK1 != (singleton @ sK0))),
% 0.21/0.37 inference(cnf_transformation,[],[f48])).
% 0.21/0.37 thf(f99,plain,(
% 0.21/0.37 ~spl2_2),
% 0.21/0.37 inference(avatar_contradiction_clause,[],[f98])).
% 0.21/0.37 thf(f98,plain,(
% 0.21/0.37 $false | ~spl2_2),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f97])).
% 0.21/0.37 thf(f97,plain,(
% 0.21/0.37 ($false = $true) | ~spl2_2),
% 0.21/0.37 inference(forward_demodulation,[],[f94,f96])).
% 0.21/0.37 thf(f94,plain,(
% 0.21/0.37 ($true = (sK1 @ sK5)) | ~spl2_2),
% 0.21/0.37 inference(avatar_component_clause,[],[f92])).
% 0.21/0.37 thf(f92,plain,(
% 0.21/0.37 spl2_2 <=> ($true = (sK1 @ sK5))),
% 0.21/0.37 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.21/0.37 thf(f95,plain,(
% 0.21/0.37 spl2_1 | spl2_2),
% 0.21/0.37 inference(avatar_split_clause,[],[f86,f92,f88])).
% 0.21/0.37 thf(f86,plain,(
% 0.21/0.37 ($true = (sK1 @ sK5)) | (sK0 = sK5)),
% 0.21/0.37 inference(equality_proxy_clausification,[],[f83])).
% 0.21/0.37 thf(f83,plain,(
% 0.21/0.37 ($true = (sK1 @ sK5)) | ((sK0 = sK5) = $true)),
% 0.21/0.37 inference(binary_proxy_clausification,[],[f82])).
% 0.21/0.37 % SZS output end Proof for theBenchmark
% 0.21/0.37 % (19814)------------------------------
% 0.21/0.37 % (19814)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (19814)Termination reason: Refutation
% 0.21/0.37
% 0.21/0.37 % (19814)Memory used [KB]: 5500
% 0.21/0.37 % (19814)Time elapsed: 0.005 s
% 0.21/0.37 % (19814)Instructions burned: 4 (million)
% 0.21/0.37 % (19814)------------------------------
% 0.21/0.37 % (19814)------------------------------
% 0.21/0.37 % (19807)Success in time 0.015 s
% 0.21/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------