TSTP Solution File: SEU771^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU771^2 : TPTP v8.2.0. Released v3.7.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 03:51:24 EDT 2024
% Result : Theorem 0.23s 0.39s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU771^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/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 : n004.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 : Sun May 19 15:58:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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.23/0.38 % (14151)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.23/0.38 % (14154)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.23/0.38 % (14153)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.23/0.38 % (14155)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.23/0.38 % (14156)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.23/0.38 % (14157)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.38 % (14152)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.23/0.38 % (14158)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.23/0.38 % (14154)Instruction limit reached!
% 0.23/0.38 % (14154)------------------------------
% 0.23/0.38 % (14154)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (14154)Termination reason: Unknown
% 0.23/0.38 % (14155)Instruction limit reached!
% 0.23/0.38 % (14155)------------------------------
% 0.23/0.38 % (14155)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (14154)Termination phase: Property scanning
% 0.23/0.38
% 0.23/0.38 % (14154)Memory used [KB]: 895
% 0.23/0.38 % (14154)Time elapsed: 0.003 s
% 0.23/0.38 % (14154)Instructions burned: 2 (million)
% 0.23/0.38 % (14154)------------------------------
% 0.23/0.38 % (14154)------------------------------
% 0.23/0.38 % (14155)Termination reason: Unknown
% 0.23/0.38 % (14155)Termination phase: shuffling
% 0.23/0.38
% 0.23/0.38 % (14155)Memory used [KB]: 895
% 0.23/0.38 % (14155)Time elapsed: 0.003 s
% 0.23/0.38 % (14155)Instructions burned: 2 (million)
% 0.23/0.38 % (14155)------------------------------
% 0.23/0.38 % (14155)------------------------------
% 0.23/0.39 % (14158)Instruction limit reached!
% 0.23/0.39 % (14158)------------------------------
% 0.23/0.39 % (14158)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (14158)Termination reason: Unknown
% 0.23/0.39 % (14158)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (14158)Memory used [KB]: 5500
% 0.23/0.39 % (14157)First to succeed.
% 0.23/0.39 % (14158)Time elapsed: 0.004 s
% 0.23/0.39 % (14158)Instructions burned: 3 (million)
% 0.23/0.39 % (14158)------------------------------
% 0.23/0.39 % (14158)------------------------------
% 0.23/0.39 % (14152)Instruction limit reached!
% 0.23/0.39 % (14152)------------------------------
% 0.23/0.39 % (14152)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (14152)Termination reason: Unknown
% 0.23/0.39 % (14152)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (14152)Memory used [KB]: 5500
% 0.23/0.39 % (14152)Time elapsed: 0.005 s
% 0.23/0.39 % (14152)Instructions burned: 4 (million)
% 0.23/0.39 % (14152)------------------------------
% 0.23/0.39 % (14152)------------------------------
% 0.23/0.39 % (14156)Also succeeded, but the first one will report.
% 0.23/0.39 % (14157)Refutation found. Thanks to Tanya!
% 0.23/0.39 % SZS status Theorem for theBenchmark
% 0.23/0.39 % SZS output start Proof for theBenchmark
% 0.23/0.39 thf(func_def_0, type, subset: $i > $i > $o).
% 0.23/0.39 thf(func_def_1, type, cartprod: $i > $i > $i).
% 0.23/0.39 thf(func_def_2, type, breln: $i > $i > $i > $o).
% 0.23/0.39 thf(func_def_4, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.23/0.39 thf(func_def_6, type, breln1: $i > $i > $o).
% 0.23/0.39 thf(func_def_13, type, sK0: $i > $i > $o).
% 0.23/0.39 thf(func_def_17, type, sK4: $i > $i > $o).
% 0.23/0.39 thf(f34,plain,(
% 0.23/0.39 $false),
% 0.23/0.39 inference(subsumption_resolution,[],[f31,f33])).
% 0.23/0.39 thf(f33,plain,(
% 0.23/0.39 ( ! [X3 : $i > $i > $o,X4 : $i,X5 : $i] : (($true = (subset @ (dpsetconstr @ X4 @ X5 @ X3) @ (cartprod @ X4 @ X5)))) )),
% 0.23/0.39 inference(beta_eta_normalization,[],[f32])).
% 0.23/0.39 thf(f32,plain,(
% 0.23/0.39 ( ! [X3 : $i > $i > $o,X4 : $i,X5 : $i] : (($true = ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))) @ X4 @ X5 @ (dpsetconstr @ X4 @ X5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1)))))))) )),
% 0.23/0.39 inference(trivial_inequality_removal,[],[f29])).
% 0.23/0.39 thf(f29,plain,(
% 0.23/0.39 ( ! [X3 : $i > $i > $o,X4 : $i,X5 : $i] : (($true = ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))) @ X4 @ X5 @ (dpsetconstr @ X4 @ X5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))) | ($true != $true)) )),
% 0.23/0.39 inference(definition_unfolding,[],[f21,f26,f23])).
% 0.23/0.39 thf(f23,plain,(
% 0.23/0.39 (setOfPairsIsBReln = $true)),
% 0.23/0.39 inference(cnf_transformation,[],[f20])).
% 0.23/0.39 thf(f20,plain,(
% 0.23/0.39 ((breln1 @ sK3 @ (dpsetconstr @ sK3 @ sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK4 @ Y0 @ Y1)))))) != $true) & (setOfPairsIsBReln = $true)),
% 0.23/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f14,f19])).
% 0.23/0.39 thf(f19,plain,(
% 0.23/0.39 ? [X0,X1 : $i > $i > $o] : ($true != (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X1 @ Y0 @ Y1))))))) => ((breln1 @ sK3 @ (dpsetconstr @ sK3 @ sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK4 @ Y0 @ Y1)))))) != $true)),
% 0.23/0.39 introduced(choice_axiom,[])).
% 0.23/0.39 thf(f14,plain,(
% 0.23/0.39 ? [X0,X1 : $i > $i > $o] : ($true != (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X1 @ Y0 @ Y1))))))) & (setOfPairsIsBReln = $true)),
% 0.23/0.39 inference(ennf_transformation,[],[f11])).
% 0.23/0.39 thf(f11,plain,(
% 0.23/0.39 ~((setOfPairsIsBReln = $true) => ! [X0,X1 : $i > $i > $o] : ($true = (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X1 @ Y0 @ Y1))))))))),
% 0.23/0.39 inference(fool_elimination,[],[f10])).
% 0.23/0.39 thf(f10,plain,(
% 0.23/0.39 ~(setOfPairsIsBReln => ! [X0,X1 : $i > $i > $o] : (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[X2 : $i, X3 : $i] : (X1 @ X2 @ X3)))))),
% 0.23/0.39 inference(rectify,[],[f5])).
% 0.23/0.39 thf(f5,negated_conjecture,(
% 0.23/0.39 ~(setOfPairsIsBReln => ! [X0,X3 : $i > $i > $o] : (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[X4 : $i, X5 : $i] : (X3 @ X4 @ X5)))))),
% 0.23/0.39 inference(negated_conjecture,[],[f4])).
% 0.23/0.39 thf(f4,conjecture,(
% 0.23/0.39 setOfPairsIsBReln => ! [X0,X3 : $i > $i > $o] : (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[X4 : $i, X5 : $i] : (X3 @ X4 @ X5))))),
% 0.23/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setOfPairsIsBReln1)).
% 0.23/0.39 thf(f26,plain,(
% 0.23/0.39 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.23/0.39 inference(cnf_transformation,[],[f7])).
% 0.23/0.39 thf(f7,plain,(
% 0.23/0.39 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.23/0.39 inference(fool_elimination,[],[f1])).
% 0.23/0.39 thf(f1,axiom,(
% 0.23/0.39 (breln = (^[X0 : $i, X1 : $i, X2 : $i] : (subset @ X2 @ (cartprod @ X0 @ X1))))),
% 0.23/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln)).
% 0.23/0.39 thf(f21,plain,(
% 0.23/0.39 ( ! [X3 : $i > $i > $o,X4 : $i,X5 : $i] : (($true = (breln @ X4 @ X5 @ (dpsetconstr @ X4 @ X5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))) | (setOfPairsIsBReln != $true)) )),
% 0.23/0.39 inference(cnf_transformation,[],[f18])).
% 0.23/0.39 thf(f18,plain,(
% 0.23/0.39 ((setOfPairsIsBReln = $true) | ((breln @ sK1 @ sK2 @ (dpsetconstr @ sK1 @ sK2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK0 @ Y0 @ Y1)))))) != $true)) & (! [X3 : $i > $i > $o,X4,X5] : ($true = (breln @ X4 @ X5 @ (dpsetconstr @ X4 @ X5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))) | (setOfPairsIsBReln != $true))),
% 0.23/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f17])).
% 0.23/0.39 thf(f17,plain,(
% 0.23/0.39 ? [X0 : $i > $i > $o,X1,X2] : ((breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) != $true) => ((breln @ sK1 @ sK2 @ (dpsetconstr @ sK1 @ sK2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK0 @ Y0 @ Y1)))))) != $true)),
% 0.23/0.39 introduced(choice_axiom,[])).
% 0.23/0.39 thf(f16,plain,(
% 0.23/0.39 ((setOfPairsIsBReln = $true) | ? [X0 : $i > $i > $o,X1,X2] : ((breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) != $true)) & (! [X3 : $i > $i > $o,X4,X5] : ($true = (breln @ X4 @ X5 @ (dpsetconstr @ X4 @ X5 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X3 @ Y0 @ Y1))))))) | (setOfPairsIsBReln != $true))),
% 0.23/0.39 inference(rectify,[],[f15])).
% 0.23/0.39 thf(f15,plain,(
% 0.23/0.39 ((setOfPairsIsBReln = $true) | ? [X0 : $i > $i > $o,X1,X2] : ((breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) != $true)) & (! [X0 : $i > $i > $o,X1,X2] : ((breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true) | (setOfPairsIsBReln != $true))),
% 0.23/0.39 inference(nnf_transformation,[],[f13])).
% 0.23/0.39 thf(f13,plain,(
% 0.23/0.39 (setOfPairsIsBReln = $true) <=> ! [X0 : $i > $i > $o,X1,X2] : ((breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[Y0 : $i]: ((^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true)),
% 0.23/0.39 inference(fool_elimination,[],[f12])).
% 0.23/0.39 thf(f12,plain,(
% 0.23/0.39 (setOfPairsIsBReln = ! [X0 : $i > $i > $o,X1,X2] : (breln @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (^[X3 : $i, X4 : $i] : (X0 @ X3 @ X4)))))),
% 0.23/0.39 inference(rectify,[],[f2])).
% 0.23/0.39 thf(f2,axiom,(
% 0.23/0.39 (setOfPairsIsBReln = ! [X3 : $i > $i > $o,X0,X1] : (breln @ X0 @ X1 @ (dpsetconstr @ X0 @ X1 @ (^[X4 : $i, X5 : $i] : (X3 @ X4 @ X5)))))),
% 0.23/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setOfPairsIsBReln)).
% 0.23/0.39 thf(f31,plain,(
% 0.23/0.39 ((subset @ (dpsetconstr @ sK3 @ sK3 @ sK4) @ (cartprod @ sK3 @ sK3)) != $true)),
% 0.23/0.39 inference(beta_eta_normalization,[],[f30])).
% 0.23/0.39 thf(f30,plain,(
% 0.23/0.39 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK3 @ (dpsetconstr @ sK3 @ sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK4 @ Y0 @ Y1)))))))),
% 0.23/0.39 inference(definition_unfolding,[],[f24,f27])).
% 0.23/0.39 thf(f27,plain,(
% 0.23/0.39 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))))),
% 0.23/0.39 inference(definition_unfolding,[],[f25,f26])).
% 0.23/0.39 thf(f25,plain,(
% 0.23/0.39 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.23/0.39 inference(cnf_transformation,[],[f9])).
% 0.23/0.39 thf(f9,plain,(
% 0.23/0.39 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.23/0.39 inference(fool_elimination,[],[f8])).
% 0.23/0.39 thf(f8,plain,(
% 0.23/0.39 (breln1 = (^[X0 : $i, X1 : $i] : (breln @ X0 @ X0 @ X1)))),
% 0.23/0.39 inference(rectify,[],[f3])).
% 0.23/0.39 thf(f3,axiom,(
% 0.23/0.39 (breln1 = (^[X0 : $i, X6 : $i] : (breln @ X0 @ X0 @ X6)))),
% 0.23/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1)).
% 0.23/0.39 thf(f24,plain,(
% 0.23/0.39 ((breln1 @ sK3 @ (dpsetconstr @ sK3 @ sK3 @ (^[Y0 : $i]: ((^[Y1 : $i]: (sK4 @ Y0 @ Y1)))))) != $true)),
% 0.23/0.39 inference(cnf_transformation,[],[f20])).
% 0.23/0.39 % SZS output end Proof for theBenchmark
% 0.23/0.39 % (14157)------------------------------
% 0.23/0.39 % (14157)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (14157)Termination reason: Refutation
% 0.23/0.39
% 0.23/0.39 % (14157)Memory used [KB]: 5500
% 0.23/0.39 % (14157)Time elapsed: 0.005 s
% 0.23/0.39 % (14157)Instructions burned: 3 (million)
% 0.23/0.39 % (14157)------------------------------
% 0.23/0.39 % (14157)------------------------------
% 0.23/0.39 % (14150)Success in time 0.01 s
% 0.23/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------