TSTP Solution File: SEU775^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU775^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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:26 EDT 2024
% Result : Theorem 0.12s 0.38s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU775^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.12/0.35 % Computer : n023.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 17:37:23 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/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.12/0.37 % (29589)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.12/0.37 % (29587)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.12/0.37 % (29590)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.37 % (29592)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.12/0.37 % (29591)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.12/0.37 % (29593)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.37 % (29594)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.12/0.37 % (29590)Instruction limit reached!
% 0.12/0.37 % (29590)------------------------------
% 0.12/0.37 % (29590)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37 % (29590)Termination reason: Unknown
% 0.12/0.37 % (29590)Termination phase: Property scanning
% 0.12/0.37 % (29591)Instruction limit reached!
% 0.12/0.37 % (29591)------------------------------
% 0.12/0.37 % (29591)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37
% 0.12/0.37 % (29590)Memory used [KB]: 895
% 0.12/0.37 % (29590)Time elapsed: 0.003 s
% 0.12/0.37 % (29590)Instructions burned: 2 (million)
% 0.12/0.37 % (29590)------------------------------
% 0.12/0.37 % (29590)------------------------------
% 0.12/0.37 % (29591)Termination reason: Unknown
% 0.12/0.37 % (29591)Termination phase: Property scanning
% 0.12/0.37
% 0.12/0.37 % (29591)Memory used [KB]: 895
% 0.12/0.37 % (29591)Time elapsed: 0.003 s
% 0.12/0.37 % (29591)Instructions burned: 2 (million)
% 0.12/0.37 % (29591)------------------------------
% 0.12/0.37 % (29591)------------------------------
% 0.12/0.37 % (29588)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.12/0.37 % (29594)Instruction limit reached!
% 0.12/0.37 % (29594)------------------------------
% 0.12/0.37 % (29594)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37 % (29594)Termination reason: Unknown
% 0.12/0.37 % (29594)Termination phase: Saturation
% 0.12/0.37
% 0.12/0.37 % (29594)Memory used [KB]: 5500
% 0.12/0.37 % (29594)Time elapsed: 0.004 s
% 0.12/0.37 % (29594)Instructions burned: 3 (million)
% 0.12/0.37 % (29594)------------------------------
% 0.12/0.37 % (29594)------------------------------
% 0.12/0.37 % (29587)First to succeed.
% 0.12/0.37 % (29592)Refutation not found, incomplete strategy
% 0.12/0.37 % (29592)------------------------------
% 0.12/0.37 % (29592)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37 % (29592)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 % (29592)Memory used [KB]: 5500
% 0.12/0.37 % (29592)Time elapsed: 0.004 s
% 0.12/0.37 % (29592)Instructions burned: 3 (million)
% 0.12/0.37 % (29592)------------------------------
% 0.12/0.37 % (29592)------------------------------
% 0.12/0.38 % (29593)Also succeeded, but the first one will report.
% 0.12/0.38 % (29587)Refutation found. Thanks to Tanya!
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38 % SZS output start Proof for theBenchmark
% 0.12/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.12/0.38 thf(func_def_1, type, subset: $i > $i > $o).
% 0.12/0.38 thf(func_def_2, type, kpair: $i > $i > $i).
% 0.12/0.38 thf(func_def_3, type, cartprod: $i > $i > $i).
% 0.12/0.38 thf(func_def_4, type, breln: $i > $i > $i > $o).
% 0.12/0.38 thf(func_def_6, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.12/0.38 thf(func_def_7, type, breln1: $i > $i > $o).
% 0.12/0.38 thf(func_def_9, type, breln1invset: $i > $i > $i).
% 0.12/0.38 thf(f38,plain,(
% 0.12/0.38 $false),
% 0.12/0.38 inference(subsumption_resolution,[],[f31,f36])).
% 0.12/0.38 thf(f36,plain,(
% 0.12/0.38 ( ! [X2 : $i > $i > $o,X1 : $i] : (($true = (subset @ (dpsetconstr @ X1 @ X1 @ X2) @ (cartprod @ X1 @ X1)))) )),
% 0.12/0.38 inference(beta_eta_normalization,[],[f35])).
% 0.12/0.38 thf(f35,plain,(
% 0.12/0.38 ( ! [X2 : $i > $i > $o,X1 : $i] : ((((^[Y0 : $i > $i > $o]: (subset @ (dpsetconstr @ X1 @ X1 @ Y0) @ (cartprod @ X1 @ X1))) @ X2) = $true)) )),
% 0.12/0.38 inference(pi_clausification,[],[f34])).
% 0.12/0.38 thf(f34,plain,(
% 0.12/0.38 ( ! [X1 : $i] : (($true = (!! @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (subset @ (dpsetconstr @ X1 @ X1 @ Y0) @ (cartprod @ X1 @ X1)))))) )),
% 0.12/0.38 inference(beta_eta_normalization,[],[f33])).
% 0.12/0.38 thf(f33,plain,(
% 0.12/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (subset @ (dpsetconstr @ Y0 @ Y0 @ Y1) @ (cartprod @ Y0 @ Y0))))) @ X1) = $true)) )),
% 0.12/0.38 inference(pi_clausification,[],[f32])).
% 0.12/0.38 thf(f32,plain,(
% 0.12/0.38 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (subset @ (dpsetconstr @ Y0 @ Y0 @ Y1) @ (cartprod @ Y0 @ Y0)))))))),
% 0.12/0.38 inference(beta_eta_normalization,[],[f30])).
% 0.12/0.38 thf(f30,plain,(
% 0.12/0.38 ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: ((^[Y5 : $i]: ((^[Y6 : $i]: (subset @ Y6 @ (cartprod @ Y4 @ Y5))))))) @ Y2 @ Y2 @ Y3)))) @ Y0 @ (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (Y1 @ Y2 @ Y3)))))))))) = $true)),
% 0.12/0.38 inference(definition_unfolding,[],[f25,f23,f27])).
% 0.12/0.38 thf(f27,plain,(
% 0.12/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))))),
% 0.12/0.38 inference(definition_unfolding,[],[f24,f20])).
% 0.12/0.38 thf(f20,plain,(
% 0.12/0.38 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.12/0.38 inference(cnf_transformation,[],[f8])).
% 0.12/0.38 thf(f8,plain,(
% 0.12/0.38 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 0.12/0.38 inference(fool_elimination,[],[f1])).
% 0.12/0.38 thf(f1,axiom,(
% 0.12/0.38 (breln = (^[X0 : $i, X1 : $i, X2 : $i] : (subset @ X2 @ (cartprod @ X0 @ X1))))),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln)).
% 0.12/0.38 thf(f24,plain,(
% 0.12/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.12/0.38 inference(cnf_transformation,[],[f14])).
% 0.12/0.38 thf(f14,plain,(
% 0.12/0.38 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 0.12/0.38 inference(fool_elimination,[],[f13])).
% 0.12/0.38 thf(f13,plain,(
% 0.12/0.38 ((^[X0 : $i, X1 : $i] : (breln @ X0 @ X0 @ X1)) = breln1)),
% 0.12/0.38 inference(rectify,[],[f2])).
% 0.12/0.38 thf(f2,axiom,(
% 0.12/0.38 ((^[X0 : $i, X3 : $i] : (breln @ X0 @ X0 @ X3)) = breln1)),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1)).
% 0.12/0.38 thf(f23,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = $true)),
% 0.12/0.38 inference(cnf_transformation,[],[f19])).
% 0.12/0.38 thf(f19,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = $true) & (((breln1 @ sK0 @ (breln1invset @ sK0 @ sK1)) != $true) & ((breln1 @ sK0 @ sK1) = $true))),
% 0.12/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18])).
% 0.12/0.38 thf(f18,plain,(
% 0.12/0.38 ? [X0,X1] : (($true != (breln1 @ X0 @ (breln1invset @ X0 @ X1))) & ((breln1 @ X0 @ X1) = $true)) => (((breln1 @ sK0 @ (breln1invset @ sK0 @ sK1)) != $true) & ((breln1 @ sK0 @ sK1) = $true))),
% 0.12/0.38 introduced(choice_axiom,[])).
% 0.12/0.38 thf(f17,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = $true) & ? [X0,X1] : (($true != (breln1 @ X0 @ (breln1invset @ X0 @ X1))) & ((breln1 @ X0 @ X1) = $true))),
% 0.12/0.38 inference(ennf_transformation,[],[f12])).
% 0.12/0.38 thf(f12,plain,(
% 0.12/0.38 ~((setOfPairsIsBReln1 = $true) => ! [X0,X1] : (((breln1 @ X0 @ X1) = $true) => ($true = (breln1 @ X0 @ (breln1invset @ X0 @ X1)))))),
% 0.12/0.38 inference(fool_elimination,[],[f11])).
% 0.12/0.38 thf(f11,plain,(
% 0.12/0.38 ~(setOfPairsIsBReln1 => ! [X0,X1] : ((breln1 @ X0 @ X1) => (breln1 @ X0 @ (breln1invset @ X0 @ X1))))),
% 0.12/0.38 inference(rectify,[],[f6])).
% 0.12/0.38 thf(f6,negated_conjecture,(
% 0.12/0.38 ~(setOfPairsIsBReln1 => ! [X0,X3] : ((breln1 @ X0 @ X3) => (breln1 @ X0 @ (breln1invset @ X0 @ X3))))),
% 0.12/0.38 inference(negated_conjecture,[],[f5])).
% 0.12/0.38 thf(f5,conjecture,(
% 0.12/0.38 setOfPairsIsBReln1 => ! [X0,X3] : ((breln1 @ X0 @ X3) => (breln1 @ X0 @ (breln1invset @ X0 @ X3)))),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1invprop)).
% 0.12/0.38 thf(f25,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (breln1 @ Y0 @ (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (Y1 @ Y2 @ Y3)))))))))))),
% 0.12/0.38 inference(cnf_transformation,[],[f10])).
% 0.12/0.38 thf(f10,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $i > $o) @ (^[Y1 : $i > $i > $o]: (breln1 @ Y0 @ (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (Y1 @ Y2 @ Y3)))))))))))),
% 0.12/0.38 inference(fool_elimination,[],[f9])).
% 0.12/0.38 thf(f9,plain,(
% 0.12/0.38 (setOfPairsIsBReln1 = ! [X0 : $i > $i > $o,X1] : (breln1 @ X1 @ (dpsetconstr @ X1 @ X1 @ (^[X2 : $i, X3 : $i] : (X0 @ X2 @ X3)))))),
% 0.12/0.38 inference(rectify,[],[f3])).
% 0.12/0.38 thf(f3,axiom,(
% 0.12/0.38 (setOfPairsIsBReln1 = ! [X4 : $i > $i > $o,X0] : (breln1 @ X0 @ (dpsetconstr @ X0 @ X0 @ (^[X5 : $i, X6 : $i] : (X4 @ X5 @ X6)))))),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setOfPairsIsBReln1)).
% 0.12/0.38 thf(f31,plain,(
% 0.12/0.38 ($true != (subset @ (dpsetconstr @ sK0 @ sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (in @ (kpair @ Y1 @ Y0) @ sK1))))) @ (cartprod @ sK0 @ sK0)))),
% 0.12/0.38 inference(beta_eta_normalization,[],[f28])).
% 0.12/0.38 thf(f28,plain,(
% 0.12/0.38 ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK0 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))) @ sK0 @ sK1)))),
% 0.12/0.38 inference(definition_unfolding,[],[f22,f27,f26])).
% 0.12/0.38 thf(f26,plain,(
% 0.12/0.38 (breln1invset = (^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))))),
% 0.12/0.38 inference(cnf_transformation,[],[f16])).
% 0.12/0.38 thf(f16,plain,(
% 0.12/0.38 (breln1invset = (^[Y0 : $i]: ((^[Y1 : $i]: (dpsetconstr @ Y0 @ Y0 @ (^[Y2 : $i]: ((^[Y3 : $i]: (in @ (kpair @ Y3 @ Y2) @ Y1)))))))))),
% 0.12/0.38 inference(fool_elimination,[],[f15])).
% 0.12/0.38 thf(f15,plain,(
% 0.12/0.38 ((^[X0 : $i, X1 : $i] : (dpsetconstr @ X0 @ X0 @ (^[X2 : $i, X3 : $i] : (in @ (kpair @ X3 @ X2) @ X1)))) = breln1invset)),
% 0.12/0.38 inference(rectify,[],[f4])).
% 0.12/0.38 thf(f4,axiom,(
% 0.12/0.38 ((^[X0 : $i, X3 : $i] : (dpsetconstr @ X0 @ X0 @ (^[X5 : $i, X6 : $i] : (in @ (kpair @ X6 @ X5) @ X3)))) = breln1invset)),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1invset)).
% 0.12/0.38 thf(f22,plain,(
% 0.12/0.38 ((breln1 @ sK0 @ (breln1invset @ sK0 @ sK1)) != $true)),
% 0.12/0.38 inference(cnf_transformation,[],[f19])).
% 0.12/0.38 % SZS output end Proof for theBenchmark
% 0.12/0.38 % (29587)------------------------------
% 0.12/0.38 % (29587)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.38 % (29587)Termination reason: Refutation
% 0.12/0.38
% 0.12/0.38 % (29587)Memory used [KB]: 5500
% 0.12/0.38 % (29587)Time elapsed: 0.005 s
% 0.12/0.38 % (29587)Instructions burned: 3 (million)
% 0.12/0.38 % (29587)------------------------------
% 0.12/0.38 % (29587)------------------------------
% 0.12/0.38 % (29586)Success in time 0.018 s
% 0.12/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------