TSTP Solution File: SYO277^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO277^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 : n005.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 09:03:45 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO277^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % 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.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 09:34:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (15386)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (15387)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.14/0.37 % (15390)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.14/0.37 % (15383)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.14/0.37 % (15386)Instruction limit reached!
% 0.14/0.37 % (15386)------------------------------
% 0.14/0.37 % (15386)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15386)Termination reason: Unknown
% 0.14/0.37 % (15386)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (15386)Memory used [KB]: 5500
% 0.14/0.37 % (15387)Instruction limit reached!
% 0.14/0.37 % (15387)------------------------------
% 0.14/0.37 % (15387)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15387)Termination reason: Unknown
% 0.14/0.37 % (15387)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (15387)Memory used [KB]: 5500
% 0.14/0.37 % (15387)Time elapsed: 0.003 s
% 0.14/0.37 % (15387)Instructions burned: 2 (million)
% 0.14/0.37 % (15387)------------------------------
% 0.14/0.37 % (15387)------------------------------
% 0.14/0.37 % (15386)Time elapsed: 0.003 s
% 0.14/0.37 % (15386)Instructions burned: 2 (million)
% 0.14/0.37 % (15386)------------------------------
% 0.14/0.37 % (15386)------------------------------
% 0.14/0.37 % (15390)Instruction limit reached!
% 0.14/0.37 % (15390)------------------------------
% 0.14/0.37 % (15390)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (15390)Termination reason: Unknown
% 0.14/0.37 % (15390)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (15390)Memory used [KB]: 5500
% 0.14/0.37 % (15390)Time elapsed: 0.004 s
% 0.14/0.37 % (15390)Instructions burned: 3 (million)
% 0.14/0.37 % (15390)------------------------------
% 0.14/0.37 % (15390)------------------------------
% 0.14/0.37 % (15384)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.20/0.37 % (15384)Instruction limit reached!
% 0.20/0.37 % (15384)------------------------------
% 0.20/0.37 % (15384)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15384)Termination reason: Unknown
% 0.20/0.37 % (15384)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (15384)Memory used [KB]: 5500
% 0.20/0.37 % (15384)Time elapsed: 0.005 s
% 0.20/0.37 % (15384)Instructions burned: 4 (million)
% 0.20/0.37 % (15384)------------------------------
% 0.20/0.37 % (15384)------------------------------
% 0.20/0.37 % (15383)First to succeed.
% 0.20/0.37 % (15389)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.37 % (15383)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(func_def_5, type, sK2: $i > $o).
% 0.20/0.37 thf(func_def_6, type, sK3: $i > $i > $o).
% 0.20/0.37 thf(func_def_7, type, sK4: ($i > $i > $o) > $i).
% 0.20/0.37 thf(func_def_10, type, ph6: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(f103,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(avatar_sat_refutation,[],[f27,f32,f36,f37,f44,f59,f72,f100,f102])).
% 0.20/0.37 thf(f102,plain,(
% 0.20/0.37 spl5_1 | ~spl5_3 | ~spl5_6),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f101])).
% 0.20/0.37 thf(f101,plain,(
% 0.20/0.37 $false | (spl5_1 | ~spl5_3 | ~spl5_6)),
% 0.20/0.37 inference(subsumption_resolution,[],[f98,f31])).
% 0.20/0.37 thf(f31,plain,(
% 0.20/0.37 ($true = (sK2 @ sK0)) | ~spl5_3),
% 0.20/0.37 inference(avatar_component_clause,[],[f29])).
% 0.20/0.37 thf(f29,plain,(
% 0.20/0.37 spl5_3 <=> ($true = (sK2 @ sK0))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_3])])).
% 0.20/0.37 thf(f98,plain,(
% 0.20/0.37 ($true != (sK2 @ sK0)) | (spl5_1 | ~spl5_6)),
% 0.20/0.37 inference(superposition,[],[f22,f83])).
% 0.20/0.37 thf(f83,plain,(
% 0.20/0.37 (sK0 = sK1) | ~spl5_6),
% 0.20/0.37 inference(equality_proxy_clausification,[],[f82])).
% 0.20/0.37 thf(f82,plain,(
% 0.20/0.37 ((sK1 = sK0) = $true) | ~spl5_6),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f81])).
% 0.20/0.37 thf(f81,plain,(
% 0.20/0.37 ($true != $true) | ((sK1 = sK0) = $true) | ~spl5_6),
% 0.20/0.37 inference(boolean_simplification,[],[f80])).
% 0.20/0.37 thf(f80,plain,(
% 0.20/0.37 (((sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) = (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | ((sK1 = sK0) = $true) | ~spl5_6),
% 0.20/0.37 inference(beta_eta_normalization,[],[f73])).
% 0.20/0.37 thf(f73,plain,(
% 0.20/0.37 ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ sK0 @ sK1)) | (((^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0))))) @ (sK4 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y1 = Y0)))))) != $true) | ~spl5_6),
% 0.20/0.37 inference(primitive_instantiation,[],[f43])).
% 0.20/0.37 thf(f43,plain,(
% 0.20/0.37 ( ! [X6 : $i > $i > $o] : (((X6 @ (sK4 @ X6) @ (sK4 @ X6)) != $true) | ((X6 @ sK0 @ sK1) = $true)) ) | ~spl5_6),
% 0.20/0.37 inference(avatar_component_clause,[],[f42])).
% 0.20/0.37 thf(f42,plain,(
% 0.20/0.37 spl5_6 <=> ! [X6 : $i > $i > $o] : (((X6 @ (sK4 @ X6) @ (sK4 @ X6)) != $true) | ((X6 @ sK0 @ sK1) = $true))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_6])])).
% 0.20/0.37 thf(f22,plain,(
% 0.20/0.37 ($true != (sK2 @ sK1)) | spl5_1),
% 0.20/0.37 inference(avatar_component_clause,[],[f20])).
% 0.20/0.37 thf(f20,plain,(
% 0.20/0.37 spl5_1 <=> ($true = (sK2 @ sK1))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_1])])).
% 0.20/0.37 thf(f100,plain,(
% 0.20/0.37 spl5_2 | ~spl5_4 | ~spl5_6),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f99])).
% 0.20/0.37 thf(f99,plain,(
% 0.20/0.37 $false | (spl5_2 | ~spl5_4 | ~spl5_6)),
% 0.20/0.37 inference(subsumption_resolution,[],[f97,f35])).
% 0.20/0.37 thf(f35,plain,(
% 0.20/0.37 ( ! [X4 : $i] : (((sK3 @ X4 @ X4) = $true)) ) | ~spl5_4),
% 0.20/0.37 inference(avatar_component_clause,[],[f34])).
% 0.20/0.37 thf(f34,plain,(
% 0.20/0.37 spl5_4 <=> ! [X4] : ((sK3 @ X4 @ X4) = $true)),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_4])])).
% 0.20/0.37 thf(f97,plain,(
% 0.20/0.37 ((sK3 @ sK0 @ sK0) != $true) | (spl5_2 | ~spl5_6)),
% 0.20/0.37 inference(superposition,[],[f26,f83])).
% 0.20/0.37 thf(f26,plain,(
% 0.20/0.37 ((sK3 @ sK0 @ sK1) != $true) | spl5_2),
% 0.20/0.37 inference(avatar_component_clause,[],[f24])).
% 0.20/0.37 thf(f24,plain,(
% 0.20/0.37 spl5_2 <=> ((sK3 @ sK0 @ sK1) = $true)),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_2])])).
% 0.20/0.37 thf(f72,plain,(
% 0.20/0.37 spl5_2 | ~spl5_4 | ~spl5_5),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f71])).
% 0.20/0.37 thf(f71,plain,(
% 0.20/0.37 $false | (spl5_2 | ~spl5_4 | ~spl5_5)),
% 0.20/0.37 inference(subsumption_resolution,[],[f65,f35])).
% 0.20/0.37 thf(f65,plain,(
% 0.20/0.37 ((sK3 @ sK0 @ sK0) != $true) | (spl5_2 | ~spl5_5)),
% 0.20/0.37 inference(superposition,[],[f26,f46])).
% 0.20/0.37 thf(f46,plain,(
% 0.20/0.37 (sK0 = sK1) | ~spl5_5),
% 0.20/0.37 inference(leibniz_equality_elimination,[],[f40])).
% 0.20/0.37 thf(f40,plain,(
% 0.20/0.37 ( ! [X5 : $i > $o] : (($true = (X5 @ sK1)) | ((X5 @ sK0) != $true)) ) | ~spl5_5),
% 0.20/0.37 inference(avatar_component_clause,[],[f39])).
% 0.20/0.37 thf(f39,plain,(
% 0.20/0.37 spl5_5 <=> ! [X5 : $i > $o] : (($true = (X5 @ sK1)) | ((X5 @ sK0) != $true))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl5_5])])).
% 0.20/0.37 thf(f59,plain,(
% 0.20/0.37 spl5_1 | ~spl5_3 | ~spl5_5),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f58])).
% 0.20/0.37 thf(f58,plain,(
% 0.20/0.37 $false | (spl5_1 | ~spl5_3 | ~spl5_5)),
% 0.20/0.37 inference(subsumption_resolution,[],[f57,f31])).
% 0.20/0.37 thf(f57,plain,(
% 0.20/0.37 ($true != (sK2 @ sK0)) | (spl5_1 | ~spl5_5)),
% 0.20/0.37 inference(beta_eta_normalization,[],[f56])).
% 0.20/0.37 thf(f56,plain,(
% 0.20/0.37 (((^[Y0 : $i]: (sK2 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0) != $true) | (spl5_1 | ~spl5_5)),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f50])).
% 0.20/0.37 thf(f50,plain,(
% 0.20/0.37 ($true != $true) | (((^[Y0 : $i]: (sK2 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ sK0) != $true) | (spl5_1 | ~spl5_5)),
% 0.20/0.37 inference(superposition,[],[f22,f40])).
% 0.20/0.37 thf(f44,plain,(
% 0.20/0.37 spl5_5 | spl5_6),
% 0.20/0.37 inference(avatar_split_clause,[],[f14,f42,f39])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 ( ! [X6 : $i > $i > $o,X5 : $i > $o] : (($true = (X5 @ sK1)) | ((X5 @ sK0) != $true) | ((X6 @ (sK4 @ X6) @ (sK4 @ X6)) != $true) | ((X6 @ sK0 @ sK1) = $true)) )),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 ((($true = (sK2 @ sK0)) & ($true != (sK2 @ sK1))) | (((sK3 @ sK0 @ sK1) != $true) & ! [X4] : ((sK3 @ X4 @ X4) = $true))) & (! [X5 : $i > $o] : (((X5 @ sK0) != $true) | ($true = (X5 @ sK1))) | ! [X6 : $i > $i > $o] : (((X6 @ sK0 @ sK1) = $true) | ((X6 @ (sK4 @ X6) @ (sK4 @ X6)) != $true)))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f8,f12,f11,f10,f9])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ? [X0,X1] : ((? [X2 : $i > $o] : (((X2 @ X0) = $true) & ((X2 @ X1) != $true)) | ? [X3 : $i > $i > $o] : (((X3 @ X0 @ X1) != $true) & ! [X4] : ((X3 @ X4 @ X4) = $true))) & (! [X5 : $i > $o] : (((X5 @ X0) != $true) | ((X5 @ X1) = $true)) | ! [X6 : $i > $i > $o] : (($true = (X6 @ X0 @ X1)) | ? [X7] : ($true != (X6 @ X7 @ X7))))) => ((? [X2 : $i > $o] : (((X2 @ sK0) = $true) & ((X2 @ sK1) != $true)) | ? [X3 : $i > $i > $o] : (($true != (X3 @ sK0 @ sK1)) & ! [X4] : ((X3 @ X4 @ X4) = $true))) & (! [X5 : $i > $o] : (((X5 @ sK0) != $true) | ($true = (X5 @ sK1))) | ! [X6 : $i > $i > $o] : (((X6 @ sK0 @ sK1) = $true) | ? [X7] : ($true != (X6 @ X7 @ X7)))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ? [X2 : $i > $o] : (((X2 @ sK0) = $true) & ((X2 @ sK1) != $true)) => (($true = (sK2 @ sK0)) & ($true != (sK2 @ sK1)))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ? [X3 : $i > $i > $o] : (($true != (X3 @ sK0 @ sK1)) & ! [X4] : ((X3 @ X4 @ X4) = $true)) => (((sK3 @ sK0 @ sK1) != $true) & ! [X4] : ((sK3 @ X4 @ X4) = $true))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f12,plain,(
% 0.20/0.37 ! [X6 : $i > $i > $o] : (? [X7] : ($true != (X6 @ X7 @ X7)) => ((X6 @ (sK4 @ X6) @ (sK4 @ X6)) != $true))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 ? [X0,X1] : ((? [X2 : $i > $o] : (((X2 @ X0) = $true) & ((X2 @ X1) != $true)) | ? [X3 : $i > $i > $o] : (((X3 @ X0 @ X1) != $true) & ! [X4] : ((X3 @ X4 @ X4) = $true))) & (! [X5 : $i > $o] : (((X5 @ X0) != $true) | ((X5 @ X1) = $true)) | ! [X6 : $i > $i > $o] : (($true = (X6 @ X0 @ X1)) | ? [X7] : ($true != (X6 @ X7 @ X7)))))),
% 0.20/0.37 inference(rectify,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 ? [X0,X1] : ((? [X2 : $i > $o] : (((X2 @ X0) = $true) & ((X2 @ X1) != $true)) | ? [X3 : $i > $i > $o] : (((X3 @ X0 @ X1) != $true) & ! [X4] : ((X3 @ X4 @ X4) = $true))) & (! [X2 : $i > $o] : (((X2 @ X0) != $true) | ((X2 @ X1) = $true)) | ! [X3 : $i > $i > $o] : (((X3 @ X0 @ X1) = $true) | ? [X4] : ((X3 @ X4 @ X4) != $true))))),
% 0.20/0.37 inference(nnf_transformation,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 ? [X0,X1] : (! [X3 : $i > $i > $o] : (((X3 @ X0 @ X1) = $true) | ? [X4] : ((X3 @ X4 @ X4) != $true)) <~> ! [X2 : $i > $o] : (((X2 @ X0) != $true) | ((X2 @ X1) = $true)))),
% 0.20/0.37 inference(ennf_transformation,[],[f5])).
% 0.20/0.37 thf(f5,plain,(
% 0.20/0.37 ~! [X0,X1] : (! [X3 : $i > $i > $o] : (! [X4] : ((X3 @ X4 @ X4) = $true) => ((X3 @ X0 @ X1) = $true)) <=> ! [X2 : $i > $o] : (((X2 @ X0) = $true) => ((X2 @ X1) = $true)))),
% 0.20/0.37 inference(fool_elimination,[],[f4])).
% 0.20/0.37 thf(f4,plain,(
% 0.20/0.37 ~! [X0,X1] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 0.20/0.37 inference(rectify,[],[f2])).
% 0.20/0.37 thf(f2,negated_conjecture,(
% 0.20/0.37 ~! [X0,X1] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 0.20/0.37 inference(negated_conjecture,[],[f1])).
% 0.20/0.37 thf(f1,conjecture,(
% 0.20/0.37 ! [X0,X1] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)) <=> ! [X3 : $i > $i > $o] : (! [X4] : (X3 @ X4 @ X4) => (X3 @ X0 @ X1)))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM47D)).
% 0.20/0.37 thf(f37,plain,(
% 0.20/0.37 spl5_3 | spl5_4),
% 0.20/0.37 inference(avatar_split_clause,[],[f17,f34,f29])).
% 0.20/0.37 thf(f17,plain,(
% 0.20/0.37 ( ! [X4 : $i] : (((sK3 @ X4 @ X4) = $true) | ($true = (sK2 @ sK0))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 thf(f36,plain,(
% 0.20/0.37 spl5_4 | ~spl5_1),
% 0.20/0.37 inference(avatar_split_clause,[],[f15,f20,f34])).
% 0.20/0.37 thf(f15,plain,(
% 0.20/0.37 ( ! [X4 : $i] : (((sK3 @ X4 @ X4) = $true) | ($true != (sK2 @ sK1))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 thf(f32,plain,(
% 0.20/0.37 spl5_3 | ~spl5_2),
% 0.20/0.37 inference(avatar_split_clause,[],[f18,f24,f29])).
% 0.20/0.37 thf(f18,plain,(
% 0.20/0.37 ($true = (sK2 @ sK0)) | ((sK3 @ sK0 @ sK1) != $true)),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 thf(f27,plain,(
% 0.20/0.37 ~spl5_1 | ~spl5_2),
% 0.20/0.37 inference(avatar_split_clause,[],[f16,f24,f20])).
% 0.20/0.37 thf(f16,plain,(
% 0.20/0.37 ($true != (sK2 @ sK1)) | ((sK3 @ sK0 @ sK1) != $true)),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (15383)------------------------------
% 0.20/0.37 % (15383)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (15383)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (15383)Memory used [KB]: 5628
% 0.20/0.37 % (15383)Time elapsed: 0.008 s
% 0.20/0.37 % (15383)Instructions burned: 6 (million)
% 0.20/0.37 % (15383)------------------------------
% 0.20/0.37 % (15383)------------------------------
% 0.20/0.37 % (15382)Success in time 0.019 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------