TSTP Solution File: SEV396^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% 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 : Mon Jun 24 16:03:42 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.11/0.12 % Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 18:37:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/0.35 Running higher-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.37 % (18987)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 % (18986)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 % (18991)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 % (18988)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 % (18990)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 % (18989)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.37 % (18992)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 % (18990)Instruction limit reached!
% 0.12/0.37 % (18990)------------------------------
% 0.12/0.37 % (18990)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.37 % (18990)Termination reason: Unknown
% 0.12/0.37 % (18990)Termination phase: Saturation
% 0.12/0.37
% 0.12/0.37 % (18990)Memory used [KB]: 5500
% 0.12/0.37 % (18990)Time elapsed: 0.004 s
% 0.12/0.37 % (18990)Instructions burned: 2 (million)
% 0.12/0.37 % (18990)------------------------------
% 0.12/0.37 % (18990)------------------------------
% 0.12/0.37 % (18989)Instruction limit reached!
% 0.12/0.37 % (18989)------------------------------
% 0.12/0.37 % (18989)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.37 % (18989)Termination reason: Unknown
% 0.12/0.37 % (18989)Termination phase: Saturation
% 0.12/0.37
% 0.12/0.37 % (18989)Memory used [KB]: 5500
% 0.12/0.37 % (18989)Time elapsed: 0.005 s
% 0.12/0.37 % (18989)Instructions burned: 2 (million)
% 0.12/0.37 % (18989)------------------------------
% 0.12/0.37 % (18989)------------------------------
% 0.12/0.38 % (18991)First to succeed.
% 0.12/0.38 % (18987)Instruction limit reached!
% 0.12/0.38 % (18987)------------------------------
% 0.12/0.38 % (18987)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (18987)Termination reason: Unknown
% 0.12/0.38 % (18987)Termination phase: Saturation
% 0.12/0.38
% 0.12/0.38 % (18987)Memory used [KB]: 5500
% 0.12/0.38 % (18987)Time elapsed: 0.007 s
% 0.12/0.38 % (18987)Instructions burned: 5 (million)
% 0.12/0.38 % (18987)------------------------------
% 0.12/0.38 % (18987)------------------------------
% 0.12/0.38 % (18992)Also succeeded, but the first one will report.
% 0.12/0.38 % (18988)Also succeeded, but the first one will report.
% 0.12/0.38 % (18991)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, cR: $i > $o).
% 0.12/0.38 thf(func_def_1, type, cS: $i > $o).
% 0.12/0.38 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.12/0.38 thf(f84,plain,(
% 0.12/0.38 $false),
% 0.12/0.38 inference(avatar_sat_refutation,[],[f23,f28,f32,f52,f83])).
% 0.12/0.38 thf(f83,plain,(
% 0.12/0.38 ~spl1_1 | ~spl1_2 | spl1_3),
% 0.12/0.38 inference(avatar_contradiction_clause,[],[f82])).
% 0.12/0.38 thf(f82,plain,(
% 0.12/0.38 $false | (~spl1_1 | ~spl1_2 | spl1_3)),
% 0.12/0.38 inference(trivial_inequality_removal,[],[f77])).
% 0.12/0.38 thf(f77,plain,(
% 0.12/0.38 ($true = $false) | (~spl1_1 | ~spl1_2 | spl1_3)),
% 0.12/0.38 inference(superposition,[],[f22,f65])).
% 0.12/0.38 thf(f65,plain,(
% 0.12/0.38 ($false = (cR @ sK0)) | (~spl1_1 | spl1_3)),
% 0.12/0.38 inference(trivial_inequality_removal,[],[f64])).
% 0.12/0.38 thf(f64,plain,(
% 0.12/0.38 ($false = (cR @ sK0)) | ($true != $true) | (~spl1_1 | spl1_3)),
% 0.12/0.38 inference(superposition,[],[f27,f62])).
% 0.12/0.38 thf(f62,plain,(
% 0.12/0.38 ( ! [X1 : $i] : (($true = (cS @ X1)) | ($false = (cR @ X1))) ) | ~spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f59])).
% 0.12/0.38 thf(f59,plain,(
% 0.12/0.38 ( ! [X1 : $i] : ((((cR @ X1) & (cS @ X1)) = $true) | ($false = (cR @ X1))) ) | ~spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f58])).
% 0.12/0.38 thf(f58,plain,(
% 0.12/0.38 ( ! [X1 : $i] : ((((cR @ X1) & (cS @ X1)) = (cR @ X1))) ) | ~spl1_1),
% 0.12/0.38 inference(beta_eta_normalization,[],[f57])).
% 0.12/0.38 thf(f57,plain,(
% 0.12/0.38 ( ! [X1 : $i] : (((cR @ X1) = ((^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))) @ X1))) ) | ~spl1_1),
% 0.12/0.38 inference(argument_congruence,[],[f17])).
% 0.12/0.38 thf(f17,plain,(
% 0.12/0.38 (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ~spl1_1),
% 0.12/0.38 inference(avatar_component_clause,[],[f16])).
% 0.12/0.38 thf(f16,plain,(
% 0.12/0.38 spl1_1 <=> (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))),
% 0.12/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.12/0.38 thf(f27,plain,(
% 0.12/0.38 ($true != (cS @ sK0)) | spl1_3),
% 0.12/0.38 inference(avatar_component_clause,[],[f25])).
% 0.12/0.38 thf(f25,plain,(
% 0.12/0.38 spl1_3 <=> ($true = (cS @ sK0))),
% 0.12/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.12/0.38 thf(f22,plain,(
% 0.12/0.38 ($true = (cR @ sK0)) | ~spl1_2),
% 0.12/0.38 inference(avatar_component_clause,[],[f20])).
% 0.12/0.38 thf(f20,plain,(
% 0.12/0.38 spl1_2 <=> ($true = (cR @ sK0))),
% 0.12/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.12/0.38 thf(f52,plain,(
% 0.12/0.38 spl1_1 | ~spl1_4),
% 0.12/0.38 inference(avatar_contradiction_clause,[],[f51])).
% 0.12/0.38 thf(f51,plain,(
% 0.12/0.38 $false | (spl1_1 | ~spl1_4)),
% 0.12/0.38 inference(subsumption_resolution,[],[f47,f41])).
% 0.12/0.38 thf(f41,plain,(
% 0.12/0.38 ($true = (cR @ sK3)) | spl1_1),
% 0.12/0.38 inference(duplicate_literal_removal,[],[f40])).
% 0.12/0.38 thf(f40,plain,(
% 0.12/0.38 ($true = (cR @ sK3)) | ($true = (cR @ sK3)) | spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f35])).
% 0.12/0.38 thf(f35,plain,(
% 0.12/0.38 ($true = ((cR @ sK3) & (cS @ sK3))) | ($true = (cR @ sK3)) | spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f34])).
% 0.12/0.38 thf(f34,plain,(
% 0.12/0.38 (((cR @ sK3) & (cS @ sK3)) != (cR @ sK3)) | spl1_1),
% 0.12/0.38 inference(beta_eta_normalization,[],[f33])).
% 0.12/0.38 thf(f33,plain,(
% 0.12/0.38 (((^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))) @ sK3) != (cR @ sK3)) | spl1_1),
% 0.12/0.38 inference(negative_extensionality,[],[f18])).
% 0.12/0.38 thf(f18,plain,(
% 0.12/0.38 (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | spl1_1),
% 0.12/0.38 inference(avatar_component_clause,[],[f16])).
% 0.12/0.38 thf(f47,plain,(
% 0.12/0.38 ($true != (cR @ sK3)) | (spl1_1 | ~spl1_4)),
% 0.12/0.38 inference(trivial_inequality_removal,[],[f46])).
% 0.12/0.38 thf(f46,plain,(
% 0.12/0.38 ($true != (cR @ sK3)) | ($true = $false) | (spl1_1 | ~spl1_4)),
% 0.12/0.38 inference(superposition,[],[f31,f44])).
% 0.12/0.38 thf(f44,plain,(
% 0.12/0.38 ($false = (cS @ sK3)) | spl1_1),
% 0.12/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.12/0.38 thf(f43,plain,(
% 0.12/0.38 ($true = $false) | ($false = (cS @ sK3)) | spl1_1),
% 0.12/0.38 inference(forward_demodulation,[],[f38,f41])).
% 0.12/0.38 thf(f38,plain,(
% 0.12/0.38 ($false = (cR @ sK3)) | ($false = (cS @ sK3)) | spl1_1),
% 0.12/0.38 inference(duplicate_literal_removal,[],[f37])).
% 0.12/0.38 thf(f37,plain,(
% 0.12/0.38 ($false = (cR @ sK3)) | ($false = (cR @ sK3)) | ($false = (cS @ sK3)) | spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f36])).
% 0.12/0.38 thf(f36,plain,(
% 0.12/0.38 ($false = (cR @ sK3)) | ($false = ((cR @ sK3) & (cS @ sK3))) | spl1_1),
% 0.12/0.38 inference(binary_proxy_clausification,[],[f34])).
% 0.12/0.38 thf(f31,plain,(
% 0.12/0.38 ( ! [X1 : $i] : (($true = (cS @ X1)) | ($true != (cR @ X1))) ) | ~spl1_4),
% 0.12/0.38 inference(avatar_component_clause,[],[f30])).
% 0.12/0.38 thf(f30,plain,(
% 0.12/0.38 spl1_4 <=> ! [X1] : (($true != (cR @ X1)) | ($true = (cS @ X1)))),
% 0.12/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.12/0.38 thf(f32,plain,(
% 0.12/0.38 spl1_4 | spl1_1),
% 0.12/0.38 inference(avatar_split_clause,[],[f12,f16,f30])).
% 0.12/0.38 thf(f12,plain,(
% 0.12/0.38 ( ! [X1 : $i] : (($true != (cR @ X1)) | ($true = (cS @ X1)) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) )),
% 0.12/0.38 inference(cnf_transformation,[],[f11])).
% 0.12/0.38 thf(f11,plain,(
% 0.12/0.38 ((($true = (cR @ sK0)) & ($true != (cS @ sK0))) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X1] : (($true != (cR @ X1)) | ($true = (cS @ X1))) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.12/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.12/0.38 thf(f10,plain,(
% 0.12/0.38 ? [X0] : (((cR @ X0) = $true) & ((cS @ X0) != $true)) => (($true = (cR @ sK0)) & ($true != (cS @ sK0)))),
% 0.12/0.38 introduced(choice_axiom,[])).
% 0.12/0.38 thf(f9,plain,(
% 0.12/0.38 (? [X0] : (((cR @ X0) = $true) & ((cS @ X0) != $true)) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X1] : (($true != (cR @ X1)) | ($true = (cS @ X1))) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.12/0.38 inference(rectify,[],[f8])).
% 0.12/0.38 thf(f8,plain,(
% 0.12/0.38 (? [X0] : (((cR @ X0) = $true) & ((cS @ X0) != $true)) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X0] : (((cR @ X0) != $true) | ((cS @ X0) = $true)) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.12/0.38 inference(nnf_transformation,[],[f7])).
% 0.12/0.38 thf(f7,plain,(
% 0.12/0.38 (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <~> ! [X0] : (((cR @ X0) != $true) | ((cS @ X0) = $true))),
% 0.12/0.38 inference(ennf_transformation,[],[f6])).
% 0.12/0.38 thf(f6,plain,(
% 0.12/0.38 ~((cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <=> ! [X0] : (((cR @ X0) = $true) => ((cS @ X0) = $true)))),
% 0.12/0.38 inference(rectify,[],[f5])).
% 0.12/0.38 thf(f5,plain,(
% 0.12/0.38 ~((cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <=> ! [X1] : (($true = (cR @ X1)) => ($true = (cS @ X1))))),
% 0.12/0.38 inference(fool_elimination,[],[f4])).
% 0.12/0.38 thf(f4,plain,(
% 0.12/0.38 ~(((^[X0 : $i] : ((cS @ X0) & (cR @ X0))) = cR) <=> ! [X1] : ((cR @ X1) => (cS @ X1)))),
% 0.12/0.38 inference(rectify,[],[f2])).
% 0.12/0.38 thf(f2,negated_conjecture,(
% 0.12/0.38 ~(((^[X0 : $i] : ((cS @ X0) & (cR @ X0))) = cR) <=> ! [X0] : ((cR @ X0) => (cS @ X0)))),
% 0.12/0.38 inference(negated_conjecture,[],[f1])).
% 0.12/0.38 thf(f1,conjecture,(
% 0.12/0.38 ((^[X0 : $i] : ((cS @ X0) & (cR @ X0))) = cR) <=> ! [X0] : ((cR @ X0) => (cS @ X0))),
% 0.12/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM31_pme)).
% 0.12/0.38 thf(f28,plain,(
% 0.12/0.38 ~spl1_3 | ~spl1_1),
% 0.12/0.38 inference(avatar_split_clause,[],[f13,f16,f25])).
% 0.12/0.38 thf(f13,plain,(
% 0.12/0.38 (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ($true != (cS @ sK0))),
% 0.12/0.38 inference(cnf_transformation,[],[f11])).
% 0.12/0.38 thf(f23,plain,(
% 0.12/0.38 ~spl1_1 | spl1_2),
% 0.12/0.38 inference(avatar_split_clause,[],[f14,f20,f16])).
% 0.12/0.38 thf(f14,plain,(
% 0.12/0.38 (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ($true = (cR @ sK0))),
% 0.12/0.38 inference(cnf_transformation,[],[f11])).
% 0.12/0.38 % SZS output end Proof for theBenchmark
% 0.12/0.38 % (18991)------------------------------
% 0.12/0.38 % (18991)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (18991)Termination reason: Refutation
% 0.12/0.38
% 0.12/0.38 % (18991)Memory used [KB]: 5500
% 0.12/0.38 % (18991)Time elapsed: 0.006 s
% 0.12/0.38 % (18991)Instructions burned: 3 (million)
% 0.12/0.38 % (18991)------------------------------
% 0.12/0.38 % (18991)------------------------------
% 0.12/0.38 % (18983)Success in time 0.009 s
%------------------------------------------------------------------------------