TSTP Solution File: SET066^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET066^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 : n004.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:27 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET066^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.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 11:28:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.38 % (20830)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.14/0.38 % (20830)First to succeed.
% 0.14/0.38 % (20830)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_3, type, emptyset: $i > $o).
% 0.14/0.38 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.14/0.38 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.14/0.38 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.38 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.38 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.38 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.38 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.14/0.38 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.14/0.38 thf(func_def_31, type, ph3: !>[X0: $tType]:(X0)).
% 0.14/0.38 thf(f103,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(avatar_sat_refutation,[],[f98,f100,f101])).
% 0.14/0.38 thf(f101,plain,(
% 0.14/0.38 ~spl2_1),
% 0.14/0.38 inference(avatar_split_clause,[],[f76,f91])).
% 0.14/0.38 thf(f91,plain,(
% 0.14/0.38 spl2_1 <=> (sK4 = sK1)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.14/0.38 thf(f76,plain,(
% 0.14/0.38 (sK4 != sK1)),
% 0.14/0.38 inference(duplicate_literal_removal,[],[f75])).
% 0.14/0.38 thf(f75,plain,(
% 0.14/0.38 (sK4 != sK1) | (sK4 != sK1)),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f72])).
% 0.14/0.38 thf(f72,plain,(
% 0.14/0.38 (sK4 != sK1) | ($false = (sK1 = sK4))),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f71])).
% 0.14/0.38 thf(f71,plain,(
% 0.14/0.38 (((sK0 = sK4) | (sK1 = sK4)) = $false) | (sK4 != sK1)),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f70])).
% 0.14/0.38 thf(f70,plain,(
% 0.14/0.38 ($false = (sK1 = sK4)) | (((sK0 = sK4) | (sK1 = sK4)) = $false)),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f68])).
% 0.14/0.38 thf(f68,plain,(
% 0.14/0.38 ($false = ((sK1 = sK4) | (sK0 = sK4))) | (((sK0 = sK4) | (sK1 = sK4)) = $false)),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f66])).
% 0.14/0.38 thf(f66,plain,(
% 0.14/0.38 (((sK0 = sK4) | (sK1 = sK4)) != ((sK1 = sK4) | (sK0 = sK4)))),
% 0.14/0.38 inference(beta_eta_normalization,[],[f65])).
% 0.14/0.38 thf(f65,plain,(
% 0.14/0.38 (((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) @ sK4) != ((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) @ sK4))),
% 0.14/0.38 inference(negative_extensionality,[],[f64])).
% 0.14/0.38 thf(f64,plain,(
% 0.14/0.38 ((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) != (^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))))),
% 0.14/0.38 inference(beta_eta_normalization,[],[f63])).
% 0.14/0.38 thf(f63,plain,(
% 0.14/0.38 (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))) @ sK1 @ sK0) != ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))) @ sK0 @ sK1))),
% 0.14/0.38 inference(definition_unfolding,[],[f50,f51,f51])).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))))),
% 0.14/0.38 inference(cnf_transformation,[],[f31])).
% 0.14/0.38 thf(f31,plain,(
% 0.14/0.38 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))))),
% 0.14/0.38 inference(fool_elimination,[],[f30])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 ((^[X0 : $i, X1 : $i, X2 : $i] : ((X0 = X2) | (X1 = X2))) = unord_pair)),
% 0.14/0.38 inference(rectify,[],[f4])).
% 0.14/0.38 thf(f4,axiom,(
% 0.14/0.38 ((^[X0 : $i, X2 : $i, X3 : $i] : ((X0 = X3) | (X2 = X3))) = unord_pair)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unord_pair)).
% 0.14/0.38 thf(f50,plain,(
% 0.14/0.38 ((unord_pair @ sK0 @ sK1) != (unord_pair @ sK1 @ sK0))),
% 0.14/0.38 inference(cnf_transformation,[],[f46])).
% 0.14/0.38 thf(f46,plain,(
% 0.14/0.38 ((unord_pair @ sK0 @ sK1) != (unord_pair @ sK1 @ sK0))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f44,f45])).
% 0.14/0.38 thf(f45,plain,(
% 0.14/0.38 ? [X0,X1] : ((unord_pair @ X0 @ X1) != (unord_pair @ X1 @ X0)) => ((unord_pair @ sK0 @ sK1) != (unord_pair @ sK1 @ sK0))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f44,plain,(
% 0.14/0.38 ? [X0,X1] : ((unord_pair @ X0 @ X1) != (unord_pair @ X1 @ X0))),
% 0.14/0.38 inference(ennf_transformation,[],[f43])).
% 0.14/0.38 thf(f43,plain,(
% 0.14/0.38 ~! [X0,X1] : ((unord_pair @ X0 @ X1) = (unord_pair @ X1 @ X0))),
% 0.14/0.38 inference(rectify,[],[f16])).
% 0.14/0.38 thf(f16,negated_conjecture,(
% 0.14/0.38 ~! [X0,X2] : ((unord_pair @ X0 @ X2) = (unord_pair @ X2 @ X0))),
% 0.14/0.38 inference(negated_conjecture,[],[f15])).
% 0.14/0.38 thf(f15,conjecture,(
% 0.14/0.38 ! [X0,X2] : ((unord_pair @ X0 @ X2) = (unord_pair @ X2 @ X0))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.14/0.38 thf(f100,plain,(
% 0.14/0.38 ~spl2_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f81,f95])).
% 0.14/0.38 thf(f95,plain,(
% 0.14/0.38 spl2_2 <=> (sK0 = sK4)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.14/0.38 thf(f81,plain,(
% 0.14/0.38 (sK0 != sK4)),
% 0.14/0.38 inference(duplicate_literal_removal,[],[f80])).
% 0.14/0.38 thf(f80,plain,(
% 0.14/0.38 (sK0 != sK4) | (sK0 != sK4)),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f79])).
% 0.14/0.38 thf(f79,plain,(
% 0.14/0.38 (sK0 != sK4) | ($false = (sK0 = sK4))),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f77])).
% 0.14/0.38 thf(f77,plain,(
% 0.14/0.38 (((sK0 = sK4) | (sK1 = sK4)) = $false) | (sK0 != sK4)),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f69])).
% 0.14/0.38 thf(f69,plain,(
% 0.14/0.38 ($false = (sK0 = sK4)) | (((sK0 = sK4) | (sK1 = sK4)) = $false)),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f68])).
% 0.14/0.38 thf(f98,plain,(
% 0.14/0.38 spl2_1 | spl2_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f89,f95,f91])).
% 0.14/0.38 thf(f89,plain,(
% 0.14/0.38 (sK4 = sK1) | (sK0 = sK4)),
% 0.14/0.38 inference(duplicate_literal_removal,[],[f88])).
% 0.14/0.38 thf(f88,plain,(
% 0.14/0.38 (sK4 = sK1) | (sK4 = sK1) | (sK0 = sK4)),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f87])).
% 0.14/0.38 thf(f87,plain,(
% 0.14/0.38 (sK4 = sK1) | (sK0 = sK4) | ($true = (sK1 = sK4))),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f86])).
% 0.14/0.38 thf(f86,plain,(
% 0.14/0.38 ($true = (sK0 = sK4)) | ($true = (sK1 = sK4)) | (sK4 = sK1)),
% 0.14/0.38 inference(duplicate_literal_removal,[],[f85])).
% 0.14/0.38 thf(f85,plain,(
% 0.14/0.38 ($true = (sK0 = sK4)) | (sK4 = sK1) | ($true = (sK1 = sK4)) | ($true = (sK0 = sK4))),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f84])).
% 0.14/0.38 thf(f84,plain,(
% 0.14/0.38 (sK4 = sK1) | (((sK0 = sK4) | (sK1 = sK4)) = $true) | ($true = (sK0 = sK4))),
% 0.14/0.38 inference(equality_proxy_clausification,[],[f83])).
% 0.14/0.38 thf(f83,plain,(
% 0.14/0.38 ($true = (sK1 = sK4)) | (((sK0 = sK4) | (sK1 = sK4)) = $true) | ($true = (sK0 = sK4))),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f67])).
% 0.14/0.38 thf(f67,plain,(
% 0.14/0.38 ($true = ((sK1 = sK4) | (sK0 = sK4))) | (((sK0 = sK4) | (sK1 = sK4)) = $true)),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f66])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (20830)------------------------------
% 0.14/0.38 % (20830)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (20830)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (20830)Memory used [KB]: 5500
% 0.14/0.38 % (20830)Time elapsed: 0.006 s
% 0.14/0.38 % (20830)Instructions burned: 4 (million)
% 0.14/0.38 % (20830)------------------------------
% 0.14/0.38 % (20830)------------------------------
% 0.14/0.38 % (20829)Success in time 0.022 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------