TSTP Solution File: SET764^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET764^4 : 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 : n021.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:13:10 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET764^4 : 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 : n021.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 12:30:08 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.21/0.37 % (8423)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.37 % (8424)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.37 % (8425)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.37 % (8427)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.37 % (8428)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.37 % (8429)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.37 % (8426)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (8430)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.37 % (8426)Instruction limit reached!
% 0.21/0.37 % (8426)------------------------------
% 0.21/0.37 % (8426)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (8427)Instruction limit reached!
% 0.21/0.37 % (8427)------------------------------
% 0.21/0.37 % (8427)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (8426)Termination reason: Unknown
% 0.21/0.37 % (8426)Termination phase: shuffling
% 0.21/0.37
% 0.21/0.37 % (8426)Memory used [KB]: 1023
% 0.21/0.37 % (8426)Time elapsed: 0.003 s
% 0.21/0.37 % (8426)Instructions burned: 3 (million)
% 0.21/0.37 % (8426)------------------------------
% 0.21/0.37 % (8426)------------------------------
% 0.21/0.37 % (8427)Termination reason: Unknown
% 0.21/0.37 % (8427)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (8427)Memory used [KB]: 1023
% 0.21/0.37 % (8427)Time elapsed: 0.004 s
% 0.21/0.37 % (8427)Instructions burned: 3 (million)
% 0.21/0.37 % (8427)------------------------------
% 0.21/0.37 % (8427)------------------------------
% 0.21/0.37 % (8430)Instruction limit reached!
% 0.21/0.37 % (8430)------------------------------
% 0.21/0.37 % (8430)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (8430)Termination reason: Unknown
% 0.21/0.37 % (8430)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (8430)Memory used [KB]: 1023
% 0.21/0.37 % (8430)Time elapsed: 0.004 s
% 0.21/0.37 % (8430)Instructions burned: 3 (million)
% 0.21/0.37 % (8430)------------------------------
% 0.21/0.37 % (8430)------------------------------
% 0.21/0.38 % (8424)Instruction limit reached!
% 0.21/0.38 % (8424)------------------------------
% 0.21/0.38 % (8424)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (8424)Termination reason: Unknown
% 0.21/0.38 % (8424)Termination phase: Property scanning
% 0.21/0.38
% 0.21/0.38 % (8424)Memory used [KB]: 1023
% 0.21/0.38 % (8424)Time elapsed: 0.005 s
% 0.21/0.38 % (8424)Instructions burned: 5 (million)
% 0.21/0.38 % (8424)------------------------------
% 0.21/0.38 % (8424)------------------------------
% 0.21/0.38 % (8423)First to succeed.
% 0.21/0.38 % (8425)Also succeeded, but the first one will report.
% 0.21/0.38 % (8428)Refutation not found, incomplete strategy
% 0.21/0.38 % (8428)------------------------------
% 0.21/0.38 % (8428)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (8428)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 % (8428)Memory used [KB]: 5628
% 0.21/0.38 % (8428)Time elapsed: 0.006 s
% 0.21/0.38 % (8428)Instructions burned: 5 (million)
% 0.21/0.38 % (8428)------------------------------
% 0.21/0.38 % (8428)------------------------------
% 0.21/0.38 % (8429)Also succeeded, but the first one will report.
% 0.21/0.38 % (8423)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_3, type, emptyset: $i > $o).
% 0.21/0.38 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.21/0.38 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.21/0.38 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.21/0.38 thf(func_def_15, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_16, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
% 0.21/0.38 thf(func_def_17, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_18, type, fun_injective: ($i > $i) > $o).
% 0.21/0.38 thf(func_def_19, type, fun_surjective: ($i > $i) > $o).
% 0.21/0.38 thf(func_def_20, type, fun_bijective: ($i > $i) > $o).
% 0.21/0.38 thf(func_def_21, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.21/0.38 thf(func_def_22, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.21/0.38 thf(func_def_37, type, sK0: $i > $i).
% 0.21/0.38 thf(func_def_39, type, ph2: !>[X0: $tType]:(X0)).
% 0.21/0.38 thf(f103,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f102])).
% 0.21/0.38 thf(f102,plain,(
% 0.21/0.38 ($true = $false)),
% 0.21/0.38 inference(beta_eta_normalization,[],[f101])).
% 0.21/0.38 thf(f101,plain,(
% 0.21/0.38 (((^[Y0 : $i]: ($false)) @ sK4) = $true)),
% 0.21/0.38 inference(sigma_clausification,[],[f100])).
% 0.21/0.38 thf(f100,plain,(
% 0.21/0.38 ($false != (?? @ $i @ (^[Y0 : $i]: ($false))))),
% 0.21/0.38 inference(beta_eta_normalization,[],[f99])).
% 0.21/0.38 thf(f99,plain,(
% 0.21/0.38 (((^[Y0 : $i]: ($false)) @ sK3) != ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ($false)))) @ sK3))),
% 0.21/0.38 inference(negative_extensionality,[],[f98])).
% 0.21/0.38 thf(f98,plain,(
% 0.21/0.38 ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ($false)))) != (^[Y0 : $i]: ($false)))),
% 0.21/0.38 inference(boolean_simplification,[],[f97])).
% 0.21/0.38 thf(f97,plain,(
% 0.21/0.38 ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (((sK0 @ Y0) = Y1) & $false)))) != (^[Y0 : $i]: ($false)))),
% 0.21/0.38 inference(beta_eta_normalization,[],[f96])).
% 0.21/0.38 thf(f96,plain,(
% 0.21/0.38 (((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y2) = Y3) & (Y1 @ Y3))))))))) @ sK0 @ (^[Y0 : $i]: ($false))) != (^[Y0 : $i]: ($false)))),
% 0.21/0.38 inference(definition_unfolding,[],[f80,f82,f72,f82])).
% 0.21/0.38 thf(f72,plain,(
% 0.21/0.38 (fun_inv_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y2) = Y3) & (Y1 @ Y3))))))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f42])).
% 0.21/0.38 thf(f42,plain,(
% 0.21/0.38 (fun_inv_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y2) = Y3) & (Y1 @ Y3))))))))))),
% 0.21/0.38 inference(fool_elimination,[],[f41])).
% 0.21/0.38 thf(f41,plain,(
% 0.21/0.38 (fun_inv_image = (^[X0 : $i > $i, X1 : $i > $o, X2 : $i] : (? [X3] : ((X1 @ X3) & ((X0 @ X2) = X3)))))),
% 0.21/0.38 inference(rectify,[],[f17])).
% 0.21/0.38 thf(f17,axiom,(
% 0.21/0.38 (fun_inv_image = (^[X4 : $i > $i, X7 : $i > $o, X0 : $i] : (? [X2] : ((X7 @ X2) & ((X4 @ X0) = X2)))))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fun_inv_image)).
% 0.21/0.38 thf(f82,plain,(
% 0.21/0.38 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.21/0.38 inference(cnf_transformation,[],[f56])).
% 0.21/0.38 thf(f56,plain,(
% 0.21/0.38 (emptyset = (^[Y0 : $i]: ($false)))),
% 0.21/0.38 inference(fool_elimination,[],[f3])).
% 0.21/0.38 thf(f3,axiom,(
% 0.21/0.38 (emptyset = (^[X0 : $i] : ($false)))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyset)).
% 0.21/0.38 thf(f80,plain,(
% 0.21/0.38 (emptyset != (fun_inv_image @ sK0 @ emptyset))),
% 0.21/0.38 inference(cnf_transformation,[],[f70])).
% 0.21/0.38 thf(f70,plain,(
% 0.21/0.38 (emptyset != (fun_inv_image @ sK0 @ emptyset))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f68,f69])).
% 0.21/0.38 thf(f69,plain,(
% 0.21/0.38 ? [X0 : $i > $i] : (emptyset != (fun_inv_image @ X0 @ emptyset)) => (emptyset != (fun_inv_image @ sK0 @ emptyset))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f68,plain,(
% 0.21/0.38 ? [X0 : $i > $i] : (emptyset != (fun_inv_image @ X0 @ emptyset))),
% 0.21/0.38 inference(ennf_transformation,[],[f67])).
% 0.21/0.38 thf(f67,plain,(
% 0.21/0.38 ~! [X0 : $i > $i] : (emptyset = (fun_inv_image @ X0 @ emptyset))),
% 0.21/0.38 inference(rectify,[],[f24])).
% 0.21/0.38 thf(f24,negated_conjecture,(
% 0.21/0.38 ~! [X4 : $i > $i] : (emptyset = (fun_inv_image @ X4 @ emptyset))),
% 0.21/0.38 inference(negated_conjecture,[],[f23])).
% 0.21/0.38 thf(f23,conjecture,(
% 0.21/0.38 ! [X4 : $i > $i] : (emptyset = (fun_inv_image @ X4 @ emptyset))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (8423)------------------------------
% 0.21/0.38 % (8423)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (8423)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (8423)Memory used [KB]: 5500
% 0.21/0.38 % (8423)Time elapsed: 0.006 s
% 0.21/0.38 % (8423)Instructions burned: 5 (million)
% 0.21/0.38 % (8423)------------------------------
% 0.21/0.38 % (8423)------------------------------
% 0.21/0.38 % (8420)Success in time 0.006 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------