%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU707^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:33:03 AM UTC 2026
% Result : Theorem 8.42s 1.52s
% Output : Refutation 8.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU707^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n002.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 14:15:52 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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
% 0.80/0.42 % (1351307)Will run a generic schedule for satisfiability detection.
% 0.80/0.42 % (1351314)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2394720771:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.80/0.42 % (1351313)% WARNING: option uhcvi not known.
% 0.80/0.42 % (1351312)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2418720420_2999 on theBenchmark for (2999ds/0Mi)
% 0.80/0.42 % (1351316)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=595845442:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.80/0.42 % (1351313)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3988993746:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.80/0.42 % (1351315)dis+10_1_sil=32000:sp=arity:random_seed=2334553394:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.80/0.42 % (1351314)Refutation not found, incomplete strategy
% 0.80/0.42 % (1351314)------------------------------
% 0.80/0.42 % (1351314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.80/0.42 % (1351314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.80/0.42 % (1351314)CaDiCaL version: 2.1.3
% 0.80/0.42 % (1351314)Termination reason: Refutation not found, incomplete strategy
% 0.80/0.42 % (1351314)Time elapsed: 0.007 s
% 0.80/0.42 % (1351314)Peak memory usage: 12 MB
% 0.80/0.42 % (1351314)Instructions burned: 19 (million)
% 0.80/0.42 % (1351318)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=394970584:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.80/0.42 % (1351316)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.80/0.42 % (1351314)------------------------------
% 0.80/0.42 % (1351314)------------------------------
% 0.80/0.42 % (1351313)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.80/0.42 % Exception at run slice level
% 0.80/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.80/0.42 % (1351313)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.80/0.42 % (1351317)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1922579798:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.80/0.42 % (1351318)Refutation not found, incomplete strategy
% 0.80/0.42 % (1351318)------------------------------
% 0.80/0.42 % (1351318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.80/0.42 % (1351318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.80/0.42 % (1351318)CaDiCaL version: 2.1.3
% 0.80/0.42 % (1351318)Termination reason: Refutation not found, incomplete strategy
% 0.80/0.42 % (1351318)Time elapsed: 0.012 s
% 0.80/0.42 % (1351318)Peak memory usage: 12 MB
% 0.80/0.42 % (1351318)Instructions burned: 22 (million)
% 0.80/0.42 % (1351318)------------------------------
% 0.80/0.42 % (1351318)------------------------------
% 0.80/0.42 % (1351325)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3556232841:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.80/0.42 % Exception at run slice level
% 0.80/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.80/0.42 % (1351326)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=426266662:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.80/0.42 % (1351330)ott-21_1_sil=16000:fs=off:random_seed=4168771292:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.80/0.42 % (1351329)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=1875035044:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.80/0.42 % (1351329)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.80/0.42 % (1351329)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.80/0.42 % (1351315)Instruction limit reached!
% 0.80/0.42 % (1351315)------------------------------
% 0.80/0.42 % (1351315)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.80/0.42 % (1351315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.80/0.42 % (1351315)CaDiCaL version: 2.1.3
% 0.80/0.42 % (1351315)Termination reason: Instruction limit
% 0.80/0.42 % (1351315)Termination phase: Saturation
% 8.42/1.52 % (1351315)Time elapsed: 0.047 s
% 8.42/1.52 % (1351315)Peak memory usage: 12 MB
% 8.42/1.52 % (1351315)Instructions burned: 105 (million)
% 8.42/1.52 % (1351316)Instruction limit reached!
% 8.42/1.52 % (1351316)------------------------------
% 8.42/1.52 % (1351316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351316)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351316)Termination reason: Instruction limit
% 8.42/1.52 % (1351316)Termination phase: Saturation
% 8.42/1.52 % (1351316)Time elapsed: 0.050 s
% 8.42/1.52 % (1351316)Peak memory usage: 12 MB
% 8.42/1.52 % (1351316)Instructions burned: 117 (million)
% 8.42/1.52 % (1351329)Refutation not found, incomplete strategy
% 8.42/1.52 % (1351329)------------------------------
% 8.42/1.52 % (1351329)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351329)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351329)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351329)Termination reason: Refutation not found, incomplete strategy
% 8.42/1.52 % (1351329)Time elapsed: 0.023 s
% 8.42/1.52 % (1351329)Peak memory usage: 13 MB
% 8.42/1.52 % (1351329)Instructions burned: 39 (million)
% 8.42/1.52 % (1351329)------------------------------
% 8.42/1.52 % (1351329)------------------------------
% 8.42/1.52 % (1351334)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1903340856:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 8.42/1.52 % (1351335)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1353752238:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 8.42/1.52 % (1351330)Instruction limit reached!
% 8.42/1.52 % (1351330)------------------------------
% 8.42/1.52 % (1351330)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351330)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351330)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351330)Termination reason: Instruction limit
% 8.42/1.52 % (1351330)Termination phase: Saturation
% 8.42/1.52 % (1351330)Time elapsed: 0.043 s
% 8.42/1.52 % (1351330)Peak memory usage: 12 MB
% 8.42/1.52 % (1351330)Instructions burned: 182 (million)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351326)Instruction limit reached!
% 8.42/1.52 % (1351326)------------------------------
% 8.42/1.52 % (1351326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351326)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351326)Termination reason: Instruction limit
% 8.42/1.52 % (1351326)Termination phase: Saturation
% 8.42/1.52 % (1351326)Time elapsed: 0.057 s
% 8.42/1.52 % (1351326)Peak memory usage: 12 MB
% 8.42/1.52 % (1351326)Instructions burned: 132 (million)
% 8.42/1.52 % (1351334)Refutation not found, incomplete strategy
% 8.42/1.52 % (1351334)------------------------------
% 8.42/1.52 % (1351334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351334)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351334)Termination reason: Refutation not found, incomplete strategy
% 8.42/1.52 % (1351334)Time elapsed: 0.018 s
% 8.42/1.52 % (1351334)Peak memory usage: 12 MB
% 8.42/1.52 % (1351334)Instructions burned: 30 (million)
% 8.42/1.52 % (1351334)------------------------------
% 8.42/1.52 % (1351334)------------------------------
% 8.42/1.52 % (1351336)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3302764765:i=1179_2999 on theBenchmark for (2999ds/1179Mi)
% 8.42/1.52 % (1351340)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=1108846881:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 8.42/1.52 % (1351340)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.42/1.52 % (1351341)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=94669910:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 8.42/1.52 % (1351341)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.42/1.52 % (1351342)fmb+10_1_sil=64000:random_seed=2238738289:i=22061:nm=2:gsp=on_2998 on theBenchmark for (2998ds/22061Mi)
% 8.42/1.52 % (1351342)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351339)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1873430441:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351317)Instruction limit reached!
% 8.42/1.52 % (1351317)------------------------------
% 8.42/1.52 % (1351317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351317)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351317)Termination reason: Instruction limit
% 8.42/1.52 % (1351317)Termination phase: Saturation
% 8.42/1.52 % (1351317)Time elapsed: 0.097 s
% 8.42/1.52 % (1351317)Peak memory usage: 12 MB
% 8.42/1.52 % (1351317)Instructions burned: 139 (million)
% 8.42/1.52 % (1351341)Refutation not found, incomplete strategy
% 8.42/1.52 % (1351341)------------------------------
% 8.42/1.52 % (1351341)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351341)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351336)Refutation not found, incomplete strategy
% 8.42/1.52 % (1351336)------------------------------
% 8.42/1.52 % (1351336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351341)Termination reason: Refutation not found, incomplete strategy
% 8.42/1.52 % (1351341)Time elapsed: 0.010 s
% 8.42/1.52 % (1351341)Peak memory usage: 12 MB
% 8.42/1.52 % (1351336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351341)Instructions burned: 17 (million)
% 8.42/1.52 % (1351336)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351336)Termination reason: Refutation not found, incomplete strategy
% 8.42/1.52 % (1351336)Time elapsed: 0.020 s
% 8.42/1.52 % (1351336)Peak memory usage: 12 MB
% 8.42/1.52 % (1351336)Instructions burned: 26 (million)
% 8.42/1.52 % (1351341)------------------------------
% 8.42/1.52 % (1351341)------------------------------
% 8.42/1.52 % (1351336)------------------------------
% 8.42/1.52 % (1351336)------------------------------
% 8.42/1.52 % (1351349)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=4104110104:fmbsr=1.7:i=920_2998 on theBenchmark for (2998ds/920Mi)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351348)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1713315280:i=9515:nm=5_2998 on theBenchmark for (2998ds/9515Mi)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351350)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2923787487:i=5131_2998 on theBenchmark for (2998ds/5131Mi)
% 8.42/1.52 % (1351350)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.42/1.52 % (1351351)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3078525014:i=1472:ins=7:fdi=8:gsp=on_2998 on theBenchmark for (2998ds/1472Mi)
% 8.42/1.52 % (1351352)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3831877083:i=6324_2998 on theBenchmark for (2998ds/6324Mi)
% 8.42/1.52 % (1351354)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=396971808:fmbsr=2.30978:i=2174_2998 on theBenchmark for (2998ds/2174Mi)
% 8.42/1.52 % (1351351)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.42/1.52 % (1351351)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351361)ott+10_1_sil=32000:tgt=ground:random_seed=516676716:i=5114:av=off_2998 on theBenchmark for (2998ds/5114Mi)
% 8.42/1.52 % (1351356)ott-2_1_sil=16000:newcnf=on:random_seed=2274831858:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2998 on theBenchmark for (2998ds/869Mi)
% 8.42/1.52 % (1351356)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.42/1.52 % (1351362)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3707760163:i=54282_2998 on theBenchmark for (2998ds/54282Mi)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351366)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2310019819:i=3512:aac=none_2998 on theBenchmark for (2998ds/3512Mi)
% 8.42/1.52 % (1351366)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.42/1.52 % (1351340)Instruction limit reached!
% 8.42/1.52 % (1351340)------------------------------
% 8.42/1.52 % (1351340)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351340)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351340)Termination reason: Instruction limit
% 8.42/1.52 % (1351340)Termination phase: Saturation
% 8.42/1.52 % (1351340)Time elapsed: 0.268 s
% 8.42/1.52 % (1351340)Peak memory usage: 14 MB
% 8.42/1.52 % (1351340)Instructions burned: 695 (million)
% 8.42/1.52 % (1351368)dis+21_1_sil=32000:sas=cadical:random_seed=3612270578:i=3773:amm=off_2995 on theBenchmark for (2995ds/3773Mi)
% 8.42/1.52 % (1351356)Instruction limit reached!
% 8.42/1.52 % (1351356)------------------------------
% 8.42/1.52 % (1351356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351356)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351356)Termination reason: Instruction limit
% 8.42/1.52 % (1351356)Termination phase: Saturation
% 8.42/1.52 % (1351356)Time elapsed: 0.328 s
% 8.42/1.52 % (1351356)Peak memory usage: 14 MB
% 8.42/1.52 % (1351356)Instructions burned: 870 (million)
% 8.42/1.52 % (1351370)ott+11_1_sil=16000:gs=on:random_seed=2620610591:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2994 on theBenchmark for (2994ds/2251Mi)
% 8.42/1.52 % (1351370)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.42/1.52 % (1351351)Instruction limit reached!
% 8.42/1.52 % (1351351)------------------------------
% 8.42/1.52 % (1351351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351351)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351351)Termination reason: Instruction limit
% 8.42/1.52 % (1351351)Termination phase: Saturation
% 8.42/1.52 % (1351351)Time elapsed: 0.741 s
% 8.42/1.52 % (1351351)Peak memory usage: 18 MB
% 8.42/1.52 % (1351351)Instructions burned: 1473 (million)
% 8.42/1.52 % (1351372)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=1765469153:fmbsr=1.6:i=67534_2990 on theBenchmark for (2990ds/67534Mi)
% 8.42/1.52 % Exception at run slice level
% 8.42/1.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.42/1.52 % (1351374)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=3494053119:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2990 on theBenchmark for (2990ds/4591Mi)
% 8.42/1.52 % (1351361)Instruction limit reached!
% 8.42/1.52 % (1351361)------------------------------
% 8.42/1.52 % (1351361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.52 % (1351361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.52 % (1351361)CaDiCaL version: 2.1.3
% 8.42/1.52 % (1351361)Termination reason: Instruction limit
% 8.42/1.52 % (1351361)Termination phase: Saturation
% 8.42/1.52 % (1351361)Time elapsed: 0.949 s
% 8.42/1.52 % (1351361)Peak memory usage: 17 MB
% 8.42/1.52 % (1351361)Instructions burned: 5118 (million)
% 8.42/1.52 % (1351376)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=4060762464:i=29340_2988 on theBenchmark for (2988ds/29340Mi)
% 8.42/1.52 % (1351376) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1351307-1351376"...
% 8.42/1.52 % (1351376)...printing done.
% 8.42/1.52 % (1351376)Refutation found. Thanks to Tanya!
% 8.42/1.52 % SZS status Theorem for theBenchmark
% 8.42/1.52 % SZS output start Proof for theBenchmark
% 8.42/1.52 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 8.42/1.52 thf(func_def_0, type, in: ($i > $i > $o)).
% 8.42/1.52 thf(func_def_1, type, setunion: ($i > $i)).
% 8.42/1.52 thf(func_def_2, type, dsetconstr: ($i > ($i > $o) > $i)).
% 8.42/1.52 thf(func_def_3, type, singleton: ($i > $o)).
% 8.42/1.52 thf(func_def_4, type, iftrueProp1: $o).
% 8.42/1.52 thf(func_def_6, type, ifSingleton: $o).
% 8.42/1.52 thf(func_def_7, type, if: ($i > $o > $i > $i > $i)).
% 8.42/1.52 thf(func_def_8, type, theeq: $o).
% 8.42/1.52 thf(func_def_9, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 8.42/1.52 thf(func_def_10, type, vIMP: ($o > $o > $o)).
% 8.42/1.52 thf(func_def_11, type, db2: !>[X0: $tType]:(X0)).
% 8.42/1.52 thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 8.42/1.52 thf(func_def_13, type, db1: !>[X0: $tType]:(X0)).
% 8.42/1.52 thf(func_def_14, type, db3: !>[X0: $tType]:(X0)).
% 8.42/1.52 thf(func_def_15, type, vOR: ($o > $o > $o)).
% 8.42/1.52 thf(func_def_16, type, vAND: ($o > $o > $o)).
% 8.42/1.52 thf(func_def_17, type, db4: !>[X0: $tType]:(X0)).
% 8.42/1.52 thf(func_def_18, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 8.42/1.52 thf(func_def_19, type, vNOT: ($o > $o)).
% 8.42/1.52 thf(func_def_20, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 8.42/1.52 thf(func_def_24, type, sK1: $o).
% 8.42/1.52 thf(func_def_28, type, sK5: ($i > $i)).
% 8.42/1.52 thf(func_def_29, type, sK6: ($i > $i)).
% 8.42/1.52 thf(func_def_30, type, sK7: ($i > $i)).
% 8.42/1.52 thf(func_def_31, type, sK8: ($i > $i)).
% 8.42/1.52 thf(func_def_32, type, sK9: ($i > $i)).
% 8.42/1.52 thf(func_def_33, type, sK10: ($i > $i)).
% 8.42/1.52 thf(func_def_34, type, sK11: ($i > $i)).
% 8.42/1.52 thf(func_def_35, type, sK12: ($i > $i)).
% 8.42/1.52 thf(func_def_36, type, sK13: ($i > $i)).
% 8.42/1.52 thf(func_def_37, type, sK14: ($i > $i)).
% 8.42/1.52 thf(func_def_38, type, sK15: ($i > $i)).
% 8.42/1.52 thf(func_def_39, type, sK16: ($i > $i)).
% 8.42/1.52 thf(func_def_40, type, sK17: ($i > $i)).
% 8.42/1.52 thf(func_def_41, type, sK18: ($i > $i)).
% 8.42/1.52 thf(func_def_42, type, sK19: ($i > $i)).
% 8.42/1.52 thf(func_def_43, type, sK20: ($i > $i)).
% 8.42/1.52 thf(func_def_44, type, sK21: ($i > $i)).
% 8.42/1.52 thf(func_def_45, type, sK22: ($i > $i)).
% 8.42/1.52 thf(func_def_46, type, sK23: ($i > $i)).
% 8.42/1.52 thf(func_def_47, type, sK24: ($o > $i > $i)).
% 8.42/1.52 thf(func_def_48, type, sK25: ($o > $i)).
% 8.42/1.52 thf(func_def_49, type, sK26: ($i > $i)).
% 8.42/1.52 thf(func_def_50, type, sK27: ($i > $i)).
% 8.42/1.52 thf(func_def_51, type, sK28: ($i > $i)).
% 8.42/1.52 thf(func_def_52, type, sK29: ($i > $i)).
% 8.42/1.52 thf(func_def_53, type, sK30: ($o > $i > $i)).
% 8.42/1.52 thf(func_def_54, type, sK31: ($i > $i)).
% 8.42/1.52 thf(f1,axiom,(
% 8.42/1.52 (iftrueProp1 = ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (X1 => (in @ X2 @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1)))))))))),
% 8.42/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',iftrueProp1)).
% 8.42/1.52 thf(f2,axiom,(
% 8.42/1.52 (ifSingleton = ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1))))))))),
% 8.42/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifSingleton)).
% 8.42/1.52 thf(f3,axiom,(
% 8.42/1.52 (if = (^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : ((setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1))))))))),
% 8.42/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',if)).
% 8.42/1.52 thf(f4,axiom,(
% 8.42/1.52 (theeq = ! [X0 : $i] : ((singleton @ X0) => ! [X1 : $i] : ((in @ X1 @ X0) => (((setunion @ X0)) = X1))))),
% 8.42/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',theeq)).
% 8.42/1.52 thf(f5,conjecture,(
% 8.42/1.52 iftrueProp1 => (ifSingleton => (theeq => ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (X1 => (((if @ X0 @ X1 @ X2 @ X3)) = X2))))))),
% 8.42/1.52 file('/export/starexec/sandbox/benchmark/theBenchmark.p',iftrue)).
% 8.42/1.52 thf(f6,negated_conjecture,(
% 8.42/1.52 ~(iftrueProp1 => (ifSingleton => (theeq => ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (X1 => (((if @ X0 @ X1 @ X2 @ X3)) = X2)))))))),
% 8.42/1.52 inference(negated_conjecture,[status(cth)],[f5])).
% 8.42/1.52 thf(f7,plain,(
% 8.42/1.52 (iftrueProp1 = ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (X1 => (in @ X2 @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1)))))))))),
% 8.42/1.52 inference(rectify,[],[f1])).
% 8.42/1.52 thf(f8,plain,(
% 8.42/1.52 (iftrueProp1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (Y1 => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4)))))))))))))))))))),
% 8.42/1.52 inference(fool_elimination,[],[f7])).
% 8.42/1.52 thf(f9,plain,(
% 8.42/1.52 (ifSingleton = ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1))))))))),
% 8.42/1.52 inference(rectify,[],[f2])).
% 8.42/1.52 thf(f10,plain,(
% 8.42/1.52 (ifSingleton = ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (singleton @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))))))),
% 8.42/1.52 inference(fool_elimination,[],[f9])).
% 8.42/1.52 thf(f11,plain,(
% 8.42/1.52 (if = (^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : ((setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X4 = X3) & ~X1) | ((X4 = X2) & X1))))))))),
% 8.42/1.52 inference(rectify,[],[f3])).
% 8.42/1.52 thf(f12,plain,(
% 8.42/1.52 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))),
% 8.42/1.52 inference(fool_elimination,[],[f11])).
% 8.42/1.52 thf(f13,plain,(
% 8.42/1.52 (theeq = ! [X0 : $i] : ((singleton @ X0) => ! [X1 : $i] : ((in @ X1 @ X0) => (((setunion @ X0)) = X1))))),
% 8.42/1.52 inference(rectify,[],[f4])).
% 8.42/1.52 thf(f14,plain,(
% 8.42/1.52 (theeq = ((!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((setunion @ Y0) = Y1)))))))))),
% 8.42/1.52 inference(fool_elimination,[],[f13])).
% 8.42/1.52 thf(f15,plain,(
% 8.42/1.52 ~(iftrueProp1 => (ifSingleton => (theeq => ! [X0 : $i,X1 : $o,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (X1 => (((if @ X0 @ X1 @ X2 @ X3)) = X2)))))))),
% 8.42/1.52 inference(rectify,[],[f6])).
% 8.42/1.52 thf(f16,plain,(
% 8.42/1.52 ~((iftrueProp1 = $true) => ((ifSingleton = $true) => ((theeq = $true) => ! [X0 : $i,X1 : $o,X2 : $i] : ((((in @ X2 @ X0)) = $true) => ! [X3 : $i] : ((((in @ X3 @ X0)) = $true) => (($true = X1) => (((if @ X0 @ X1 @ X2 @ X3)) = X2)))))))),
% 8.42/1.52 inference(fool_elimination,[],[f15])).
% 8.42/1.52 thf(f17,plain,(
% 8.42/1.52 ((? [X0 : $i,X1 : $o,X2 : $i] : (? [X3 : $i] : (((((if @ X0 @ X1 @ X2 @ X3)) != X2) & ($true = X1)) & (((in @ X3 @ X0)) = $true)) & (((in @ X2 @ X0)) = $true)) & (theeq = $true)) & (ifSingleton = $true)) & (iftrueProp1 = $true)),
% 8.42/1.52 inference(ennf_transformation,[],[f16])).
% 8.42/1.52 thf(f18,plain,(
% 8.42/1.52 ? [X0 : $i,X1 : $o,X2 : $i] : (? [X3 : $i] : ((((if @ X0 @ X1 @ X2 @ X3)) != X2) & ($true = X1) & (((in @ X3 @ X0)) = $true)) & (((in @ X2 @ X0)) = $true)) & (theeq = $true) & (ifSingleton = $true) & (iftrueProp1 = $true)),
% 8.42/1.52 inference(flattening,[],[f17])).
% 8.42/1.52 thf(f19,plain,(
% 8.42/1.52 (((sK2 != ((if @ sK0 @ sK1 @ sK2 @ sK3))) & ($true = sK1) & ($true = ((in @ sK3 @ sK0)))) & ($true = ((in @ sK2 @ sK0)))) & (theeq = $true) & (ifSingleton = $true) & (iftrueProp1 = $true)),
% 8.42/1.52 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f18])).
% 8.42/1.52 thf(f20,plain,(
% 8.42/1.52 (iftrueProp1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (Y1 => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4)))))))))))))))))))),
% 8.42/1.52 inference(cnf_transformation,[],[f8])).
% 8.42/1.52 thf(f21,plain,(
% 8.42/1.52 (ifSingleton = ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (singleton @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))))))),
% 8.42/1.52 inference(cnf_transformation,[],[f10])).
% 8.42/1.52 thf(f22,plain,(
% 8.42/1.52 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))),
% 8.42/1.52 inference(cnf_transformation,[],[f12])).
% 8.42/1.52 thf(f23,plain,(
% 8.42/1.52 (theeq = ((!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((setunion @ Y0) = Y1)))))))))),
% 8.42/1.52 inference(cnf_transformation,[],[f14])).
% 8.42/1.52 thf(f24,plain,(
% 8.42/1.52 (iftrueProp1 = $true)),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f25,plain,(
% 8.42/1.52 (ifSingleton = $true)),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f26,plain,(
% 8.42/1.52 (theeq = $true)),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f27,plain,(
% 8.42/1.52 ($true = ((in @ sK2 @ sK0)))),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f28,plain,(
% 8.42/1.52 ($true = ((in @ sK3 @ sK0)))),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f29,plain,(
% 8.42/1.52 ($true = sK1)),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f30,plain,(
% 8.42/1.52 (sK2 != ((if @ sK0 @ sK1 @ sK2 @ sK3)))),
% 8.42/1.52 inference(cnf_transformation,[],[f19])).
% 8.42/1.52 thf(f31,definition,(
% 8.42/1.52 ($true != $false)),
% 8.42/1.52 introduced(theory,[fool_distinctness_axiom])).
% 8.42/1.52 thf(f33,plain,(
% 8.42/1.52 (((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (Y1 => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4)))))))))))))))))) = $true)),
% 8.42/1.52 inference(definition_unfolding,[],[f20,f24])).
% 8.42/1.52 thf(f34,plain,(
% 8.42/1.52 (((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (singleton @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))))) = $true)),
% 8.42/1.52 inference(definition_unfolding,[],[f21,f25])).
% 8.42/1.52 thf(f35,plain,(
% 8.42/1.52 (((!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((setunion @ Y0) = Y1)))))))) = $true)),
% 8.42/1.52 inference(definition_unfolding,[],[f23,f26])).
% 8.42/1.52 thf(f36,plain,(
% 8.42/1.52 (sK2 != (((^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))) @ sK0 @ $true @ sK2 @ sK3)))),
% 8.42/1.52 inference(definition_unfolding,[],[f30,f22,f29])).
% 8.42/1.52 thf(f37,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | ((~ $true) & (sK3 = Y0))))))))),
% 8.42/1.52 inference(beta-eta_normalization,[],[f36])).
% 8.42/1.52 thf(f38,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | ($false & (sK3 = Y0))))))))),
% 8.42/1.52 inference(boolean_simplification,[],[f37])).
% 8.42/1.52 thf(f39,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | $false))))))),
% 8.42/1.52 inference(boolean_simplification,[],[f38])).
% 8.42/1.52 thf(f40,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ($true & (sK2 = Y0)))))))),
% 8.42/1.52 inference(boolean_simplification,[],[f39])).
% 8.42/1.52 thf(f41,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (sK2 = Y0))))))),
% 8.42/1.52 inference(boolean_simplification,[],[f40])).
% 8.42/1.52 thf(f42,plain,(
% 8.42/1.52 (sK2 != ((setunion @ (dsetconstr @ sK0 @ (= @ sK2)))))),
% 8.42/1.52 inference(beta-eta_normalization,[],[f41])).
% 8.42/1.52 thf(f43,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: ((singleton @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((setunion @ Y0) = Y1)))))) @ X1)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f35])).
% 8.42/1.52 thf(f44,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = (((singleton @ X1) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => ((setunion @ X1) = Y0)))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f43])).
% 8.42/1.52 thf(f45,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($false = ((singleton @ X1))) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => ((setunion @ X1) = Y0))))))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f44])).
% 8.42/1.52 thf(f46,plain,(
% 8.42/1.52 ( ! [X2 : $i,X1 : $i] : (($false = ((singleton @ X1))) | ($true = (((^[Y0 : $i]: ((in @ Y0 @ X1) => ((setunion @ X1) = Y0))) @ X2)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f45])).
% 8.42/1.52 thf(f47,plain,(
% 8.42/1.52 ( ! [X2 : $i,X1 : $i] : (($false = ((singleton @ X1))) | ($true = (((in @ X2 @ X1) => ((setunion @ X1) = X2))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f46])).
% 8.42/1.52 thf(f48,plain,(
% 8.42/1.52 ( ! [X2 : $i,X1 : $i] : (($false = ((singleton @ X1))) | ($false = ((in @ X2 @ X1))) | ($true = (((setunion @ X1) = X2)))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f47])).
% 8.42/1.52 thf(f49,plain,(
% 8.42/1.52 ( ! [X2 : $i,X1 : $i] : (($false = ((singleton @ X1))) | ($false = ((in @ X2 @ X1))) | (((setunion @ X1)) = X2)) )),
% 8.42/1.52 inference(equality_proxy_clausification,[],[f48])).
% 8.42/1.52 thf(f50,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (singleton @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4))))))))))))))) @ X1)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f34])).
% 8.42/1.52 thf(f51,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (singleton @ (dsetconstr @ Y1 @ (^[Y3 : $i]: ((Y0 & (X1 = Y3)) | ((~ Y0) & (Y2 = Y3))))))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f50])).
% 8.42/1.52 thf(f52,plain,(
% 8.42/1.52 ( ! [X2 : $o,X1 : $i] : (($true = (((^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (singleton @ (dsetconstr @ Y1 @ (^[Y3 : $i]: ((Y0 & (X1 = Y3)) | ((~ Y0) & (Y2 = Y3))))))))))))) @ X2)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f51])).
% 8.42/1.52 thf(f53,plain,(
% 8.42/1.52 ( ! [X2 : $o,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: ((X2 & (X1 = Y2)) | ((~ X2) & (Y1 = Y2))))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f52])).
% 8.42/1.52 thf(f54,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: ((X2 & (X1 = Y2)) | ((~ X2) & (Y1 = Y2))))))))))) @ X3)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f53])).
% 8.42/1.52 thf(f55,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($true = (((in @ X1 @ X3) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => (singleton @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f54])).
% 8.42/1.52 thf(f56,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($false = ((in @ X1 @ X3))) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => (singleton @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1)))))))))))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f55])).
% 8.42/1.52 thf(f57,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X3))) | ($true = (((^[Y0 : $i]: ((in @ Y0 @ X3) => (singleton @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1)))))))) @ X4)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f56])).
% 8.42/1.52 thf(f58,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X3))) | ($true = (((in @ X4 @ X3) => (singleton @ (dsetconstr @ X3 @ (^[Y0 : $i]: ((X2 & (X1 = Y0)) | ((~ X2) & (X4 = Y0)))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f57])).
% 8.42/1.52 thf(f59,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($true = ((singleton @ (dsetconstr @ X3 @ (^[Y0 : $i]: ((X2 & (X1 = Y0)) | ((~ X2) & (X4 = Y0)))))))) | ($false = ((in @ X4 @ X3))) | ($false = ((in @ X1 @ X3)))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f58])).
% 8.42/1.52 thf(f60,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => (Y1 => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: ((Y1 & (Y0 = Y4)) | ((~ Y1) & (Y3 = Y4)))))))))))))))) @ X1)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f33])).
% 8.42/1.52 thf(f61,plain,(
% 8.42/1.52 ( ! [X1 : $i] : (($true = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (Y0 => (in @ X1 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: ((Y0 & (X1 = Y3)) | ((~ Y0) & (Y2 = Y3)))))))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f60])).
% 8.42/1.52 thf(f62,plain,(
% 8.42/1.52 ( ! [X2 : $o,X1 : $i] : (($true = (((^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (Y0 => (in @ X1 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: ((Y0 & (X1 = Y3)) | ((~ Y0) & (Y2 = Y3)))))))))))))) @ X2)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f61])).
% 8.42/1.52 thf(f63,plain,(
% 8.42/1.52 ( ! [X2 : $o,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (X2 => (in @ X1 @ (dsetconstr @ Y0 @ (^[Y2 : $i]: ((X2 & (X1 = Y2)) | ((~ X2) & (Y1 = Y2)))))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f62])).
% 8.42/1.52 thf(f64,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (X2 => (in @ X1 @ (dsetconstr @ Y0 @ (^[Y2 : $i]: ((X2 & (X1 = Y2)) | ((~ X2) & (Y1 = Y2)))))))))))) @ X3)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f63])).
% 8.42/1.52 thf(f65,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($true = (((in @ X1 @ X3) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => (X2 => (in @ X1 @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1)))))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f64])).
% 8.42/1.52 thf(f66,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($false = ((in @ X1 @ X3))) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => (X2 => (in @ X1 @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1))))))))))))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f65])).
% 8.42/1.52 thf(f67,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X3))) | ($true = (((^[Y0 : $i]: ((in @ Y0 @ X3) => (X2 => (in @ X1 @ (dsetconstr @ X3 @ (^[Y1 : $i]: ((X2 & (X1 = Y1)) | ((~ X2) & (Y0 = Y1))))))))) @ X4)))) )),
% 8.42/1.52 inference(pi_proxy_clausification,[],[f66])).
% 8.42/1.52 thf(f68,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X3))) | ($true = (((in @ X4 @ X3) => (X2 => (in @ X1 @ (dsetconstr @ X3 @ (^[Y0 : $i]: ((X2 & (X1 = Y0)) | ((~ X2) & (X4 = Y0))))))))))) )),
% 8.42/1.52 inference(beta-eta_normalization,[],[f67])).
% 8.42/1.52 thf(f69,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X3))) | ($false = ((in @ X4 @ X3))) | ($true = ((X2 => (in @ X1 @ (dsetconstr @ X3 @ (^[Y0 : $i]: ((X2 & (X1 = Y0)) | ((~ X2) & (X4 = Y0)))))))))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f68])).
% 8.42/1.52 thf(f70,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($true = ((in @ X1 @ (dsetconstr @ X3 @ (^[Y0 : $i]: ((X2 & (X1 = Y0)) | ((~ X2) & (X4 = Y0)))))))) | ($false = ((in @ X4 @ X3))) | ($false = X2) | ($false = ((in @ X1 @ X3)))) )),
% 8.42/1.52 inference(imp_proxy_clausification,[],[f69])).
% 8.42/1.52 thf(f132,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o,X4 : $i] : (($true = $false) | ($false = ((in @ X4 @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((~ X1) & (X3 = Y0)))))))) | (((setunion @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((~ X1) & (X3 = Y0))))))) = X4) | (((in @ X3 @ X0)) = $false) | (((in @ X2 @ X0)) = $false)) )),
% 8.42/1.52 inference(constrained_superposition,[],[f49,f59])).
% 8.42/1.52 thf(f133,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X4 @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((~ X1) & (X3 = Y0)))))))) | (((setunion @ (dsetconstr @ X0 @ (^[Y0 : $i]: ((X1 & (X2 = Y0)) | ((~ X1) & (X3 = Y0))))))) = X4) | (((in @ X3 @ X0)) = $false) | (((in @ X2 @ X0)) = $false)) )),
% 8.42/1.52 inference(trivial_inequality_removal,[],[f132])).
% 8.42/1.52 thf(f407,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i,X6 : $i,X4 : $o,X5 : $i] : (($true = $false) | ($false = ((in @ X3 @ X1))) | ($false = X2) | ($false = ((in @ X0 @ X1))) | (((setunion @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X4 & (X5 = Y0)) | ((~ X4) & (X6 = Y0))))))) = X0) | ($false = ((in @ X6 @ X1))) | ($false = ((in @ X5 @ X1))) | ((^[Y0 : $i]: (X5)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X6))) | ((^[Y0 : $i]: (X4)) != (^[Y0 : $i]: (X2))) | ((^[Y0 : $i]: (X4)) != (^[Y0 : $i]: (X2)))) )),
% 8.42/1.52 inference(constrained_superposition,[],[f70,f133])).
% 8.42/1.52 thf(f413,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i,X6 : $i,X4 : $o,X5 : $i] : (($true = $false) | ($false = ((in @ X3 @ X1))) | ($false = X2) | ($false = ((in @ X0 @ X1))) | (((setunion @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X4 & (X5 = Y0)) | ((~ X4) & (X6 = Y0))))))) = X0) | ($false = ((in @ X6 @ X1))) | ($false = ((in @ X5 @ X1))) | ((^[Y0 : $i]: (X5)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X6))) | ((^[Y0 : $i]: (X4)) != (^[Y0 : $i]: (X2)))) )),
% 8.42/1.52 inference(duplicate_literal_removal,[],[f407])).
% 8.42/1.52 thf(f414,plain,(
% 8.42/1.52 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i,X6 : $i,X4 : $o,X5 : $i] : ((((setunion @ (dsetconstr @ X1 @ (^[Y0 : $i]: ((X4 & (X5 = Y0)) | ((~ X4) & (X6 = Y0))))))) = X0) | ($false = ((in @ X3 @ X1))) | ($false = ((in @ X0 @ X1))) | ($false = X2) | ($false = ((in @ X6 @ X1))) | ($false = ((in @ X5 @ X1))) | ((^[Y0 : $i]: (X5)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X6))) | ((^[Y0 : $i]: (X4)) != (^[Y0 : $i]: (X2)))) )),
% 8.42/1.52 inference(trivial_inequality_removal,[],[f413])).
% 8.42/1.52 thf(f458,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $i,X0 : $o,X1 : $i,X4 : $o] : (($true = $false) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (X1 = Y0)) | ((~ X0) & (X2 = Y0)))))))) | ($false = ((in @ X3 @ sK0))) | ($false = X4) | ($false = ((in @ X2 @ sK0))) | ($false = ((in @ X1 @ sK0))) | ((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (sK2))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X3))) | ((^[Y0 : $i]: (X0)) != (^[Y0 : $i]: (X4)))) )),
% 8.42/1.52 inference(constrained_superposition,[],[f27,f414])).
% 8.42/1.52 thf(f494,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $i,X0 : $o,X1 : $i,X4 : $o] : (((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (sK2))) | ($false = ((in @ X3 @ sK0))) | ($false = X4) | ($false = ((in @ X2 @ sK0))) | ($false = ((in @ X1 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (X1 = Y0)) | ((~ X0) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X3))) | ((^[Y0 : $i]: (X0)) != (^[Y0 : $i]: (X4)))) )),
% 8.42/1.52 inference(trivial_inequality_removal,[],[f458])).
% 8.42/1.52 thf(f3682,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK0))) | ($false = X1) | ($false = ((in @ X2 @ sK0))) | (((in @ sK2 @ sK0)) = $false) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X3 & (sK2 = Y0)) | ((~ X3) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X1)))) )),
% 8.42/1.52 inference(equality_resolution,[],[f494])).
% 8.42/1.52 thf(f3684,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $o] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = X1) | ($false = ((in @ X2 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X3 & (sK2 = Y0)) | ((~ X3) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X1)))) )),
% 8.42/1.52 inference(forward_demodulation,[],[f3682,f27])).
% 8.42/1.52 thf(f3685,plain,(
% 8.42/1.52 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $o] : ((sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X3 & (sK2 = Y0)) | ((~ X3) & (X2 = Y0)))))))) | ($false = ((in @ X0 @ sK0))) | ($false = X1) | ($false = ((in @ X2 @ sK0))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X3)) != (^[Y0 : $i]: (X1)))) )),
% 8.42/1.52 inference(trivial_inequality_removal,[],[f3684])).
% 8.42/1.52 thf(f3715,plain,(
% 8.42/1.52 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false != $false) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (in @ X0 @ sK0)))) )),
% 8.42/1.52 inference(equality_factoring,[],[f3685])).
% 8.42/1.52 thf(f3716,plain,(
% 8.42/1.52 ( ! [X2 : $i,X0 : $i,X1 : $o] : (((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (in @ X0 @ sK0))) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0)))) )),
% 8.42/1.53 inference(trivial_inequality_removal,[],[f3715])).
% 8.42/1.53 thf(f4450,plain,(
% 8.42/1.53 ( ! [X2 : $i,X0 : $i,X1 : $o] : (((((^[Y0 : $i]: (X1)) @ (sK30 @ X1 @ X0))) != (((^[Y0 : $i]: (in @ X0 @ sK0)) @ (sK30 @ X1 @ X0)))) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0)))) )),
% 8.42/1.53 inference(negative_extensionality,[],[f3716])).
% 8.42/1.53 thf(f4453,plain,(
% 8.42/1.53 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = (((^[Y0 : $i]: (X1)) @ (sK30 @ X1 @ X0)))) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ($false = (((^[Y0 : $i]: (in @ X0 @ sK0)) @ (sK30 @ X1 @ X0))))) )),
% 8.42/1.53 inference(xor_proxy_clausification,[],[f4450])).
% 8.42/1.53 thf(f4454,plain,(
% 8.42/1.53 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = X1) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0))) | ($false = ((in @ X0 @ sK0)))) )),
% 8.42/1.53 inference(beta-eta_normalization,[],[f4453])).
% 8.42/1.53 thf(f4455,plain,(
% 8.42/1.53 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X1 & (sK2 = Y0)) | ((~ X1) & (X2 = Y0)))))))) | ($false = ((in @ X0 @ sK0))) | ($false = ((in @ X2 @ sK0))) | ($false = X1) | ((^[Y0 : $i]: (X2)) != (^[Y0 : $i]: (X0)))) )),
% 8.42/1.53 inference(duplicate_literal_removal,[],[f4454])).
% 8.42/1.53 thf(f4463,plain,(
% 8.42/1.53 ( ! [X0 : $o,X1 : $i] : (($true = $false) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (sK2 = Y0)) | ((~ X0) & (X1 = Y0)))))))) | ($false = ((in @ X1 @ sK0))) | ($false = X0) | ((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (sK3)))) )),
% 8.42/1.53 inference(constrained_superposition,[],[f28,f4455])).
% 8.42/1.53 thf(f4464,plain,(
% 8.42/1.53 ( ! [X0 : $o,X1 : $i] : (((^[Y0 : $i]: (X1)) != (^[Y0 : $i]: (sK3))) | ($false = ((in @ X1 @ sK0))) | ($false = X0) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (sK2 = Y0)) | ((~ X0) & (X1 = Y0))))))))) )),
% 8.42/1.53 inference(trivial_inequality_removal,[],[f4463])).
% 8.42/1.53 thf(f4480,plain,(
% 8.42/1.53 ( ! [X0 : $o] : ((((in @ sK3 @ sK0)) = $false) | ($false = X0) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (sK2 = Y0)) | ((~ X0) & (sK3 = Y0))))))))) )),
% 8.42/1.53 inference(equality_resolution,[],[f4464])).
% 8.42/1.53 thf(f4482,plain,(
% 8.42/1.53 ( ! [X0 : $o] : (($true = $false) | ($false = X0) | (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (sK2 = Y0)) | ((~ X0) & (sK3 = Y0))))))))) )),
% 8.42/1.53 inference(forward_demodulation,[],[f4480,f28])).
% 8.42/1.53 thf(f4483,plain,(
% 8.42/1.53 ( ! [X0 : $o] : ((sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ((X0 & (sK2 = Y0)) | ((~ X0) & (sK3 = Y0)))))))) | ($false = X0)) )),
% 8.42/1.53 inference(trivial_inequality_removal,[],[f4482])).
% 8.42/1.53 thf(f4484,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | ((~ $true) & (sK3 = Y0))))))))),
% 8.42/1.53 inference(unit_resulting_resolution,[],[f4483,f31])).
% 8.42/1.53 thf(f4493,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | ($false & (sK3 = Y0))))))))),
% 8.42/1.53 inference(boolean_simplification,[],[f4484])).
% 8.42/1.53 thf(f4494,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (($true & (sK2 = Y0)) | $false))))))),
% 8.42/1.53 inference(boolean_simplification,[],[f4493])).
% 8.42/1.53 thf(f4495,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: ($true & (sK2 = Y0)))))))),
% 8.42/1.53 inference(boolean_simplification,[],[f4494])).
% 8.42/1.53 thf(f4496,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (sK2 = Y0))))))),
% 8.42/1.53 inference(boolean_simplification,[],[f4495])).
% 8.42/1.53 thf(f4497,plain,(
% 8.42/1.53 (sK2 = ((setunion @ (dsetconstr @ sK0 @ (= @ sK2)))))),
% 8.42/1.53 inference(beta-eta_normalization,[],[f4496])).
% 8.42/1.53 thf(f4506,plain,(
% 8.42/1.53 $false),
% 8.42/1.53 inference(forward_subsumption_resolution,[],[f4497,f42])).
% 8.42/1.53 % SZS output end Proof for theBenchmark
% 8.42/1.53 % (1351376)------------------------------
% 8.42/1.53 % (1351376)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.42/1.53 % (1351376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.42/1.53 % (1351376)CaDiCaL version: 2.1.3
% 8.42/1.53 % (1351376)Termination reason: Refutation
% 8.42/1.53 % (1351376)Time elapsed: 0.137 s
% 8.42/1.53 % (1351376)Peak memory usage: 13 MB
% 8.42/1.53 % (1351376)Instructions burned: 620 (million)
% 8.42/1.53 % (1351307)Success in time 1.288 s
% 8.42/1.53 % Vampire exiting
%------------------------------------------------------------------------------