TSTP Solution File: QUA002^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : QUA002^1 : TPTP v8.2.0. Released v4.1.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 : 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 02:30:31 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 : QUA002^1 : TPTP v8.2.0. Released v4.1.0.
% 0.14/0.14 % 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.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 13:37:07 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/sandbox/benchmark/theBenchmark.p
% 0.21/0.37 % (2444)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 % (2445)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 % (2447)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (2446)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 % (2448)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 % (2449)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 % (2450)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 % (2447)Instruction limit reached!
% 0.21/0.37 % (2447)------------------------------
% 0.21/0.37 % (2447)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (2451)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 % (2447)Termination reason: Unknown
% 0.21/0.37 % (2447)Termination phase: shuffling
% 0.21/0.37 % (2448)Instruction limit reached!
% 0.21/0.37 % (2448)------------------------------
% 0.21/0.37 % (2448)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (2448)Termination reason: Unknown
% 0.21/0.37 % (2448)Termination phase: shuffling
% 0.21/0.37
% 0.21/0.37 % (2448)Memory used [KB]: 1023
% 0.21/0.37 % (2448)Time elapsed: 0.003 s
% 0.21/0.37 % (2448)Instructions burned: 2 (million)
% 0.21/0.37 % (2448)------------------------------
% 0.21/0.37 % (2448)------------------------------
% 0.21/0.37
% 0.21/0.37 % (2447)Memory used [KB]: 895
% 0.21/0.37 % (2447)Time elapsed: 0.003 s
% 0.21/0.37 % (2447)Instructions burned: 2 (million)
% 0.21/0.37 % (2447)------------------------------
% 0.21/0.37 % (2447)------------------------------
% 0.21/0.37 % (2451)Instruction limit reached!
% 0.21/0.37 % (2451)------------------------------
% 0.21/0.37 % (2451)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (2449)Refutation not found, incomplete strategy
% 0.21/0.37 % (2449)------------------------------
% 0.21/0.37 % (2449)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (2451)Termination reason: Unknown
% 0.21/0.37 % (2451)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (2451)Memory used [KB]: 1023
% 0.21/0.37 % (2451)Time elapsed: 0.003 s
% 0.21/0.37 % (2451)Instructions burned: 3 (million)
% 0.21/0.37 % (2451)------------------------------
% 0.21/0.37 % (2451)------------------------------
% 0.21/0.37 % (2449)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.37
% 0.21/0.37
% 0.21/0.37 % (2449)Memory used [KB]: 5500
% 0.21/0.37 % (2449)Time elapsed: 0.004 s
% 0.21/0.37 % (2449)Instructions burned: 2 (million)
% 0.21/0.37 % (2449)------------------------------
% 0.21/0.37 % (2449)------------------------------
% 0.21/0.37 % (2445)Instruction limit reached!
% 0.21/0.37 % (2445)------------------------------
% 0.21/0.37 % (2445)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (2445)Termination reason: Unknown
% 0.21/0.37 % (2445)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (2445)Memory used [KB]: 5500
% 0.21/0.37 % (2445)Time elapsed: 0.005 s
% 0.21/0.37 % (2445)Instructions burned: 5 (million)
% 0.21/0.37 % (2445)------------------------------
% 0.21/0.37 % (2445)------------------------------
% 0.21/0.38 % (2446)Refutation not found, incomplete strategy
% 0.21/0.38 % (2446)------------------------------
% 0.21/0.38 % (2446)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (2446)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 % (2446)Memory used [KB]: 5500
% 0.21/0.38 % (2446)Time elapsed: 0.007 s
% 0.21/0.38 % (2446)Instructions burned: 7 (million)
% 0.21/0.38 % (2446)------------------------------
% 0.21/0.38 % (2446)------------------------------
% 0.21/0.38 % (2450)First to succeed.
% 0.21/0.38 % (2450)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, emptyset: $i > $o).
% 0.21/0.38 thf(func_def_1, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_3, type, singleton: $i > $i > $o).
% 0.21/0.38 thf(func_def_5, type, sup: ($i > $o) > $i).
% 0.21/0.38 thf(func_def_6, type, supset: (($i > $o) > $o) > $i > $o).
% 0.21/0.38 thf(func_def_7, type, unionset: (($i > $o) > $o) > $i > $o).
% 0.21/0.38 thf(func_def_8, type, addition: $i > $i > $i).
% 0.21/0.38 thf(func_def_9, type, leq: $i > $i > $o).
% 0.21/0.38 thf(func_def_10, type, multiplication: $i > $i > $i).
% 0.21/0.38 thf(func_def_11, type, crossmult: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38 thf(func_def_29, type, ph3: !>[X0: $tType]:(X0)).
% 0.21/0.38 thf(func_def_30, type, sK4: $i > $i > $i).
% 0.21/0.38 thf(func_def_31, type, sK5: $i > $i > $i > $i).
% 0.21/0.38 thf(f137,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(avatar_sat_refutation,[],[f132,f134,f135])).
% 0.21/0.38 thf(f135,plain,(
% 0.21/0.38 ~spl2_1),
% 0.21/0.38 inference(avatar_split_clause,[],[f109,f125])).
% 0.21/0.38 thf(f125,plain,(
% 0.21/0.38 spl2_1 <=> (sK6 = sK1)),
% 0.21/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.21/0.38 thf(f109,plain,(
% 0.21/0.38 (sK6 != sK1)),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f108])).
% 0.21/0.38 thf(f108,plain,(
% 0.21/0.38 ($false = (sK1 = sK6))),
% 0.21/0.38 inference(duplicate_literal_removal,[],[f104])).
% 0.21/0.38 thf(f104,plain,(
% 0.21/0.38 ($false = (sK1 = sK6)) | ($false = (sK1 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f103])).
% 0.21/0.38 thf(f103,plain,(
% 0.21/0.38 ($false = ((sK0 = sK6) | (sK1 = sK6))) | ($false = (sK1 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f101])).
% 0.21/0.38 thf(f101,plain,(
% 0.21/0.38 ($false = ((sK1 = sK6) | (sK0 = sK6))) | ($false = ((sK0 = sK6) | (sK1 = sK6)))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f99])).
% 0.21/0.38 thf(f99,plain,(
% 0.21/0.38 (((sK0 = sK6) | (sK1 = sK6)) != ((sK1 = sK6) | (sK0 = sK6)))),
% 0.21/0.38 inference(beta_eta_normalization,[],[f98])).
% 0.21/0.38 thf(f98,plain,(
% 0.21/0.38 (((^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))) @ sK6) != ((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) @ sK6))),
% 0.21/0.38 inference(negative_extensionality,[],[f97])).
% 0.21/0.38 thf(f97,plain,(
% 0.21/0.38 ((^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0))) != (^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0))))),
% 0.21/0.38 inference(equality_resolution,[],[f65])).
% 0.21/0.38 thf(f65,plain,(
% 0.21/0.38 ((sup @ (^[Y0 : $i]: ((sK1 = Y0) | (sK0 = Y0)))) != (sup @ (^[Y0 : $i]: ((sK0 = Y0) | (sK1 = Y0)))))),
% 0.21/0.38 inference(beta_eta_normalization,[],[f57])).
% 0.21/0.38 thf(f57,plain,(
% 0.21/0.38 (((^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))) @ sK1 @ sK0) != ((^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))) @ sK0 @ sK1))),
% 0.21/0.38 inference(definition_unfolding,[],[f45,f55,f55])).
% 0.21/0.38 thf(f55,plain,(
% 0.21/0.38 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y0) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2 = Y3)))) @ Y1)))))))),
% 0.21/0.38 inference(definition_unfolding,[],[f46,f42,f39,f39])).
% 0.21/0.38 thf(f39,plain,(
% 0.21/0.38 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.21/0.38 inference(cnf_transformation,[],[f26])).
% 0.21/0.38 thf(f26,plain,(
% 0.21/0.38 (singleton = (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))))),
% 0.21/0.38 inference(fool_elimination,[],[f25])).
% 0.21/0.38 thf(f25,plain,(
% 0.21/0.38 ((^[X0 : $i, X1 : $i] : ((X0 = X1))) = singleton)),
% 0.21/0.38 inference(rectify,[],[f3])).
% 0.21/0.38 thf(f3,axiom,(
% 0.21/0.38 ((^[X0 : $i, X2 : $i] : ((X0 = X2))) = singleton)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_def)).
% 0.21/0.38 thf(f42,plain,(
% 0.21/0.38 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f31])).
% 0.21/0.38 thf(f31,plain,(
% 0.21/0.38 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.21/0.38 inference(fool_elimination,[],[f30])).
% 0.21/0.38 thf(f30,plain,(
% 0.21/0.38 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = union)),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,axiom,(
% 0.21/0.38 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = union)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_def)).
% 0.21/0.38 thf(f46,plain,(
% 0.21/0.38 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ (union @ (singleton @ Y0) @ (singleton @ Y1)))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f29])).
% 0.21/0.38 thf(f29,plain,(
% 0.21/0.38 (addition = (^[Y0 : $i]: ((^[Y1 : $i]: (sup @ (union @ (singleton @ Y0) @ (singleton @ Y1)))))))),
% 0.21/0.38 inference(fool_elimination,[],[f9])).
% 0.21/0.38 thf(f9,axiom,(
% 0.21/0.38 ((^[X0 : $i, X1 : $i] : (sup @ (union @ (singleton @ X0) @ (singleton @ X1)))) = addition)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',addition_def)).
% 0.21/0.38 thf(f45,plain,(
% 0.21/0.38 ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.21/0.38 inference(cnf_transformation,[],[f36])).
% 0.21/0.38 thf(f36,plain,(
% 0.21/0.38 ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f34,f35])).
% 0.21/0.38 thf(f35,plain,(
% 0.21/0.38 ? [X0,X1] : ((addition @ X0 @ X1) != (addition @ X1 @ X0)) => ((addition @ sK1 @ sK0) != (addition @ sK0 @ sK1))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f34,plain,(
% 0.21/0.38 ? [X0,X1] : ((addition @ X0 @ X1) != (addition @ X1 @ X0))),
% 0.21/0.38 inference(ennf_transformation,[],[f32])).
% 0.21/0.38 thf(f32,plain,(
% 0.21/0.38 ~! [X0,X1] : ((addition @ X0 @ X1) = (addition @ X1 @ X0))),
% 0.21/0.38 inference(rectify,[],[f16])).
% 0.21/0.38 thf(f16,negated_conjecture,(
% 0.21/0.38 ~! [X5,X4] : ((addition @ X4 @ X5) = (addition @ X5 @ X4))),
% 0.21/0.38 inference(negated_conjecture,[],[f15])).
% 0.21/0.38 thf(f15,conjecture,(
% 0.21/0.38 ! [X5,X4] : ((addition @ X4 @ X5) = (addition @ X5 @ X4))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',addition_comm)).
% 0.21/0.38 thf(f134,plain,(
% 0.21/0.38 ~spl2_2),
% 0.21/0.38 inference(avatar_split_clause,[],[f113,f129])).
% 0.21/0.38 thf(f129,plain,(
% 0.21/0.38 spl2_2 <=> (sK6 = sK0)),
% 0.21/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.21/0.38 thf(f113,plain,(
% 0.21/0.38 (sK6 != sK0)),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f112])).
% 0.21/0.38 thf(f112,plain,(
% 0.21/0.38 ($false = (sK0 = sK6))),
% 0.21/0.38 inference(duplicate_literal_removal,[],[f111])).
% 0.21/0.38 thf(f111,plain,(
% 0.21/0.38 ($false = (sK0 = sK6)) | ($false = (sK0 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f102])).
% 0.21/0.38 thf(f102,plain,(
% 0.21/0.38 ($false = ((sK0 = sK6) | (sK1 = sK6))) | ($false = (sK0 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f101])).
% 0.21/0.38 thf(f132,plain,(
% 0.21/0.38 spl2_1 | spl2_2),
% 0.21/0.38 inference(avatar_split_clause,[],[f123,f129,f125])).
% 0.21/0.38 thf(f123,plain,(
% 0.21/0.38 (sK6 = sK1) | (sK6 = sK0)),
% 0.21/0.38 inference(duplicate_literal_removal,[],[f122])).
% 0.21/0.38 thf(f122,plain,(
% 0.21/0.38 (sK6 = sK1) | (sK6 = sK0) | (sK6 = sK0)),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f121])).
% 0.21/0.38 thf(f121,plain,(
% 0.21/0.38 (sK6 = sK0) | ($true = (sK0 = sK6)) | (sK6 = sK1)),
% 0.21/0.38 inference(duplicate_literal_removal,[],[f120])).
% 0.21/0.38 thf(f120,plain,(
% 0.21/0.38 (sK6 = sK0) | ($true = (sK0 = sK6)) | (sK6 = sK1) | (sK6 = sK1)),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f119])).
% 0.21/0.38 thf(f119,plain,(
% 0.21/0.38 (sK6 = sK1) | (sK6 = sK0) | ($true = (sK1 = sK6)) | ($true = (sK0 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f118])).
% 0.21/0.38 thf(f118,plain,(
% 0.21/0.38 ($true = ((sK1 = sK6) | (sK0 = sK6))) | (sK6 = sK1) | (sK6 = sK0)),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f117])).
% 0.21/0.38 thf(f117,plain,(
% 0.21/0.38 (sK6 = sK0) | ($true = (sK1 = sK6)) | ($true = ((sK1 = sK6) | (sK0 = sK6)))),
% 0.21/0.38 inference(equality_proxy_clausification,[],[f116])).
% 0.21/0.38 thf(f116,plain,(
% 0.21/0.38 ($true = (sK0 = sK6)) | ($true = ((sK1 = sK6) | (sK0 = sK6))) | ($true = (sK1 = sK6))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f100])).
% 0.21/0.38 thf(f100,plain,(
% 0.21/0.38 (((sK0 = sK6) | (sK1 = sK6)) = $true) | ($true = ((sK1 = sK6) | (sK0 = sK6)))),
% 0.21/0.38 inference(binary_proxy_clausification,[],[f99])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (2450)------------------------------
% 0.21/0.38 % (2450)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (2450)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (2450)Memory used [KB]: 5628
% 0.21/0.38 % (2450)Time elapsed: 0.012 s
% 0.21/0.38 % (2450)Instructions burned: 11 (million)
% 0.21/0.38 % (2450)------------------------------
% 0.21/0.38 % (2450)------------------------------
% 0.21/0.38 % (2443)Success in time 0.023 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------