TSTP Solution File: SET630^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET630^3 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.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:12:33 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET630^3 : TPTP v8.2.0. Released v3.6.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 11:06:53 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 This is a TH0_THM_EQU_NAR problem
% 0.21/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 % (15845)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.39 % (15845)Instruction limit reached!
% 0.21/0.39 % (15845)------------------------------
% 0.21/0.39 % (15845)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (15845)Termination reason: Unknown
% 0.21/0.39 % (15845)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (15845)Memory used [KB]: 5500
% 0.21/0.39 % (15845)Time elapsed: 0.005 s
% 0.21/0.39 % (15845)Instructions burned: 4 (million)
% 0.21/0.39 % (15845)------------------------------
% 0.21/0.39 % (15845)------------------------------
% 0.21/0.40 % (15847)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.40 % (15847)Instruction limit reached!
% 0.21/0.40 % (15847)------------------------------
% 0.21/0.40 % (15847)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (15847)Termination reason: Unknown
% 0.21/0.40 % (15847)Termination phase: Property scanning
% 0.21/0.40
% 0.21/0.40 % (15847)Memory used [KB]: 1023
% 0.21/0.40 % (15847)Time elapsed: 0.003 s
% 0.21/0.40 % (15847)Instructions burned: 2 (million)
% 0.21/0.40 % (15847)------------------------------
% 0.21/0.40 % (15847)------------------------------
% 0.21/0.40 % (15846)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.21/0.40 % (15851)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.40 % (15849)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.21/0.40 % (15851)Instruction limit reached!
% 0.21/0.40 % (15851)------------------------------
% 0.21/0.40 % (15851)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (15851)Termination reason: Unknown
% 0.21/0.40 % (15851)Termination phase: Preprocessing 3
% 0.21/0.40
% 0.21/0.40 % (15851)Memory used [KB]: 1023
% 0.21/0.40 % (15851)Time elapsed: 0.003 s
% 0.21/0.40 % (15850)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.40 % (15851)Instructions burned: 3 (million)
% 0.21/0.40 % (15851)------------------------------
% 0.21/0.40 % (15851)------------------------------
% 0.21/0.40 % (15844)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.40 % (15849)First to succeed.
% 0.21/0.40 % (15846)Also succeeded, but the first one will report.
% 0.21/0.40 % (15848)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.40 % (15849)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% 0.21/0.40 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_3, type, emptyset: $i > $o).
% 0.21/0.40 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.21/0.40 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.21/0.40 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.21/0.40 thf(func_def_28, type, sK0: $i > $o).
% 0.21/0.40 thf(func_def_29, type, sK1: $i > $o).
% 0.21/0.40 thf(f77,plain,(
% 0.21/0.40 $false),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f76])).
% 0.21/0.40 thf(f76,plain,(
% 0.21/0.40 ($true = $false)),
% 0.21/0.40 inference(superposition,[],[f72,f74])).
% 0.21/0.40 thf(f74,plain,(
% 0.21/0.40 ($false = (sK1 @ sK3))),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f73])).
% 0.21/0.40 thf(f73,plain,(
% 0.21/0.40 ($false = (sK1 @ sK3)) | ($true = $false)),
% 0.21/0.40 inference(forward_demodulation,[],[f67,f71])).
% 0.21/0.40 thf(f71,plain,(
% 0.21/0.40 ($true = (sK0 @ sK3))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f58])).
% 0.21/0.40 thf(f58,plain,(
% 0.21/0.40 ($true = ((sK1 @ sK3) & (sK0 @ sK3)))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f57])).
% 0.21/0.40 thf(f57,plain,(
% 0.21/0.40 ($true = ((((~ (sK0 @ sK3)) & (sK1 @ sK3)) | ((sK0 @ sK3) & (~ (sK1 @ sK3)))) & ((sK1 @ sK3) & (sK0 @ sK3))))),
% 0.21/0.40 inference(beta_eta_normalization,[],[f56])).
% 0.21/0.40 thf(f56,plain,(
% 0.21/0.40 (((^[Y0 : $i]: ((((~ (sK0 @ Y0)) & (sK1 @ Y0)) | ((sK0 @ Y0) & (~ (sK1 @ Y0)))) & ((sK1 @ Y0) & (sK0 @ Y0)))) @ sK3) = $true)),
% 0.21/0.40 inference(sigma_clausification,[],[f55])).
% 0.21/0.40 thf(f55,plain,(
% 0.21/0.40 ((?? @ $i @ (^[Y0 : $i]: ((((~ (sK0 @ Y0)) & (sK1 @ Y0)) | ((sK0 @ Y0) & (~ (sK1 @ Y0)))) & ((sK1 @ Y0) & (sK0 @ Y0))))) = $true)),
% 0.21/0.40 inference(not_proxy_clausification,[],[f54])).
% 0.21/0.40 thf(f54,plain,(
% 0.21/0.40 ((~ (?? @ $i @ (^[Y0 : $i]: ((((~ (sK0 @ Y0)) & (sK1 @ Y0)) | ((sK0 @ Y0) & (~ (sK1 @ Y0)))) & ((sK1 @ Y0) & (sK0 @ Y0)))))) != $true)),
% 0.21/0.40 inference(beta_eta_normalization,[],[f53])).
% 0.21/0.40 thf(f53,plain,(
% 0.21/0.40 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2)))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))) @ sK1 @ sK0) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (((~ (Y1 @ Y2)) & (Y0 @ Y2)) | ((Y1 @ Y2) & (~ (Y0 @ Y2))))))))) @ sK1 @ sK0)) != $true)),
% 0.21/0.40 inference(definition_unfolding,[],[f49,f50,f48,f51])).
% 0.21/0.40 thf(f51,plain,(
% 0.21/0.40 (excl_union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (((~ (Y1 @ Y2)) & (Y0 @ Y2)) | ((Y1 @ Y2) & (~ (Y0 @ Y2))))))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f41])).
% 0.21/0.40 thf(f41,plain,(
% 0.21/0.40 (excl_union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (((~ (Y1 @ Y2)) & (Y0 @ Y2)) | ((Y1 @ Y2) & (~ (Y0 @ Y2))))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f40])).
% 0.21/0.40 thf(f40,plain,(
% 0.21/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((~(X0 @ X2) & (X1 @ X2)) | ((X0 @ X2) & ~(X1 @ X2)))) = excl_union)),
% 0.21/0.40 inference(rectify,[],[f7])).
% 0.21/0.40 thf(f7,axiom,(
% 0.21/0.40 ((^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((~(X0 @ X3) & (X2 @ X3)) | ((X0 @ X3) & ~(X2 @ X3)))) = excl_union)),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',excl_union)).
% 0.21/0.40 thf(f48,plain,(
% 0.21/0.40 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f35])).
% 0.21/0.40 thf(f35,plain,(
% 0.21/0.40 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (Y1 @ Y2))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f34])).
% 0.21/0.40 thf(f34,plain,(
% 0.21/0.40 (intersection = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) & (X0 @ X2))))),
% 0.21/0.40 inference(rectify,[],[f8])).
% 0.21/0.40 thf(f8,axiom,(
% 0.21/0.40 (intersection = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X2 @ X3) & (X0 @ X3))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection)).
% 0.21/0.40 thf(f50,plain,(
% 0.21/0.40 (misses = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2)))))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f33])).
% 0.21/0.40 thf(f33,plain,(
% 0.21/0.40 (misses = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (~ (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2)))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f32])).
% 0.21/0.40 thf(f32,plain,(
% 0.21/0.40 (misses = (^[X0 : $i > $o, X1 : $i > $o] : (~? [X2] : ((X0 @ X2) & (X1 @ X2)))))),
% 0.21/0.40 inference(rectify,[],[f14])).
% 0.21/0.40 thf(f14,axiom,(
% 0.21/0.40 (misses = (^[X0 : $i > $o, X2 : $i > $o] : (~? [X3] : ((X0 @ X3) & (X2 @ X3)))))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',misses)).
% 0.21/0.40 thf(f49,plain,(
% 0.21/0.40 ($true != (misses @ (intersection @ sK1 @ sK0) @ (excl_union @ sK1 @ sK0)))),
% 0.21/0.40 inference(cnf_transformation,[],[f47])).
% 0.21/0.40 thf(f47,plain,(
% 0.21/0.40 ($true != (misses @ (intersection @ sK1 @ sK0) @ (excl_union @ sK1 @ sK0)))),
% 0.21/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f45,f46])).
% 0.21/0.40 thf(f46,plain,(
% 0.21/0.40 ? [X0 : $i > $o,X1 : $i > $o] : ((misses @ (intersection @ X1 @ X0) @ (excl_union @ X1 @ X0)) != $true) => ($true != (misses @ (intersection @ sK1 @ sK0) @ (excl_union @ sK1 @ sK0)))),
% 0.21/0.40 introduced(choice_axiom,[])).
% 0.21/0.40 thf(f45,plain,(
% 0.21/0.40 ? [X0 : $i > $o,X1 : $i > $o] : ((misses @ (intersection @ X1 @ X0) @ (excl_union @ X1 @ X0)) != $true)),
% 0.21/0.40 inference(ennf_transformation,[],[f27])).
% 0.21/0.40 thf(f27,plain,(
% 0.21/0.40 ~! [X0 : $i > $o,X1 : $i > $o] : ((misses @ (intersection @ X1 @ X0) @ (excl_union @ X1 @ X0)) = $true)),
% 0.21/0.40 inference(fool_elimination,[],[f26])).
% 0.21/0.40 thf(f26,plain,(
% 0.21/0.40 ~! [X0 : $i > $o,X1 : $i > $o] : (misses @ (intersection @ X1 @ X0) @ (excl_union @ X1 @ X0))),
% 0.21/0.40 inference(rectify,[],[f16])).
% 0.21/0.40 thf(f16,negated_conjecture,(
% 0.21/0.40 ~! [X2 : $i > $o,X0 : $i > $o] : (misses @ (intersection @ X0 @ X2) @ (excl_union @ X0 @ X2))),
% 0.21/0.40 inference(negated_conjecture,[],[f15])).
% 0.21/0.40 thf(f15,conjecture,(
% 0.21/0.40 ! [X2 : $i > $o,X0 : $i > $o] : (misses @ (intersection @ X0 @ X2) @ (excl_union @ X0 @ X2))),
% 0.21/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.21/0.40 thf(f67,plain,(
% 0.21/0.40 ($false = (sK1 @ sK3)) | ((sK0 @ sK3) = $false)),
% 0.21/0.40 inference(not_proxy_clausification,[],[f66])).
% 0.21/0.40 thf(f66,plain,(
% 0.21/0.40 ((~ (sK0 @ sK3)) = $true) | ($false = (sK1 @ sK3))),
% 0.21/0.40 inference(not_proxy_clausification,[],[f63])).
% 0.21/0.40 thf(f63,plain,(
% 0.21/0.40 ((~ (sK1 @ sK3)) = $true) | ((~ (sK0 @ sK3)) = $true)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f62])).
% 0.21/0.40 thf(f62,plain,(
% 0.21/0.40 ($true = ((sK0 @ sK3) & (~ (sK1 @ sK3)))) | ((~ (sK0 @ sK3)) = $true)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f60])).
% 0.21/0.40 thf(f60,plain,(
% 0.21/0.40 ($true = ((~ (sK0 @ sK3)) & (sK1 @ sK3))) | ($true = ((sK0 @ sK3) & (~ (sK1 @ sK3))))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f59])).
% 0.21/0.40 thf(f59,plain,(
% 0.21/0.40 ((((~ (sK0 @ sK3)) & (sK1 @ sK3)) | ((sK0 @ sK3) & (~ (sK1 @ sK3)))) = $true)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f57])).
% 0.21/0.40 thf(f72,plain,(
% 0.21/0.40 ($true = (sK1 @ sK3))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f58])).
% 0.21/0.40 % SZS output end Proof for theBenchmark
% 0.21/0.40 % (15849)------------------------------
% 0.21/0.40 % (15849)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (15849)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (15849)Memory used [KB]: 5500
% 0.21/0.40 % (15849)Time elapsed: 0.005 s
% 0.21/0.40 % (15849)Instructions burned: 3 (million)
% 0.21/0.40 % (15849)------------------------------
% 0.21/0.40 % (15849)------------------------------
% 0.21/0.40 % (15843)Success in time 0.031 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------