TSTP Solution File: SEU803^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU803^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 : n006.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:40 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU803^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 16:38:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 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.13/0.36 % (25257)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.13/0.36 % (25259)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.13/0.37 % (25252)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.13/0.37 % (25253)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.13/0.37 % (25254)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.13/0.37 % (25259)Instruction limit reached!
% 0.13/0.37 % (25259)------------------------------
% 0.13/0.37 % (25259)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25259)Termination reason: Unknown
% 0.13/0.37 % (25255)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (25259)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (25259)Memory used [KB]: 5500
% 0.13/0.37 % (25259)Time elapsed: 0.003 s
% 0.13/0.37 % (25259)Instructions burned: 3 (million)
% 0.13/0.37 % (25259)------------------------------
% 0.13/0.37 % (25259)------------------------------
% 0.13/0.37 % (25256)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.13/0.37 % (25257)Refutation not found, incomplete strategy
% 0.13/0.37 % (25257)------------------------------
% 0.13/0.37 % (25257)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25257)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37 % (25255)Instruction limit reached!
% 0.13/0.37 % (25255)------------------------------
% 0.13/0.37 % (25255)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25255)Termination reason: Unknown
% 0.13/0.37 % (25255)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (25255)Memory used [KB]: 895
% 0.13/0.37 % (25255)Time elapsed: 0.003 s
% 0.13/0.37 % (25255)Instructions burned: 2 (million)
% 0.13/0.37 % (25255)------------------------------
% 0.13/0.37 % (25255)------------------------------
% 0.13/0.37
% 0.13/0.37 % (25257)Memory used [KB]: 5500
% 0.13/0.37 % (25257)Time elapsed: 0.003 s
% 0.13/0.37 % (25257)Instructions burned: 2 (million)
% 0.13/0.37 % (25257)------------------------------
% 0.13/0.37 % (25257)------------------------------
% 0.13/0.37 % (25256)Instruction limit reached!
% 0.13/0.37 % (25256)------------------------------
% 0.13/0.37 % (25256)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25256)Termination reason: Unknown
% 0.13/0.37 % (25256)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (25256)Memory used [KB]: 895
% 0.13/0.37 % (25256)Time elapsed: 0.003 s
% 0.13/0.37 % (25256)Instructions burned: 2 (million)
% 0.13/0.37 % (25256)------------------------------
% 0.13/0.37 % (25256)------------------------------
% 0.13/0.37 % (25253)Instruction limit reached!
% 0.13/0.37 % (25253)------------------------------
% 0.13/0.37 % (25253)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25253)Termination reason: Unknown
% 0.13/0.37 % (25253)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (25253)Memory used [KB]: 5500
% 0.13/0.37 % (25253)Time elapsed: 0.005 s
% 0.13/0.37 % (25253)Instructions burned: 4 (million)
% 0.13/0.37 % (25253)------------------------------
% 0.13/0.37 % (25253)------------------------------
% 0.13/0.37 % (25252)First to succeed.
% 0.13/0.37 % (25252)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.37 thf(func_def_1, type, funcSet: $i > $i > $i).
% 0.13/0.37 thf(func_def_2, type, ap: $i > $i > $i > $i > $i).
% 0.13/0.37 thf(func_def_3, type, surjective: $i > $i > $i > $o).
% 0.13/0.37 thf(func_def_18, type, sK0: $i > $i).
% 0.13/0.37 thf(f38,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f37])).
% 0.13/0.37 thf(f37,plain,(
% 0.13/0.37 (sK5 != sK5) | ($true != $true)),
% 0.13/0.37 inference(superposition,[],[f36,f25])).
% 0.13/0.37 thf(f25,plain,(
% 0.13/0.37 ($true = (in @ sK5 @ sK2))),
% 0.13/0.37 inference(binary_proxy_clausification,[],[f23])).
% 0.13/0.37 thf(f23,plain,(
% 0.13/0.37 ($false = ((in @ sK5 @ sK2) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ Y0) = sK5))))))),
% 0.13/0.37 inference(beta_eta_normalization,[],[f22])).
% 0.13/0.37 thf(f22,plain,(
% 0.13/0.37 (((^[Y0 : $i]: ((in @ Y0 @ sK2) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ Y1) = Y0)))))) @ sK5) = $false)),
% 0.13/0.37 inference(sigma_clausification,[],[f21])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 ($true != (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK2) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ Y1) = Y0))))))))),
% 0.13/0.37 inference(beta_eta_normalization,[],[f20])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ Y0) & ((ap @ Y0 @ Y1 @ Y2 @ Y4) = Y3)))))))))))) @ sK1 @ sK2 @ sK3) != $true)),
% 0.13/0.37 inference(definition_unfolding,[],[f18,f19])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 (surjective = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ Y0) & ((ap @ Y0 @ Y1 @ Y2 @ Y4) = Y3)))))))))))))),
% 0.13/0.37 inference(cnf_transformation,[],[f8])).
% 0.13/0.37 thf(f8,plain,(
% 0.13/0.37 (surjective = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => (?? @ $i @ (^[Y4 : $i]: ((in @ Y4 @ Y0) & ((ap @ Y0 @ Y1 @ Y2 @ Y4) = Y3)))))))))))))),
% 0.13/0.37 inference(fool_elimination,[],[f7])).
% 0.13/0.37 thf(f7,plain,(
% 0.13/0.37 (surjective = (^[X0 : $i, X1 : $i, X2 : $i] : (! [X3] : ((in @ X3 @ X1) => ? [X4] : (((ap @ X0 @ X1 @ X2 @ X4) = X3) & (in @ X4 @ X0))))))),
% 0.13/0.37 inference(rectify,[],[f1])).
% 0.13/0.37 thf(f1,axiom,(
% 0.13/0.37 (surjective = (^[X0 : $i, X1 : $i, X2 : $i] : (! [X3] : ((in @ X3 @ X1) => ? [X4] : (((ap @ X0 @ X1 @ X2 @ X4) = X3) & (in @ X4 @ X0))))))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjective)).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 ($true != (surjective @ sK1 @ sK2 @ sK3))),
% 0.13/0.37 inference(cnf_transformation,[],[f14])).
% 0.13/0.37 thf(f14,plain,(
% 0.13/0.37 (($true != (surjective @ sK1 @ sK2 @ sK3)) & ! [X4] : (((ap @ sK1 @ sK2 @ sK3 @ (sK0 @ X4)) = X4) | ($true != (in @ X4 @ sK2))) & ((in @ sK3 @ (funcSet @ sK1 @ sK2)) = $true)) & ! [X5] : (($true != (in @ X5 @ sK2)) | ((in @ (sK0 @ X5) @ sK1) = $true))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f11,f13,f12])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 ? [X0 : $i > $i,X1,X2] : (? [X3] : (($true != (surjective @ X1 @ X2 @ X3)) & ! [X4] : (((ap @ X1 @ X2 @ X3 @ (X0 @ X4)) = X4) | ((in @ X4 @ X2) != $true)) & ($true = (in @ X3 @ (funcSet @ X1 @ X2)))) & ! [X5] : (($true != (in @ X5 @ X2)) | ((in @ (X0 @ X5) @ X1) = $true))) => (? [X3] : (($true != (surjective @ sK1 @ sK2 @ X3)) & ! [X4] : (((ap @ sK1 @ sK2 @ X3 @ (sK0 @ X4)) = X4) | ($true != (in @ X4 @ sK2))) & ($true = (in @ X3 @ (funcSet @ sK1 @ sK2)))) & ! [X5] : (($true != (in @ X5 @ sK2)) | ((in @ (sK0 @ X5) @ sK1) = $true)))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 ? [X3] : (($true != (surjective @ sK1 @ sK2 @ X3)) & ! [X4] : (((ap @ sK1 @ sK2 @ X3 @ (sK0 @ X4)) = X4) | ($true != (in @ X4 @ sK2))) & ($true = (in @ X3 @ (funcSet @ sK1 @ sK2)))) => (($true != (surjective @ sK1 @ sK2 @ sK3)) & ! [X4] : (((ap @ sK1 @ sK2 @ sK3 @ (sK0 @ X4)) = X4) | ($true != (in @ X4 @ sK2))) & ((in @ sK3 @ (funcSet @ sK1 @ sK2)) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 ? [X0 : $i > $i,X1,X2] : (? [X3] : (($true != (surjective @ X1 @ X2 @ X3)) & ! [X4] : (((ap @ X1 @ X2 @ X3 @ (X0 @ X4)) = X4) | ((in @ X4 @ X2) != $true)) & ($true = (in @ X3 @ (funcSet @ X1 @ X2)))) & ! [X5] : (($true != (in @ X5 @ X2)) | ((in @ (X0 @ X5) @ X1) = $true)))),
% 0.13/0.37 inference(rectify,[],[f10])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 ? [X0 : $i > $i,X1,X2] : (? [X4] : (((surjective @ X1 @ X2 @ X4) != $true) & ! [X5] : (((ap @ X1 @ X2 @ X4 @ (X0 @ X5)) = X5) | ($true != (in @ X5 @ X2))) & ((in @ X4 @ (funcSet @ X1 @ X2)) = $true)) & ! [X3] : (($true != (in @ X3 @ X2)) | ($true = (in @ (X0 @ X3) @ X1))))),
% 0.13/0.37 inference(flattening,[],[f9])).
% 0.13/0.37 thf(f9,plain,(
% 0.13/0.37 ? [X0 : $i > $i,X1,X2] : (? [X4] : ((((surjective @ X1 @ X2 @ X4) != $true) & ! [X5] : (((ap @ X1 @ X2 @ X4 @ (X0 @ X5)) = X5) | ($true != (in @ X5 @ X2)))) & ((in @ X4 @ (funcSet @ X1 @ X2)) = $true)) & ! [X3] : (($true != (in @ X3 @ X2)) | ($true = (in @ (X0 @ X3) @ X1))))),
% 0.13/0.37 inference(ennf_transformation,[],[f6])).
% 0.13/0.37 thf(f6,plain,(
% 0.13/0.37 ~! [X0 : $i > $i,X1,X2] : (! [X3] : (($true = (in @ X3 @ X2)) => ($true = (in @ (X0 @ X3) @ X1))) => ! [X4] : (((in @ X4 @ (funcSet @ X1 @ X2)) = $true) => (! [X5] : (($true = (in @ X5 @ X2)) => ((ap @ X1 @ X2 @ X4 @ (X0 @ X5)) = X5)) => ((surjective @ X1 @ X2 @ X4) = $true))))),
% 0.13/0.37 inference(fool_elimination,[],[f5])).
% 0.13/0.37 thf(f5,plain,(
% 0.13/0.37 ~! [X0 : $i > $i,X1,X2] : (! [X3] : ((in @ X3 @ X2) => (in @ (X0 @ X3) @ X1)) => ! [X4] : ((in @ X4 @ (funcSet @ X1 @ X2)) => (! [X5] : ((in @ X5 @ X2) => ((ap @ X1 @ X2 @ X4 @ (X0 @ X5)) = X5)) => (surjective @ X1 @ X2 @ X4))))),
% 0.13/0.37 inference(rectify,[],[f3])).
% 0.13/0.37 thf(f3,negated_conjecture,(
% 0.13/0.37 ~! [X2 : $i > $i,X1,X0] : (! [X3] : ((in @ X3 @ X0) => (in @ (X2 @ X3) @ X1)) => ! [X5] : ((in @ X5 @ (funcSet @ X1 @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((ap @ X1 @ X0 @ X5 @ (X2 @ X3)) = X3)) => (surjective @ X1 @ X0 @ X5))))),
% 0.13/0.37 inference(negated_conjecture,[],[f2])).
% 0.13/0.37 thf(f2,conjecture,(
% 0.13/0.37 ! [X2 : $i > $i,X1,X0] : (! [X3] : ((in @ X3 @ X0) => (in @ (X2 @ X3) @ X1)) => ! [X5] : ((in @ X5 @ (funcSet @ X1 @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((ap @ X1 @ X0 @ X5 @ (X2 @ X3)) = X3)) => (surjective @ X1 @ X0 @ X5))))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leftInvIsSurj)).
% 0.13/0.37 thf(f36,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (($true != (in @ X0 @ sK2)) | (sK5 != X0)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f35])).
% 0.13/0.37 thf(f35,plain,(
% 0.13/0.37 ( ! [X0 : $i] : ((sK5 != X0) | ($false = $true) | ($true != (in @ X0 @ sK2))) )),
% 0.13/0.37 inference(duplicate_literal_removal,[],[f32])).
% 0.13/0.37 thf(f32,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (($false = $true) | (sK5 != X0) | ($true != (in @ X0 @ sK2)) | ($true != (in @ X0 @ sK2))) )),
% 0.13/0.37 inference(superposition,[],[f15,f30])).
% 0.13/0.37 thf(f30,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (($false = (in @ (sK0 @ X0) @ sK1)) | (sK5 != X0) | ($true != (in @ X0 @ sK2))) )),
% 0.13/0.37 inference(superposition,[],[f29,f17])).
% 0.13/0.37 thf(f17,plain,(
% 0.13/0.37 ( ! [X4 : $i] : (((ap @ sK1 @ sK2 @ sK3 @ (sK0 @ X4)) = X4) | ($true != (in @ X4 @ sK2))) )),
% 0.13/0.37 inference(cnf_transformation,[],[f14])).
% 0.13/0.37 thf(f29,plain,(
% 0.13/0.37 ( ! [X1 : $i] : (((ap @ sK1 @ sK2 @ sK3 @ X1) != sK5) | ((in @ X1 @ sK1) = $false)) )),
% 0.13/0.37 inference(equality_proxy_clausification,[],[f28])).
% 0.13/0.37 thf(f28,plain,(
% 0.13/0.37 ( ! [X1 : $i] : (($false = ((ap @ sK1 @ sK2 @ sK3 @ X1) = sK5)) | ((in @ X1 @ sK1) = $false)) )),
% 0.13/0.37 inference(binary_proxy_clausification,[],[f27])).
% 0.13/0.37 thf(f27,plain,(
% 0.13/0.37 ( ! [X1 : $i] : (($false = ((in @ X1 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ X1) = sK5)))) )),
% 0.13/0.37 inference(beta_eta_normalization,[],[f26])).
% 0.13/0.37 thf(f26,plain,(
% 0.13/0.37 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((in @ Y0 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ Y0) = sK5))) @ X1))) )),
% 0.13/0.37 inference(pi_clausification,[],[f24])).
% 0.13/0.37 thf(f24,plain,(
% 0.13/0.37 ($false = (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sK1) & ((ap @ sK1 @ sK2 @ sK3 @ Y0) = sK5)))))),
% 0.13/0.37 inference(binary_proxy_clausification,[],[f23])).
% 0.13/0.37 thf(f15,plain,(
% 0.13/0.37 ( ! [X5 : $i] : (((in @ (sK0 @ X5) @ sK1) = $true) | ($true != (in @ X5 @ sK2))) )),
% 0.13/0.37 inference(cnf_transformation,[],[f14])).
% 0.13/0.37 % SZS output end Proof for theBenchmark
% 0.13/0.37 % (25252)------------------------------
% 0.13/0.37 % (25252)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25252)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (25252)Memory used [KB]: 5500
% 0.13/0.37 % (25252)Time elapsed: 0.007 s
% 0.13/0.37 % (25252)Instructions burned: 4 (million)
% 0.13/0.37 % (25252)------------------------------
% 0.13/0.37 % (25252)------------------------------
% 0.13/0.37 % (25251)Success in time 0.012 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------