%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM167^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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 07:46:29 AM UTC 2026
% Result : Theorem 13.76s 2.30s
% Output : Refutation 14.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM167^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21 % Computer : n018.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 17:50:11 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.24 Running first-order model finding
% 0.11/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.11/1.05 % (414282)Will run a generic schedule for satisfiability detection.
% 4.11/1.05 % (414287)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=931440289_2999 on theBenchmark for (2999ds/0Mi)
% 4.11/1.05 % (414288)% WARNING: option uhcvi not known.
% 4.11/1.05 % (414288)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2444247572:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.11/1.05 % (414290)dis+10_1_sil=32000:sp=arity:random_seed=176213732:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.11/1.05 % (414289)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2136385201:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.11/1.05 % (414291)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2941168890:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.11/1.05 % (414292)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1956711063:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.11/1.05 % (414293)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1462880991:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.11/1.05 % Exception at run slice level
% 4.11/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.11/1.05 % (414288)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.11/1.05 % (414291)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.11/1.05 % (414301)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1775234156:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.11/1.05 % (414288)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 4.11/1.05 % Exception at run slice level
% 4.11/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.11/1.05 % (414290)Instruction limit reached!
% 4.11/1.05 % (414290)------------------------------
% 4.11/1.05 % (414290)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.11/1.05 % (414290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.05 % (414290)CaDiCaL version: 2.1.3
% 4.11/1.05 % (414290)Termination reason: Instruction limit
% 4.11/1.05 % (414290)Termination phase: Saturation
% 4.11/1.05 % (414290)Time elapsed: 0.046 s
% 4.11/1.05 % (414290)Peak memory usage: 12 MB
% 4.11/1.05 % (414290)Instructions burned: 105 (million)
% 4.11/1.05 % (414291)Instruction limit reached!
% 4.11/1.05 % (414291)------------------------------
% 4.11/1.05 % (414291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.11/1.05 % (414291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.05 % (414291)CaDiCaL version: 2.1.3
% 4.11/1.05 % (414291)Termination reason: Instruction limit
% 4.11/1.05 % (414291)Termination phase: Saturation
% 4.11/1.05 % (414291)Time elapsed: 0.053 s
% 4.11/1.05 % (414291)Peak memory usage: 13 MB
% 4.11/1.05 % (414291)Instructions burned: 121 (million)
% 4.11/1.05 % (414303)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=757143823:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.11/1.05 % (414292)Instruction limit reached!
% 4.11/1.05 % (414292)------------------------------
% 4.11/1.05 % (414292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.11/1.05 % (414292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.05 % (414292)CaDiCaL version: 2.1.3
% 4.11/1.05 % (414292)Termination reason: Instruction limit
% 4.11/1.05 % (414292)Termination phase: Saturation
% 4.11/1.05 % (414292)Time elapsed: 0.059 s
% 4.11/1.05 % (414292)Peak memory usage: 13 MB
% 4.11/1.05 % (414292)Instructions burned: 133 (million)
% 4.11/1.05 % (414304)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=2048171731:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.11/1.05 % (414293)Instruction limit reached!
% 4.11/1.05 % (414293)------------------------------
% 4.11/1.05 % (414293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.11/1.05 % (414293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.05 % (414293)CaDiCaL version: 2.1.3
% 4.11/1.05 % (414293)Termination reason: Instruction limit
% 4.11/1.05 % (414293)Termination phase: Saturation
% 13.76/2.30 % (414293)Time elapsed: 0.072 s
% 13.76/2.30 % (414293)Peak memory usage: 13 MB
% 13.76/2.30 % (414293)Instructions burned: 161 (million)
% 13.76/2.30 % (414306)ott-21_1_sil=16000:fs=off:random_seed=1809962979:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 13.76/2.30 % (414307)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=788742358:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 13.76/2.30 % (414304)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 13.76/2.30 % (414303)Instruction limit reached!
% 13.76/2.30 % (414303)------------------------------
% 13.76/2.30 % (414303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414303)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414303)Termination reason: Instruction limit
% 13.76/2.30 % (414303)Termination phase: Saturation
% 13.76/2.30 % (414303)Time elapsed: 0.032 s
% 13.76/2.30 % (414303)Peak memory usage: 13 MB
% 13.76/2.30 % (414303)Instructions burned: 132 (million)
% 13.76/2.30 % (414309)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3237819535:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 13.76/2.30 % (414312)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1356860416:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 13.76/2.30 % (414304)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414315)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3613674623:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 13.76/2.30 % (414306)Instruction limit reached!
% 13.76/2.30 % (414306)------------------------------
% 13.76/2.30 % (414306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414306)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414306)Termination reason: Instruction limit
% 13.76/2.30 % (414306)Termination phase: Saturation
% 13.76/2.30 % (414306)Time elapsed: 0.083 s
% 13.76/2.30 % (414306)Peak memory usage: 13 MB
% 13.76/2.30 % (414306)Instructions burned: 186 (million)
% 13.76/2.30 % (414317)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=2048756731: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)
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414317)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 13.76/2.30 % (414319)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3724298663:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 13.76/2.30 % (414319)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 13.76/2.30 % (414307)Instruction limit reached!
% 13.76/2.30 % (414307)------------------------------
% 13.76/2.30 % (414307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414307)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414307)Termination reason: Instruction limit
% 13.76/2.30 % (414307)Termination phase: Saturation
% 13.76/2.30 % (414307)Time elapsed: 0.253 s
% 13.76/2.30 % (414307)Peak memory usage: 14 MB
% 13.76/2.30 % (414307)Instructions burned: 477 (million)
% 13.76/2.30 % (414350)fmb+10_1_sil=64000:random_seed=1719576492:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 13.76/2.30 % (414350)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414312)Instruction limit reached!
% 13.76/2.30 % (414312)------------------------------
% 13.76/2.30 % (414312)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414312)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414312)Termination reason: Instruction limit
% 13.76/2.30 % (414312)Termination phase: Saturation
% 13.76/2.30 % (414312)Time elapsed: 0.297 s
% 13.76/2.30 % (414312)Peak memory usage: 20 MB
% 13.76/2.30 % (414312)Instructions burned: 1180 (million)
% 13.76/2.30 % (414304)Instruction limit reached!
% 13.76/2.30 % (414304)------------------------------
% 13.76/2.30 % (414304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414304)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414304)Termination reason: Instruction limit
% 13.76/2.30 % (414304)Termination phase: Saturation
% 13.76/2.30 % (414304)Time elapsed: 0.333 s
% 13.76/2.30 % (414304)Peak memory usage: 16 MB
% 13.76/2.30 % (414304)Instructions burned: 686 (million)
% 13.76/2.30 % (414381)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2090785647:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 13.76/2.30 % (414384)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1550835393:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 13.76/2.30 % (414385)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2949907338:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 13.76/2.30 % (414385)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414398)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=4277053126:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 13.76/2.30 % (414398)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 13.76/2.30 % (414402)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2273439224:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 13.76/2.30 % (414398)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414418)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2921080491:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 13.76/2.30 % (414317)Instruction limit reached!
% 13.76/2.30 % (414317)------------------------------
% 13.76/2.30 % (414317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414317)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414317)Termination reason: Instruction limit
% 13.76/2.30 % (414317)Termination phase: Saturation
% 13.76/2.30 % (414317)Time elapsed: 0.352 s
% 13.76/2.30 % (414317)Peak memory usage: 16 MB
% 13.76/2.30 % (414317)Instructions burned: 692 (million)
% 13.76/2.30 % (414431)ott-2_1_sil=16000:newcnf=on:random_seed=3607226737:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414431)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 13.76/2.30 % (414436)ott+10_1_sil=32000:tgt=ground:random_seed=3564030451:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 13.76/2.30 % (414319)Instruction limit reached!
% 13.76/2.30 % (414319)------------------------------
% 13.76/2.30 % (414319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414319)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414319)Termination reason: Instruction limit
% 13.76/2.30 % (414319)Termination phase: Saturation
% 13.76/2.30 % (414319)Time elapsed: 0.448 s
% 13.76/2.30 % (414319)Peak memory usage: 18 MB
% 13.76/2.30 % (414319)Instructions burned: 879 (million)
% 13.76/2.30 % (414460)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3528895836:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414468)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2708822369:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 13.76/2.30 % (414468)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 13.76/2.30 % (414398)Instruction limit reached!
% 13.76/2.30 % (414398)------------------------------
% 13.76/2.30 % (414398)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414398)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414398)Termination reason: Instruction limit
% 13.76/2.30 % (414398)Termination phase: Saturation
% 13.76/2.30 % (414398)Time elapsed: 0.334 s
% 13.76/2.30 % (414398)Peak memory usage: 15 MB
% 13.76/2.30 % (414398)Instructions burned: 1476 (million)
% 13.76/2.30 % (414470)dis+21_1_sil=32000:sas=cadical:random_seed=3773580909:i=3773:amm=off_2991 on theBenchmark for (2991ds/3773Mi)
% 13.76/2.30 % (414431)Instruction limit reached!
% 13.76/2.30 % (414431)------------------------------
% 13.76/2.30 % (414431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414431)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414431)Termination reason: Instruction limit
% 13.76/2.30 % (414431)Termination phase: Saturation
% 13.76/2.30 % (414431)Time elapsed: 0.493 s
% 13.76/2.30 % (414431)Peak memory usage: 18 MB
% 13.76/2.30 % (414431)Instructions burned: 870 (million)
% 13.76/2.30 % (414524)ott+11_1_sil=16000:gs=on:random_seed=2541528837:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2988 on theBenchmark for (2988ds/2251Mi)
% 13.76/2.30 % (414524)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 13.76/2.30 % (414470)Instruction limit reached!
% 13.76/2.30 % (414470)------------------------------
% 13.76/2.30 % (414470)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.76/2.30 % (414470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.76/2.30 % (414470)CaDiCaL version: 2.1.3
% 13.76/2.30 % (414470)Termination reason: Instruction limit
% 13.76/2.30 % (414470)Termination phase: Saturation
% 13.76/2.30 % (414470)Time elapsed: 1.023 s
% 13.76/2.30 % (414470)Peak memory usage: 28 MB
% 13.76/2.30 % (414470)Instructions burned: 3775 (million)
% 13.76/2.30 % (414678)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=2742682933:fmbsr=1.6:i=67534_2981 on theBenchmark for (2981ds/67534Mi)
% 13.76/2.30 % Exception at run slice level
% 13.76/2.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 13.76/2.30 % (414680)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=2105927299:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2980 on theBenchmark for (2980ds/4591Mi)
% 13.76/2.30 % (414524) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-414282-414524"...
% 13.76/2.30 % (414524)...printing done.
% 13.76/2.30 % (414524)Refutation found. Thanks to Tanya!
% 13.76/2.30 % SZS status Theorem for theBenchmark
% 13.76/2.30 % SZS output start Proof for theBenchmark
% 13.76/2.30 thf(type_def_5, type, binDag_Mirabelle_dag: $tType).
% 13.76/2.30 thf(type_def_6, type, simpl_ref: $tType).
% 13.76/2.30 thf(type_def_7, type, set: $tType > $tType).
% 13.76/2.30 thf(type_def_8, type, itself: $tType > $tType).
% 13.76/2.30 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 13.76/2.30 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_2, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_3, type, ord: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_4, type, order: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_5, type, lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_6, type, no_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_7, type, no_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_8, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_9, type, preorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_10, type, order_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_11, type, wellorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_12, type, dense_order: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_13, type, linordered_idom: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_14, type, linordered_field: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_15, type, semilattice_sup: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_16, type, bounded_lattice_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_17, type, bounde1808546759up_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_18, type, condit1656338222tinuum: !>[X0: $tType]:((itself @ X0 > $o))).
% 13.76/2.30 thf(func_def_19, type, binDag_Mirabelle_DAG: (binDag_Mirabelle_dag > $o)).
% 13.76/2.30 thf(func_def_20, type, binDag_Mirabelle_Dag: (simpl_ref > (simpl_ref > simpl_ref) > (simpl_ref > simpl_ref) > binDag_Mirabelle_dag > $o)).
% 13.76/2.30 thf(func_def_21, type, binDag476092410e_Node: (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_22, type, binDag_Mirabelle_Tip: binDag_Mirabelle_dag).
% 13.76/2.30 thf(func_def_23, type, binDag1297733282se_dag: !>[X0: $tType]:((X0 > (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > X0) > binDag_Mirabelle_dag > X0))).
% 13.76/2.30 thf(func_def_24, type, binDag1442713106ec_dag: !>[X0: $tType]:((X0 > (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > X0 > X0 > X0) > binDag_Mirabelle_dag > X0))).
% 13.76/2.30 thf(func_def_25, type, binDag1380252983set_of: (binDag_Mirabelle_dag > set @ simpl_ref)).
% 13.76/2.30 thf(func_def_26, type, binDag786255756subdag: (binDag_Mirabelle_dag > binDag_Mirabelle_dag > $o)).
% 13.76/2.30 thf(func_def_27, type, fun_upd: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0 > X1 > X0 > X1))).
% 13.76/2.30 thf(func_def_28, type, override_on: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > set @ X0 > X0 > X1))).
% 13.76/2.30 thf(func_def_29, type, comm_monoid: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > $o))).
% 13.76/2.30 thf(func_def_30, type, monoid: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > $o))).
% 13.76/2.30 thf(func_def_31, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 13.76/2.30 thf(func_def_32, type, semilattice_neutr: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > $o))).
% 13.76/2.30 thf(func_def_33, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 13.76/2.30 thf(func_def_34, type, bot_bot: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_35, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 13.76/2.30 thf(func_def_36, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 13.76/2.30 thf(func_def_37, type, type2: !>[X0: $tType]:(itself @ X0)).
% 13.76/2.30 thf(func_def_38, type, inv_imagep: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0) > X1 > X1 > $o))).
% 13.76/2.30 thf(func_def_39, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 13.76/2.30 thf(func_def_40, type, pow: !>[X0: $tType]:((set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_41, type, bind: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > set @ X1) > set @ X1))).
% 13.76/2.30 thf(func_def_42, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_43, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 13.76/2.30 thf(func_def_44, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 13.76/2.30 thf(func_def_45, type, pairwise: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 13.76/2.30 thf(func_def_46, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_47, type, simpl_Null: simpl_ref).
% 13.76/2.30 thf(func_def_48, type, pred_chain: !>[X0: $tType]:((set @ X0 > (X0 > X0 > $o) > set @ X0 > $o))).
% 13.76/2.30 thf(func_def_49, type, pred_maxchain: !>[X0: $tType]:((set @ X0 > (X0 > X0 > $o) > set @ X0 > $o))).
% 13.76/2.30 thf(func_def_50, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 13.76/2.30 thf(func_def_51, type, l: (simpl_ref > simpl_ref)).
% 13.76/2.30 thf(func_def_52, type, p: simpl_ref).
% 13.76/2.30 thf(func_def_53, type, r: (simpl_ref > simpl_ref)).
% 13.76/2.30 thf(func_def_54, type, t: binDag_Mirabelle_dag).
% 13.76/2.30 thf(func_def_56, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 13.76/2.30 thf(func_def_59, type, db2: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_60, type, db0: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_61, type, db1: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_62, type, db3: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_63, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 13.76/2.30 thf(func_def_64, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_65, type, vAND: ($o > $o > $o)).
% 13.76/2.30 thf(func_def_66, type, vNOT: ($o > $o)).
% 13.76/2.30 thf(func_def_67, type, vOR: ($o > $o > $o)).
% 13.76/2.30 thf(func_def_68, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_69, type, vIMP: ($o > $o > $o)).
% 13.76/2.30 thf(func_def_70, type, sP0: ((binDag_Mirabelle_dag > $o) > $o)).
% 13.76/2.30 thf(func_def_71, type, sP1: !>[X0: $tType]:((set @ X0 > $o))).
% 13.76/2.30 thf(func_def_72, type, sP2: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_73, type, sP3: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_74, type, sP4: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_75, type, sP5: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_76, type, sP6: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > $o))).
% 13.76/2.30 thf(func_def_77, type, sP7: !>[X0: $tType]:((set @ set @ X0 > $o))).
% 13.76/2.30 thf(func_def_78, type, sP8: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0 > $o))).
% 13.76/2.30 thf(func_def_79, type, sP9: !>[X0: $tType]:((set @ set @ X0 > $o))).
% 13.76/2.30 thf(func_def_80, type, sK10: (binDag_Mirabelle_dag > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_81, type, sK11: (binDag_Mirabelle_dag > simpl_ref)).
% 13.76/2.30 thf(func_def_82, type, sK12: (binDag_Mirabelle_dag > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_83, type, sK13: ((binDag_Mirabelle_dag > $o) > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_84, type, sK14: ((binDag_Mirabelle_dag > $o) > simpl_ref)).
% 13.76/2.30 thf(func_def_85, type, sK15: ((binDag_Mirabelle_dag > $o) > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_86, type, sK16: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_87, type, sK17: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_88, type, sK18: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 13.76/2.30 thf(func_def_89, type, sK19: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_90, type, sK20: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_91, type, sK21: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 13.76/2.30 thf(func_def_92, type, sK22: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 13.76/2.30 thf(func_def_93, type, sK23: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 13.76/2.30 thf(func_def_94, type, sK24: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 13.76/2.30 thf(func_def_95, type, sK25: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 13.76/2.30 thf(func_def_96, type, sK26: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 13.76/2.30 thf(func_def_97, type, sK27: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 13.76/2.30 thf(func_def_98, type, sK28: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 13.76/2.30 thf(func_def_99, type, sK29: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 13.76/2.30 thf(func_def_100, type, sK30: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 13.76/2.30 thf(func_def_101, type, sK31: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_102, type, sK32: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_103, type, sK33: !>[X0: $tType]:((X0 > X0 > X0))).
% 13.76/2.30 thf(func_def_104, type, sK34: !>[X0: $tType]:(((X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_105, type, sK35: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_106, type, sK36: !>[X0: $tType, X1: $tType]:((X1 > X0))).
% 13.76/2.30 thf(func_def_107, type, sK37: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_108, type, sK38: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_109, type, sK39: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_110, type, sK40: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_111, type, sK41: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_112, type, sK42: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_113, type, sK43: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_114, type, sK44: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_115, type, sK45: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_116, type, sK46: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_117, type, sK47: !>[X0: $tType, X1: $tType]:((X1 > X0))).
% 13.76/2.30 thf(func_def_118, type, sK48: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_119, type, sK49: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_120, type, sK50: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_121, type, sK51: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_122, type, sK52: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_123, type, sK53: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_124, type, sK54: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_125, type, sK55: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_126, type, sK56: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_127, type, sK57: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_128, type, sK58: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_129, type, sK59: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_130, type, sK60: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_131, type, sK61: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_132, type, sK62: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 13.76/2.30 thf(func_def_133, type, sK63: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 13.76/2.30 thf(func_def_134, type, sK64: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1))).
% 13.76/2.30 thf(func_def_135, type, sK65: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 13.76/2.30 thf(func_def_136, type, sK66: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1))).
% 13.76/2.30 thf(func_def_137, type, sK67: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 13.76/2.30 thf(func_def_138, type, sK68: !>[X0: $tType]:((X0 > set @ X0 > (X0 > X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_139, type, sK69: !>[X0: $tType]:((set @ X0 > set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_140, type, sK70: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_141, type, sK71: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_142, type, sK72: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_143, type, sK73: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_144, type, sK74: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_145, type, sK75: !>[X0: $tType]:((set @ X0 > set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_146, type, sK76: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_147, type, sK77: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_148, type, sK78: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_149, type, sK79: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_150, type, sK80: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_151, type, sK81: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_152, type, sK82: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_153, type, sK83: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_154, type, sK84: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_155, type, sK85: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_156, type, sK86: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0 > set @ set @ X0))).
% 13.76/2.30 thf(func_def_157, type, sK87: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_158, type, sK88: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_159, type, sK89: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_160, type, sK90: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_161, type, sK91: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_162, type, sK92: !>[X0: $tType]:(((X0 > X0 > $o) > X0 > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_163, type, sK93: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_164, type, sK94: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_165, type, sK95: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_166, type, sK96: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_167, type, sK97: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 13.76/2.30 thf(func_def_168, type, sK98: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_169, type, sK99: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_170, type, sK100: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_171, type, sK101: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_172, type, sK102: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_173, type, sK103: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 13.76/2.30 thf(func_def_174, type, sK104: !>[X0: $tType]:((X0 > X0))).
% 13.76/2.30 thf(func_def_175, type, sK105: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_176, type, sK106: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_177, type, sK107: !>[X0: $tType]:((set @ X0 > X0))).
% 13.76/2.30 thf(func_def_178, type, sK108: !>[X0: $tType]:(((X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_179, type, sK109: !>[X0: $tType]:(((X0 > $o) > X0))).
% 13.76/2.30 thf(func_def_180, type, sK110: (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_181, type, sK111: (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_182, type, sK112: ((simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref > (simpl_ref > simpl_ref) > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_183, type, sK113: ((simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref > (simpl_ref > simpl_ref) > binDag_Mirabelle_dag)).
% 13.76/2.30 thf(func_def_185, type, sK115: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0 > X1 > X1 > (X0 > X1) > X0))).
% 13.76/2.30 thf(func_def_186, type, sK116: ((simpl_ref > simpl_ref) > simpl_ref)).
% 13.76/2.30 thf(func_def_187, type, sK117: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > simpl_ref)).
% 13.76/2.30 thf(func_def_188, type, sK118: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > simpl_ref)).
% 13.76/2.30 thf(func_def_189, type, db4: !>[X0: $tType]:(X0)).
% 13.76/2.30 thf(func_def_190, type, sK119: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref)).
% 13.76/2.30 thf(func_def_191, type, sK120: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref)).
% 13.76/2.30 thf(func_def_192, type, sK121: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref)).
% 13.76/2.30 thf(func_def_193, type, sK122: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > binDag_Mirabelle_dag > simpl_ref)).
% 13.76/2.30 thf(func_def_194, type, sK123: ((binDag_Mirabelle_dag > simpl_ref > simpl_ref) > simpl_ref)).
% 13.76/2.30 thf(f1,axiom,(
% 13.76/2.30 ! [X2 : (simpl_ref > simpl_ref),X3 : (simpl_ref > simpl_ref),X4 : binDag_Mirabelle_dag] : (((binDag_Mirabelle_Dag @ simpl_Null @ X2 @ X3 @ X4)) = (X4 = binDag_Mirabelle_Tip))),
% 13.76/2.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_Dag__Null)).
% 13.76/2.30 thf(f2,axiom,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref)] : (((binDag_Mirabelle_Dag @ X0 @ X1 @ X2 @ binDag_Mirabelle_Tip)) = (X0 = simpl_Null))),
% 13.76/2.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_Dag_Osimps_I1_J)).
% 13.76/2.30 thf(f3,axiom,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag] : ((X0 != simpl_Null) => ~(binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3))),
% 13.76/2.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_Dag__upd__same__l__lemma)).
% 13.76/2.30 thf(f6,axiom,(
% 13.76/2.30 ! [X0 : $tType,X1 : $tType] : (fun_upd @ X1 @ X0 = (^[X2 : (X1 > X0), X3 : X1, X4 : X0, X5 : X1] : ((if @ X0 @ (X5 = X3) @ X4 @ (X2 @ X5)))))),
% 13.76/2.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_fun__upd__apply)).
% 13.76/2.30 thf(f294,conjecture,(
% 13.76/2.30 (((binDag_Mirabelle_Dag @ p @ (fun_upd @ simpl_ref @ simpl_ref @ l @ p @ p) @ r @ t)) = (t = binDag_Mirabelle_Tip) & (p = simpl_Null))),
% 13.76/2.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 13.76/2.30 thf(f295,negated_conjecture,(
% 13.76/2.30 ~ (((binDag_Mirabelle_Dag @ p @ (fun_upd @ simpl_ref @ simpl_ref @ l @ p @ p) @ r @ t)) = (t = binDag_Mirabelle_Tip) & (p = simpl_Null))),
% 13.76/2.30 inference(negated_conjecture,[status(cth)],[f294])).
% 13.76/2.30 thf(f296,plain,(
% 13.76/2.30 ! [X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref),X2 : binDag_Mirabelle_dag] : (((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ X2)) = (binDag_Mirabelle_Tip = X2))),
% 13.76/2.30 inference(rectify,[],[f1])).
% 13.76/2.30 thf(f297,plain,(
% 13.76/2.30 ! [X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref),X2 : binDag_Mirabelle_dag] : (((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ X2)) = ((binDag_Mirabelle_Tip = X2)))),
% 13.76/2.30 inference(fool_elimination,[],[f296])).
% 13.76/2.30 thf(f298,plain,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref)] : (((binDag_Mirabelle_Dag @ X0 @ X1 @ X2 @ binDag_Mirabelle_Tip)) = ((simpl_Null = X0)))),
% 13.76/2.30 inference(fool_elimination,[],[f2])).
% 13.76/2.30 thf(f299,plain,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag] : ((X0 != simpl_Null) => ~(binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3))),
% 13.76/2.30 inference(rectify,[],[f3])).
% 13.76/2.30 thf(f300,plain,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag] : ((simpl_Null != X0) => ~ (((binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3)) = $true))),
% 13.76/2.30 inference(fool_elimination,[],[f299])).
% 13.76/2.30 thf(f301,plain,(
% 13.76/2.30 ! [X0 : $tType,X1 : $tType] : (fun_upd @ X1 @ X0 = (^[X2 : (X1 > X0), X3 : X1, X4 : X0, X5 : X1] : ((if @ X0 @ (X5 = X3) @ X4 @ (X2 @ X5)))))),
% 13.76/2.30 inference(rectify,[],[f6])).
% 13.76/2.30 thf(f302,plain,(
% 13.76/2.30 ! [X0 : $tType,X1 : $tType] : (fun_upd @ X1 @ X0 = (^[Y0 : X1 > X0]: ((^[Y1 : X1]: ((^[Y2 : X0]: ((^[Y3 : X1]: (if @ X0 @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))))),
% 13.76/2.30 inference(fool_elimination,[],[f301])).
% 13.76/2.30 thf(f787,plain,(
% 13.76/2.30 ~ (((binDag_Mirabelle_Dag @ p @ (fun_upd @ simpl_ref @ simpl_ref @ l @ p @ p) @ r @ t)) = (((simpl_Null = p) & (binDag_Mirabelle_Tip = t))))),
% 13.76/2.30 inference(fool_elimination,[],[f295])).
% 13.76/2.30 thf(f788,plain,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag] : ((simpl_Null != X0) => (((binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3)) != $true))),
% 13.76/2.30 inference(flattening,[],[f300])).
% 13.76/2.30 thf(f827,plain,(
% 13.76/2.30 (((binDag_Mirabelle_Dag @ p @ (fun_upd @ simpl_ref @ simpl_ref @ l @ p @ p) @ r @ t)) != (((simpl_Null = p) & (binDag_Mirabelle_Tip = t))))),
% 13.76/2.30 inference(flattening,[],[f787])).
% 13.76/2.30 thf(f828,plain,(
% 13.76/2.30 ! [X0 : simpl_ref,X1 : (simpl_ref > simpl_ref),X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag] : ((((binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3)) != $true) | (simpl_Null = X0))),
% 13.76/2.30 inference(ennf_transformation,[],[f788])).
% 13.76/2.30 thf(f1135,plain,(
% 13.76/2.30 ( ! [X2 : binDag_Mirabelle_dag,X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ X2)) = ((binDag_Mirabelle_Tip = X2)))) )),
% 13.76/2.30 inference(cnf_transformation,[],[f297])).
% 13.76/2.30 thf(f1136,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ X0 @ X1 @ X2 @ binDag_Mirabelle_Tip)) = ((simpl_Null = X0)))) )),
% 13.76/2.30 inference(cnf_transformation,[],[f298])).
% 13.76/2.30 thf(f1137,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag,X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ X0 @ (fun_upd @ simpl_ref @ simpl_ref @ X1 @ X0 @ X0) @ X2 @ X3)) != $true) | (simpl_Null = X0)) )),
% 13.76/2.30 inference(cnf_transformation,[],[f828])).
% 13.76/2.30 thf(f1140,plain,(
% 13.76/2.30 ( ! [X1 : $tType,X0 : $tType] : ((fun_upd @ X1 @ X0 = (^[Y0 : X1 > X0]: ((^[Y1 : X1]: ((^[Y2 : X0]: ((^[Y3 : X1]: (if @ X0 @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))))) )),
% 13.76/2.30 inference(cnf_transformation,[],[f302])).
% 13.76/2.30 thf(f1476,plain,(
% 13.76/2.30 (((binDag_Mirabelle_Dag @ p @ (fun_upd @ simpl_ref @ simpl_ref @ l @ p @ p) @ r @ t)) != (((simpl_Null = p) & (binDag_Mirabelle_Tip = t))))),
% 13.76/2.30 inference(cnf_transformation,[],[f827])).
% 13.76/2.30 thf(f1479,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag,X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : (($true != ((binDag_Mirabelle_Dag @ X0 @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ X1 @ X0 @ X0) @ X2 @ X3))) | (simpl_Null = X0)) )),
% 13.76/2.30 inference(definition_unfolding,[],[f1137,f1140])).
% 13.76/2.30 thf(f1504,plain,(
% 13.76/2.30 ((((simpl_Null = p) & (binDag_Mirabelle_Tip = t))) != ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(definition_unfolding,[],[f1476,f1140])).
% 13.76/2.30 thf(f1524,plain,(
% 13.76/2.30 ($true = (((simpl_Null = p) & (binDag_Mirabelle_Tip = t)))) | ($true = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(xor_proxy_clausification,[],[f1504])).
% 13.76/2.30 thf(f1525,plain,(
% 13.76/2.30 ($false = (((simpl_Null = p) & (binDag_Mirabelle_Tip = t)))) | ($false = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(xor_proxy_clausification,[],[f1504])).
% 13.76/2.30 thf(f1526,plain,(
% 13.76/2.30 ($false = ((binDag_Mirabelle_Tip = t))) | ($false = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t))) | ($false = ((simpl_Null = p)))),
% 13.76/2.30 inference(and_proxy_clausification,[],[f1525])).
% 13.76/2.30 thf(f1527,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip != t) | ($false = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t))) | ($false = ((simpl_Null = p)))),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f1526])).
% 13.76/2.30 thf(f1528,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip != t) | ($false = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t))) | (simpl_Null != p)),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f1527])).
% 13.76/2.30 thf(f1529,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip != t) | ($false = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t))) | (simpl_Null != p)),
% 13.76/2.30 inference(beta-eta_normalization,[],[f1528])).
% 13.76/2.30 thf(f1530,plain,(
% 13.76/2.30 ($true = ((binDag_Mirabelle_Tip = t))) | ($true = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(and_proxy_clausification,[],[f1524])).
% 13.76/2.30 thf(f1531,plain,(
% 13.76/2.30 ($true = ((simpl_Null = p))) | ($true = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(and_proxy_clausification,[],[f1524])).
% 13.76/2.30 thf(f1532,plain,(
% 13.76/2.30 (simpl_Null = p) | ($true = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f1531])).
% 13.76/2.30 thf(f1533,plain,(
% 13.76/2.30 (simpl_Null = p) | ($true = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t)))),
% 13.76/2.30 inference(beta-eta_normalization,[],[f1532])).
% 13.76/2.30 thf(f1534,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip = t) | ($true = ((binDag_Mirabelle_Dag @ p @ ((^[Y0 : simpl_ref > simpl_ref]: ((^[Y1 : simpl_ref]: ((^[Y2 : simpl_ref]: ((^[Y3 : simpl_ref]: (if @ simpl_ref @ (Y1 = Y3) @ Y2 @ (Y0 @ Y3))))))))) @ l @ p @ p) @ r @ t)))),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f1530])).
% 13.76/2.30 thf(f1535,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip = t) | ($true = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t)))),
% 13.76/2.30 inference(beta-eta_normalization,[],[f1534])).
% 13.76/2.30 thf(f2517,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X3 : binDag_Mirabelle_dag,X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : (($true != ((binDag_Mirabelle_Dag @ X0 @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (X0 = Y0) @ X0 @ (X1 @ Y0))) @ X2 @ X3))) | (simpl_Null = X0)) )),
% 13.76/2.30 inference(beta-eta_normalization,[],[f1479])).
% 13.76/2.30 thf(f2518,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ X0 @ X1 @ X2 @ binDag_Mirabelle_Tip)) = $true) | (((simpl_Null = X0)) = $false)) )),
% 13.76/2.30 inference(iff_proxy_clausification,[],[f1136])).
% 13.76/2.30 thf(f2521,plain,(
% 13.76/2.30 ( ! [X2 : (simpl_ref > simpl_ref),X0 : simpl_ref,X1 : (simpl_ref > simpl_ref)] : ((simpl_Null != X0) | (((binDag_Mirabelle_Dag @ X0 @ X1 @ X2 @ binDag_Mirabelle_Tip)) = $true)) )),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f2518])).
% 13.76/2.30 thf(f2523,plain,(
% 13.76/2.30 ( ! [X2 : binDag_Mirabelle_dag,X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ X2)) = $false) | (((binDag_Mirabelle_Tip = X2)) = $true)) )),
% 13.76/2.30 inference(iff_proxy_clausification,[],[f1135])).
% 13.76/2.30 thf(f2524,plain,(
% 13.76/2.30 ( ! [X2 : binDag_Mirabelle_dag,X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref)] : ((((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ X2)) = $false) | (binDag_Mirabelle_Tip = X2)) )),
% 13.76/2.30 inference(equality_proxy_clausification,[],[f2523])).
% 13.76/2.30 thf(f2527,definition,(
% 13.76/2.30 spl114_1 <=> (simpl_Null = p)),
% 13.76/2.30 introduced(definition,[new_symbols(definition,[spl114_1])],[avatar_definition])).
% 13.76/2.30 thf(f2528,plain,(
% 13.76/2.30 (simpl_Null = p) | ~spl114_1),
% 13.76/2.30 inference(avatar_component_clause,[],[f2527])).
% 13.76/2.30 thf(f2531,definition,(
% 13.76/2.30 spl114_2 <=> ($false = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t)))),
% 13.76/2.30 introduced(definition,[new_symbols(definition,[spl114_2])],[avatar_definition])).
% 13.76/2.30 thf(f2533,plain,(
% 13.76/2.30 ($false = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t))) | ~spl114_2),
% 13.76/2.30 inference(avatar_component_clause,[],[f2531])).
% 13.76/2.30 thf(f2535,definition,(
% 13.76/2.30 spl114_3 <=> (binDag_Mirabelle_Tip = t)),
% 13.76/2.30 introduced(definition,[new_symbols(definition,[spl114_3])],[avatar_definition])).
% 13.76/2.30 thf(f2536,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip = t) | ~spl114_3),
% 13.76/2.30 inference(avatar_component_clause,[],[f2535])).
% 13.76/2.30 thf(f2538,plain,(
% 13.76/2.30 ~spl114_1 | spl114_2 | ~spl114_3),
% 13.76/2.30 inference(avatar_split_clause,[],[f1529,f2535,f2531,f2527])).
% 13.76/2.30 thf(f2540,definition,(
% 13.76/2.30 spl114_4 <=> ($true = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t)))),
% 13.76/2.30 introduced(definition,[new_symbols(definition,[spl114_4])],[avatar_definition])).
% 13.76/2.30 thf(f2542,plain,(
% 13.76/2.30 ($true = ((binDag_Mirabelle_Dag @ p @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (p = Y0) @ p @ (l @ Y0))) @ r @ t))) | ~spl114_4),
% 13.76/2.30 inference(avatar_component_clause,[],[f2540])).
% 13.76/2.30 thf(f2543,plain,(
% 13.76/2.30 spl114_4 | spl114_1),
% 13.76/2.30 inference(avatar_split_clause,[],[f1533,f2527,f2540])).
% 13.76/2.30 thf(f2544,plain,(
% 13.76/2.30 spl114_4 | spl114_3),
% 13.76/2.30 inference(avatar_split_clause,[],[f1535,f2535,f2540])).
% 13.76/2.30 thf(f2854,plain,(
% 13.76/2.30 ($true != $true) | (simpl_Null = p) | ~spl114_4),
% 13.76/2.30 inference(constrained_superposition,[],[f2517,f2542])).
% 13.76/2.30 thf(f2855,plain,(
% 13.76/2.30 (simpl_Null = p) | ~spl114_4),
% 13.76/2.30 inference(trivial_inequality_removal,[],[f2854])).
% 13.76/2.30 thf(f2857,plain,(
% 13.76/2.30 spl114_1 | ~spl114_4),
% 13.76/2.30 inference(avatar_split_clause,[],[f2855,f2540,f2527])).
% 13.76/2.30 thf(f2858,plain,(
% 13.76/2.30 ($true = ((binDag_Mirabelle_Dag @ simpl_Null @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (simpl_Null = Y0) @ simpl_Null @ (l @ Y0))) @ r @ t))) | (~spl114_1 | ~spl114_4)),
% 13.76/2.30 inference(constrained_superposition,[],[f2542,f2528])).
% 13.76/2.30 thf(f5649,plain,(
% 13.76/2.30 ( ! [X0 : (simpl_ref > simpl_ref),X1 : (simpl_ref > simpl_ref)] : (($true = ((binDag_Mirabelle_Dag @ simpl_Null @ X0 @ X1 @ binDag_Mirabelle_Tip)))) )),
% 13.76/2.30 inference(equality_resolution,[],[f2521])).
% 13.76/2.30 thf(f5696,plain,(
% 13.76/2.30 ($true = $false) | (binDag_Mirabelle_Tip = t) | (~spl114_1 | ~spl114_4)),
% 13.76/2.30 inference(constrained_superposition,[],[f2858,f2524])).
% 13.76/2.30 thf(f5700,plain,(
% 13.76/2.30 (binDag_Mirabelle_Tip = t) | (~spl114_1 | ~spl114_4)),
% 13.76/2.30 inference(trivial_inequality_removal,[],[f5696])).
% 13.76/2.30 thf(f5703,plain,(
% 13.76/2.30 spl114_3 | ~spl114_1 | ~spl114_4),
% 13.76/2.30 inference(avatar_split_clause,[],[f5700,f2540,f2527,f2535])).
% 13.76/2.30 thf(f5704,plain,(
% 13.76/2.30 ($false = ((binDag_Mirabelle_Dag @ simpl_Null @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (simpl_Null = Y0) @ simpl_Null @ (l @ Y0))) @ r @ t))) | (~spl114_1 | ~spl114_2)),
% 13.76/2.30 inference(forward_demodulation,[],[f2533,f2528])).
% 13.76/2.30 thf(f5705,plain,(
% 13.76/2.30 ($false = ((binDag_Mirabelle_Dag @ simpl_Null @ (^[Y0 : simpl_ref]: (if @ simpl_ref @ (simpl_Null = Y0) @ simpl_Null @ (l @ Y0))) @ r @ binDag_Mirabelle_Tip))) | (~spl114_1 | ~spl114_2 | ~spl114_3)),
% 13.76/2.30 inference(forward_demodulation,[],[f5704,f2536])).
% 13.76/2.30 thf(f5706,plain,(
% 13.76/2.30 ($true = $false) | (~spl114_1 | ~spl114_2 | ~spl114_3)),
% 13.76/2.30 inference(forward_demodulation,[],[f5705,f5649])).
% 13.76/2.30 thf(f5707,plain,(
% 13.76/2.30 $false | (~spl114_1 | ~spl114_2 | ~spl114_3)),
% 13.76/2.30 inference(trivial_inequality_removal,[],[f5706])).
% 13.76/2.30 thf(f5708,plain,(
% 13.76/2.30 ~spl114_1 | ~spl114_2 | ~spl114_3),
% 13.76/2.30 inference(avatar_contradiction_clause,[],[f5707])).
% 13.76/2.30 cnf(s2, plain, ~spl114_1 | spl114_2 | ~spl114_3, inference(sat_conversion,[],[f2538])).
% 13.76/2.30 cnf(s4, plain, spl114_1 | spl114_4, inference(sat_conversion,[],[f2543])).
% 13.76/2.30 cnf(s6, plain, spl114_3 | spl114_4, inference(sat_conversion,[],[f2544])).
% 13.76/2.30 cnf(s526, plain, spl114_1 | ~spl114_4, inference(sat_conversion,[],[f2857])).
% 13.76/2.30 cnf(s1100, plain, ~spl114_1 | spl114_3 | ~spl114_4, inference(sat_conversion,[],[f5703])).
% 13.76/2.30 cnf(s1104, plain, ~spl114_1 | ~spl114_2 | ~spl114_3, inference(sat_conversion,[],[f5708])).
% 13.76/2.30 cnf(s1128, plain, spl114_1, inference(rat,[],[s4,s526])).
% 13.76/2.30 cnf(s1129, plain, spl114_3, inference(rat,[],[s6,s1100,s1128])).
% 14.54/2.30 cnf(s1130, plain, ~spl114_2, inference(rat,[],[s1104,s1128,s1129])).
% 14.54/2.30 cnf(s1131, plain, $false, inference(rat,[],[s2,s1128,s1130,s1129])).
% 14.54/2.30 thf(f5709,plain,(
% 14.54/2.30 $false),
% 14.54/2.30 inference(avatar_sat_refutation,[],[s1131])).
% 14.54/2.30 % SZS output end Proof for theBenchmark
% 14.54/2.30 % (414524)------------------------------
% 14.54/2.30 % (414524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.54/2.30 % (414524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.54/2.30 % (414524)CaDiCaL version: 2.1.3
% 14.54/2.30 % (414524)Termination reason: Refutation
% 14.54/2.30 % (414524)Time elapsed: 0.919 s
% 14.54/2.30 % (414524)Peak memory usage: 19 MB
% 14.54/2.30 % (414524)Instructions burned: 1967 (million)
% 14.54/2.30 % (414282)Success in time 2.048 s
% 14.54/2.30 % Vampire exiting
%------------------------------------------------------------------------------