TSTP Solution File: SEV062^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV062^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:01:40 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV062^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n021.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 : Fri Jun 21 19:40:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.36 Running higher-order theorem proving
% 0.13/0.36 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.22/0.38 % (28576)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.38 % (28575)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.22/0.38 % (28574)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.22/0.38 % (28577)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.22/0.38 % (28573)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.22/0.38 % (28578)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.22/0.38 % (28579)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.38 % (28576)Instruction limit reached!
% 0.22/0.38 % (28576)------------------------------
% 0.22/0.38 % (28576)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.22/0.38 % (28576)Termination reason: Unknown
% 0.22/0.38 % (28576)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (28576)Memory used [KB]: 1023
% 0.22/0.38 % (28576)Time elapsed: 0.004 s
% 0.22/0.38 % (28576)Instructions burned: 2 (million)
% 0.22/0.38 % (28576)------------------------------
% 0.22/0.38 % (28576)------------------------------
% 0.22/0.38 % (28577)Instruction limit reached!
% 0.22/0.38 % (28577)------------------------------
% 0.22/0.38 % (28577)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.22/0.38 % (28577)Termination reason: Unknown
% 0.22/0.38 % (28577)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (28577)Memory used [KB]: 1023
% 0.22/0.38 % (28577)Time elapsed: 0.004 s
% 0.22/0.38 % (28577)Instructions burned: 2 (million)
% 0.22/0.38 % (28577)------------------------------
% 0.22/0.38 % (28577)------------------------------
% 0.22/0.38 % (28574)Instruction limit reached!
% 0.22/0.38 % (28574)------------------------------
% 0.22/0.38 % (28574)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.22/0.38 % (28574)Termination reason: Unknown
% 0.22/0.38 % (28574)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (28574)Memory used [KB]: 5500
% 0.22/0.38 % (28574)Time elapsed: 0.005 s
% 0.22/0.38 % (28574)Instructions burned: 4 (million)
% 0.22/0.38 % (28574)------------------------------
% 0.22/0.38 % (28574)------------------------------
% 0.22/0.39 % (28579)Instruction limit reached!
% 0.22/0.39 % (28579)------------------------------
% 0.22/0.39 % (28579)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.22/0.39 % (28579)Termination reason: Unknown
% 0.22/0.39 % (28579)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (28579)Memory used [KB]: 5628
% 0.22/0.39 % (28579)Time elapsed: 0.014 s
% 0.22/0.39 % (28579)Instructions burned: 18 (million)
% 0.22/0.39 % (28579)------------------------------
% 0.22/0.39 % (28579)------------------------------
% 0.22/0.40 % (28575)First to succeed.
% 0.22/0.40 % (28580)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.22/0.40 % (28581)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.40 % (28582)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.22/0.40 % (28575)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% 0.22/0.40 thf(func_def_1, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.22/0.40 thf(func_def_5, type, sK1: $i > $i > $o).
% 0.22/0.40 thf(func_def_7, type, sK3: $i > $i > $o).
% 0.22/0.40 thf(func_def_8, type, sK4: ($i > $i > $o) > $i).
% 0.22/0.40 thf(func_def_9, type, sK5: ($i > $i > $o) > $i).
% 0.22/0.40 thf(func_def_10, type, sK6: ($i > $i > $o) > $i).
% 0.22/0.40 thf(func_def_11, type, sK7: ($i > $i > $o) > $i).
% 0.22/0.40 thf(func_def_12, type, sK8: ($i > $i > $o) > $i).
% 0.22/0.40 thf(func_def_14, type, ph10: !>[X0: $tType]:(X0)).
% 0.22/0.40 thf(f168,plain,(
% 0.22/0.40 $false),
% 0.22/0.40 inference(avatar_sat_refutation,[],[f110,f119,f133,f142,f143,f159,f164,f167])).
% 0.22/0.40 thf(f167,plain,(
% 0.22/0.40 spl9_9 | ~spl9_10),
% 0.22/0.40 inference(avatar_split_clause,[],[f166,f149,f130])).
% 0.22/0.40 thf(f130,plain,(
% 0.22/0.40 spl9_9 <=> ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_9])])).
% 0.22/0.40 thf(f149,plain,(
% 0.22/0.40 spl9_10 <=> ($true = (sK1 @ (sK8 @ sK3) @ (sK7 @ sK3)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_10])])).
% 0.22/0.40 thf(f166,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ~spl9_10),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f165])).
% 0.22/0.40 thf(f165,plain,(
% 0.22/0.40 ($true != $true) | ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ~spl9_10),
% 0.22/0.40 inference(superposition,[],[f22,f151])).
% 0.22/0.40 thf(f151,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ~spl9_10),
% 0.22/0.40 inference(avatar_component_clause,[],[f149])).
% 0.22/0.40 thf(f22,plain,(
% 0.22/0.40 ( ! [X4 : $i,X5 : $i] : (((sK1 @ X5 @ X4) != $true) | ((sK3 @ X5 @ X4) = $true)) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f13,plain,(
% 0.22/0.40 (! [X4,X5] : (((sK3 @ X5 @ X4) = $true) | ((sK1 @ X5 @ X4) != $true)) & ($true != (sK3 @ sK2 @ sK0)) & ! [X6,X7,X8] : (((sK3 @ X7 @ X6) != $true) | ((sK3 @ X8 @ X6) = $true) | ($true != (sK3 @ X8 @ X7)))) & ! [X9 : $i > $i > $o] : (($true = (X9 @ sK2 @ sK0)) | (($true = (X9 @ (sK4 @ X9) @ (sK5 @ X9))) & ($true != (X9 @ (sK4 @ X9) @ (sK6 @ X9))) & ($true = (sK1 @ (sK5 @ X9) @ (sK6 @ X9)))) | (($true = (sK1 @ (sK8 @ X9) @ (sK7 @ X9))) & ($true != (X9 @ (sK8 @ X9) @ (sK7 @ X9)))))),
% 0.22/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f8,f12,f11,f10,f9])).
% 0.22/0.40 thf(f9,plain,(
% 0.22/0.40 ? [X0,X1 : $i > $i > $o,X2] : (? [X3 : $i > $i > $o] : (! [X4,X5] : (($true = (X3 @ X5 @ X4)) | ($true != (X1 @ X5 @ X4))) & ((X3 @ X2 @ X0) != $true) & ! [X6,X7,X8] : (((X3 @ X7 @ X6) != $true) | ((X3 @ X8 @ X6) = $true) | ($true != (X3 @ X8 @ X7)))) & ! [X9 : $i > $i > $o] : (($true = (X9 @ X2 @ X0)) | ? [X10,X11,X12] : (($true = (X9 @ X10 @ X11)) & ((X9 @ X10 @ X12) != $true) & ($true = (X1 @ X11 @ X12))) | ? [X13,X14] : (($true = (X1 @ X14 @ X13)) & ($true != (X9 @ X14 @ X13))))) => (? [X3 : $i > $i > $o] : (! [X5,X4] : (($true = (X3 @ X5 @ X4)) | ((sK1 @ X5 @ X4) != $true)) & ((X3 @ sK2 @ sK0) != $true) & ! [X6,X7,X8] : (((X3 @ X7 @ X6) != $true) | ((X3 @ X8 @ X6) = $true) | ($true != (X3 @ X8 @ X7)))) & ! [X9 : $i > $i > $o] : (($true = (X9 @ sK2 @ sK0)) | ? [X12,X11,X10] : (($true = (X9 @ X10 @ X11)) & ((X9 @ X10 @ X12) != $true) & ((sK1 @ X11 @ X12) = $true)) | ? [X14,X13] : (($true = (sK1 @ X14 @ X13)) & ($true != (X9 @ X14 @ X13)))))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f10,plain,(
% 0.22/0.40 ? [X3 : $i > $i > $o] : (! [X5,X4] : (($true = (X3 @ X5 @ X4)) | ((sK1 @ X5 @ X4) != $true)) & ((X3 @ sK2 @ sK0) != $true) & ! [X6,X7,X8] : (((X3 @ X7 @ X6) != $true) | ((X3 @ X8 @ X6) = $true) | ($true != (X3 @ X8 @ X7)))) => (! [X5,X4] : (((sK3 @ X5 @ X4) = $true) | ((sK1 @ X5 @ X4) != $true)) & ($true != (sK3 @ sK2 @ sK0)) & ! [X8,X7,X6] : (((sK3 @ X7 @ X6) != $true) | ((sK3 @ X8 @ X6) = $true) | ($true != (sK3 @ X8 @ X7))))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f11,plain,(
% 0.22/0.40 ! [X9 : $i > $i > $o] : (? [X12,X11,X10] : (($true = (X9 @ X10 @ X11)) & ((X9 @ X10 @ X12) != $true) & ((sK1 @ X11 @ X12) = $true)) => (($true = (X9 @ (sK4 @ X9) @ (sK5 @ X9))) & ($true != (X9 @ (sK4 @ X9) @ (sK6 @ X9))) & ($true = (sK1 @ (sK5 @ X9) @ (sK6 @ X9)))))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f12,plain,(
% 0.22/0.40 ! [X9 : $i > $i > $o] : (? [X14,X13] : (($true = (sK1 @ X14 @ X13)) & ($true != (X9 @ X14 @ X13))) => (($true = (sK1 @ (sK8 @ X9) @ (sK7 @ X9))) & ($true != (X9 @ (sK8 @ X9) @ (sK7 @ X9)))))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f8,plain,(
% 0.22/0.40 ? [X0,X1 : $i > $i > $o,X2] : (? [X3 : $i > $i > $o] : (! [X4,X5] : (($true = (X3 @ X5 @ X4)) | ($true != (X1 @ X5 @ X4))) & ((X3 @ X2 @ X0) != $true) & ! [X6,X7,X8] : (((X3 @ X7 @ X6) != $true) | ((X3 @ X8 @ X6) = $true) | ($true != (X3 @ X8 @ X7)))) & ! [X9 : $i > $i > $o] : (($true = (X9 @ X2 @ X0)) | ? [X10,X11,X12] : (($true = (X9 @ X10 @ X11)) & ((X9 @ X10 @ X12) != $true) & ($true = (X1 @ X11 @ X12))) | ? [X13,X14] : (($true = (X1 @ X14 @ X13)) & ($true != (X9 @ X14 @ X13)))))),
% 0.22/0.40 inference(rectify,[],[f7])).
% 0.22/0.40 thf(f7,plain,(
% 0.22/0.40 ? [X2,X0 : $i > $i > $o,X1] : (? [X9 : $i > $i > $o] : (! [X14,X13] : (($true = (X9 @ X13 @ X14)) | ((X0 @ X13 @ X14) != $true)) & ($true != (X9 @ X1 @ X2)) & ! [X10,X11,X12] : (($true != (X9 @ X11 @ X10)) | ((X9 @ X12 @ X10) = $true) | ($true != (X9 @ X12 @ X11)))) & ! [X3 : $i > $i > $o] : (((X3 @ X1 @ X2) = $true) | ? [X5,X4,X6] : (($true = (X3 @ X5 @ X4)) & ((X3 @ X5 @ X6) != $true) & ($true = (X0 @ X4 @ X6))) | ? [X8,X7] : (((X0 @ X7 @ X8) = $true) & ($true != (X3 @ X7 @ X8)))))),
% 0.22/0.40 inference(flattening,[],[f6])).
% 0.22/0.40 thf(f6,plain,(
% 0.22/0.40 ? [X0 : $i > $i > $o,X2,X1] : (? [X9 : $i > $i > $o] : (($true != (X9 @ X1 @ X2)) & (! [X14,X13] : (($true = (X9 @ X13 @ X14)) | ((X0 @ X13 @ X14) != $true)) & ! [X12,X10,X11] : (((X9 @ X12 @ X10) = $true) | (($true != (X9 @ X12 @ X11)) | ($true != (X9 @ X11 @ X10)))))) & ! [X3 : $i > $i > $o] : (((X3 @ X1 @ X2) = $true) | (? [X8,X7] : (((X0 @ X7 @ X8) = $true) & ($true != (X3 @ X7 @ X8))) | ? [X4,X5,X6] : (((X3 @ X5 @ X6) != $true) & (($true = (X3 @ X5 @ X4)) & ($true = (X0 @ X4 @ X6)))))))),
% 0.22/0.40 inference(ennf_transformation,[],[f5])).
% 0.22/0.40 thf(f5,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o,X2,X1] : (! [X3 : $i > $i > $o] : ((! [X7,X8] : (((X0 @ X7 @ X8) = $true) => ($true = (X3 @ X7 @ X8))) & ! [X4,X5,X6] : ((($true = (X3 @ X5 @ X4)) & ($true = (X0 @ X4 @ X6))) => ((X3 @ X5 @ X6) = $true))) => ((X3 @ X1 @ X2) = $true)) => ! [X9 : $i > $i > $o] : ((! [X13,X14] : (((X0 @ X13 @ X14) = $true) => ($true = (X9 @ X13 @ X14))) & ! [X12,X10,X11] : ((($true = (X9 @ X12 @ X11)) & ($true = (X9 @ X11 @ X10))) => ((X9 @ X12 @ X10) = $true))) => ($true = (X9 @ X1 @ X2))))),
% 0.22/0.40 inference(fool_elimination,[],[f4])).
% 0.22/0.40 thf(f4,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o,X1,X2] : (! [X3 : $i > $i > $o] : ((! [X4,X5,X6] : (((X3 @ X5 @ X4) & (X0 @ X4 @ X6)) => (X3 @ X5 @ X6)) & ! [X7,X8] : ((X0 @ X7 @ X8) => (X3 @ X7 @ X8))) => (X3 @ X1 @ X2)) => ! [X9 : $i > $i > $o] : ((! [X10,X11,X12] : (((X9 @ X12 @ X11) & (X9 @ X11 @ X10)) => (X9 @ X12 @ X10)) & ! [X13,X14] : ((X0 @ X13 @ X14) => (X9 @ X13 @ X14))) => (X9 @ X1 @ X2)))),
% 0.22/0.40 inference(rectify,[],[f2])).
% 0.22/0.40 thf(f2,negated_conjecture,(
% 0.22/0.40 ~! [X0 : $i > $i > $o,X1,X2] : (! [X3 : $i > $i > $o] : ((! [X7,X6,X8] : (((X3 @ X6 @ X7) & (X0 @ X7 @ X8)) => (X3 @ X6 @ X8)) & ! [X4,X5] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5))) => (X3 @ X1 @ X2)) => ! [X3 : $i > $i > $o] : ((! [X9,X5,X4] : (((X3 @ X4 @ X5) & (X3 @ X5 @ X9)) => (X3 @ X4 @ X9)) & ! [X4,X5] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5))) => (X3 @ X1 @ X2)))),
% 0.22/0.40 inference(negated_conjecture,[],[f1])).
% 0.22/0.40 thf(f1,conjecture,(
% 0.22/0.40 ! [X0 : $i > $i > $o,X1,X2] : (! [X3 : $i > $i > $o] : ((! [X7,X6,X8] : (((X3 @ X6 @ X7) & (X0 @ X7 @ X8)) => (X3 @ X6 @ X8)) & ! [X4,X5] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5))) => (X3 @ X1 @ X2)) => ! [X3 : $i > $i > $o] : ((! [X9,X5,X4] : (((X3 @ X4 @ X5) & (X3 @ X5 @ X9)) => (X3 @ X4 @ X9)) & ! [X4,X5] : ((X0 @ X4 @ X5) => (X3 @ X4 @ X5))) => (X3 @ X1 @ X2)))),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cT146A_pme)).
% 0.22/0.40 thf(f164,plain,(
% 0.22/0.40 spl9_5 | spl9_10 | ~spl9_7),
% 0.22/0.40 inference(avatar_split_clause,[],[f162,f106,f149,f98])).
% 0.22/0.40 thf(f98,plain,(
% 0.22/0.40 spl9_5 <=> ($true = (sK3 @ sK2 @ sK0))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_5])])).
% 0.22/0.40 thf(f106,plain,(
% 0.22/0.40 spl9_7 <=> ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_7])])).
% 0.22/0.40 thf(f162,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ~spl9_7),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f161])).
% 0.22/0.40 thf(f161,plain,(
% 0.22/0.40 ($true = (sK3 @ sK2 @ sK0)) | ($true = (sK1 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ($true != $true) | ~spl9_7),
% 0.22/0.40 inference(superposition,[],[f17,f107])).
% 0.22/0.40 thf(f107,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ~spl9_7),
% 0.22/0.40 inference(avatar_component_clause,[],[f106])).
% 0.22/0.40 thf(f17,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true != (X9 @ (sK4 @ X9) @ (sK6 @ X9))) | ($true = (sK1 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (X9 @ sK2 @ sK0))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f159,plain,(
% 0.22/0.40 spl9_7 | ~spl9_6 | ~spl9_8),
% 0.22/0.40 inference(avatar_split_clause,[],[f158,f112,f102,f106])).
% 0.22/0.40 thf(f102,plain,(
% 0.22/0.40 spl9_6 <=> ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_6])])).
% 0.22/0.40 thf(f112,plain,(
% 0.22/0.40 spl9_8 <=> ($true = (sK1 @ (sK5 @ sK3) @ (sK6 @ sK3)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl9_8])])).
% 0.22/0.40 thf(f158,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | (~spl9_6 | ~spl9_8)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f155])).
% 0.22/0.40 thf(f155,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ($true != $true) | (~spl9_6 | ~spl9_8)),
% 0.22/0.40 inference(superposition,[],[f122,f154])).
% 0.22/0.40 thf(f154,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK5 @ sK3) @ (sK6 @ sK3))) | ~spl9_8),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f153])).
% 0.22/0.40 thf(f153,plain,(
% 0.22/0.40 ($true != $true) | ($true = (sK3 @ (sK5 @ sK3) @ (sK6 @ sK3))) | ~spl9_8),
% 0.22/0.40 inference(superposition,[],[f22,f114])).
% 0.22/0.40 thf(f114,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ sK3) @ (sK6 @ sK3))) | ~spl9_8),
% 0.22/0.40 inference(avatar_component_clause,[],[f112])).
% 0.22/0.40 thf(f122,plain,(
% 0.22/0.40 ( ! [X0 : $i] : (((sK3 @ (sK5 @ sK3) @ X0) != $true) | ($true = (sK3 @ (sK4 @ sK3) @ X0))) ) | ~spl9_6),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f121])).
% 0.22/0.40 thf(f121,plain,(
% 0.22/0.40 ( ! [X0 : $i] : (((sK3 @ (sK5 @ sK3) @ X0) != $true) | ($true = (sK3 @ (sK4 @ sK3) @ X0)) | ($true != $true)) ) | ~spl9_6),
% 0.22/0.40 inference(superposition,[],[f20,f104])).
% 0.22/0.40 thf(f104,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3))) | ~spl9_6),
% 0.22/0.40 inference(avatar_component_clause,[],[f102])).
% 0.22/0.40 thf(f20,plain,(
% 0.22/0.40 ( ! [X8 : $i,X6 : $i,X7 : $i] : (($true != (sK3 @ X8 @ X7)) | ((sK3 @ X8 @ X6) = $true) | ((sK3 @ X7 @ X6) != $true)) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f143,plain,(
% 0.22/0.40 spl9_8 | spl9_5 | ~spl9_9),
% 0.22/0.40 inference(avatar_split_clause,[],[f138,f130,f98,f112])).
% 0.22/0.40 thf(f138,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ sK3) @ (sK6 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ~spl9_9),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f137])).
% 0.22/0.40 thf(f137,plain,(
% 0.22/0.40 ($true != $true) | ($true = (sK3 @ sK2 @ sK0)) | ($true = (sK1 @ (sK5 @ sK3) @ (sK6 @ sK3))) | ~spl9_9),
% 0.22/0.40 inference(superposition,[],[f14,f132])).
% 0.22/0.40 thf(f132,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ~spl9_9),
% 0.22/0.40 inference(avatar_component_clause,[],[f130])).
% 0.22/0.40 thf(f14,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true != (X9 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (X9 @ sK2 @ sK0)) | ($true = (sK1 @ (sK5 @ X9) @ (sK6 @ X9)))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f142,plain,(
% 0.22/0.40 ~spl9_7 | spl9_5 | ~spl9_9),
% 0.22/0.40 inference(avatar_split_clause,[],[f141,f130,f98,f106])).
% 0.22/0.40 thf(f141,plain,(
% 0.22/0.40 ($true != (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ~spl9_9),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f136])).
% 0.22/0.40 thf(f136,plain,(
% 0.22/0.40 ($true != (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ($true != $true) | ~spl9_9),
% 0.22/0.40 inference(superposition,[],[f16,f132])).
% 0.22/0.40 thf(f16,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true != (X9 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (X9 @ sK2 @ sK0)) | ($true != (X9 @ (sK4 @ X9) @ (sK6 @ X9)))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f133,plain,(
% 0.22/0.40 spl9_5 | spl9_7 | spl9_9 | ~spl9_6),
% 0.22/0.40 inference(avatar_split_clause,[],[f126,f102,f130,f106,f98])).
% 0.22/0.40 thf(f126,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ~spl9_6),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f123])).
% 0.22/0.40 thf(f123,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK8 @ sK3) @ (sK7 @ sK3))) | ($true = (sK3 @ (sK4 @ sK3) @ (sK6 @ sK3))) | ($true != $true) | ($true = (sK3 @ sK2 @ sK0)) | ~spl9_6),
% 0.22/0.40 inference(superposition,[],[f122,f85])).
% 0.22/0.40 thf(f85,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (($true = (sK3 @ (sK5 @ X0) @ (sK6 @ X0))) | ((X0 @ sK2 @ sK0) = $true) | ((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true)) )),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f84])).
% 0.22/0.40 thf(f84,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (($true = (sK3 @ (sK5 @ X0) @ (sK6 @ X0))) | ((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true) | ((X0 @ sK2 @ sK0) = $true) | ($true != $true)) )),
% 0.22/0.40 inference(superposition,[],[f22,f27])).
% 0.22/0.40 thf(f27,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (($true = (sK1 @ (sK5 @ X0) @ (sK6 @ X0))) | ((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true) | ((X0 @ sK2 @ sK0) = $true)) )),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f23])).
% 0.22/0.40 thf(f23,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (($true != $true) | ((X0 @ sK2 @ sK0) = $true) | ((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true) | ($true = (sK1 @ (sK5 @ X0) @ (sK6 @ X0)))) )),
% 0.22/0.40 inference(superposition,[],[f22,f15])).
% 0.22/0.40 thf(f15,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true = (sK1 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (sK1 @ (sK5 @ X9) @ (sK6 @ X9))) | ($true = (X9 @ sK2 @ sK0))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f119,plain,(
% 0.22/0.40 ~spl9_5),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f118])).
% 0.22/0.40 thf(f118,plain,(
% 0.22/0.40 $false | ~spl9_5),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f116])).
% 0.22/0.40 thf(f116,plain,(
% 0.22/0.40 ($true != $true) | ~spl9_5),
% 0.22/0.40 inference(superposition,[],[f21,f100])).
% 0.22/0.40 thf(f100,plain,(
% 0.22/0.40 ($true = (sK3 @ sK2 @ sK0)) | ~spl9_5),
% 0.22/0.40 inference(avatar_component_clause,[],[f98])).
% 0.22/0.40 thf(f21,plain,(
% 0.22/0.40 ($true != (sK3 @ sK2 @ sK0))),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f110,plain,(
% 0.22/0.40 spl9_6 | spl9_5),
% 0.22/0.40 inference(avatar_split_clause,[],[f94,f98,f102])).
% 0.22/0.40 thf(f94,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3))) | ($true = (sK3 @ sK2 @ sK0))),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f93])).
% 0.22/0.40 thf(f93,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3))) | ($true = (sK3 @ sK2 @ sK0)) | ($true != $true)),
% 0.22/0.40 inference(duplicate_literal_removal,[],[f87])).
% 0.22/0.40 thf(f87,plain,(
% 0.22/0.40 ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3))) | ($true != $true) | ($true = (sK3 @ sK2 @ sK0)) | ($true = (sK3 @ (sK4 @ sK3) @ (sK5 @ sK3))) | ($true = (sK3 @ sK2 @ sK0))),
% 0.22/0.40 inference(superposition,[],[f18,f69])).
% 0.22/0.40 thf(f69,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true) | ((X0 @ (sK4 @ X0) @ (sK5 @ X0)) = $true) | ((X0 @ sK2 @ sK0) = $true)) )),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f59])).
% 0.22/0.40 thf(f59,plain,(
% 0.22/0.40 ( ! [X0 : $i > $i > $o] : (($true != $true) | ((X0 @ sK2 @ sK0) = $true) | ((sK3 @ (sK8 @ X0) @ (sK7 @ X0)) = $true) | ((X0 @ (sK4 @ X0) @ (sK5 @ X0)) = $true)) )),
% 0.22/0.40 inference(superposition,[],[f22,f19])).
% 0.22/0.40 thf(f19,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true = (sK1 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (X9 @ (sK4 @ X9) @ (sK5 @ X9))) | ($true = (X9 @ sK2 @ sK0))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 thf(f18,plain,(
% 0.22/0.40 ( ! [X9 : $i > $i > $o] : (($true != (X9 @ (sK8 @ X9) @ (sK7 @ X9))) | ($true = (X9 @ (sK4 @ X9) @ (sK5 @ X9))) | ($true = (X9 @ sK2 @ sK0))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f13])).
% 0.22/0.40 % SZS output end Proof for theBenchmark
% 0.22/0.40 % (28575)------------------------------
% 0.22/0.40 % (28575)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.22/0.40 % (28575)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (28575)Memory used [KB]: 5628
% 0.22/0.40 % (28575)Time elapsed: 0.021 s
% 0.22/0.40 % (28575)Instructions burned: 21 (million)
% 0.22/0.40 % (28575)------------------------------
% 0.22/0.40 % (28575)------------------------------
% 0.22/0.40 % (28572)Success in time 0.035 s
%------------------------------------------------------------------------------