%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU975^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 : n015.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:34:29 AM UTC 2026
% Result : Theorem 2.91s 0.67s
% Output : Refutation 2.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU975^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n015.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 14:58:03 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 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
% 2.91/0.66 % (3628711)Will run a generic schedule for satisfiability detection.
% 2.91/0.66 % (3628720)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1822689927_2999 on theBenchmark for (2999ds/0Mi)
% 2.91/0.66 % Exception at run slice level
% 2.91/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.91/0.66 % (3628721)% WARNING: option uhcvi not known.
% 2.91/0.66 % (3628722)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4012854448:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.91/0.66 % (3628724)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3245135453:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.91/0.66 % (3628721)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1175201508:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.91/0.66 % (3628727)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3437075417:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.91/0.66 % (3628723)dis+10_1_sil=32000:sp=arity:random_seed=2309307265:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.91/0.66 % (3628725)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1793266250:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.91/0.66 % (3628724)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.91/0.66 % (3628721)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.91/0.66 % (3628721)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.91/0.66 % (3628729)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=600572920:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.91/0.66 % Exception at run slice level
% 2.91/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.91/0.66 % (3628743)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3694689260:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.91/0.66 % (3628723)Instruction limit reached!
% 2.91/0.66 % (3628723)------------------------------
% 2.91/0.66 % (3628723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.66 % (3628723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.66 % (3628723)CaDiCaL version: 2.1.3
% 2.91/0.66 % (3628723)Termination reason: Instruction limit
% 2.91/0.66 % (3628723)Termination phase: Saturation
% 2.91/0.66 % (3628723)Time elapsed: 0.088 s
% 2.91/0.66 % (3628723)Peak memory usage: 12 MB
% 2.91/0.66 % (3628723)Instructions burned: 104 (million)
% 2.91/0.66 % (3628724)Instruction limit reached!
% 2.91/0.66 % (3628724)------------------------------
% 2.91/0.66 % (3628724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.66 % (3628724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.66 % (3628724)CaDiCaL version: 2.1.3
% 2.91/0.66 % (3628724)Termination reason: Instruction limit
% 2.91/0.66 % (3628724)Termination phase: Saturation
% 2.91/0.66 % (3628724)Time elapsed: 0.095 s
% 2.91/0.66 % (3628724)Peak memory usage: 12 MB
% 2.91/0.66 % (3628724)Instructions burned: 116 (million)
% 2.91/0.66 % (3628725)Instruction limit reached!
% 2.91/0.66 % (3628725)------------------------------
% 2.91/0.67 % (3628725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.67 % (3628725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.67 % (3628725)CaDiCaL version: 2.1.3
% 2.91/0.67 % (3628725)Termination reason: Instruction limit
% 2.91/0.67 % (3628725)Termination phase: Saturation
% 2.91/0.67 % (3628725)Time elapsed: 0.112 s
% 2.91/0.67 % (3628725)Peak memory usage: 12 MB
% 2.91/0.67 % (3628725)Instructions burned: 131 (million)
% 2.91/0.67 % (3628761)ott-21_1_sil=16000:fs=off:random_seed=3314493498:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.91/0.67 % (3628759)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=174303609:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.91/0.67 % (3628759)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.91/0.67 % (3628759)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.91/0.67 % (3628727)Instruction limit reached!
% 2.91/0.67 % (3628727)------------------------------
% 2.91/0.67 % (3628727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.67 % (3628727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.67 % (3628727)CaDiCaL version: 2.1.3
% 2.91/0.67 % (3628727)Termination reason: Instruction limit
% 2.91/0.67 % (3628727)Termination phase: Saturation
% 2.91/0.67 % (3628727)Time elapsed: 0.132 s
% 2.91/0.67 % (3628727)Peak memory usage: 13 MB
% 2.91/0.67 % (3628727)Instructions burned: 159 (million)
% 2.91/0.67 % (3628766)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3972842710:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.91/0.67 % (3628771)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1444814626:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.91/0.67 % Exception at run slice level
% 2.91/0.67 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.91/0.67 % (3628743)Instruction limit reached!
% 2.91/0.67 % (3628743)------------------------------
% 2.91/0.67 % (3628743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.67 % (3628743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.67 % (3628743)CaDiCaL version: 2.1.3
% 2.91/0.67 % (3628743)Termination reason: Instruction limit
% 2.91/0.67 % (3628743)Termination phase: Saturation
% 2.91/0.67 % (3628743)Time elapsed: 0.111 s
% 2.91/0.67 % (3628743)Peak memory usage: 12 MB
% 2.91/0.67 % (3628743)Instructions burned: 131 (million)
% 2.91/0.67 % (3628761)Instruction limit reached!
% 2.91/0.67 % (3628761)------------------------------
% 2.91/0.67 % (3628761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.67 % (3628761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.67 % (3628761)CaDiCaL version: 2.1.3
% 2.91/0.67 % (3628761)Termination reason: Instruction limit
% 2.91/0.67 % (3628761)Termination phase: Saturation
% 2.91/0.67 % (3628761)Time elapsed: 0.079 s
% 2.91/0.67 % (3628761)Peak memory usage: 12 MB
% 2.91/0.67 % (3628761)Instructions burned: 180 (million)
% 2.91/0.67 % (3628779)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3990293550:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 2.91/0.67 % (3628778)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3519162025:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.91/0.67 % Exception at run slice level
% 2.91/0.67 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.91/0.67 % (3628781)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2469871300:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 2.91/0.67 % (3628781)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.91/0.67 % (3628786)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3419400041:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 2.91/0.67 % (3628786)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.91/0.67 % (3628766) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3628711-3628766"...
% 2.91/0.67 % (3628766)...printing done.
% 2.91/0.67 % (3628766)Refutation found. Thanks to Tanya!
% 2.91/0.67 % SZS status Theorem for theBenchmark
% 2.91/0.67 % SZS output start Proof for theBenchmark
% 2.91/0.67 thf(type_def_5, type, a: $tType).
% 2.91/0.67 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 2.91/0.67 thf(func_def_0, type, cR: (a > a)).
% 2.91/0.67 thf(func_def_1, type, cP: (a > a > a)).
% 2.91/0.67 thf(func_def_2, type, cL: (a > a)).
% 2.91/0.67 thf(func_def_3, type, cZ: a).
% 2.91/0.67 thf(func_def_7, type, sK0: a).
% 2.91/0.67 thf(func_def_8, type, sK1: a).
% 2.91/0.67 thf(func_def_9, type, sK2: ((a > $o) > a)).
% 2.91/0.67 thf(func_def_10, type, sK3: ((a > $o) > a)).
% 2.91/0.67 thf(func_def_11, type, sK4: (a > $o)).
% 2.91/0.67 thf(func_def_12, type, sK5: ((a > $o) > a)).
% 2.91/0.67 thf(func_def_13, type, sK6: ((a > $o) > a)).
% 2.91/0.67 thf(func_def_14, type, vNOT: ($o > $o)).
% 2.91/0.67 thf(func_def_16, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.91/0.67 thf(func_def_17, type, db0: !>[X0: $tType]:(X0)).
% 2.91/0.67 thf(func_def_18, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 2.91/0.67 thf(f1,conjecture,(
% 2.91/0.67 (! [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X2 = cZ) <=> (X4 = cZ)))) => ! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => (X2 = X4))) & ! [X2 : a] : ((X2 != cZ) <=> (X2 = ((cP @ (cL @ X2) @ (cR @ X2))))) & ! [X0 : a,X1 : a] : (((cR @ (cP @ X0 @ X1))) = X1) & ! [X0 : a,X1 : a] : (((cL @ (cP @ X0 @ X1))) = X0) & (((cR @ cZ)) = cZ) & (((cL @ cZ)) = cZ)) => ! [X0 : a,X1 : a] : (? [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X4 = cZ) => (X2 = cZ)))) & (X3 @ (cP @ X0 @ X1))) => ? [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X4 = cZ) => (X2 = cZ)))) & (X3 @ (cP @ (cL @ X0) @ (cL @ X1)))))),
% 2.91/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPU_LEM2B_pme)).
% 2.91/0.67 thf(f2,negated_conjecture,(
% 2.91/0.67 ~((! [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X2 = cZ) <=> (X4 = cZ)))) => ! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => (X2 = X4))) & ! [X2 : a] : ((X2 != cZ) <=> (X2 = ((cP @ (cL @ X2) @ (cR @ X2))))) & ! [X0 : a,X1 : a] : (((cR @ (cP @ X0 @ X1))) = X1) & ! [X0 : a,X1 : a] : (((cL @ (cP @ X0 @ X1))) = X0) & (((cR @ cZ)) = cZ) & (((cL @ cZ)) = cZ)) => ! [X0 : a,X1 : a] : (? [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X4 = cZ) => (X2 = cZ)))) & (X3 @ (cP @ X0 @ X1))) => ? [X3 : (a > $o)] : (! [X2 : a,X4 : a] : ((X3 @ (cP @ X2 @ X4)) => ((X3 @ (cP @ (cR @ X2) @ (cR @ X4))) & (X3 @ (cP @ (cL @ X2) @ (cL @ X4))) & ((X4 = cZ) => (X2 = cZ)))) & (X3 @ (cP @ (cL @ X0) @ (cL @ X1))))))),
% 2.91/0.67 inference(negated_conjecture,[status(cth)],[f1])).
% 2.91/0.67 thf(f3,plain,(
% 2.91/0.67 ~((! [X0 : (a > $o)] : (! [X1 : a,X2 : a] : ((X0 @ (cP @ X1 @ X2)) => ((X0 @ (cP @ (cR @ X1) @ (cR @ X2))) & (X0 @ (cP @ (cL @ X1) @ (cL @ X2))) & ((cZ = X1) <=> (cZ = X2)))) => ! [X3 : a,X4 : a] : ((X0 @ (cP @ X3 @ X4)) => (X3 = X4))) & ! [X5 : a] : ((cZ != X5) <=> (((cP @ (cL @ X5) @ (cR @ X5))) = X5)) & ! [X6 : a,X7 : a] : (((cR @ (cP @ X6 @ X7))) = X7) & ! [X8 : a,X9 : a] : (((cL @ (cP @ X8 @ X9))) = X8) & (((cR @ cZ)) = cZ) & (((cL @ cZ)) = cZ)) => ! [X10 : a,X11 : a] : (? [X12 : (a > $o)] : (! [X13 : a,X14 : a] : ((X12 @ (cP @ X13 @ X14)) => ((X12 @ (cP @ (cR @ X13) @ (cR @ X14))) & (X12 @ (cP @ (cL @ X13) @ (cL @ X14))) & ((cZ = X14) => (cZ = X13)))) & (X12 @ (cP @ X10 @ X11))) => ? [X15 : (a > $o)] : (! [X16 : a,X17 : a] : ((X15 @ (cP @ X16 @ X17)) => ((X15 @ (cP @ (cR @ X16) @ (cR @ X17))) & (X15 @ (cP @ (cL @ X16) @ (cL @ X17))) & ((cZ = X17) => (cZ = X16)))) & (X15 @ (cP @ (cL @ X10) @ (cL @ X11))))))),
% 2.91/0.67 inference(rectify,[],[f2])).
% 2.91/0.67 thf(f4,plain,(
% 2.91/0.67 ~((! [X0 : (a > $o)] : (! [X1 : a,X2 : a] : ((((X0 @ (cP @ X1 @ X2))) = $true) => ((((X0 @ (cP @ (cR @ X1) @ (cR @ X2)))) = $true) & (((X0 @ (cP @ (cL @ X1) @ (cL @ X2)))) = $true) & ((cZ = X1) <=> (cZ = X2)))) => ! [X3 : a,X4 : a] : ((((X0 @ (cP @ X3 @ X4))) = $true) => (X3 = X4))) & ! [X5 : a] : ((cZ != X5) <=> (((cP @ (cL @ X5) @ (cR @ X5))) = X5)) & ! [X6 : a,X7 : a] : (((cR @ (cP @ X6 @ X7))) = X7) & ! [X8 : a,X9 : a] : (((cL @ (cP @ X8 @ X9))) = X8) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ)))) => ! [X10 : a,X11 : a] : (? [X12 : (a > $o)] : (! [X13 : a,X14 : a] : ((((X12 @ (cP @ X13 @ X14))) = $true) => ((((X12 @ (cP @ (cR @ X13) @ (cR @ X14)))) = $true) & (((X12 @ (cP @ (cL @ X13) @ (cL @ X14)))) = $true) & ((cZ = X14) => (cZ = X13)))) & (((X12 @ (cP @ X10 @ X11))) = $true)) => ? [X15 : (a > $o)] : (! [X16 : a,X17 : a] : ((((X15 @ (cP @ X16 @ X17))) = $true) => ((((X15 @ (cP @ (cR @ X16) @ (cR @ X17)))) = $true) & (((X15 @ (cP @ (cL @ X16) @ (cL @ X17)))) = $true) & ((cZ = X17) => (cZ = X16)))) & (((X15 @ (cP @ (cL @ X10) @ (cL @ X11)))) = $true))))),
% 2.91/0.67 inference(fool_elimination,[],[f3])).
% 2.91/0.67 thf(f5,plain,(
% 2.91/0.67 ? [X10 : a,X11 : a] : (! [X15 : (a > $o)] : (? [X16 : a,X17 : a] : (((((X15 @ (cP @ (cR @ X16) @ (cR @ X17)))) != $true) | (((X15 @ (cP @ (cL @ X16) @ (cL @ X17)))) != $true) | ((cZ != X16) & (cZ = X17))) & (((X15 @ (cP @ X16 @ X17))) = $true)) | (((X15 @ (cP @ (cL @ X10) @ (cL @ X11)))) != $true)) & ? [X12 : (a > $o)] : (! [X13 : a,X14 : a] : (((((X12 @ (cP @ (cR @ X13) @ (cR @ X14)))) = $true) & (((X12 @ (cP @ (cL @ X13) @ (cL @ X14)))) = $true) & ((cZ = X13) | (cZ != X14))) | (((X12 @ (cP @ X13 @ X14))) != $true)) & (((X12 @ (cP @ X10 @ X11))) = $true))) & (! [X0 : (a > $o)] : (! [X3 : a,X4 : a] : ((X3 = X4) | (((X0 @ (cP @ X3 @ X4))) != $true)) | ? [X1 : a,X2 : a] : (((((X0 @ (cP @ (cR @ X1) @ (cR @ X2)))) != $true) | (((X0 @ (cP @ (cL @ X1) @ (cL @ X2)))) != $true) | ((cZ = X1) <~> (cZ = X2))) & (((X0 @ (cP @ X1 @ X2))) = $true))) & ! [X5 : a] : ((cZ != X5) <=> (((cP @ (cL @ X5) @ (cR @ X5))) = X5)) & ! [X6 : a,X7 : a] : (((cR @ (cP @ X6 @ X7))) = X7) & ! [X8 : a,X9 : a] : (((cL @ (cP @ X8 @ X9))) = X8) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ))))),
% 2.91/0.67 inference(ennf_transformation,[],[f4])).
% 2.91/0.67 thf(f6,plain,(
% 2.91/0.67 ? [X10 : a,X11 : a] : (! [X15 : (a > $o)] : (? [X16 : a,X17 : a] : (((((X15 @ (cP @ (cR @ X16) @ (cR @ X17)))) != $true) | (((X15 @ (cP @ (cL @ X16) @ (cL @ X17)))) != $true) | ((cZ != X16) & (cZ = X17))) & (((X15 @ (cP @ X16 @ X17))) = $true)) | (((X15 @ (cP @ (cL @ X10) @ (cL @ X11)))) != $true)) & ? [X12 : (a > $o)] : (! [X13 : a,X14 : a] : (((((X12 @ (cP @ (cR @ X13) @ (cR @ X14)))) = $true) & (((X12 @ (cP @ (cL @ X13) @ (cL @ X14)))) = $true) & ((cZ = X13) | (cZ != X14))) | (((X12 @ (cP @ X13 @ X14))) != $true)) & (((X12 @ (cP @ X10 @ X11))) = $true))) & ! [X0 : (a > $o)] : (! [X3 : a,X4 : a] : ((X3 = X4) | (((X0 @ (cP @ X3 @ X4))) != $true)) | ? [X1 : a,X2 : a] : (((((X0 @ (cP @ (cR @ X1) @ (cR @ X2)))) != $true) | (((X0 @ (cP @ (cL @ X1) @ (cL @ X2)))) != $true) | ((cZ = X1) <~> (cZ = X2))) & (((X0 @ (cP @ X1 @ X2))) = $true))) & ! [X5 : a] : ((cZ != X5) <=> (((cP @ (cL @ X5) @ (cR @ X5))) = X5)) & ! [X6 : a,X7 : a] : (((cR @ (cP @ X6 @ X7))) = X7) & ! [X8 : a,X9 : a] : (((cL @ (cP @ X8 @ X9))) = X8) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ)))),
% 2.91/0.67 inference(flattening,[],[f5])).
% 2.91/0.67 thf(f7,plain,(
% 2.91/0.67 ? [X10 : a,X11 : a] : (! [X15 : (a > $o)] : (? [X16 : a,X17 : a] : (((((X15 @ (cP @ (cR @ X16) @ (cR @ X17)))) != $true) | (((X15 @ (cP @ (cL @ X16) @ (cL @ X17)))) != $true) | ((cZ != X16) & (cZ = X17))) & (((X15 @ (cP @ X16 @ X17))) = $true)) | (((X15 @ (cP @ (cL @ X10) @ (cL @ X11)))) != $true)) & ? [X12 : (a > $o)] : (! [X13 : a,X14 : a] : (((((X12 @ (cP @ (cR @ X13) @ (cR @ X14)))) = $true) & (((X12 @ (cP @ (cL @ X13) @ (cL @ X14)))) = $true) & ((cZ = X13) | (cZ != X14))) | (((X12 @ (cP @ X13 @ X14))) != $true)) & (((X12 @ (cP @ X10 @ X11))) = $true))) & ! [X0 : (a > $o)] : (! [X3 : a,X4 : a] : ((X3 = X4) | (((X0 @ (cP @ X3 @ X4))) != $true)) | ? [X1 : a,X2 : a] : (((((X0 @ (cP @ (cR @ X1) @ (cR @ X2)))) != $true) | (((X0 @ (cP @ (cL @ X1) @ (cL @ X2)))) != $true) | (((cZ != X2) | (cZ != X1)) & ((cZ = X2) | (cZ = X1)))) & (((X0 @ (cP @ X1 @ X2))) = $true))) & ! [X5 : a] : (((cZ != X5) | (((cP @ (cL @ X5) @ (cR @ X5))) != X5)) & ((((cP @ (cL @ X5) @ (cR @ X5))) = X5) | (cZ = X5))) & ! [X6 : a,X7 : a] : (((cR @ (cP @ X6 @ X7))) = X7) & ! [X8 : a,X9 : a] : (((cL @ (cP @ X8 @ X9))) = X8) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ)))),
% 2.91/0.67 inference(nnf_transformation,[],[f6])).
% 2.91/0.67 thf(f8,plain,(
% 2.91/0.67 ? [X0 : a,X1 : a] : (! [X2 : (a > $o)] : (? [X3 : a,X4 : a] : ((($true != ((X2 @ (cP @ (cR @ X3) @ (cR @ X4))))) | ($true != ((X2 @ (cP @ (cL @ X3) @ (cL @ X4))))) | ((cZ != X3) & (cZ = X4))) & ($true = ((X2 @ (cP @ X3 @ X4))))) | ($true != ((X2 @ (cP @ (cL @ X0) @ (cL @ X1)))))) & ? [X5 : (a > $o)] : (! [X6 : a,X7 : a] : ((($true = ((X5 @ (cP @ (cR @ X6) @ (cR @ X7))))) & ($true = ((X5 @ (cP @ (cL @ X6) @ (cL @ X7))))) & ((cZ = X6) | (cZ != X7))) | ($true != ((X5 @ (cP @ X6 @ X7))))) & ($true = ((X5 @ (cP @ X0 @ X1)))))) & ! [X8 : (a > $o)] : (! [X9 : a,X10 : a] : ((X9 = X10) | ($true != ((X8 @ (cP @ X9 @ X10))))) | ? [X11 : a,X12 : a] : ((($true != ((X8 @ (cP @ (cR @ X11) @ (cR @ X12))))) | ($true != ((X8 @ (cP @ (cL @ X11) @ (cL @ X12))))) | (((cZ != X12) | (cZ != X11)) & ((cZ = X12) | (cZ = X11)))) & ($true = ((X8 @ (cP @ X11 @ X12)))))) & ! [X13 : a] : (((cZ != X13) | (((cP @ (cL @ X13) @ (cR @ X13))) != X13)) & ((((cP @ (cL @ X13) @ (cR @ X13))) = X13) | (cZ = X13))) & ! [X14 : a,X15 : a] : (((cR @ (cP @ X14 @ X15))) = X15) & ! [X16 : a,X17 : a] : (((cL @ (cP @ X16 @ X17))) = X16) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ)))),
% 2.91/0.67 inference(rectify,[],[f7])).
% 2.91/0.67 thf(f9,plain,(
% 2.91/0.67 (! [X2 : (a > $o)] : (((($true != ((X2 @ (cP @ (cR @ (sK2 @ X2)) @ (cR @ (sK3 @ X2)))))) | ($true != ((X2 @ (cP @ (cL @ (sK2 @ X2)) @ (cL @ (sK3 @ X2)))))) | ((cZ != ((sK2 @ X2))) & (cZ = ((sK3 @ X2))))) & ($true = ((X2 @ (cP @ (sK2 @ X2) @ (sK3 @ X2)))))) | ($true != ((X2 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))) & (! [X6 : a,X7 : a] : ((($true = ((sK4 @ (cP @ (cR @ X6) @ (cR @ X7))))) & ($true = ((sK4 @ (cP @ (cL @ X6) @ (cL @ X7))))) & ((cZ = X6) | (cZ != X7))) | ($true != ((sK4 @ (cP @ X6 @ X7))))) & ($true = ((sK4 @ (cP @ sK0 @ sK1)))))) & ! [X8 : (a > $o)] : (! [X9 : a,X10 : a] : ((X9 = X10) | ($true != ((X8 @ (cP @ X9 @ X10))))) | ((($true != ((X8 @ (cP @ (cR @ (sK5 @ X8)) @ (cR @ (sK6 @ X8)))))) | ($true != ((X8 @ (cP @ (cL @ (sK5 @ X8)) @ (cL @ (sK6 @ X8)))))) | (((cZ != ((sK6 @ X8))) | (cZ != ((sK5 @ X8)))) & ((cZ = ((sK6 @ X8))) | (cZ = ((sK5 @ X8)))))) & ($true = ((X8 @ (cP @ (sK5 @ X8) @ (sK6 @ X8))))))) & ! [X13 : a] : (((cZ != X13) | (((cP @ (cL @ X13) @ (cR @ X13))) != X13)) & ((((cP @ (cL @ X13) @ (cR @ X13))) = X13) | (cZ = X13))) & ! [X14 : a,X15 : a] : (((cR @ (cP @ X14 @ X15))) = X15) & ! [X16 : a,X17 : a] : (((cL @ (cP @ X16 @ X17))) = X16) & (cZ = ((cR @ cZ))) & (cZ = ((cL @ cZ)))),
% 2.91/0.67 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,vAPP,vAPP,sK4,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X12,sK6 @ X8),skolemize(X12,sK6 @ X8),skolemize(X5,sK4),skolemize(X12,sK6 @ X8),skolemize(X12,sK6 @ X8)],[f8])).
% 2.91/0.67 thf(f10,plain,(
% 2.91/0.67 (cZ = ((cL @ cZ)))),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f11,plain,(
% 2.91/0.67 (cZ = ((cR @ cZ)))),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f19,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ sK0 @ sK1))))),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f20,plain,(
% 2.91/0.67 ( ! [X6 : a,X7 : a] : ((cZ = X6) | (cZ != X7) | ($true != ((sK4 @ (cP @ X6 @ X7))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f21,plain,(
% 2.91/0.67 ( ! [X6 : a,X7 : a] : (($true != ((sK4 @ (cP @ X6 @ X7)))) | ($true = ((sK4 @ (cP @ (cL @ X6) @ (cL @ X7)))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f22,plain,(
% 2.91/0.67 ( ! [X6 : a,X7 : a] : (($true != ((sK4 @ (cP @ X6 @ X7)))) | ($true = ((sK4 @ (cP @ (cR @ X6) @ (cR @ X7)))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f23,plain,(
% 2.91/0.67 ( ! [X2 : (a > $o)] : (($true != ((X2 @ (cP @ (cL @ sK0) @ (cL @ sK1))))) | ($true = ((X2 @ (cP @ (sK2 @ X2) @ (sK3 @ X2)))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f24,plain,(
% 2.91/0.67 ( ! [X2 : (a > $o)] : (($true != ((X2 @ (cP @ (cL @ (sK2 @ X2)) @ (cL @ (sK3 @ X2)))))) | ($true != ((X2 @ (cP @ (cR @ (sK2 @ X2)) @ (cR @ (sK3 @ X2)))))) | (cZ = ((sK3 @ X2))) | ($true != ((X2 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f25,plain,(
% 2.91/0.67 ( ! [X2 : (a > $o)] : (($true != ((X2 @ (cP @ (cL @ (sK2 @ X2)) @ (cL @ (sK3 @ X2)))))) | ($true != ((X2 @ (cP @ (cR @ (sK2 @ X2)) @ (cR @ (sK3 @ X2)))))) | (cZ != ((sK2 @ X2))) | ($true != ((X2 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))) )),
% 2.91/0.67 inference(cnf_transformation,[],[f9])).
% 2.91/0.67 thf(f28,plain,(
% 2.91/0.67 ( ! [X6 : a] : (($true != ((sK4 @ (cP @ X6 @ cZ)))) | (cZ = X6)) )),
% 2.91/0.67 inference(equality_resolution,[],[f20])).
% 2.91/0.67 thf(f85,plain,(
% 2.91/0.67 ($true != $true) | ($true = ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(constrained_superposition,[],[f21,f19])).
% 2.91/0.67 thf(f86,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f85])).
% 2.91/0.67 thf(f633,plain,(
% 2.91/0.67 ($true != $true) | ($true = (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (sK2 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0)))) @ (sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))))))),
% 2.91/0.67 inference(constrained_superposition,[],[f23,f86])).
% 2.91/0.67 thf(f669,plain,(
% 2.91/0.67 ($true = (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (sK2 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0)))) @ (sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))))))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f633])).
% 2.91/0.67 thf(f670,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ (sK2 @ sK4) @ (sK3 @ sK4)))))),
% 2.91/0.67 inference(beta-eta_normalization,[],[f669])).
% 2.91/0.67 thf(f760,plain,(
% 2.91/0.67 ($true != $true) | ($true = ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ (sK3 @ sK4))))))),
% 2.91/0.67 inference(constrained_superposition,[],[f22,f670])).
% 2.91/0.67 thf(f761,plain,(
% 2.91/0.67 ($true != $true) | ($true = ((sK4 @ (cP @ (cL @ (sK2 @ sK4)) @ (cL @ (sK3 @ sK4))))))),
% 2.91/0.67 inference(constrained_superposition,[],[f21,f670])).
% 2.91/0.67 thf(f768,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ (cL @ (sK2 @ sK4)) @ (cL @ (sK3 @ sK4))))))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f761])).
% 2.91/0.67 thf(f769,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ (sK3 @ sK4))))))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f760])).
% 2.91/0.67 thf(f1297,plain,(
% 2.91/0.67 ($true != $true) | ($true != (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (cR @ (sK2 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))) @ (cR @ (sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))))))) | (cZ = ((sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0)))))) | ($true != (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(constrained_superposition,[],[f24,f768])).
% 2.91/0.67 thf(f1320,plain,(
% 2.91/0.67 ($true != (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (cR @ (sK2 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))) @ (cR @ (sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))))))))) | (cZ = ((sK3 @ (^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0)))))) | ($true != (((^[Y0 : a]: (sK4 @ ((^[Y1 : a]: (Y1)) @ Y0))) @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f1297])).
% 2.91/0.67 thf(f1321,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ (sK3 @ sK4)))))) | (cZ = ((sK3 @ sK4))) | ($true != ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(beta-eta_normalization,[],[f1320])).
% 2.91/0.67 thf(f1367,plain,(
% 2.91/0.67 (cZ = ((sK3 @ sK4))) | ($true != ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1321,f769])).
% 2.91/0.67 thf(f1368,plain,(
% 2.91/0.67 (cZ = ((sK3 @ sK4)))),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1367,f86])).
% 2.91/0.67 thf(f1472,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ (sK2 @ sK4) @ cZ))))),
% 2.91/0.67 inference(forward_demodulation,[],[f670,f1368])).
% 2.91/0.67 thf(f1643,plain,(
% 2.91/0.67 ($true != $true) | (cZ = ((sK2 @ sK4)))),
% 2.91/0.67 inference(constrained_superposition,[],[f28,f1472])).
% 2.91/0.67 thf(f1653,plain,(
% 2.91/0.67 (cZ = ((sK2 @ sK4)))),
% 2.91/0.67 inference(trivial_inequality_removal,[],[f1643])).
% 2.91/0.67 thf(f1741,plain,(
% 2.91/0.67 ($true = ((sK4 @ (cP @ cZ @ cZ))))),
% 2.91/0.67 inference(backward_demodulation,[],[f1472,f1653])).
% 2.91/0.67 thf(f1767,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cL @ (sK2 @ sK4)) @ (cL @ cZ))))) | ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ))))) | (cZ != ((sK2 @ sK4))) | ($true != ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(constrained_superposition,[],[f25,f1368])).
% 2.91/0.67 thf(f1854,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cL @ (sK2 @ sK4)) @ (cL @ cZ))))) | ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ))))) | ($true != ((sK4 @ (cP @ (cL @ sK0) @ (cL @ sK1)))))),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1767,f1653])).
% 2.91/0.67 thf(f1856,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cL @ (sK2 @ sK4)) @ (cL @ cZ))))) | ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ)))))),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1854,f86])).
% 2.91/0.67 thf(f1858,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cL @ cZ) @ (cL @ cZ))))) | ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ)))))),
% 2.91/0.67 inference(forward_demodulation,[],[f1856,f1653])).
% 2.91/0.67 thf(f1860,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ cZ @ cZ)))) | ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ)))))),
% 2.91/0.67 inference(forward_demodulation,[],[f1858,f10])).
% 2.91/0.67 thf(f1862,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cR @ (sK2 @ sK4)) @ (cR @ cZ)))))),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1860,f1741])).
% 2.91/0.67 thf(f1864,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ (cR @ cZ) @ (cR @ cZ)))))),
% 2.91/0.67 inference(forward_demodulation,[],[f1862,f1653])).
% 2.91/0.67 thf(f1866,plain,(
% 2.91/0.67 ($true != ((sK4 @ (cP @ cZ @ cZ))))),
% 2.91/0.67 inference(forward_demodulation,[],[f1864,f11])).
% 2.91/0.67 thf(f1868,plain,(
% 2.91/0.67 $false),
% 2.91/0.67 inference(forward_subsumption_resolution,[],[f1866,f1741])).
% 2.91/0.67 % SZS output end Proof for theBenchmark
% 2.91/0.67 % (3628766)------------------------------
% 2.91/0.67 % (3628766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.91/0.67 % (3628766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/0.67 % (3628766)CaDiCaL version: 2.1.3
% 2.91/0.67 % (3628766)Termination reason: Refutation
% 2.91/0.67 % (3628766)Time elapsed: 0.219 s
% 2.91/0.67 % (3628766)Peak memory usage: 13 MB
% 2.91/0.67 % (3628766)Instructions burned: 255 (million)
% 2.91/0.67 % (3628711)Success in time 0.408 s
% 2.91/0.67 % Vampire exiting
%------------------------------------------------------------------------------