TSTP Solution File: SET017^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET017^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 : n013.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:07:45 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET017^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.13 % 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 : n013.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 12:39:23 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.20/0.37 % (27971)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.20/0.37 % (27972)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.20/0.37 % (27974)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.20/0.37 % (27975)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.20/0.37 % (27976)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.37 % (27974)Instruction limit reached!
% 0.20/0.37 % (27974)------------------------------
% 0.20/0.37 % (27974)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (27974)Termination reason: Unknown
% 0.20/0.37 % (27974)Termination phase: Property scanning
% 0.20/0.37
% 0.20/0.37 % (27974)Memory used [KB]: 1023
% 0.20/0.37 % (27974)Time elapsed: 0.003 s
% 0.20/0.37 % (27974)Instructions burned: 2 (million)
% 0.20/0.37 % (27974)------------------------------
% 0.20/0.37 % (27974)------------------------------
% 0.20/0.37 % (27977)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.20/0.37 % (27971)Instruction limit reached!
% 0.20/0.37 % (27971)------------------------------
% 0.20/0.37 % (27971)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (27971)Termination reason: Unknown
% 0.20/0.37 % (27971)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (27971)Memory used [KB]: 5500
% 0.20/0.37 % (27971)Time elapsed: 0.005 s
% 0.20/0.37 % (27971)Instructions burned: 4 (million)
% 0.20/0.37 % (27971)------------------------------
% 0.20/0.37 % (27971)------------------------------
% 0.20/0.37 % (27972)First to succeed.
% 0.20/0.37 % (27977)Instruction limit reached!
% 0.20/0.37 % (27977)------------------------------
% 0.20/0.37 % (27977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (27977)Termination reason: Unknown
% 0.20/0.37 % (27977)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (27977)Memory used [KB]: 5500
% 0.20/0.37 % (27977)Time elapsed: 0.004 s
% 0.20/0.37 % (27977)Instructions burned: 4 (million)
% 0.20/0.37 % (27977)------------------------------
% 0.20/0.37 % (27977)------------------------------
% 0.20/0.38 % (27976)Also succeeded, but the first one will report.
% 0.20/0.38 % (27972)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_3, type, emptyset: $i > $o).
% 0.20/0.38 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.20/0.38 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.20/0.38 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.20/0.38 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.20/0.38 thf(func_def_15, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.20/0.38 thf(func_def_33, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.38 thf(f109,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(avatar_sat_refutation,[],[f95,f101,f105,f108])).
% 0.20/0.38 thf(f108,plain,(
% 0.20/0.38 ~spl3_3 | ~spl3_1),
% 0.20/0.38 inference(avatar_split_clause,[],[f106,f88,f98])).
% 0.20/0.38 thf(f98,plain,(
% 0.20/0.38 spl3_3 <=> (sK0 = sK1)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.20/0.38 thf(f88,plain,(
% 0.20/0.38 spl3_1 <=> (sK0 = sK2)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.20/0.38 thf(f106,plain,(
% 0.20/0.38 (sK0 != sK1) | ~spl3_1),
% 0.20/0.38 inference(backward_demodulation,[],[f58,f90])).
% 0.20/0.38 thf(f90,plain,(
% 0.20/0.38 (sK0 = sK2) | ~spl3_1),
% 0.20/0.38 inference(avatar_component_clause,[],[f88])).
% 0.20/0.38 thf(f58,plain,(
% 0.20/0.38 (sK1 != sK2)),
% 0.20/0.38 inference(cnf_transformation,[],[f46])).
% 0.20/0.38 thf(f46,plain,(
% 0.20/0.38 ((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2)) & (sK1 != sK2)),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45])).
% 0.20/0.38 thf(f45,plain,(
% 0.20/0.38 ? [X0,X1,X2] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1)) & (X1 != X2)) => (((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2)) & (sK1 != sK2))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f44,plain,(
% 0.20/0.38 ? [X0,X1,X2] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1)) & (X1 != X2))),
% 0.20/0.38 inference(ennf_transformation,[],[f43])).
% 0.20/0.38 thf(f43,plain,(
% 0.20/0.38 ~! [X0,X1,X2] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X1)) => (X1 = X2))),
% 0.20/0.38 inference(rectify,[],[f16])).
% 0.20/0.38 thf(f16,negated_conjecture,(
% 0.20/0.38 ~! [X0,X2,X4] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X4)) => (X2 = X4))),
% 0.20/0.38 inference(negated_conjecture,[],[f15])).
% 0.20/0.38 thf(f15,conjecture,(
% 0.20/0.38 ! [X0,X2,X4] : (((unord_pair @ X0 @ X2) = (unord_pair @ X0 @ X4)) => (X2 = X4))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.20/0.38 thf(f105,plain,(
% 0.20/0.38 ~spl3_2),
% 0.20/0.38 inference(avatar_contradiction_clause,[],[f104])).
% 0.20/0.38 thf(f104,plain,(
% 0.20/0.38 $false | ~spl3_2),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f103])).
% 0.20/0.38 thf(f103,plain,(
% 0.20/0.38 (sK1 != sK1) | ~spl3_2),
% 0.20/0.38 inference(superposition,[],[f58,f94])).
% 0.20/0.38 thf(f94,plain,(
% 0.20/0.38 (sK1 = sK2) | ~spl3_2),
% 0.20/0.38 inference(avatar_component_clause,[],[f92])).
% 0.20/0.38 thf(f92,plain,(
% 0.20/0.38 spl3_2 <=> (sK1 = sK2)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.20/0.38 thf(f101,plain,(
% 0.20/0.38 spl3_3 | spl3_2),
% 0.20/0.38 inference(avatar_split_clause,[],[f96,f92,f98])).
% 0.20/0.38 thf(f96,plain,(
% 0.20/0.38 (sK0 = sK1) | (sK1 = sK2)),
% 0.20/0.38 inference(equality_resolution,[],[f83])).
% 0.20/0.38 thf(f83,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((sK1 != X1) | (sK2 = X1) | (sK0 = X1)) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f82])).
% 0.20/0.38 thf(f82,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((sK0 = X1) | (sK2 = X1) | ($false = (sK1 = X1))) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f81])).
% 0.20/0.38 thf(f81,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((sK0 = X1) | ($true = (sK2 = X1)) | ($false = (sK1 = X1))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f79])).
% 0.20/0.38 thf(f79,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($false = ((sK1 = X1) | (sK0 = X1))) | (sK0 = X1) | ($true = (sK2 = X1))) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f78])).
% 0.20/0.38 thf(f78,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = (sK0 = X1)) | ($false = ((sK1 = X1) | (sK0 = X1))) | ($true = (sK2 = X1))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f68])).
% 0.20/0.38 thf(f68,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = ((sK2 = X1) | (sK0 = X1))) | ($false = ((sK1 = X1) | (sK0 = X1)))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f67])).
% 0.20/0.38 thf(f67,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((((sK2 = X1) | (sK0 = X1)) = ((sK1 = X1) | (sK0 = X1)))) )),
% 0.20/0.38 inference(beta_eta_normalization,[],[f66])).
% 0.20/0.38 thf(f66,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) @ X1) = ((^[Y0 : $i]: ((sK2 = Y0) | (sK0 = Y0))) @ X1))) )),
% 0.20/0.38 inference(argument_congruence,[],[f65])).
% 0.20/0.38 thf(f65,plain,(
% 0.20/0.38 ((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) = (^[Y0 : $i]: ((sK2 = Y0) | (sK0 = Y0))))),
% 0.20/0.38 inference(beta_eta_normalization,[],[f64])).
% 0.20/0.38 thf(f64,plain,(
% 0.20/0.38 (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))) @ sK0 @ sK1) = ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))) @ sK0 @ sK2))),
% 0.20/0.38 inference(definition_unfolding,[],[f59,f49,f49])).
% 0.20/0.38 thf(f49,plain,(
% 0.20/0.38 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))))),
% 0.20/0.38 inference(cnf_transformation,[],[f32])).
% 0.20/0.38 thf(f32,plain,(
% 0.20/0.38 (unord_pair = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((Y1 = Y2) | (Y0 = Y2))))))))),
% 0.20/0.38 inference(fool_elimination,[],[f31])).
% 0.20/0.38 thf(f31,plain,(
% 0.20/0.38 (unord_pair = (^[X0 : $i, X1 : $i, X2 : $i] : ((X0 = X2) | (X1 = X2))))),
% 0.20/0.38 inference(rectify,[],[f4])).
% 0.20/0.38 thf(f4,axiom,(
% 0.20/0.38 (unord_pair = (^[X0 : $i, X2 : $i, X3 : $i] : ((X0 = X3) | (X2 = X3))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unord_pair)).
% 0.20/0.38 thf(f59,plain,(
% 0.20/0.38 ((unord_pair @ sK0 @ sK1) = (unord_pair @ sK0 @ sK2))),
% 0.20/0.38 inference(cnf_transformation,[],[f46])).
% 0.20/0.38 thf(f95,plain,(
% 0.20/0.38 spl3_1 | spl3_2),
% 0.20/0.38 inference(avatar_split_clause,[],[f86,f92,f88])).
% 0.20/0.38 thf(f86,plain,(
% 0.20/0.38 (sK1 = sK2) | (sK0 = sK2)),
% 0.20/0.38 inference(equality_resolution,[],[f75])).
% 0.20/0.38 thf(f75,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((sK2 != X1) | (sK1 = X1) | (sK0 = X1)) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f74])).
% 0.20/0.38 thf(f74,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($false = (sK2 = X1)) | (sK1 = X1) | (sK0 = X1)) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f73])).
% 0.20/0.38 thf(f73,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = (sK1 = X1)) | (sK0 = X1) | ($false = (sK2 = X1))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f71])).
% 0.20/0.38 thf(f71,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((sK0 = X1) | ($false = ((sK2 = X1) | (sK0 = X1))) | ($true = (sK1 = X1))) )),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f70])).
% 0.20/0.38 thf(f70,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = (sK0 = X1)) | ($false = ((sK2 = X1) | (sK0 = X1))) | ($true = (sK1 = X1))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f69])).
% 0.20/0.38 thf(f69,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = ((sK1 = X1) | (sK0 = X1))) | ($false = ((sK2 = X1) | (sK0 = X1)))) )),
% 0.20/0.38 inference(binary_proxy_clausification,[],[f67])).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (27972)------------------------------
% 0.20/0.38 % (27972)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (27972)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (27972)Memory used [KB]: 5500
% 0.20/0.38 % (27972)Time elapsed: 0.007 s
% 0.20/0.38 % (27972)Instructions burned: 4 (million)
% 0.20/0.38 % (27972)------------------------------
% 0.20/0.38 % (27972)------------------------------
% 0.20/0.38 % (27969)Success in time 0.008 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------