%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV127^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:39:02 AM UTC 2026
% Result : Theorem 0.08s 0.20s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV127^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 15:12:03 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.20 % (229269)Will run a generic schedule for satisfiability detection.
% 0.08/0.20 % (229275)% WARNING: option uhcvi not known.
% 0.08/0.20 % (229276)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2522434782:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.20 % (229275)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1687022873:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.20 % (229279)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4103163754:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.20 % (229277)dis+10_1_sil=32000:sp=arity:random_seed=3012508375:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.20 % (229274)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=232808050_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.20 % (229278)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2077980082:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.20 % (229280)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3848154479:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.20 % (229275)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.20 % (229278)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.20 % (229275)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.20 % Exception at run slice level
% 0.08/0.20 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.20 % (229288)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1724481359:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.08/0.20 % Exception at run slice level
% 0.08/0.20 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.20 % (229290)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3107369653:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.20 % (229277)Instruction limit reached!
% 0.08/0.20 % (229277)------------------------------
% 0.08/0.20 % (229277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.20 % (229277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.20 % (229277)CaDiCaL version: 2.1.3
% 0.08/0.20 % (229277)Termination reason: Instruction limit
% 0.08/0.20 % (229277)Termination phase: Saturation
% 0.08/0.20 % (229277)Time elapsed: 0.027 s
% 0.08/0.20 % (229277)Peak memory usage: 12 MB
% 0.08/0.20 % (229277)Instructions burned: 107 (million)
% 0.08/0.20 % (229278)Instruction limit reached!
% 0.08/0.20 % (229278)------------------------------
% 0.08/0.20 % (229278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.20 % (229278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.20 % (229278)CaDiCaL version: 2.1.3
% 0.08/0.20 % (229278)Termination reason: Instruction limit
% 0.08/0.20 % (229278)Termination phase: Saturation
% 0.08/0.20 % (229278)Time elapsed: 0.029 s
% 0.08/0.20 % (229278)Peak memory usage: 12 MB
% 0.08/0.20 % (229278)Instructions burned: 120 (million)
% 0.08/0.20 % (229279)Instruction limit reached!
% 0.08/0.20 % (229279)------------------------------
% 0.08/0.20 % (229279)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.20 % (229279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.20 % (229279)CaDiCaL version: 2.1.3
% 0.08/0.20 % (229279)Termination reason: Instruction limit
% 0.08/0.20 % (229279)Termination phase: Saturation
% 0.08/0.20 % (229279)Time elapsed: 0.034 s
% 0.08/0.20 % (229279)Peak memory usage: 12 MB
% 0.08/0.20 % (229279)Instructions burned: 135 (million)
% 0.08/0.20 % (229292)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1786606222:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.08/0.20 % (229292)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.20 % (229293)ott-21_1_sil=16000:fs=off:random_seed=2410583132:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.08/0.20 % (229292)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.20 % (229280)Instruction limit reached!
% 0.08/0.20 % (229280)------------------------------
% 0.08/0.20 % (229280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.20 % (229280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.20 % (229280)CaDiCaL version: 2.1.3
% 0.08/0.20 % (229280)Termination reason: Instruction limit
% 0.08/0.20 % (229280)Termination phase: Saturation
% 0.08/0.20 % (229280)Time elapsed: 0.041 s
% 0.08/0.20 % (229280)Peak memory usage: 13 MB
% 0.08/0.20 % (229280)Instructions burned: 159 (million)
% 0.08/0.20 % (229290) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-229269-229290"...
% 0.08/0.20 % (229294)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3977126693:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.08/0.20 % (229290)...printing done.
% 0.08/0.20 % (229290)Refutation found. Thanks to Tanya!
% 0.08/0.20 % SZS status Theorem for theBenchmark
% 0.08/0.20 % SZS output start Proof for theBenchmark
% 0.08/0.20 thf(type_def_5, type, a: $tType).
% 0.08/0.20 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.08/0.20 thf(func_def_3, type, sK0: ((a > a > $o) > $o)).
% 0.08/0.20 thf(func_def_4, type, sK1: (a > a > $o)).
% 0.08/0.20 thf(func_def_5, type, sK2: (a > a > $o)).
% 0.08/0.20 thf(func_def_6, type, sK3: a).
% 0.08/0.20 thf(func_def_7, type, sK4: a).
% 0.08/0.20 thf(func_def_8, type, sK5: (a > a > $o)).
% 0.08/0.20 thf(func_def_9, type, sK6: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_10, type, sK7: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_11, type, sK8: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_12, type, sK9: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_13, type, sK10: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_14, type, sK11: ((a > a > $o) > a)).
% 0.08/0.20 thf(func_def_15, type, vNOT: ($o > $o)).
% 0.08/0.20 thf(func_def_17, type, db0: !>[X0: $tType]:(X0)).
% 0.08/0.20 thf(func_def_18, type, db1: !>[X0: $tType]:(X0)).
% 0.08/0.20 thf(func_def_19, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.08/0.20 thf(func_def_20, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.08/0.20 thf(func_def_21, type, db2: !>[X0: $tType]:(X0)).
% 0.08/0.20 thf(func_def_22, type, db3: !>[X0: $tType]:(X0)).
% 0.08/0.20 thf(func_def_23, type, db4: !>[X0: $tType]:(X0)).
% 0.08/0.20 thf(f1,conjecture,(
% 0.08/0.20 ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.08/0.20 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM252A_pme)).
% 0.08/0.20 thf(f2,negated_conjecture,(
% 0.08/0.20 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.08/0.20 inference(negated_conjecture,[status(cth)],[f1])).
% 0.08/0.20 thf(f3,plain,(
% 0.08/0.20 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X11 : (a > a > $o)] : (((X0 @ X11) & ! [X12 : a,X13 : a] : ((X1 @ X12 @ X13) => (X11 @ X12 @ X13))) => (X11 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X14 : (a > a > $o)] : (((X0 @ X14) & ! [X15 : a,X16 : a] : (((X2 @ X15 @ X16) | (X1 @ X15 @ X16)) => (X14 @ X15 @ X16))) => (X14 @ X3 @ X4)))),
% 0.08/0.20 inference(rectify,[],[f2])).
% 0.08/0.20 thf(f4,plain,(
% 0.08/0.20 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((((X0 @ X5)) = $true) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((((X0 @ X8)) = $true) & ! [X9 : a,X10 : a] : ((((X2 @ X9 @ X10)) = $true) => (((X8 @ X9 @ X10)) = $true))) => (((X8 @ X6 @ X7)) = $true)) | ! [X11 : (a > a > $o)] : (((((X0 @ X11)) = $true) & ! [X12 : a,X13 : a] : ((((X1 @ X12 @ X13)) = $true) => (((X11 @ X12 @ X13)) = $true))) => (((X11 @ X6 @ X7)) = $true))) => (((X5 @ X6 @ X7)) = $true))) => (((X5 @ X3 @ X4)) = $true)) => ! [X14 : (a > a > $o)] : (((((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : (((((X2 @ X15 @ X16)) = $true) | (((X1 @ X15 @ X16)) = $true)) => (((X14 @ X15 @ X16)) = $true))) => (((X14 @ X3 @ X4)) = $true)))),
% 0.08/0.20 inference(fool_elimination,[],[f3])).
% 0.08/0.20 thf(f5,plain,(
% 0.08/0.20 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X14 : (a > a > $o)] : ((((X14 @ X3 @ X4)) != $true) & ((((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | ((((X2 @ X15 @ X16)) != $true) & (((X1 @ X15 @ X16)) != $true))))) & ! [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) = $true) | ((((X0 @ X5)) != $true) | ? [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) != $true) & (! [X8 : (a > a > $o)] : ((((X8 @ X6 @ X7)) = $true) | ((((X0 @ X8)) != $true) | ? [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) != $true) & (((X2 @ X9 @ X10)) = $true)))) | ! [X11 : (a > a > $o)] : ((((X11 @ X6 @ X7)) = $true) | ((((X0 @ X11)) != $true) | ? [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) != $true) & (((X1 @ X12 @ X13)) = $true)))))))))),
% 0.08/0.20 inference(ennf_transformation,[],[f4])).
% 0.08/0.20 thf(f6,plain,(
% 0.08/0.20 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X14 : (a > a > $o)] : ((((X14 @ X3 @ X4)) != $true) & (((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | ((((X2 @ X15 @ X16)) != $true) & (((X1 @ X15 @ X16)) != $true)))) & ! [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) = $true) | (((X0 @ X5)) != $true) | ? [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) != $true) & (! [X8 : (a > a > $o)] : ((((X8 @ X6 @ X7)) = $true) | (((X0 @ X8)) != $true) | ? [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) != $true) & (((X2 @ X9 @ X10)) = $true))) | ! [X11 : (a > a > $o)] : ((((X11 @ X6 @ X7)) = $true) | (((X0 @ X11)) != $true) | ? [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) != $true) & (((X1 @ X12 @ X13)) = $true)))))))),
% 0.08/0.20 inference(flattening,[],[f5])).
% 0.08/0.20 thf(f7,plain,(
% 0.08/0.20 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) != $true) & (((X0 @ X5)) = $true) & ! [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) = $true) | ((((X2 @ X6 @ X7)) != $true) & (((X1 @ X6 @ X7)) != $true)))) & ! [X8 : (a > a > $o)] : (($true = ((X8 @ X3 @ X4))) | (((X0 @ X8)) != $true) | ? [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) != $true) & (! [X11 : (a > a > $o)] : (($true = ((X11 @ X9 @ X10))) | (((X0 @ X11)) != $true) | ? [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) != $true) & ($true = ((X2 @ X12 @ X13))))) | ! [X14 : (a > a > $o)] : (($true = ((X14 @ X9 @ X10))) | (((X0 @ X14)) != $true) | ? [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) != $true) & (((X1 @ X15 @ X16)) = $true)))))))),
% 0.08/0.20 inference(rectify,[],[f6])).
% 0.08/0.20 thf(f8,plain,(
% 0.08/0.20 (($true != ((sK5 @ sK3 @ sK4))) & ($true = ((sK0 @ sK5))) & ! [X6 : a,X7 : a] : (($true = ((sK5 @ X6 @ X7))) | (($true != ((sK2 @ X6 @ X7))) & ($true != ((sK1 @ X6 @ X7)))))) & ! [X8 : (a > a > $o)] : (($true = ((X8 @ sK3 @ sK4))) | ($true != ((sK0 @ X8))) | (($true != ((X8 @ (sK6 @ X8) @ (sK7 @ X8)))) & (! [X11 : (a > a > $o)] : (($true = ((X11 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X11))) | (($true != ((X11 @ (sK8 @ X11) @ (sK9 @ X11)))) & ($true = ((sK2 @ (sK8 @ X11) @ (sK9 @ X11)))))) | ! [X14 : (a > a > $o)] : (($true = ((X14 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X14))) | (($true != ((X14 @ (sK10 @ X14) @ (sK11 @ X14)))) & ($true = ((sK1 @ (sK10 @ X14) @ (sK11 @ X14)))))))))),
% 0.08/0.20 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,vAPP,vAPP,vAPP,vAPP,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X16,sK11 @ X14),skolemize(X16,sK11 @ X14),skolemize(X16,sK11 @ X14),skolemize(X16,sK11 @ X14),skolemize(X16,sK11 @ X14),skolemize(X16,sK11 @ X14)],[f7])).
% 0.08/0.20 thf(f9,plain,(
% 0.08/0.20 ( ! [X11 : (a > a > $o),X8 : (a > a > $o),X14 : (a > a > $o)] : (($true != ((sK0 @ X14))) | ($true != ((sK0 @ X8))) | ($true = ((X11 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X11))) | ($true = ((sK2 @ (sK8 @ X11) @ (sK9 @ X11)))) | ($true = ((X14 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true = ((X8 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ X14) @ (sK11 @ X14))))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f10,plain,(
% 0.08/0.20 ( ! [X11 : (a > a > $o),X8 : (a > a > $o),X14 : (a > a > $o)] : (($true != ((sK0 @ X14))) | ($true != ((sK0 @ X8))) | ($true = ((X11 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X11))) | ($true = ((sK2 @ (sK8 @ X11) @ (sK9 @ X11)))) | ($true = ((X14 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true = ((X8 @ sK3 @ sK4))) | ($true != ((X14 @ (sK10 @ X14) @ (sK11 @ X14))))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f11,plain,(
% 0.08/0.20 ( ! [X11 : (a > a > $o),X8 : (a > a > $o),X14 : (a > a > $o)] : (($true != ((sK0 @ X14))) | ($true != ((sK0 @ X8))) | ($true = ((X11 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X11))) | ($true != ((X11 @ (sK8 @ X11) @ (sK9 @ X11)))) | ($true = ((X14 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true = ((X8 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ X14) @ (sK11 @ X14))))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f12,plain,(
% 0.08/0.20 ( ! [X11 : (a > a > $o),X8 : (a > a > $o),X14 : (a > a > $o)] : (($true != ((sK0 @ X14))) | ($true != ((sK0 @ X8))) | ($true = ((X11 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true != ((sK0 @ X11))) | ($true != ((X11 @ (sK8 @ X11) @ (sK9 @ X11)))) | ($true = ((X14 @ (sK6 @ X8) @ (sK7 @ X8)))) | ($true = ((X8 @ sK3 @ sK4))) | ($true != ((X14 @ (sK10 @ X14) @ (sK11 @ X14))))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f13,plain,(
% 0.08/0.20 ( ! [X8 : (a > a > $o)] : (($true != ((sK0 @ X8))) | ($true = ((X8 @ sK3 @ sK4))) | ($true != ((X8 @ (sK6 @ X8) @ (sK7 @ X8))))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f14,plain,(
% 0.08/0.20 ( ! [X6 : a,X7 : a] : (($true != ((sK1 @ X6 @ X7))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f15,plain,(
% 0.08/0.20 ( ! [X6 : a,X7 : a] : (($true != ((sK2 @ X6 @ X7))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f16,plain,(
% 0.08/0.20 ($true = ((sK0 @ sK5)))),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f17,plain,(
% 0.08/0.20 ($true != ((sK5 @ sK3 @ sK4)))),
% 0.08/0.20 inference(cnf_transformation,[],[f8])).
% 0.08/0.20 thf(f19,definition,(
% 0.08/0.20 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.08/0.20 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.08/0.20 thf(f20,plain,(
% 0.08/0.20 ($true != $true) | ($true = ((sK5 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5))))),
% 0.08/0.20 inference(constrained_superposition,[],[f13,f16])).
% 0.08/0.20 thf(f21,plain,(
% 0.08/0.20 ($true = ((sK5 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5))))),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f20])).
% 0.08/0.20 thf(f22,plain,(
% 0.08/0.20 ($true != ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5))))),
% 0.08/0.20 inference(forward_subsumption_resolution,[],[f21,f17])).
% 0.08/0.20 thf(f26,plain,(
% 0.08/0.20 ($true != $true) | (((sK5 @ sK3 @ sK4)) = $false)),
% 0.08/0.20 inference(constrained_superposition,[],[f17,f19])).
% 0.08/0.20 thf(f27,plain,(
% 0.08/0.20 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X0 @ X1))) | ($false = ((sK1 @ X0 @ X1)))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f14,f19])).
% 0.08/0.20 thf(f28,plain,(
% 0.08/0.20 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X0 @ X1))) | ($false = ((sK2 @ X0 @ X1)))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f15,f19])).
% 0.08/0.20 thf(f29,plain,(
% 0.08/0.20 ($true != $true) | ($false = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5))))),
% 0.08/0.20 inference(constrained_superposition,[],[f22,f19])).
% 0.08/0.20 thf(f31,plain,(
% 0.08/0.20 ($false = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5))))),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f29])).
% 0.08/0.20 thf(f32,plain,(
% 0.08/0.20 ( ! [X0 : a,X1 : a] : (($true = ((sK5 @ X0 @ X1))) | ($false = ((sK2 @ X0 @ X1)))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f28])).
% 0.08/0.20 thf(f33,plain,(
% 0.08/0.20 ( ! [X0 : a,X1 : a] : (($true = ((sK5 @ X0 @ X1))) | ($false = ((sK1 @ X0 @ X1)))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f27])).
% 0.08/0.20 thf(f34,plain,(
% 0.08/0.20 (((sK5 @ sK3 @ sK4)) = $false)),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f26])).
% 0.08/0.20 thf(f47,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != $true) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f9,f16])).
% 0.08/0.20 thf(f50,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f47])).
% 0.08/0.20 thf(f53,definition,(
% 0.08/0.20 spl12_1 <=> ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition])).
% 0.08/0.20 thf(f55,plain,(
% 0.08/0.20 ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5)))) | ~spl12_1),
% 0.08/0.20 inference(avatar_component_clause,[],[f53])).
% 0.08/0.20 thf(f57,definition,(
% 0.08/0.20 spl12_2 <=> ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true != ((sK0 @ X1))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition])).
% 0.08/0.20 thf(f58,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X1))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0))))) ) | ~spl12_2),
% 0.08/0.20 inference(avatar_component_clause,[],[f57])).
% 0.08/0.20 thf(f59,plain,(
% 0.08/0.20 spl12_1 | spl12_2),
% 0.08/0.20 inference(avatar_split_clause,[],[f50,f57,f53])).
% 0.08/0.20 thf(f64,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != $true) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f10,f16])).
% 0.08/0.20 thf(f67,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f64])).
% 0.08/0.20 thf(f71,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != $true) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f11,f16])).
% 0.08/0.20 thf(f74,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f71])).
% 0.08/0.20 thf(f77,definition,(
% 0.08/0.20 spl12_3 <=> ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true != ((sK0 @ X1))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition])).
% 0.08/0.20 thf(f78,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X1))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0))))) ) | ~spl12_3),
% 0.08/0.20 inference(avatar_component_clause,[],[f77])).
% 0.08/0.20 thf(f79,plain,(
% 0.08/0.20 spl12_1 | spl12_3),
% 0.08/0.20 inference(avatar_split_clause,[],[f74,f77,f53])).
% 0.08/0.20 thf(f84,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != $true) | ($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(constrained_superposition,[],[f12,f16])).
% 0.08/0.20 thf(f87,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true != ((X1 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4))) | ($true != ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5))))) )),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f84])).
% 0.08/0.20 thf(f90,definition,(
% 0.08/0.20 spl12_4 <=> ($true = ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition])).
% 0.08/0.20 thf(f91,plain,(
% 0.08/0.20 ($true = ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5)))) | ~spl12_4),
% 0.08/0.20 inference(avatar_component_clause,[],[f90])).
% 0.08/0.20 thf(f92,plain,(
% 0.08/0.20 ($true != ((sK5 @ (sK10 @ sK5) @ (sK11 @ sK5)))) | spl12_4),
% 0.08/0.20 inference(avatar_component_clause,[],[f90])).
% 0.08/0.20 thf(f93,plain,(
% 0.08/0.20 ~spl12_4 | spl12_3),
% 0.08/0.20 inference(avatar_split_clause,[],[f87,f77,f90])).
% 0.08/0.20 thf(f96,plain,(
% 0.08/0.20 ($true != $true) | ($false = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5)))) | spl12_4),
% 0.08/0.20 inference(constrained_superposition,[],[f92,f33])).
% 0.08/0.20 thf(f101,plain,(
% 0.08/0.20 ($false = ((sK1 @ (sK10 @ sK5) @ (sK11 @ sK5)))) | spl12_4),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f96])).
% 0.08/0.20 thf(f103,plain,(
% 0.08/0.20 ($true = $false) | (~spl12_1 | spl12_4)),
% 0.08/0.20 inference(backward_demodulation,[],[f55,f101])).
% 0.08/0.20 thf(f104,plain,(
% 0.08/0.20 $false | (~spl12_1 | spl12_4)),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f103])).
% 0.08/0.20 thf(f105,plain,(
% 0.08/0.20 ~spl12_1 | spl12_4),
% 0.08/0.20 inference(avatar_contradiction_clause,[],[f104])).
% 0.08/0.20 thf(f174,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true != $true) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0))))) ) | ~spl12_2),
% 0.08/0.20 inference(constrained_superposition,[],[f58,f16])).
% 0.08/0.20 thf(f177,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true != $true) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0)))) ) | ~spl12_2),
% 0.08/0.20 inference(duplicate_literal_removal,[],[f174])).
% 0.08/0.20 thf(f181,definition,(
% 0.08/0.20 spl12_10 <=> ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_10])],[avatar_definition])).
% 0.08/0.20 thf(f183,plain,(
% 0.08/0.20 ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ~spl12_10),
% 0.08/0.20 inference(avatar_component_clause,[],[f181])).
% 0.08/0.20 thf(f185,definition,(
% 0.08/0.20 spl12_11 <=> ! [X0 : (a > a > $o)] : (($true = ((X0 @ sK3 @ sK4))) | ($true != ((sK0 @ X0))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_11])],[avatar_definition])).
% 0.08/0.20 thf(f186,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0))))) ) | ~spl12_11),
% 0.08/0.20 inference(avatar_component_clause,[],[f185])).
% 0.08/0.20 thf(f295,plain,(
% 0.08/0.20 ($true != $true) | ($true = ((sK5 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5)))) | ~spl12_11),
% 0.08/0.20 inference(constrained_superposition,[],[f186,f16])).
% 0.08/0.20 thf(f300,plain,(
% 0.08/0.20 ($true = ((sK5 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5)))) | ~spl12_11),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f295])).
% 0.08/0.20 thf(f302,plain,(
% 0.08/0.20 ($true = $false) | ($true = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5)))) | ~spl12_11),
% 0.08/0.20 inference(forward_demodulation,[],[f300,f34])).
% 0.08/0.20 thf(f303,plain,(
% 0.08/0.20 ($true = ((sK5 @ (sK6 @ sK5) @ (sK7 @ sK5)))) | ~spl12_11),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f302])).
% 0.08/0.20 thf(f304,plain,(
% 0.08/0.20 ($true = $false) | ~spl12_11),
% 0.08/0.20 inference(forward_demodulation,[],[f303,f31])).
% 0.08/0.20 thf(f305,plain,(
% 0.08/0.20 $false | ~spl12_11),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f304])).
% 0.08/0.20 thf(f306,plain,(
% 0.08/0.20 ~spl12_11),
% 0.08/0.20 inference(avatar_contradiction_clause,[],[f305])).
% 0.08/0.20 thf(f316,definition,(
% 0.08/0.20 spl12_14 <=> ($true = ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.08/0.20 introduced(definition,[new_symbols(definition,[spl12_14])],[avatar_definition])).
% 0.08/0.20 thf(f317,plain,(
% 0.08/0.20 ($true = ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ~spl12_14),
% 0.08/0.20 inference(avatar_component_clause,[],[f316])).
% 0.08/0.20 thf(f318,plain,(
% 0.08/0.20 ($true != ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | spl12_14),
% 0.08/0.20 inference(avatar_component_clause,[],[f316])).
% 0.08/0.20 thf(f321,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o),X1 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X1 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X1))) | ($true = ((sK2 @ (sK8 @ X1) @ (sK9 @ X1)))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((X0 @ sK3 @ sK4)))) ) | ~spl12_4),
% 0.08/0.20 inference(forward_subsumption_resolution,[],[f67,f91])).
% 0.08/0.20 thf(f322,plain,(
% 0.08/0.20 spl12_2 | ~spl12_4),
% 0.08/0.20 inference(avatar_split_clause,[],[f321,f90,f57])).
% 0.08/0.20 thf(f325,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0)))) ) | ~spl12_2),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f177])).
% 0.08/0.20 thf(f329,plain,(
% 0.08/0.20 spl12_10 | spl12_11 | ~spl12_2),
% 0.08/0.20 inference(avatar_split_clause,[],[f325,f57,f185,f181])).
% 0.08/0.20 thf(f336,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true != $true) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0))))) ) | ~spl12_3),
% 0.08/0.20 inference(constrained_superposition,[],[f78,f16])).
% 0.08/0.20 thf(f341,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true != $true) | ($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0)))) ) | ~spl12_3),
% 0.08/0.20 inference(duplicate_literal_removal,[],[f336])).
% 0.08/0.20 thf(f342,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true != ((sK0 @ X0)))) ) | ~spl12_3),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f341])).
% 0.08/0.20 thf(f346,plain,(
% 0.08/0.20 ($true != $true) | ($false = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | spl12_14),
% 0.08/0.20 inference(constrained_superposition,[],[f318,f32])).
% 0.08/0.20 thf(f349,plain,(
% 0.08/0.20 ($false = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | spl12_14),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f346])).
% 0.08/0.20 thf(f353,plain,(
% 0.08/0.20 ($true = $false) | (~spl12_10 | spl12_14)),
% 0.08/0.20 inference(backward_demodulation,[],[f183,f349])).
% 0.08/0.20 thf(f354,plain,(
% 0.08/0.20 $false | (~spl12_10 | spl12_14)),
% 0.08/0.20 inference(trivial_inequality_removal,[],[f353])).
% 0.08/0.20 thf(f355,plain,(
% 0.08/0.20 ~spl12_10 | spl12_14),
% 0.08/0.20 inference(avatar_contradiction_clause,[],[f354])).
% 0.08/0.20 thf(f356,plain,(
% 0.08/0.20 ( ! [X0 : (a > a > $o)] : (($true = ((X0 @ sK3 @ sK4))) | ($true = ((sK5 @ (sK6 @ X0) @ (sK7 @ X0)))) | ($true != ((sK0 @ X0)))) ) | (~spl12_3 | ~spl12_14)),
% 0.08/0.20 inference(forward_subsumption_resolution,[],[f342,f317])).
% 0.08/0.20 thf(f357,plain,(
% 0.08/0.20 spl12_11 | ~spl12_3 | ~spl12_14),
% 0.08/0.20 inference(avatar_split_clause,[],[f356,f316,f77,f185])).
% 0.08/0.20 cnf(s1, plain, spl12_1 | spl12_2, inference(sat_conversion,[],[f59])).
% 0.08/0.20 cnf(s2, plain, spl12_1 | spl12_3, inference(sat_conversion,[],[f79])).
% 0.08/0.20 cnf(s3, plain, spl12_3 | ~spl12_4, inference(sat_conversion,[],[f93])).
% 0.08/0.20 cnf(s4, plain, ~spl12_1 | spl12_4, inference(sat_conversion,[],[f105])).
% 0.08/0.20 cnf(s8, plain, ~spl12_11, inference(sat_conversion,[],[f306])).
% 0.08/0.20 cnf(s13, plain, spl12_2 | ~spl12_4, inference(sat_conversion,[],[f322])).
% 0.08/0.20 cnf(s16, plain, ~spl12_2 | spl12_10 | spl12_11, inference(sat_conversion,[],[f329])).
% 0.08/0.20 cnf(s17, plain, ~spl12_10 | spl12_14, inference(sat_conversion,[],[f355])).
% 0.08/0.20 cnf(s18, plain, ~spl12_3 | spl12_11 | ~spl12_14, inference(sat_conversion,[],[f357])).
% 0.08/0.20 cnf(s20, plain, spl12_1, inference(rat,[],[s17,s16,s18,s1,s2,s8])).
% 0.08/0.20 cnf(s21, plain, spl12_4, inference(rat,[],[s4,s20])).
% 0.08/0.20 cnf(s22, plain, spl12_2, inference(rat,[],[s13,s21])).
% 0.08/0.20 cnf(s23, plain, spl12_3, inference(rat,[],[s3,s21])).
% 0.08/0.20 cnf(s24, plain, spl12_10, inference(rat,[],[s16,s8,s22])).
% 0.08/0.20 cnf(s25, plain, ~spl12_14, inference(rat,[],[s18,s8,s23])).
% 0.08/0.20 cnf(s26, plain, $false, inference(rat,[],[s17,s25,s24])).
% 0.08/0.20 thf(f358,plain,(
% 0.08/0.20 $false),
% 0.08/0.20 inference(avatar_sat_refutation,[],[s26])).
% 0.08/0.20 % SZS output end Proof for theBenchmark
% 0.08/0.20 % (229290)------------------------------
% 0.08/0.20 % (229290)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.20 % (229290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.20 % (229290)CaDiCaL version: 2.1.3
% 0.08/0.20 % (229290)Termination reason: Refutation
% 0.08/0.20 % (229290)Time elapsed: 0.021 s
% 0.08/0.20 % (229290)Peak memory usage: 13 MB
% 0.08/0.20 % (229290)Instructions burned: 76 (million)
% 0.08/0.20 % (229269)Success in time 0.072 s
% 0.08/0.20 % Vampire exiting
%------------------------------------------------------------------------------