TSTP Solution File: SEV070^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV070^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.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:11:53 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV070^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.14/0.34 % Computer : n010.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 19:03:08 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (26081)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (26075)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 % (26076)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.14/0.37 % (26078)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (26077)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.14/0.37 % (26079)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 % (26078)Instruction limit reached!
% 0.14/0.37 % (26078)------------------------------
% 0.14/0.37 % (26078)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26078)Termination reason: Unknown
% 0.14/0.37 % (26079)Instruction limit reached!
% 0.14/0.37 % (26079)------------------------------
% 0.14/0.37 % (26079)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26079)Termination reason: Unknown
% 0.14/0.37 % (26079)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26079)Memory used [KB]: 895
% 0.14/0.37 % (26079)Time elapsed: 0.003 s
% 0.14/0.37 % (26079)Instructions burned: 2 (million)
% 0.14/0.37 % (26079)------------------------------
% 0.14/0.37 % (26079)------------------------------
% 0.14/0.37 % (26078)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26078)Memory used [KB]: 1023
% 0.14/0.37 % (26078)Time elapsed: 0.003 s
% 0.14/0.37 % (26078)Instructions burned: 2 (million)
% 0.14/0.37 % (26078)------------------------------
% 0.14/0.37 % (26078)------------------------------
% 0.14/0.37 % (26076)Instruction limit reached!
% 0.14/0.37 % (26076)------------------------------
% 0.14/0.37 % (26076)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26076)Termination reason: Unknown
% 0.14/0.37 % (26076)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26076)Memory used [KB]: 5500
% 0.14/0.37 % (26076)Time elapsed: 0.005 s
% 0.14/0.37 % (26076)Instructions burned: 4 (million)
% 0.14/0.37 % (26076)------------------------------
% 0.14/0.37 % (26076)------------------------------
% 0.14/0.37 % (26077)First to succeed.
% 0.14/0.37 % (26082)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.38 % (26081)Instruction limit reached!
% 0.14/0.38 % (26081)------------------------------
% 0.14/0.38 % (26081)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26081)Termination reason: Unknown
% 0.14/0.38 % (26081)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (26081)Memory used [KB]: 5628
% 0.14/0.38 % (26081)Time elapsed: 0.012 s
% 0.14/0.38 % (26081)Instructions burned: 18 (million)
% 0.14/0.38 % (26081)------------------------------
% 0.14/0.38 % (26081)------------------------------
% 0.14/0.38 % (26077)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, cS: $i > $i).
% 0.14/0.38 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.38 thf(func_def_8, type, sK3: ($i > $o) > $i).
% 0.14/0.38 thf(func_def_9, type, sK4: $i > $o).
% 0.14/0.38 thf(func_def_10, type, sK5: ($i > $o) > $i).
% 0.14/0.38 thf(func_def_12, type, ph7: !>[X0: $tType]:(X0)).
% 0.14/0.38 thf(f86,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(avatar_sat_refutation,[],[f39,f52,f56,f71,f82,f85])).
% 0.14/0.38 thf(f85,plain,(
% 0.14/0.38 spl6_5),
% 0.14/0.38 inference(avatar_contradiction_clause,[],[f84])).
% 0.14/0.38 thf(f84,plain,(
% 0.14/0.38 $false | spl6_5),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f83])).
% 0.14/0.38 thf(f83,plain,(
% 0.14/0.38 ($true != $true) | spl6_5),
% 0.14/0.38 inference(superposition,[],[f81,f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 ($true = (sK4 @ sK2))),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ! [X3 : $i > $o] : (($true = (X3 @ sK0)) | ($true != (X3 @ sK2)) | (($true != (X3 @ (cS @ (sK3 @ X3)))) & ($true = (X3 @ (sK3 @ X3))))) & (! [X6] : (($true != (sK4 @ X6)) | ($true = (sK4 @ (cS @ X6)))) & ($true != (sK4 @ sK1)) & ($true = (sK4 @ sK2))) & ! [X7 : $i > $o] : ((($true = (X7 @ (sK5 @ X7))) & ($true != (X7 @ (cS @ (sK5 @ X7))))) | ((X7 @ sK1) = $true) | ($true != (X7 @ sK0)))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f12,f11,f10,f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (! [X3 : $i > $o] : (((X3 @ X0) = $true) | ((X3 @ X2) != $true) | ? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true))) & ? [X5 : $i > $o] : (! [X6] : (($true != (X5 @ X6)) | ($true = (X5 @ (cS @ X6)))) & ($true != (X5 @ X1)) & ($true = (X5 @ X2))) & ! [X7 : $i > $o] : (? [X8] : (($true = (X7 @ X8)) & ($true != (X7 @ (cS @ X8)))) | ((X7 @ X1) = $true) | ($true != (X7 @ X0)))) => (! [X3 : $i > $o] : (($true = (X3 @ sK0)) | ($true != (X3 @ sK2)) | ? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true))) & ? [X5 : $i > $o] : (! [X6] : (($true != (X5 @ X6)) | ($true = (X5 @ (cS @ X6)))) & ($true != (X5 @ sK1)) & ($true = (X5 @ sK2))) & ! [X7 : $i > $o] : (? [X8] : (($true = (X7 @ X8)) & ($true != (X7 @ (cS @ X8)))) | ((X7 @ sK1) = $true) | ($true != (X7 @ sK0))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 ! [X3 : $i > $o] : (? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true)) => (($true != (X3 @ (cS @ (sK3 @ X3)))) & ($true = (X3 @ (sK3 @ X3)))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ? [X5 : $i > $o] : (! [X6] : (($true != (X5 @ X6)) | ($true = (X5 @ (cS @ X6)))) & ($true != (X5 @ sK1)) & ($true = (X5 @ sK2))) => (! [X6] : (($true != (sK4 @ X6)) | ($true = (sK4 @ (cS @ X6)))) & ($true != (sK4 @ sK1)) & ($true = (sK4 @ sK2)))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 ! [X7 : $i > $o] : (? [X8] : (($true = (X7 @ X8)) & ($true != (X7 @ (cS @ X8)))) => (($true = (X7 @ (sK5 @ X7))) & ($true != (X7 @ (cS @ (sK5 @ X7))))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (! [X3 : $i > $o] : (((X3 @ X0) = $true) | ((X3 @ X2) != $true) | ? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true))) & ? [X5 : $i > $o] : (! [X6] : (($true != (X5 @ X6)) | ($true = (X5 @ (cS @ X6)))) & ($true != (X5 @ X1)) & ($true = (X5 @ X2))) & ! [X7 : $i > $o] : (? [X8] : (($true = (X7 @ X8)) & ($true != (X7 @ (cS @ X8)))) | ((X7 @ X1) = $true) | ($true != (X7 @ X0))))),
% 0.14/0.38 inference(rectify,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ? [X2,X0,X1] : (! [X3 : $i > $o] : (((X3 @ X2) = $true) | ((X3 @ X1) != $true) | ? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true))) & ? [X7 : $i > $o] : (! [X8] : (($true != (X7 @ X8)) | ($true = (X7 @ (cS @ X8)))) & ($true != (X7 @ X0)) & ((X7 @ X1) = $true)) & ! [X5 : $i > $o] : (? [X6] : (($true = (X5 @ X6)) & ($true != (X5 @ (cS @ X6)))) | ($true = (X5 @ X0)) | ($true != (X5 @ X2))))),
% 0.14/0.38 inference(flattening,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (? [X7 : $i > $o] : (($true != (X7 @ X0)) & (! [X8] : (($true != (X7 @ X8)) | ($true = (X7 @ (cS @ X8)))) & ((X7 @ X1) = $true))) & (! [X5 : $i > $o] : (($true = (X5 @ X0)) | (($true != (X5 @ X2)) | ? [X6] : (($true = (X5 @ X6)) & ($true != (X5 @ (cS @ X6)))))) & ! [X3 : $i > $o] : (((X3 @ X2) = $true) | (? [X4] : (((X3 @ (cS @ X4)) != $true) & ((X3 @ X4) = $true)) | ((X3 @ X1) != $true)))))),
% 0.14/0.38 inference(ennf_transformation,[],[f5])).
% 0.14/0.38 thf(f5,plain,(
% 0.14/0.38 ~! [X0,X1,X2] : ((! [X5 : $i > $o] : ((($true = (X5 @ X2)) & ! [X6] : (($true = (X5 @ X6)) => ($true = (X5 @ (cS @ X6))))) => ($true = (X5 @ X0))) & ! [X3 : $i > $o] : ((! [X4] : (((X3 @ X4) = $true) => ((X3 @ (cS @ X4)) = $true)) & ((X3 @ X1) = $true)) => ((X3 @ X2) = $true))) => ! [X7 : $i > $o] : ((! [X8] : (($true = (X7 @ X8)) => ($true = (X7 @ (cS @ X8)))) & ((X7 @ X1) = $true)) => ($true = (X7 @ X0))))),
% 0.14/0.38 inference(fool_elimination,[],[f4])).
% 0.14/0.38 thf(f4,plain,(
% 0.14/0.38 ~! [X0,X1,X2] : ((! [X3 : $i > $o] : ((! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4))) & (X3 @ X1)) => (X3 @ X2)) & ! [X5 : $i > $o] : (((X5 @ X2) & ! [X6] : ((X5 @ X6) => (X5 @ (cS @ X6)))) => (X5 @ X0))) => ! [X7 : $i > $o] : ((! [X8] : ((X7 @ X8) => (X7 @ (cS @ X8))) & (X7 @ X1)) => (X7 @ X0)))),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,negated_conjecture,(
% 0.14/0.38 ~! [X2,X0,X1] : ((! [X3 : $i > $o] : ((! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4))) & (X3 @ X0)) => (X3 @ X1)) & ! [X3 : $i > $o] : (((X3 @ X1) & ! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4)))) => (X3 @ X2))) => ! [X3 : $i > $o] : ((! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4))) & (X3 @ X0)) => (X3 @ X2)))),
% 0.14/0.38 inference(negated_conjecture,[],[f1])).
% 0.14/0.38 thf(f1,conjecture,(
% 0.14/0.38 ! [X2,X0,X1] : ((! [X3 : $i > $o] : ((! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4))) & (X3 @ X0)) => (X3 @ X1)) & ! [X3 : $i > $o] : (((X3 @ X1) & ! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4)))) => (X3 @ X2))) => ! [X3 : $i > $o] : ((! [X4] : ((X3 @ X4) => (X3 @ (cS @ X4))) & (X3 @ X0)) => (X3 @ X2)))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM577_pme)).
% 0.14/0.38 thf(f81,plain,(
% 0.14/0.38 ($true != (sK4 @ sK2)) | spl6_5),
% 0.14/0.38 inference(avatar_component_clause,[],[f79])).
% 0.14/0.38 thf(f79,plain,(
% 0.14/0.38 spl6_5 <=> ($true = (sK4 @ sK2))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_5])])).
% 0.14/0.38 thf(f82,plain,(
% 0.14/0.38 ~spl6_5 | spl6_2 | ~spl6_1),
% 0.14/0.38 inference(avatar_split_clause,[],[f76,f32,f36,f79])).
% 0.14/0.38 thf(f36,plain,(
% 0.14/0.38 spl6_2 <=> ($true = (sK4 @ sK0))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 spl6_1 <=> ($true = (sK4 @ (sK3 @ sK4)))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.14/0.38 thf(f76,plain,(
% 0.14/0.38 ($true = (sK4 @ sK0)) | ($true != (sK4 @ sK2)) | ~spl6_1),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f75])).
% 0.14/0.38 thf(f75,plain,(
% 0.14/0.38 ($true != $true) | ($true != (sK4 @ sK2)) | ($true = (sK4 @ sK0)) | ~spl6_1),
% 0.14/0.38 inference(superposition,[],[f20,f73])).
% 0.14/0.38 thf(f73,plain,(
% 0.14/0.38 ((sK4 @ (cS @ (sK3 @ sK4))) = $true) | ~spl6_1),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f72])).
% 0.14/0.38 thf(f72,plain,(
% 0.14/0.38 ((sK4 @ (cS @ (sK3 @ sK4))) = $true) | ($true != $true) | ~spl6_1),
% 0.14/0.38 inference(superposition,[],[f18,f34])).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 ($true = (sK4 @ (sK3 @ sK4))) | ~spl6_1),
% 0.14/0.38 inference(avatar_component_clause,[],[f32])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 ( ! [X6 : $i] : (($true != (sK4 @ X6)) | ($true = (sK4 @ (cS @ X6)))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 ( ! [X3 : $i > $o] : (($true != (X3 @ (cS @ (sK3 @ X3)))) | ($true = (X3 @ sK0)) | ($true != (X3 @ sK2))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f71,plain,(
% 0.14/0.38 ~spl6_2 | spl6_3 | ~spl6_4),
% 0.14/0.38 inference(avatar_split_clause,[],[f66,f49,f45,f36])).
% 0.14/0.38 thf(f45,plain,(
% 0.14/0.38 spl6_3 <=> ($true = (sK4 @ sK1))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_3])])).
% 0.14/0.38 thf(f49,plain,(
% 0.14/0.38 spl6_4 <=> ($true = (sK4 @ (sK5 @ sK4)))),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl6_4])])).
% 0.14/0.38 thf(f66,plain,(
% 0.14/0.38 ($true = (sK4 @ sK1)) | ($true != (sK4 @ sK0)) | ~spl6_4),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f65])).
% 0.14/0.38 thf(f65,plain,(
% 0.14/0.38 ($true != $true) | ($true = (sK4 @ sK1)) | ($true != (sK4 @ sK0)) | ~spl6_4),
% 0.14/0.38 inference(superposition,[],[f14,f61])).
% 0.14/0.38 thf(f61,plain,(
% 0.14/0.38 ($true = (sK4 @ (cS @ (sK5 @ sK4)))) | ~spl6_4),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f60])).
% 0.14/0.38 thf(f60,plain,(
% 0.14/0.38 ($true = (sK4 @ (cS @ (sK5 @ sK4)))) | ($true != $true) | ~spl6_4),
% 0.14/0.38 inference(superposition,[],[f18,f51])).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 ($true = (sK4 @ (sK5 @ sK4))) | ~spl6_4),
% 0.14/0.38 inference(avatar_component_clause,[],[f49])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 ( ! [X7 : $i > $o] : (($true != (X7 @ (cS @ (sK5 @ X7)))) | ($true != (X7 @ sK0)) | ((X7 @ sK1) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f56,plain,(
% 0.14/0.38 ~spl6_3),
% 0.14/0.38 inference(avatar_contradiction_clause,[],[f55])).
% 0.14/0.38 thf(f55,plain,(
% 0.14/0.38 $false | ~spl6_3),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f53])).
% 0.14/0.38 thf(f53,plain,(
% 0.14/0.38 ($true != $true) | ~spl6_3),
% 0.14/0.38 inference(superposition,[],[f17,f47])).
% 0.14/0.38 thf(f47,plain,(
% 0.14/0.38 ($true = (sK4 @ sK1)) | ~spl6_3),
% 0.14/0.38 inference(avatar_component_clause,[],[f45])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 ($true != (sK4 @ sK1))),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f52,plain,(
% 0.14/0.38 spl6_3 | spl6_4 | ~spl6_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f42,f36,f49,f45])).
% 0.14/0.38 thf(f42,plain,(
% 0.14/0.38 ($true = (sK4 @ (sK5 @ sK4))) | ($true = (sK4 @ sK1)) | ~spl6_2),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f41])).
% 0.14/0.38 thf(f41,plain,(
% 0.14/0.38 ($true = (sK4 @ sK1)) | ($true = (sK4 @ (sK5 @ sK4))) | ($true != $true) | ~spl6_2),
% 0.14/0.38 inference(superposition,[],[f15,f38])).
% 0.14/0.38 thf(f38,plain,(
% 0.14/0.38 ($true = (sK4 @ sK0)) | ~spl6_2),
% 0.14/0.38 inference(avatar_component_clause,[],[f36])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ( ! [X7 : $i > $o] : (($true != (X7 @ sK0)) | ((X7 @ sK1) = $true) | ($true = (X7 @ (sK5 @ X7)))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 thf(f39,plain,(
% 0.14/0.38 spl6_1 | spl6_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f30,f36,f32])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 ($true = (sK4 @ sK0)) | ($true = (sK4 @ (sK3 @ sK4)))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f29])).
% 0.14/0.38 thf(f29,plain,(
% 0.14/0.38 ($true = (sK4 @ (sK3 @ sK4))) | ($true = (sK4 @ sK0)) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f19,f16])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ( ! [X3 : $i > $o] : (($true != (X3 @ sK2)) | ($true = (X3 @ (sK3 @ X3))) | ($true = (X3 @ sK0))) )),
% 0.14/0.38 inference(cnf_transformation,[],[f13])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (26077)------------------------------
% 0.14/0.38 % (26077)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26077)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (26077)Memory used [KB]: 5628
% 0.14/0.38 % (26077)Time elapsed: 0.010 s
% 0.14/0.38 % (26077)Instructions burned: 8 (million)
% 0.14/0.38 % (26077)------------------------------
% 0.14/0.38 % (26077)------------------------------
% 0.14/0.38 % (26074)Success in time 0.022 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------