TSTP Solution File: SEV396^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.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 : n027.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 04:13:39 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV396^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % 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.13/0.34 % Computer : n027.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 18:36:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.34 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.19/0.36 % (30618)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.36 % (30612)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.19/0.36 % (30613)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 (3000ds/4Mi)
% 0.19/0.36 % (30615)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.36 % (30614)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 (3000ds/27Mi)
% 0.19/0.36 % (30617)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 (3000ds/275Mi)
% 0.19/0.36 % (30616)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 (3000ds/2Mi)
% 0.19/0.36 % (30619)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.19/0.36 % (30615)Instruction limit reached!
% 0.19/0.36 % (30615)------------------------------
% 0.19/0.36 % (30615)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (30615)Termination reason: Unknown
% 0.19/0.36 % (30615)Termination phase: Saturation
% 0.19/0.36
% 0.19/0.36 % (30615)Memory used [KB]: 5373
% 0.19/0.36 % (30615)Time elapsed: 0.003 s
% 0.19/0.36 % (30615)Instructions burned: 2 (million)
% 0.19/0.36 % (30615)------------------------------
% 0.19/0.36 % (30615)------------------------------
% 0.19/0.36 % (30618)First to succeed.
% 0.19/0.36 % (30616)Refutation not found, incomplete strategy
% 0.19/0.36 % (30616)------------------------------
% 0.19/0.36 % (30616)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (30616)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.36
% 0.19/0.36
% 0.19/0.36 % (30616)Memory used [KB]: 5500
% 0.19/0.36 % (30616)Time elapsed: 0.003 s
% 0.19/0.36 % (30616)Instructions burned: 1 (million)
% 0.19/0.36 % (30616)------------------------------
% 0.19/0.36 % (30616)------------------------------
% 0.19/0.36 % (30619)Refutation not found, incomplete strategy
% 0.19/0.36 % (30619)------------------------------
% 0.19/0.36 % (30619)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36 % (30619)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.36
% 0.19/0.36
% 0.19/0.36 % (30619)Memory used [KB]: 5500
% 0.19/0.36 % (30619)Time elapsed: 0.003 s
% 0.19/0.36 % (30619)Instructions burned: 1 (million)
% 0.19/0.36 % (30619)------------------------------
% 0.19/0.36 % (30619)------------------------------
% 0.19/0.36 % (30617)Also succeeded, but the first one will report.
% 0.19/0.37 % (30618)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% 0.19/0.37 thf(func_def_0, type, cR: $i > $o).
% 0.19/0.37 thf(func_def_1, type, cS: $i > $o).
% 0.19/0.37 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.19/0.37 thf(f64,plain,(
% 0.19/0.37 $false),
% 0.19/0.37 inference(avatar_sat_refutation,[],[f22,f27,f32,f47,f63])).
% 0.19/0.37 thf(f63,plain,(
% 0.19/0.37 ~spl1_1 | ~spl1_3 | spl1_4),
% 0.19/0.37 inference(avatar_contradiction_clause,[],[f62])).
% 0.19/0.37 thf(f62,plain,(
% 0.19/0.37 $false | (~spl1_1 | ~spl1_3 | spl1_4)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f61])).
% 0.19/0.37 thf(f61,plain,(
% 0.19/0.37 ($false = $true) | (~spl1_1 | ~spl1_3 | spl1_4)),
% 0.19/0.37 inference(backward_demodulation,[],[f26,f60])).
% 0.19/0.37 thf(f60,plain,(
% 0.19/0.37 ((cR @ sK0) = $false) | (~spl1_1 | spl1_4)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f59])).
% 0.19/0.37 thf(f59,plain,(
% 0.19/0.37 ($true != $true) | ((cR @ sK0) = $false) | (~spl1_1 | spl1_4)),
% 0.19/0.37 inference(superposition,[],[f31,f57])).
% 0.19/0.37 thf(f57,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (($true = (cS @ X1)) | ($false = (cR @ X1))) ) | ~spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f54])).
% 0.19/0.37 thf(f54,plain,(
% 0.19/0.37 ( ! [X1 : $i] : ((((cR @ X1) & (cS @ X1)) = $true) | ($false = (cR @ X1))) ) | ~spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f53])).
% 0.19/0.37 thf(f53,plain,(
% 0.19/0.37 ( ! [X1 : $i] : ((((cR @ X1) & (cS @ X1)) = (cR @ X1))) ) | ~spl1_1),
% 0.19/0.37 inference(beta_eta_normalization,[],[f52])).
% 0.19/0.37 thf(f52,plain,(
% 0.19/0.37 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))) @ X1) = (cR @ X1))) ) | ~spl1_1),
% 0.19/0.37 inference(argument_congruence,[],[f18])).
% 0.19/0.37 thf(f18,plain,(
% 0.19/0.37 (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ~spl1_1),
% 0.19/0.37 inference(avatar_component_clause,[],[f16])).
% 0.19/0.37 thf(f16,plain,(
% 0.19/0.37 spl1_1 <=> (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))),
% 0.19/0.37 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.19/0.37 thf(f31,plain,(
% 0.19/0.37 ((cS @ sK0) != $true) | spl1_4),
% 0.19/0.37 inference(avatar_component_clause,[],[f29])).
% 0.19/0.37 thf(f29,plain,(
% 0.19/0.37 spl1_4 <=> ((cS @ sK0) = $true)),
% 0.19/0.37 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.19/0.37 thf(f26,plain,(
% 0.19/0.37 ((cR @ sK0) = $true) | ~spl1_3),
% 0.19/0.37 inference(avatar_component_clause,[],[f24])).
% 0.19/0.37 thf(f24,plain,(
% 0.19/0.37 spl1_3 <=> ((cR @ sK0) = $true)),
% 0.19/0.37 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.19/0.37 thf(f47,plain,(
% 0.19/0.37 spl1_1 | ~spl1_2),
% 0.19/0.37 inference(avatar_contradiction_clause,[],[f46])).
% 0.19/0.37 thf(f46,plain,(
% 0.19/0.37 $false | (spl1_1 | ~spl1_2)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f45])).
% 0.19/0.37 thf(f45,plain,(
% 0.19/0.37 ($false = $true) | (spl1_1 | ~spl1_2)),
% 0.19/0.37 inference(backward_demodulation,[],[f42,f44])).
% 0.19/0.37 thf(f44,plain,(
% 0.19/0.37 ((cS @ sK3) = $false) | spl1_1),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f43])).
% 0.19/0.37 thf(f43,plain,(
% 0.19/0.37 ($false = $true) | ((cS @ sK3) = $false) | spl1_1),
% 0.19/0.37 inference(forward_demodulation,[],[f38,f41])).
% 0.19/0.37 thf(f41,plain,(
% 0.19/0.37 ($true = (cR @ sK3)) | spl1_1),
% 0.19/0.37 inference(duplicate_literal_removal,[],[f40])).
% 0.19/0.37 thf(f40,plain,(
% 0.19/0.37 ($true = (cR @ sK3)) | ($true = (cR @ sK3)) | spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f35])).
% 0.19/0.37 thf(f35,plain,(
% 0.19/0.37 ($true = (cR @ sK3)) | (((cR @ sK3) & (cS @ sK3)) = $true) | spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f34])).
% 0.19/0.37 thf(f34,plain,(
% 0.19/0.37 (((cR @ sK3) & (cS @ sK3)) != (cR @ sK3)) | spl1_1),
% 0.19/0.37 inference(beta_eta_normalization,[],[f33])).
% 0.19/0.37 thf(f33,plain,(
% 0.19/0.37 (((^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))) @ sK3) != (cR @ sK3)) | spl1_1),
% 0.19/0.37 inference(negative_extensionality,[],[f17])).
% 0.19/0.37 thf(f17,plain,(
% 0.19/0.37 (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | spl1_1),
% 0.19/0.37 inference(avatar_component_clause,[],[f16])).
% 0.19/0.37 thf(f38,plain,(
% 0.19/0.37 ($false = (cR @ sK3)) | ((cS @ sK3) = $false) | spl1_1),
% 0.19/0.37 inference(duplicate_literal_removal,[],[f37])).
% 0.19/0.37 thf(f37,plain,(
% 0.19/0.37 ($false = (cR @ sK3)) | ((cS @ sK3) = $false) | ($false = (cR @ sK3)) | spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f36])).
% 0.19/0.37 thf(f36,plain,(
% 0.19/0.37 ($false = (cR @ sK3)) | (((cR @ sK3) & (cS @ sK3)) = $false) | spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f34])).
% 0.19/0.37 thf(f42,plain,(
% 0.19/0.37 ((cS @ sK3) = $true) | (spl1_1 | ~spl1_2)),
% 0.19/0.37 inference(subsumption_resolution,[],[f39,f21])).
% 0.19/0.37 thf(f21,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (((cR @ X1) != $true) | ($true = (cS @ X1))) ) | ~spl1_2),
% 0.19/0.37 inference(avatar_component_clause,[],[f20])).
% 0.19/0.37 thf(f20,plain,(
% 0.19/0.37 spl1_2 <=> ! [X1] : (((cR @ X1) != $true) | ($true = (cS @ X1)))),
% 0.19/0.37 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.19/0.37 thf(f39,plain,(
% 0.19/0.37 ($true = (cR @ sK3)) | ((cS @ sK3) = $true) | spl1_1),
% 0.19/0.37 inference(binary_proxy_clausification,[],[f35])).
% 0.19/0.37 thf(f32,plain,(
% 0.19/0.37 ~spl1_1 | ~spl1_4),
% 0.19/0.37 inference(avatar_split_clause,[],[f14,f29,f16])).
% 0.19/0.37 thf(f14,plain,(
% 0.19/0.37 (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ((cS @ sK0) != $true)),
% 0.19/0.37 inference(cnf_transformation,[],[f11])).
% 0.19/0.37 thf(f11,plain,(
% 0.19/0.37 ((((cS @ sK0) != $true) & ((cR @ sK0) = $true)) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X1] : (($true = (cS @ X1)) | ((cR @ X1) != $true)) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.19/0.37 thf(f10,plain,(
% 0.19/0.37 ? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) => (((cS @ sK0) != $true) & ((cR @ sK0) = $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f9,plain,(
% 0.19/0.37 (? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X1] : (($true = (cS @ X1)) | ((cR @ X1) != $true)) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.19/0.37 inference(rectify,[],[f8])).
% 0.19/0.37 thf(f8,plain,(
% 0.19/0.37 (? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))) & (! [X0] : (((cS @ X0) = $true) | ((cR @ X0) != $true)) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))))),
% 0.19/0.37 inference(nnf_transformation,[],[f7])).
% 0.19/0.37 thf(f7,plain,(
% 0.19/0.37 (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <~> ! [X0] : (((cS @ X0) = $true) | ((cR @ X0) != $true))),
% 0.19/0.37 inference(ennf_transformation,[],[f6])).
% 0.19/0.37 thf(f6,plain,(
% 0.19/0.37 ~((cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <=> ! [X0] : (((cR @ X0) = $true) => ((cS @ X0) = $true)))),
% 0.19/0.37 inference(rectify,[],[f5])).
% 0.19/0.37 thf(f5,plain,(
% 0.19/0.37 ~((cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) <=> ! [X1] : (((cR @ X1) = $true) => ($true = (cS @ X1))))),
% 0.19/0.37 inference(fool_elimination,[],[f4])).
% 0.19/0.37 thf(f4,plain,(
% 0.19/0.37 ~((cR = (^[X0 : $i] : ((cS @ X0) & (cR @ X0)))) <=> ! [X1] : ((cR @ X1) => (cS @ X1)))),
% 0.19/0.37 inference(rectify,[],[f2])).
% 0.19/0.37 thf(f2,negated_conjecture,(
% 0.19/0.37 ~((cR = (^[X0 : $i] : ((cS @ X0) & (cR @ X0)))) <=> ! [X0] : ((cR @ X0) => (cS @ X0)))),
% 0.19/0.37 inference(negated_conjecture,[],[f1])).
% 0.19/0.37 thf(f1,conjecture,(
% 0.19/0.37 (cR = (^[X0 : $i] : ((cS @ X0) & (cR @ X0)))) <=> ! [X0] : ((cR @ X0) => (cS @ X0))),
% 0.19/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM31_pme)).
% 0.19/0.37 thf(f27,plain,(
% 0.19/0.37 spl1_3 | ~spl1_1),
% 0.19/0.37 inference(avatar_split_clause,[],[f13,f16,f24])).
% 0.19/0.37 thf(f13,plain,(
% 0.19/0.37 ((cR @ sK0) = $true) | (cR != (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0))))),
% 0.19/0.37 inference(cnf_transformation,[],[f11])).
% 0.19/0.37 thf(f22,plain,(
% 0.19/0.37 spl1_1 | spl1_2),
% 0.19/0.37 inference(avatar_split_clause,[],[f12,f20,f16])).
% 0.19/0.37 thf(f12,plain,(
% 0.19/0.37 ( ! [X1 : $i] : (((cR @ X1) != $true) | (cR = (^[Y0 : $i]: ((cR @ Y0) & (cS @ Y0)))) | ($true = (cS @ X1))) )),
% 0.19/0.37 inference(cnf_transformation,[],[f11])).
% 0.19/0.37 % SZS output end Proof for theBenchmark
% 0.19/0.37 % (30618)------------------------------
% 0.19/0.37 % (30618)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (30618)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (30618)Memory used [KB]: 5500
% 0.19/0.37 % (30618)Time elapsed: 0.005 s
% 0.19/0.37 % (30618)Instructions burned: 3 (million)
% 0.19/0.37 % (30618)------------------------------
% 0.19/0.37 % (30618)------------------------------
% 0.19/0.37 % (30611)Success in time 0.015 s
% 0.19/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------