%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV080^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 : n005.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:38:58 AM UTC 2026
% Result : Theorem 1.15s 0.59s
% Output : Refutation 1.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV080^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.28 % Computer : n005.cluster.edu
% 0.12/0.28 % Model : x86_64 x86_64
% 0.12/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.28 % Memory : 8046.5625MB
% 0.12/0.28 % OS : Linux 6.8.0-71-generic
% 0.12/0.28 % CPULimit : 300
% 0.12/0.28 % WCLimit : 300
% 0.12/0.28 % DateTime : Tue Sep 29 15:06:46 UTC 2026
% 0.12/0.29 % CPUTime :
% 0.12/0.29 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.29/0.34 Running first-order model finding
% 0.29/0.34 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
% 1.15/0.59 % (1779810)Will run a generic schedule for satisfiability detection.
% 1.15/0.59 % (1779818)dis+10_1_sil=32000:sp=arity:random_seed=762125800:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.15/0.59 % (1779816)% WARNING: option uhcvi not known.
% 1.15/0.59 % (1779815)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3192867711_2999 on theBenchmark for (2999ds/0Mi)
% 1.15/0.59 % (1779816)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=454234887:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.15/0.59 % (1779817)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=746472592:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.15/0.59 % (1779819)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2453192585:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.15/0.59 % (1779816)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.15/0.59 % Exception at run slice level
% 1.15/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.15/0.59 % (1779819)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.15/0.59 % (1779816)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.15/0.59 % (1779821)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=301485537:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.15/0.59 % (1779820)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1888067219:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.15/0.59 % (1779829)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3130912448:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.15/0.59 % (1779818)Instruction limit reached!
% 1.15/0.59 % (1779818)------------------------------
% 1.15/0.59 % (1779818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59 % (1779818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59 % (1779818)CaDiCaL version: 2.1.3
% 1.15/0.59 % (1779818)Termination reason: Instruction limit
% 1.15/0.59 % (1779818)Termination phase: Saturation
% 1.15/0.59 % (1779818)Time elapsed: 0.049 s
% 1.15/0.59 % (1779818)Peak memory usage: 12 MB
% 1.15/0.59 % (1779818)Instructions burned: 104 (million)
% 1.15/0.59 % Exception at run slice level
% 1.15/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.15/0.59 % (1779831)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1231875112:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.15/0.59 % (1779832)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=4039754693:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.15/0.59 % (1779832)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.15/0.59 % (1779832)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.15/0.59 % (1779819)Instruction limit reached!
% 1.15/0.59 % (1779819)------------------------------
% 1.15/0.59 % (1779819)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59 % (1779819)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59 % (1779819)CaDiCaL version: 2.1.3
% 1.15/0.59 % (1779819)Termination reason: Instruction limit
% 1.15/0.59 % (1779819)Termination phase: Saturation
% 1.15/0.59 % (1779819)Time elapsed: 0.099 s
% 1.15/0.59 % (1779819)Peak memory usage: 12 MB
% 1.15/0.59 % (1779819)Instructions burned: 116 (million)
% 1.15/0.59 % (1779820)Instruction limit reached!
% 1.15/0.59 % (1779820)------------------------------
% 1.15/0.59 % (1779820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59 % (1779820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59 % (1779820)CaDiCaL version: 2.1.3
% 1.15/0.59 % (1779820)Termination reason: Instruction limit
% 1.15/0.59 % (1779820)Termination phase: Saturation
% 1.15/0.59 % (1779820)Time elapsed: 0.119 s
% 1.15/0.59 % (1779820)Peak memory usage: 13 MB
% 1.15/0.59 % (1779820)Instructions burned: 132 (million)
% 1.15/0.59 % (1779835)ott-21_1_sil=16000:fs=off:random_seed=1218998028:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.15/0.59 % (1779831)Instruction limit reached!
% 1.15/0.59 % (1779831)------------------------------
% 1.15/0.59 % (1779831)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59 % (1779831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59 % (1779831)CaDiCaL version: 2.1.3
% 1.15/0.59 % (1779831)Termination reason: Instruction limit
% 1.15/0.59 % (1779831)Termination phase: Saturation
% 1.15/0.59 % (1779831)Time elapsed: 0.068 s
% 1.15/0.59 % (1779831)Peak memory usage: 13 MB
% 1.15/0.59 % (1779831)Instructions burned: 132 (million)
% 1.15/0.59 % (1779821)Instruction limit reached!
% 1.15/0.59 % (1779821)------------------------------
% 1.15/0.59 % (1779821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59 % (1779821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59 % (1779821)CaDiCaL version: 2.1.3
% 1.15/0.59 % (1779821)Termination reason: Instruction limit
% 1.15/0.59 % (1779821)Termination phase: Saturation
% 1.15/0.59 % (1779821)Time elapsed: 0.141 s
% 1.15/0.59 % (1779821)Peak memory usage: 13 MB
% 1.15/0.59 % (1779821)Instructions burned: 159 (million)
% 1.15/0.59 % (1779836)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=126482705:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.15/0.59 % (1779838)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2656729185:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.15/0.59 % Exception at run slice level
% 1.15/0.59 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.15/0.59 % (1779839)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=878382662:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.15/0.59 % (1779816) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1779810-1779816"...
% 1.15/0.59 % (1779816)...printing done.
% 1.15/0.59 % (1779816)Refutation found. Thanks to Tanya!
% 1.15/0.59 % SZS status Theorem for theBenchmark
% 1.15/0.59 % SZS output start Proof for theBenchmark
% 1.15/0.59 thf(type_def_5, type, a: $tType).
% 1.15/0.59 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 1.15/0.59 thf(func_def_3, type, vAND: ($o > $o > $o)).
% 1.15/0.59 thf(func_def_4, type, db0: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_5, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 1.15/0.59 thf(func_def_6, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 1.15/0.59 thf(func_def_7, type, db1: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_8, type, sK0: (a > $o)).
% 1.15/0.59 thf(func_def_9, type, sK1: ((a > a) > a)).
% 1.15/0.59 thf(func_def_10, type, sK2: ((a > a) > a)).
% 1.15/0.59 thf(func_def_11, type, sK3: (a > (a > a) > a)).
% 1.15/0.59 thf(func_def_12, type, sK4: (a > (a > a) > a)).
% 1.15/0.59 thf(func_def_14, type, sK6: ((a > a > a) > a)).
% 1.15/0.59 thf(func_def_15, type, sK7: ((a > a) > a)).
% 1.15/0.59 thf(func_def_16, type, sK8: ((a > a > a) > a)).
% 1.15/0.59 thf(func_def_17, type, db2: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_18, type, db3: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_19, type, db4: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_20, type, sK9: a).
% 1.15/0.59 thf(func_def_21, type, sK10: ((a > a > a) > a)).
% 1.15/0.59 thf(func_def_22, type, sK11: ((a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_23, type, sK12: ((a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_24, type, sK13: ((a > a > a) > (a > a > a) > a)).
% 1.15/0.59 thf(func_def_25, type, sK14: ((a > a > a) > (a > a > a) > a)).
% 1.15/0.59 thf(func_def_26, type, sK15: ((a > a > a) > (a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_27, type, sK16: ((a > a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_28, type, db5: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_29, type, db6: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_30, type, db7: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_31, type, db8: !>[X0: $tType]:(X0)).
% 1.15/0.59 thf(func_def_32, type, sK17: a).
% 1.15/0.59 thf(func_def_33, type, sK18: a).
% 1.15/0.59 thf(func_def_34, type, sK19: ((a > a > a > a) > (a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_35, type, sK20: (a > (a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_36, type, sK21: (a > (a > a > a > a) > a)).
% 1.15/0.59 thf(func_def_37, type, sK22: a).
% 1.15/0.59 thf(f1,conjecture,(
% 1.15/0.59 ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X3 : a] : ((X0 @ X3) => ? [X4 : a] : ((^[X2 : a] : ((X3 = ((X1 @ X2))) & (X0 @ X2))) = (((^[X0 : a, X3 : a] : ((X0 = X3))) @ X4)))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 1.15/0.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEQP_1A_pme)).
% 1.15/0.59 thf(f2,negated_conjecture,(
% 1.15/0.59 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X3 : a] : ((X0 @ X3) => ? [X4 : a] : ((^[X2 : a] : ((X3 = ((X1 @ X2))) & (X0 @ X2))) = (((^[X0 : a, X3 : a] : ((X0 = X3))) @ X4)))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 1.15/0.59 inference(negated_conjecture,[status(cth)],[f1])).
% 1.15/0.59 thf(f3,plain,(
% 1.15/0.59 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X2 : a] : ((X0 @ X2) => ? [X3 : a] : ((^[X4 : a] : ((((X1 @ X4)) = X2) & (X0 @ X4))) = (((^[X5 : a, X6 : a] : ((X5 = X6))) @ X3)))) & ! [X7 : a] : ((X0 @ X7) => (X0 @ (X1 @ X7))))),
% 1.15/0.59 inference(rectify,[],[f2])).
% 1.15/0.59 thf(f4,plain,(
% 1.15/0.59 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X2 : a] : ((((X0 @ X2)) = $true) => ? [X3 : a] : ((^[Y0 : a]: ((X0 @ Y0) & ((X1 @ Y0) = X2))) = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3)))) & ! [X7 : a] : ((((X0 @ X7)) = $true) => (((X0 @ (X1 @ X7))) = $true)))),
% 1.15/0.59 inference(fool_elimination,[],[f3])).
% 1.15/0.59 thf(f5,plain,(
% 1.15/0.59 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X2 : a] : ((((X0 @ X2)) = $true) => ? [X3 : a] : ((^[Y0 : a]: ((X0 @ Y0) & ((X1 @ Y0) = X2))) = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3)))) & ! [X4 : a] : ((((X0 @ X4)) = $true) => ($true = ((X0 @ (X1 @ X4))))))),
% 1.15/0.59 inference(rectify,[],[f4])).
% 1.15/0.59 thf(f6,plain,(
% 1.15/0.59 ? [X0 : (a > $o)] : ! [X1 : (a > a)] : (? [X2 : a] : (! [X3 : a] : ((^[Y0 : a]: ((X0 @ Y0) & ((X1 @ Y0) = X2))) != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3))) & (((X0 @ X2)) = $true)) | ? [X4 : a] : (($true != ((X0 @ (X1 @ X4)))) & (((X0 @ X4)) = $true)))),
% 1.15/0.59 inference(ennf_transformation,[],[f5])).
% 1.15/0.59 thf(f7,plain,(
% 1.15/0.59 ! [X1 : (a > a)] : ((! [X3 : a] : ((((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3)) != (^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1))))) & ($true = ((sK0 @ (sK1 @ X1))))) | (($true != ((sK0 @ (X1 @ (sK2 @ X1))))) & ($true = ((sK0 @ (sK2 @ X1))))))),
% 1.15/0.59 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X4,sK2 @ X1),skolemize(X4,sK2 @ X1)],[f6])).
% 1.15/0.59 thf(f8,plain,(
% 1.15/0.59 ( ! [X1 : (a > a)] : (($true = ((sK0 @ (sK2 @ X1)))) | ($true = ((sK0 @ (sK1 @ X1))))) )),
% 1.15/0.59 inference(cnf_transformation,[],[f7])).
% 1.15/0.59 thf(f9,plain,(
% 1.15/0.59 ( ! [X1 : (a > a)] : (($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | ($true = ((sK0 @ (sK1 @ X1))))) )),
% 1.15/0.59 inference(cnf_transformation,[],[f7])).
% 1.15/0.59 thf(f10,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3)) != (^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1))))) | ($true = ((sK0 @ (sK2 @ X1))))) )),
% 1.15/0.59 inference(cnf_transformation,[],[f7])).
% 1.15/0.59 thf(f11,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3)) != (^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1))))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1)))))) )),
% 1.15/0.59 inference(cnf_transformation,[],[f7])).
% 1.15/0.59 thf(f13,definition,(
% 1.15/0.59 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 1.15/0.59 introduced(theory,[fool_exhaustiveness_axiom])).
% 1.15/0.59 thf(f14,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) != ((= @ X3))) | ($true = ((sK0 @ (sK2 @ X1))))) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f10])).
% 1.15/0.59 thf(f15,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) != ((= @ X3))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1)))))) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f11])).
% 1.15/0.59 thf(f16,plain,(
% 1.15/0.59 ($true != $true) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 1.15/0.59 inference(constrained_superposition,[],[f9,f8])).
% 1.15/0.59 thf(f19,plain,(
% 1.15/0.59 ($true != $true) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 1.15/0.59 inference(duplicate_literal_removal,[],[f16])).
% 1.15/0.59 thf(f20,plain,(
% 1.15/0.59 ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 1.15/0.59 inference(trivial_inequality_removal,[],[f19])).
% 1.15/0.59 thf(f30,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK3 @ X3 @ X1))) != ((X3 = (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1))))) )),
% 1.15/0.59 inference(negative_extensionality,[],[f14])).
% 1.15/0.59 thf(f31,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | ($true = ((X3 = (sK3 @ X3 @ X1))))) )),
% 1.15/0.59 inference(xor_proxy_clausification,[],[f30])).
% 1.15/0.59 thf(f32,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | ($false = ((X3 = (sK3 @ X3 @ X1))))) )),
% 1.15/0.59 inference(xor_proxy_clausification,[],[f30])).
% 1.15/0.59 thf(f33,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) != X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f32])).
% 1.15/0.59 thf(f34,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((sK0 @ (sK3 @ X3 @ X1)) & ((X1 @ (sK3 @ X3 @ X1)) = (sK1 @ X1))))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) != X3)) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f33])).
% 1.15/0.59 thf(f35,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((X1 @ (sK3 @ X3 @ X1)) = (sK1 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) != X3) | ($false = ((sK0 @ (sK3 @ X3 @ X1))))) )),
% 1.15/0.59 inference(and_proxy_clausification,[],[f34])).
% 1.15/0.59 thf(f36,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : ((((sK1 @ X1)) != ((X1 @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) != X3) | ($false = ((sK0 @ (sK3 @ X3 @ X1))))) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f35])).
% 1.15/0.59 thf(f37,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f31])).
% 1.15/0.59 thf(f38,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((sK0 @ (sK3 @ X3 @ X1)) & ((X1 @ (sK3 @ X3 @ X1)) = (sK1 @ X1))))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f37])).
% 1.15/0.59 thf(f39,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((X1 @ (sK3 @ X3 @ X1)) = (sK1 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(and_proxy_clausification,[],[f38])).
% 1.15/0.59 thf(f41,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : ((((sK1 @ X1)) = ((X1 @ (sK3 @ X3 @ X1)))) | ($true = ((sK0 @ (sK2 @ X1)))) | (((sK3 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f39])).
% 1.15/0.59 thf(f42,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (((((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK4 @ X3 @ X1))) != ((X3 = (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1)))))) )),
% 1.15/0.59 inference(negative_extensionality,[],[f15])).
% 1.15/0.59 thf(f43,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | ($true = ((X3 = (sK4 @ X3 @ X1))))) )),
% 1.15/0.59 inference(xor_proxy_clausification,[],[f42])).
% 1.15/0.59 thf(f44,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | ($false = ((X3 = (sK4 @ X3 @ X1))))) )),
% 1.15/0.59 inference(xor_proxy_clausification,[],[f42])).
% 1.15/0.59 thf(f45,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) != X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f44])).
% 1.15/0.59 thf(f46,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((sK0 @ (sK4 @ X3 @ X1)) & ((X1 @ (sK4 @ X3 @ X1)) = (sK1 @ X1))))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) != X3)) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f45])).
% 1.15/0.59 thf(f47,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($false = (((X1 @ (sK4 @ X3 @ X1)) = (sK1 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) != X3) | ($false = ((sK0 @ (sK4 @ X3 @ X1))))) )),
% 1.15/0.59 inference(and_proxy_clausification,[],[f46])).
% 1.15/0.59 thf(f48,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : ((((sK1 @ X1)) != ((X1 @ (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) != X3) | ($false = ((sK0 @ (sK4 @ X3 @ X1))))) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f47])).
% 1.15/0.59 thf(f49,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((^[Y0 : a]: ((sK0 @ Y0) & ((X1 @ Y0) = (sK1 @ X1)))) @ (sK4 @ X3 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f43])).
% 1.15/0.59 thf(f50,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((sK0 @ (sK4 @ X3 @ X1)) & ((X1 @ (sK4 @ X3 @ X1)) = (sK1 @ X1))))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f49])).
% 1.15/0.59 thf(f51,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true = (((X1 @ (sK4 @ X3 @ X1)) = (sK1 @ X1)))) | ($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK4 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(and_proxy_clausification,[],[f50])).
% 1.15/0.59 thf(f53,plain,(
% 1.15/0.59 ( ! [X3 : a,X1 : (a > a)] : (($true != ((sK0 @ (X1 @ (sK2 @ X1))))) | (((sK1 @ X1)) = ((X1 @ (sK4 @ X3 @ X1)))) | (((sK4 @ X3 @ X1)) = X3)) )),
% 1.15/0.59 inference(equality_proxy_clausification,[],[f51])).
% 1.15/0.59 thf(f269,plain,(
% 1.15/0.59 ( ! [X0 : (a > a),X1 : a] : (($true != $true) | (((sK1 @ X0)) = ((X0 @ (sK4 @ X1 @ X0)))) | (((sK4 @ X1 @ X0)) = X1) | ($false = ((sK0 @ (X0 @ (sK2 @ X0)))))) )),
% 1.15/0.59 inference(constrained_superposition,[],[f53,f13])).
% 1.15/0.59 thf(f270,plain,(
% 1.15/0.59 ( ! [X0 : (a > a),X1 : a] : ((((sK1 @ X0)) = ((X0 @ (sK4 @ X1 @ X0)))) | (((sK4 @ X1 @ X0)) = X1) | ($false = ((sK0 @ (X0 @ (sK2 @ X0)))))) )),
% 1.15/0.59 inference(trivial_inequality_removal,[],[f269])).
% 1.15/0.59 thf(f322,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(constrained_superposition,[],[f36,f41])).
% 1.15/0.59 thf(f329,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(duplicate_literal_removal,[],[f322])).
% 1.15/0.59 thf(f330,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(beta-eta_normalization,[],[f329])).
% 1.15/0.59 thf(f331,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : (($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(trivial_inequality_removal,[],[f330])).
% 1.15/0.59 thf(f332,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : (($true = $false) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(forward_demodulation,[],[f331,f20])).
% 1.15/0.59 thf(f333,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : (($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) )),
% 1.15/0.59 inference(trivial_inequality_removal,[],[f332])).
% 1.15/0.59 thf(f335,definition,(
% 1.15/0.59 spl5_7 <=> ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (X0 != X1) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1))),
% 1.15/0.59 introduced(definition,[new_symbols(definition,[spl5_7])],[avatar_definition])).
% 1.15/0.59 thf(f336,plain,(
% 1.15/0.59 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK3 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) ) | ~spl5_7),
% 1.15/0.59 inference(avatar_component_clause,[],[f335])).
% 1.15/0.59 thf(f338,definition,(
% 1.15/0.59 spl5_8 <=> ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0))))))),
% 1.15/0.59 introduced(definition,[new_symbols(definition,[spl5_8])],[avatar_definition])).
% 1.15/0.59 thf(f340,plain,(
% 1.15/0.59 ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.59 inference(avatar_component_clause,[],[f338])).
% 1.15/0.59 thf(f341,plain,(
% 1.15/0.59 spl5_7 | spl5_8),
% 1.15/0.59 inference(avatar_split_clause,[],[f333,f338,f335])).
% 1.15/0.59 thf(f362,plain,(
% 1.15/0.59 ( ! [X0 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK3 @ X0 @ (^[Y0 : a]: (Y0)))) = X0)) ) | ~spl5_7),
% 1.15/0.59 inference(equality_resolution,[],[f336])).
% 1.15/0.60 thf(f363,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) = ((sK3 @ (sK1 @ (^[Y0 : a]: (Y0))) @ (^[Y0 : a]: (Y0))))) | ~spl5_7),
% 1.15/0.60 inference(equality_resolution,[],[f362])).
% 1.15/0.60 thf(f467,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(constrained_superposition,[],[f36,f363])).
% 1.15/0.60 thf(f488,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f467])).
% 1.15/0.60 thf(f489,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(beta-eta_normalization,[],[f488])).
% 1.15/0.60 thf(f490,plain,(
% 1.15/0.60 ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f489])).
% 1.15/0.60 thf(f502,plain,(
% 1.15/0.60 ($true = $false) | ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(forward_demodulation,[],[f490,f20])).
% 1.15/0.60 thf(f503,plain,(
% 1.15/0.60 ($true = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ~spl5_7),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f502])).
% 1.15/0.60 thf(f504,plain,(
% 1.15/0.60 spl5_8 | ~spl5_7),
% 1.15/0.60 inference(avatar_split_clause,[],[f503,f335,f338])).
% 1.15/0.60 thf(f940,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))))) | (X0 != X1)) )),
% 1.15/0.60 inference(constrained_superposition,[],[f48,f270])).
% 1.15/0.60 thf(f1019,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($true != ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) )),
% 1.15/0.60 inference(beta-eta_normalization,[],[f940])).
% 1.15/0.60 thf(f1020,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : (($true != ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) )),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1019])).
% 1.15/0.60 thf(f1033,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) ) | ~spl5_8),
% 1.15/0.60 inference(forward_subsumption_resolution,[],[f1020,f340])).
% 1.15/0.60 thf(f1034,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : (($true = $false) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) ) | ~spl5_8),
% 1.15/0.60 inference(forward_demodulation,[],[f1033,f20])).
% 1.15/0.60 thf(f1035,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | ($false = ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) ) | ~spl5_8),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1034])).
% 1.15/0.60 thf(f1036,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : (($true = $false) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) ) | ~spl5_8),
% 1.15/0.60 inference(forward_demodulation,[],[f1035,f340])).
% 1.15/0.60 thf(f1037,plain,(
% 1.15/0.60 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK4 @ X1 @ (^[Y0 : a]: (Y0)))) = X1) | (X0 != X1)) ) | ~spl5_8),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1036])).
% 1.15/0.60 thf(f1038,plain,(
% 1.15/0.60 ( ! [X0 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK4 @ X0 @ (^[Y0 : a]: (Y0)))) = X0)) ) | ~spl5_8),
% 1.15/0.60 inference(equality_resolution,[],[f1037])).
% 1.15/0.60 thf(f1066,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) = ((sK4 @ (sK1 @ (^[Y0 : a]: (Y0))) @ (^[Y0 : a]: (Y0))))) | ~spl5_8),
% 1.15/0.60 inference(equality_resolution,[],[f1038])).
% 1.15/0.60 thf(f1067,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.60 inference(constrained_superposition,[],[f48,f1066])).
% 1.15/0.60 thf(f1093,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK2 @ (^[Y0 : a]: (Y0))))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1067])).
% 1.15/0.60 thf(f1094,plain,(
% 1.15/0.60 (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ($true != ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.60 inference(beta-eta_normalization,[],[f1093])).
% 1.15/0.60 thf(f1095,plain,(
% 1.15/0.60 ($true != ((sK0 @ (sK2 @ (^[Y0 : a]: (Y0)))))) | ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1094])).
% 1.15/0.60 thf(f1104,plain,(
% 1.15/0.60 ($false = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ~spl5_8),
% 1.15/0.60 inference(forward_subsumption_resolution,[],[f1095,f340])).
% 1.15/0.60 thf(f1105,plain,(
% 1.15/0.60 ($true = $false) | ~spl5_8),
% 1.15/0.60 inference(constrained_superposition,[],[f1104,f20])).
% 1.15/0.60 thf(f1117,plain,(
% 1.15/0.60 $false | ~spl5_8),
% 1.15/0.60 inference(trivial_inequality_removal,[],[f1105])).
% 1.15/0.60 thf(f1118,plain,(
% 1.15/0.60 ~spl5_8),
% 1.15/0.60 inference(avatar_contradiction_clause,[],[f1117])).
% 1.15/0.60 cnf(s9, plain, spl5_7 | spl5_8, inference(sat_conversion,[],[f341])).
% 1.15/0.60 cnf(s17, plain, ~spl5_7 | spl5_8, inference(sat_conversion,[],[f504])).
% 1.15/0.60 cnf(s27, plain, ~spl5_8, inference(sat_conversion,[],[f1118])).
% 1.15/0.60 cnf(s28, plain, ~spl5_7, inference(rat,[],[s17,s27])).
% 1.15/0.60 cnf(s29, plain, $false, inference(rat,[],[s9,s27,s28])).
% 1.15/0.60 thf(f1119,plain,(
% 1.15/0.60 $false),
% 1.15/0.60 inference(avatar_sat_refutation,[],[s29])).
% 1.15/0.60 % SZS output end Proof for theBenchmark
% 1.15/0.60 % (1779816)------------------------------
% 1.15/0.60 % (1779816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.60 % (1779816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.60 % (1779816)CaDiCaL version: 2.1.3
% 1.15/0.60 % (1779816)Termination reason: Refutation
% 1.15/0.60 % (1779816)Time elapsed: 0.198 s
% 1.15/0.60 % (1779816)Peak memory usage: 14 MB
% 1.15/0.60 % (1779816)Instructions burned: 231 (million)
% 1.15/0.60 % (1779810)Success in time 0.242 s
% 1.15/0.60 % Vampire exiting
%------------------------------------------------------------------------------