%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU782^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:23 AM UTC 2026
% Result : Theorem 80.30s 11.64s
% Output : Refutation 80.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU782^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n011.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 14:28:16 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.85/1.39 % (163014)Will run a generic schedule for satisfiability detection.
% 6.85/1.39 % (163021)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2998086643:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.85/1.39 % (163019)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1704600313_2999 on theBenchmark for (2999ds/0Mi)
% 6.85/1.39 % Exception at run slice level
% 6.85/1.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.85/1.39 % (163028)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1984118530:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.85/1.39 % Exception at run slice level
% 6.85/1.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.85/1.39 % (163020)% WARNING: option uhcvi not known.
% 6.85/1.39 % (163022)dis+10_1_sil=32000:sp=arity:random_seed=474216219:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.85/1.39 % (163020)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2733333136:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.85/1.39 % (163020)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.85/1.39 % (163023)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=17878436:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.85/1.39 % (163020)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.85/1.39 % (163023)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.85/1.39 % (163024)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3842916829:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.85/1.39 % (163025)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1513024056:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.85/1.39 % (163030)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2784080597:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.85/1.39 % (163022)Instruction limit reached!
% 6.85/1.39 % (163022)------------------------------
% 6.85/1.39 % (163022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.39 % (163022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.39 % (163022)CaDiCaL version: 2.1.3
% 6.85/1.39 % (163022)Termination reason: Instruction limit
% 6.85/1.39 % (163022)Termination phase: Saturation
% 6.85/1.39 % (163022)Time elapsed: 0.087 s
% 6.85/1.39 % (163022)Peak memory usage: 12 MB
% 6.85/1.39 % (163022)Instructions burned: 104 (million)
% 6.85/1.39 % (163023)Instruction limit reached!
% 6.85/1.39 % (163023)------------------------------
% 6.85/1.39 % (163023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.39 % (163023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.39 % (163023)CaDiCaL version: 2.1.3
% 6.85/1.39 % (163023)Termination reason: Instruction limit
% 6.85/1.39 % (163023)Termination phase: Saturation
% 6.85/1.39 % (163023)Time elapsed: 0.098 s
% 6.85/1.39 % (163023)Peak memory usage: 12 MB
% 6.85/1.39 % (163023)Instructions burned: 116 (million)
% 6.85/1.39 % (163024)Instruction limit reached!
% 6.85/1.39 % (163024)------------------------------
% 6.85/1.39 % (163024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.85/1.39 % (163024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.85/1.39 % (163024)CaDiCaL version: 2.1.3
% 6.85/1.39 % (163024)Termination reason: Instruction limit
% 6.85/1.39 % (163024)Termination phase: Saturation
% 6.85/1.39 % (163024)Time elapsed: 0.106 s
% 6.85/1.39 % (163024)Peak memory usage: 12 MB
% 6.85/1.39 % (163024)Instructions burned: 132 (million)
% 6.85/1.39 % (163037)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=3624742727:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.85/1.39 % (163037)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.85/1.39 % (163037)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.85/1.39 % (163038)ott-21_1_sil=16000:fs=off:random_seed=3178029690:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.85/1.39 % (163025)Instruction limit reached!
% 6.85/1.39 % (163025)------------------------------
% 24.84/3.82 % (163025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 24.84/3.82 % (163025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.84/3.82 % (163025)CaDiCaL version: 2.1.3
% 24.84/3.82 % (163039)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=583977286:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 24.84/3.82 % (163025)Termination reason: Instruction limit
% 24.84/3.82 % (163025)Termination phase: Saturation
% 24.84/3.82 % (163025)Time elapsed: 0.138 s
% 24.84/3.82 % (163025)Peak memory usage: 12 MB
% 24.84/3.82 % (163025)Instructions burned: 159 (million)
% 24.84/3.82 % (163030)Instruction limit reached!
% 24.84/3.82 % (163030)------------------------------
% 24.84/3.82 % (163030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 24.84/3.82 % (163030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.84/3.82 % (163030)CaDiCaL version: 2.1.3
% 24.84/3.82 % (163030)Termination reason: Instruction limit
% 24.84/3.82 % (163030)Termination phase: Saturation
% 24.84/3.82 % (163030)Time elapsed: 0.143 s
% 24.84/3.82 % (163030)Peak memory usage: 12 MB
% 24.84/3.82 % (163030)Instructions burned: 132 (million)
% 24.84/3.82 % (163043)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1723328678:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 24.84/3.82 % Exception at run slice level
% 24.84/3.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 24.84/3.82 % (163044)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2464587746:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 24.84/3.82 % (163046)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1268881452:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 24.84/3.82 % Exception at run slice level
% 24.84/3.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 24.84/3.82 % (163049)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=2810283324: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)
% 24.84/3.82 % (163049)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 24.84/3.82 % (163038)Instruction limit reached!
% 24.84/3.82 % (163038)------------------------------
% 24.84/3.82 % (163038)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 24.84/3.82 % (163038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.84/3.82 % (163038)CaDiCaL version: 2.1.3
% 24.84/3.82 % (163038)Termination reason: Instruction limit
% 24.84/3.82 % (163038)Termination phase: Saturation
% 24.84/3.82 % (163038)Time elapsed: 0.147 s
% 24.84/3.82 % (163038)Peak memory usage: 12 MB
% 24.84/3.82 % (163038)Instructions burned: 180 (million)
% 24.84/3.82 % (163051)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1248631421:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 24.84/3.82 % (163051)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 24.84/3.82 % (163039)Instruction limit reached!
% 24.84/3.82 % (163039)------------------------------
% 24.84/3.82 % (163039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 24.84/3.82 % (163039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 24.84/3.82 % (163039)CaDiCaL version: 2.1.3
% 24.84/3.82 % (163039)Termination reason: Instruction limit
% 24.84/3.82 % (163039)Termination phase: Saturation
% 24.84/3.82 % (163039)Time elapsed: 0.395 s
% 24.84/3.82 % (163039)Peak memory usage: 13 MB
% 24.84/3.82 % (163039)Instructions burned: 478 (million)
% 24.84/3.82 % (163053)fmb+10_1_sil=64000:random_seed=2026743441:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 24.84/3.82 % (163053)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 24.84/3.82 % Exception at run slice level
% 24.84/3.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 24.84/3.82 % (163055)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=927710044:i=9515:nm=5_2993 on theBenchmark for (2993ds/9515Mi)
% 24.84/3.82 % Exception at run slice level
% 24.84/3.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 24.84/3.82 % (163057)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3284500182:fmbsr=1.7:i=920_2993 on theBenchmark for (2993ds/920Mi)
% 55.64/8.15 % Exception at run slice level
% 55.64/8.15 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 55.64/8.15 % (163059)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2333687619:i=5131_2993 on theBenchmark for (2993ds/5131Mi)
% 55.64/8.15 % (163059)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 55.64/8.15 % (163037)Instruction limit reached!
% 55.64/8.15 % (163037)------------------------------
% 55.64/8.15 % (163037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 55.64/8.15 % (163037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 55.64/8.15 % (163037)CaDiCaL version: 2.1.3
% 55.64/8.15 % (163037)Termination reason: Instruction limit
% 55.64/8.15 % (163037)Termination phase: Saturation
% 55.64/8.15 % (163037)Time elapsed: 0.535 s
% 55.64/8.15 % (163037)Peak memory usage: 13 MB
% 55.64/8.15 % (163037)Instructions burned: 684 (million)
% 55.64/8.15 % (163061)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2903649728:i=1472:ins=7:fdi=8:gsp=on_2992 on theBenchmark for (2992ds/1472Mi)
% 55.64/8.15 % (163061)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 55.64/8.15 % (163061)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 55.64/8.15 % (163044)Instruction limit reached!
% 55.64/8.15 % (163044)------------------------------
% 55.64/8.15 % (163044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 55.64/8.15 % (163044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 55.64/8.15 % (163044)CaDiCaL version: 2.1.3
% 55.64/8.15 % (163044)Termination reason: Instruction limit
% 55.64/8.15 % (163044)Termination phase: Saturation
% 55.64/8.15 % (163044)Time elapsed: 0.571 s
% 55.64/8.15 % (163044)Peak memory usage: 13 MB
% 55.64/8.15 % (163044)Instructions burned: 1179 (million)
% 55.64/8.15 % (163049)Instruction limit reached!
% 55.64/8.15 % (163049)------------------------------
% 55.64/8.15 % (163049)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 55.64/8.15 % (163049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 55.64/8.15 % (163049)CaDiCaL version: 2.1.3
% 55.64/8.15 % (163049)Termination reason: Instruction limit
% 55.64/8.15 % (163049)Termination phase: Saturation
% 55.64/8.15 % (163049)Time elapsed: 0.510 s
% 55.64/8.15 % (163049)Peak memory usage: 13 MB
% 55.64/8.15 % (163049)Instructions burned: 694 (million)
% 55.64/8.15 % (163064)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=4019986020:i=6324_2991 on theBenchmark for (2991ds/6324Mi)
% 55.64/8.15 % Exception at run slice level
% 55.64/8.15 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 55.64/8.15 % (163065)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3416225205:fmbsr=2.30978:i=2174_2991 on theBenchmark for (2991ds/2174Mi)
% 55.64/8.15 % Exception at run slice level
% 55.64/8.15 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 55.64/8.15 % (163067)ott-2_1_sil=16000:newcnf=on:random_seed=3399085508:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2991 on theBenchmark for (2991ds/869Mi)
% 55.64/8.15 % (163067)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 55.64/8.15 % (163069)ott+10_1_sil=32000:tgt=ground:random_seed=2442645015:i=5114:av=off_2991 on theBenchmark for (2991ds/5114Mi)
% 55.64/8.15 % (163051)Instruction limit reached!
% 55.64/8.15 % (163051)------------------------------
% 55.64/8.15 % (163051)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 55.64/8.15 % (163051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 55.64/8.15 % (163051)CaDiCaL version: 2.1.3
% 55.64/8.15 % (163051)Termination reason: Instruction limit
% 55.64/8.15 % (163051)Termination phase: Saturation
% 55.64/8.15 % (163051)Time elapsed: 0.671 s
% 55.64/8.15 % (163051)Peak memory usage: 13 MB
% 55.64/8.15 % (163051)Instructions burned: 879 (million)
% 55.64/8.15 % (163072)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2196865143:i=54282_2989 on theBenchmark for (2989ds/54282Mi)
% 55.64/8.15 % Exception at run slice level
% 55.64/8.15 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 55.64/8.15 % (163074)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2690493510:i=3512:aac=none_2989 on theBenchmark for (2989ds/3512Mi)
% 80.30/11.64 % (163074)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 80.30/11.64 % (163067)Instruction limit reached!
% 80.30/11.64 % (163067)------------------------------
% 80.30/11.64 % (163067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163067)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163067)Termination reason: Instruction limit
% 80.30/11.64 % (163067)Termination phase: Saturation
% 80.30/11.64 % (163067)Time elapsed: 0.423 s
% 80.30/11.64 % (163067)Peak memory usage: 14 MB
% 80.30/11.64 % (163067)Instructions burned: 870 (million)
% 80.30/11.64 % (163076)dis+21_1_sil=32000:sas=cadical:random_seed=421439387:i=3773:amm=off_2987 on theBenchmark for (2987ds/3773Mi)
% 80.30/11.64 % (163061)Instruction limit reached!
% 80.30/11.64 % (163061)------------------------------
% 80.30/11.64 % (163061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163061)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163061)Termination reason: Instruction limit
% 80.30/11.64 % (163061)Termination phase: Saturation
% 80.30/11.64 % (163061)Time elapsed: 1.228 s
% 80.30/11.64 % (163061)Peak memory usage: 14 MB
% 80.30/11.64 % (163061)Instructions burned: 1472 (million)
% 80.30/11.64 % (163079)ott+11_1_sil=16000:gs=on:random_seed=3778098450:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2980 on theBenchmark for (2980ds/2251Mi)
% 80.30/11.64 % (163079)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 80.30/11.64 % (163076)Instruction limit reached!
% 80.30/11.64 % (163076)------------------------------
% 80.30/11.64 % (163076)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163076)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163076)Termination reason: Instruction limit
% 80.30/11.64 % (163076)Termination phase: Saturation
% 80.30/11.64 % (163076)Time elapsed: 2.118 s
% 80.30/11.64 % (163076)Peak memory usage: 18 MB
% 80.30/11.64 % (163076)Instructions burned: 3775 (million)
% 80.30/11.64 % (163059)Instruction limit reached!
% 80.30/11.64 % (163059)------------------------------
% 80.30/11.64 % (163059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163059)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163059)Termination reason: Instruction limit
% 80.30/11.64 % (163059)Termination phase: Saturation
% 80.30/11.64 % (163059)Time elapsed: 2.709 s
% 80.30/11.64 % (163059)Peak memory usage: 17 MB
% 80.30/11.64 % (163059)Instructions burned: 5133 (million)
% 80.30/11.64 % (163083)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=4228045985:fmbsr=1.6:i=67534_2965 on theBenchmark for (2965ds/67534Mi)
% 80.30/11.64 % Exception at run slice level
% 80.30/11.64 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 80.30/11.64 % (163084)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=2936970180:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2965 on theBenchmark for (2965ds/4591Mi)
% 80.30/11.64 % (163086)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=2919738060:i=29340_2965 on theBenchmark for (2965ds/29340Mi)
% 80.30/11.64 % (163074)Instruction limit reached!
% 80.30/11.64 % (163074)------------------------------
% 80.30/11.64 % (163074)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163074)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163074)Termination reason: Instruction limit
% 80.30/11.64 % (163074)Termination phase: Saturation
% 80.30/11.64 % (163074)Time elapsed: 2.422 s
% 80.30/11.64 % (163074)Peak memory usage: 15 MB
% 80.30/11.64 % (163074)Instructions burned: 3512 (million)
% 80.30/11.64 % (163079)Instruction limit reached!
% 80.30/11.64 % (163079)------------------------------
% 80.30/11.64 % (163079)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163079)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163079)Termination reason: Instruction limit
% 80.30/11.64 % (163079)Termination phase: Saturation
% 80.30/11.64 % (163079)Time elapsed: 1.558 s
% 80.30/11.64 % (163079)Peak memory usage: 14 MB
% 80.30/11.64 % (163079)Instructions burned: 2252 (million)
% 80.30/11.64 % (163089)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=2302789043:i=5211_2964 on theBenchmark for (2964ds/5211Mi)
% 80.30/11.64 % (163090)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=3933507369:i=5497:nm=2_2964 on theBenchmark for (2964ds/5497Mi)
% 80.30/11.64 % Exception at run slice level
% 80.30/11.64 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 80.30/11.64 % (163093)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=2095505281:fmbsr=2:i=46332_2963 on theBenchmark for (2963ds/46332Mi)
% 80.30/11.64 % Exception at run slice level
% 80.30/11.64 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 80.30/11.64 % (163095)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=3767576306:i=14071_2963 on theBenchmark for (2963ds/14071Mi)
% 80.30/11.64 % Exception at run slice level
% 80.30/11.64 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 80.30/11.64 % (163097)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2778105192:i=22565:add=on:rawr=on_2963 on theBenchmark for (2963ds/22565Mi)
% 80.30/11.64 % (163069)Instruction limit reached!
% 80.30/11.64 % (163069)------------------------------
% 80.30/11.64 % (163069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163069)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163069)Termination reason: Instruction limit
% 80.30/11.64 % (163069)Termination phase: Saturation
% 80.30/11.64 % (163069)Time elapsed: 3.040 s
% 80.30/11.64 % (163069)Peak memory usage: 14 MB
% 80.30/11.64 % (163069)Instructions burned: 5116 (million)
% 80.30/11.64 % (163099)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=3767999829:i=8173:av=off_2960 on theBenchmark for (2960ds/8173Mi)
% 80.30/11.64 % (163084)Instruction limit reached!
% 80.30/11.64 % (163084)------------------------------
% 80.30/11.64 % (163084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163084)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163084)Termination reason: Instruction limit
% 80.30/11.64 % (163084)Termination phase: Saturation
% 80.30/11.64 % (163084)Time elapsed: 2.717 s
% 80.30/11.64 % (163084)Peak memory usage: 25 MB
% 80.30/11.64 % (163084)Instructions burned: 4592 (million)
% 80.30/11.64 % (163105)dis+10_16:1_sil=16000:random_seed=3156793887:i=9155:fsr=off_2938 on theBenchmark for (2938ds/9155Mi)
% 80.30/11.64 % (163089)Instruction limit reached!
% 80.30/11.64 % (163089)------------------------------
% 80.30/11.64 % (163089)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163089)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163089)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163089)Termination reason: Instruction limit
% 80.30/11.64 % (163089)Termination phase: Saturation
% 80.30/11.64 % (163089)Time elapsed: 3.681 s
% 80.30/11.64 % (163089)Peak memory usage: 21 MB
% 80.30/11.64 % (163089)Instructions burned: 5212 (million)
% 80.30/11.64 % (163109)ott-3_8_sil=64000:random_seed=3842969844:i=20139:bs=on_2927 on theBenchmark for (2927ds/20139Mi)
% 80.30/11.64 % (163099)Instruction limit reached!
% 80.30/11.64 % (163099)------------------------------
% 80.30/11.64 % (163099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163099)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163099)Termination reason: Instruction limit
% 80.30/11.64 % (163099)Termination phase: Saturation
% 80.30/11.64 % (163099)Time elapsed: 3.939 s
% 80.30/11.64 % (163099)Peak memory usage: 16 MB
% 80.30/11.64 % (163099)Instructions burned: 8174 (million)
% 80.30/11.64 % (163111)fmb+10_1_sil=64000:tgt=ground:sas=cadical:bce=on:fmbss=9:random_seed=534301567:fmbsr=2:i=32576_2921 on theBenchmark for (2921ds/32576Mi)
% 80.30/11.64 % Exception at run slice level
% 80.30/11.64 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 80.30/11.64 % (163113)ott+10_8:1_sil=16000:sp=arity:gs=on:random_seed=309717300:i=11404_2921 on theBenchmark for (2921ds/11404Mi)
% 80.30/11.64 % (163105)Instruction limit reached!
% 80.30/11.64 % (163105)------------------------------
% 80.30/11.64 % (163105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163105)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163105)Termination reason: Instruction limit
% 80.30/11.64 % (163105)Termination phase: Saturation
% 80.30/11.64 % (163105)Time elapsed: 4.219 s
% 80.30/11.64 % (163105)Peak memory usage: 21 MB
% 80.30/11.64 % (163105)Instructions burned: 9157 (million)
% 80.30/11.64 % (163117)ott-11_1_sil=16000:alpa=false:sac=on:random_seed=1753465003:i=14134_2895 on theBenchmark for (2895ds/14134Mi)
% 80.30/11.64 % (163117)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 80.30/11.64 % (163020) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-163014-163020"...
% 80.30/11.64 % (163020)...printing done.
% 80.30/11.64 % (163020)Refutation found. Thanks to Tanya!
% 80.30/11.64 % SZS status Theorem for theBenchmark
% 80.30/11.64 % SZS output start Proof for theBenchmark
% 80.30/11.64 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 80.30/11.64 thf(func_def_0, type, in: ($i > $i > $o)).
% 80.30/11.64 thf(func_def_1, type, subset: ($i > $i > $o)).
% 80.30/11.64 thf(func_def_2, type, subsetI1: $o).
% 80.30/11.64 thf(func_def_4, type, subsetE: $o).
% 80.30/11.64 thf(func_def_5, type, binunion: ($i > $i > $i)).
% 80.30/11.64 thf(func_def_6, type, binunionEcases: $o).
% 80.30/11.64 thf(func_def_7, type, cartprod: ($i > $i > $i)).
% 80.30/11.64 thf(func_def_8, type, breln: ($i > $i > $i > $o)).
% 80.30/11.64 thf(func_def_9, type, breln1: ($i > $i > $o)).
% 80.30/11.64 thf(func_def_10, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 80.30/11.64 thf(func_def_11, type, vIMP: ($o > $o > $o)).
% 80.30/11.64 thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 80.30/11.64 thf(func_def_13, type, db1: !>[X0: $tType]:(X0)).
% 80.30/11.64 thf(func_def_14, type, db2: !>[X0: $tType]:(X0)).
% 80.30/11.64 thf(func_def_15, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 80.30/11.64 thf(func_def_16, type, db3: !>[X0: $tType]:(X0)).
% 80.30/11.64 thf(func_def_22, type, vNOT: ($o > $o)).
% 80.30/11.64 thf(func_def_23, type, sK3: ($i > $i > $i)).
% 80.30/11.64 thf(f1,axiom,(
% 80.30/11.64 (subsetI1 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1)).
% 80.30/11.64 thf(f2,axiom,(
% 80.30/11.64 (subsetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 80.30/11.64 thf(f3,axiom,(
% 80.30/11.64 (binunionEcases = ! [X0 : $i,X1 : $i,X2 : $i,X3 : $o] : ((in @ X2 @ (binunion @ X0 @ X1)) => (((in @ X2 @ X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionEcases)).
% 80.30/11.64 thf(f4,axiom,(
% 80.30/11.64 (breln = (^[X0 : $i, X1 : $i, X2 : $i] : ((subset @ X2 @ (cartprod @ X0 @ X1)))))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln)).
% 80.30/11.64 thf(f5,axiom,(
% 80.30/11.64 (breln1 = (^[X0 : $i, X1 : $i] : ((breln @ X0 @ X0 @ X1))))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1)).
% 80.30/11.64 thf(f6,conjecture,(
% 80.30/11.64 subsetI1 => (subsetE => (binunionEcases => ! [X0 : $i,X1 : $i] : ((breln1 @ X0 @ X1) => ! [X2 : $i] : ((breln1 @ X0 @ X2) => (breln1 @ X0 @ (binunion @ X1 @ X2))))))),
% 80.30/11.64 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionprop)).
% 80.30/11.64 thf(f7,negated_conjecture,(
% 80.30/11.64 ~(subsetI1 => (subsetE => (binunionEcases => ! [X0 : $i,X1 : $i] : ((breln1 @ X0 @ X1) => ! [X2 : $i] : ((breln1 @ X0 @ X2) => (breln1 @ X0 @ (binunion @ X1 @ X2)))))))),
% 80.30/11.64 inference(negated_conjecture,[status(cth)],[f6])).
% 80.30/11.64 thf(f8,plain,(
% 80.30/11.64 (subsetI1 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 80.30/11.64 inference(rectify,[],[f1])).
% 80.30/11.64 thf(f9,plain,(
% 80.30/11.64 (subsetI1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 80.30/11.64 inference(fool_elimination,[],[f8])).
% 80.30/11.64 thf(f10,plain,(
% 80.30/11.64 (subsetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 80.30/11.64 inference(rectify,[],[f2])).
% 80.30/11.64 thf(f11,plain,(
% 80.30/11.64 (subsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y1) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))))))),
% 80.30/11.64 inference(fool_elimination,[],[f10])).
% 80.30/11.64 thf(f12,plain,(
% 80.30/11.64 (binunionEcases = ! [X0 : $i,X1 : $i,X2 : $i,X3 : $o] : ((in @ X2 @ (binunion @ X0 @ X1)) => (((in @ X2 @ X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 80.30/11.64 inference(rectify,[],[f3])).
% 80.30/11.64 thf(f13,plain,(
% 80.30/11.64 (binunionEcases = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y1 @ (binunion @ Y3 @ Y2)) => (((in @ Y1 @ Y3) => Y0) => (((in @ Y1 @ Y2) => Y0) => Y0)))))))))))))),
% 80.30/11.64 inference(fool_elimination,[],[f12])).
% 80.30/11.64 thf(f14,plain,(
% 80.30/11.64 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 80.30/11.64 inference(fool_elimination,[],[f4])).
% 80.30/11.64 thf(f15,plain,(
% 80.30/11.64 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 80.30/11.64 inference(fool_elimination,[],[f5])).
% 80.30/11.64 thf(f16,plain,(
% 80.30/11.64 ~(subsetI1 => (subsetE => (binunionEcases => ! [X0 : $i,X1 : $i] : ((breln1 @ X0 @ X1) => ! [X2 : $i] : ((breln1 @ X0 @ X2) => (breln1 @ X0 @ (binunion @ X1 @ X2)))))))),
% 80.30/11.64 inference(rectify,[],[f7])).
% 80.30/11.64 thf(f17,plain,(
% 80.30/11.64 ~((subsetI1 = $true) => ((subsetE = $true) => ((binunionEcases = $true) => ! [X0 : $i,X1 : $i] : ((((breln1 @ X0 @ X1)) = $true) => ! [X2 : $i] : ((((breln1 @ X0 @ X2)) = $true) => (((breln1 @ X0 @ (binunion @ X1 @ X2))) = $true))))))),
% 80.30/11.64 inference(fool_elimination,[],[f16])).
% 80.30/11.64 thf(f18,plain,(
% 80.30/11.64 ((? [X0 : $i,X1 : $i] : (? [X2 : $i] : ((((breln1 @ X0 @ (binunion @ X1 @ X2))) != $true) & (((breln1 @ X0 @ X2)) = $true)) & (((breln1 @ X0 @ X1)) = $true)) & (binunionEcases = $true)) & (subsetE = $true)) & (subsetI1 = $true)),
% 80.30/11.64 inference(ennf_transformation,[],[f17])).
% 80.30/11.64 thf(f19,plain,(
% 80.30/11.64 ? [X0 : $i,X1 : $i] : (? [X2 : $i] : ((((breln1 @ X0 @ (binunion @ X1 @ X2))) != $true) & (((breln1 @ X0 @ X2)) = $true)) & (((breln1 @ X0 @ X1)) = $true)) & (binunionEcases = $true) & (subsetE = $true) & (subsetI1 = $true)),
% 80.30/11.64 inference(flattening,[],[f18])).
% 80.30/11.64 thf(f20,plain,(
% 80.30/11.64 ((($true != ((breln1 @ sK0 @ (binunion @ sK1 @ sK2)))) & ($true = ((breln1 @ sK0 @ sK2)))) & ($true = ((breln1 @ sK0 @ sK1)))) & (binunionEcases = $true) & (subsetE = $true) & (subsetI1 = $true)),
% 80.30/11.64 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f19])).
% 80.30/11.64 thf(f21,plain,(
% 80.30/11.64 (subsetI1 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 80.30/11.64 inference(cnf_transformation,[],[f9])).
% 80.30/11.64 thf(f22,plain,(
% 80.30/11.64 (subsetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y1) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))))))),
% 80.30/11.64 inference(cnf_transformation,[],[f11])).
% 80.30/11.64 thf(f23,plain,(
% 80.30/11.64 (binunionEcases = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y1 @ (binunion @ Y3 @ Y2)) => (((in @ Y1 @ Y3) => Y0) => (((in @ Y1 @ Y2) => Y0) => Y0)))))))))))))),
% 80.30/11.64 inference(cnf_transformation,[],[f13])).
% 80.30/11.64 thf(f24,plain,(
% 80.30/11.64 (breln = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: (subset @ Y2 @ (cartprod @ Y0 @ Y1))))))))),
% 80.30/11.64 inference(cnf_transformation,[],[f14])).
% 80.30/11.64 thf(f25,plain,(
% 80.30/11.64 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: (breln @ Y0 @ Y0 @ Y1)))))),
% 80.30/11.64 inference(cnf_transformation,[],[f15])).
% 80.30/11.64 thf(f26,plain,(
% 80.30/11.64 (subsetI1 = $true)),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f27,plain,(
% 80.30/11.64 (subsetE = $true)),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f28,plain,(
% 80.30/11.64 (binunionEcases = $true)),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f29,plain,(
% 80.30/11.64 ($true = ((breln1 @ sK0 @ sK1)))),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f30,plain,(
% 80.30/11.64 ($true = ((breln1 @ sK0 @ sK2)))),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f31,plain,(
% 80.30/11.64 ($true != ((breln1 @ sK0 @ (binunion @ sK1 @ sK2))))),
% 80.30/11.64 inference(cnf_transformation,[],[f20])).
% 80.30/11.64 thf(f33,definition,(
% 80.30/11.64 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 80.30/11.64 introduced(theory,[fool_exhaustiveness_axiom])).
% 80.30/11.64 thf(f34,plain,(
% 80.30/11.64 (breln1 = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))))),
% 80.30/11.64 inference(definition_unfolding,[],[f25,f24])).
% 80.30/11.64 thf(f35,plain,(
% 80.30/11.64 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))) = $true)),
% 80.30/11.64 inference(definition_unfolding,[],[f21,f26])).
% 80.30/11.64 thf(f36,plain,(
% 80.30/11.64 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y1) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))))) = $true)),
% 80.30/11.64 inference(definition_unfolding,[],[f22,f27])).
% 80.30/11.64 thf(f37,plain,(
% 80.30/11.64 (((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y1 @ (binunion @ Y3 @ Y2)) => (((in @ Y1 @ Y3) => Y0) => (((in @ Y1 @ Y2) => Y0) => Y0)))))))))))) = $true)),
% 80.30/11.64 inference(definition_unfolding,[],[f23,f28])).
% 80.30/11.64 thf(f38,plain,(
% 80.30/11.64 ($true != (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK0 @ (binunion @ sK1 @ sK2))))),
% 80.30/11.64 inference(definition_unfolding,[],[f31,f34])).
% 80.30/11.64 thf(f39,plain,(
% 80.30/11.64 ($true = (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK0 @ sK2)))),
% 80.30/11.64 inference(definition_unfolding,[],[f30,f34])).
% 80.30/11.64 thf(f40,plain,(
% 80.30/11.64 ($true = (((^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $i]: (subset @ Y4 @ (cartprod @ Y2 @ Y3))))))) @ Y0 @ Y0 @ Y1)))) @ sK0 @ sK1)))),
% 80.30/11.64 inference(definition_unfolding,[],[f29,f34])).
% 80.30/11.64 thf(f41,plain,(
% 80.30/11.64 ($true = ((subset @ sK1 @ (cartprod @ sK0 @ sK0))))),
% 80.30/11.64 inference(beta-eta_normalization,[],[f40])).
% 80.30/11.64 thf(f42,plain,(
% 80.30/11.64 ($true = ((subset @ sK2 @ (cartprod @ sK0 @ sK0))))),
% 80.30/11.64 inference(beta-eta_normalization,[],[f39])).
% 80.30/11.64 thf(f43,plain,(
% 80.30/11.64 ($true != ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0))))),
% 80.30/11.64 inference(beta-eta_normalization,[],[f38])).
% 80.30/11.64 thf(f44,plain,(
% 80.30/11.64 ( ! [X1 : $o] : (($true = (((^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((in @ Y1 @ (binunion @ Y3 @ Y2)) => (((in @ Y1 @ Y3) => Y0) => (((in @ Y1 @ Y2) => Y0) => Y0)))))))))) @ X1)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f37])).
% 80.30/11.64 thf(f45,plain,(
% 80.30/11.64 ( ! [X1 : $o] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (binunion @ Y2 @ Y1)) => (((in @ Y0 @ Y2) => X1) => (((in @ Y0 @ Y1) => X1) => X1)))))))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f44])).
% 80.30/11.64 thf(f46,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $o] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (binunion @ Y2 @ Y1)) => (((in @ Y0 @ Y2) => X1) => (((in @ Y0 @ Y1) => X1) => X1)))))))) @ X2)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f45])).
% 80.30/11.64 thf(f47,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $o] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X2 @ (binunion @ Y1 @ Y0)) => (((in @ X2 @ Y1) => X1) => (((in @ X2 @ Y0) => X1) => X1)))))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f46])).
% 80.30/11.64 thf(f48,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X2 @ (binunion @ Y1 @ Y0)) => (((in @ X2 @ Y1) => X1) => (((in @ X2 @ Y0) => X1) => X1)))))) @ X3)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f47])).
% 80.30/11.64 thf(f49,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ (binunion @ Y0 @ X3)) => (((in @ X2 @ Y0) => X1) => (((in @ X2 @ X3) => X1) => X1)))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f48])).
% 80.30/11.64 thf(f50,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($true = (((^[Y0 : $i]: ((in @ X2 @ (binunion @ Y0 @ X3)) => (((in @ X2 @ Y0) => X1) => (((in @ X2 @ X3) => X1) => X1)))) @ X4)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f49])).
% 80.30/11.64 thf(f51,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($true = (((in @ X2 @ (binunion @ X4 @ X3)) => (((in @ X2 @ X4) => X1) => (((in @ X2 @ X3) => X1) => X1)))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f50])).
% 80.30/11.64 thf(f52,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((((in @ X2 @ X4) => X1) => (((in @ X2 @ X3) => X1) => X1))))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f51])).
% 80.30/11.64 thf(f53,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($false = (((in @ X2 @ X4) => X1))) | ($true = ((((in @ X2 @ X3) => X1) => X1)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f52])).
% 80.30/11.64 thf(f55,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((in @ X2 @ X4))) | ($true = ((((in @ X2 @ X3) => X1) => X1)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f53])).
% 80.30/11.64 thf(f56,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((in @ X2 @ X4))) | ($false = (((in @ X2 @ X3) => X1))) | ($true = X1)) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f55])).
% 80.30/11.64 thf(f58,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((in @ X2 @ X4))) | ($true = ((in @ X2 @ X3))) | ($true = X1)) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f56])).
% 80.30/11.64 thf(f63,plain,(
% 80.30/11.64 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y2 @ Y1) => ((in @ Y0 @ Y2) => (in @ Y0 @ Y1)))))))) @ X1)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f36])).
% 80.30/11.64 thf(f64,plain,(
% 80.30/11.64 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => ((in @ X1 @ Y1) => (in @ X1 @ Y0)))))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f63])).
% 80.30/11.64 thf(f65,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y1 @ Y0) => ((in @ X1 @ Y1) => (in @ X1 @ Y0)))))) @ X2)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f64])).
% 80.30/11.64 thf(f66,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((subset @ Y0 @ X2) => ((in @ X1 @ Y0) => (in @ X1 @ X2)))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f65])).
% 80.30/11.64 thf(f67,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((subset @ Y0 @ X2) => ((in @ X1 @ Y0) => (in @ X1 @ X2)))) @ X3)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f66])).
% 80.30/11.64 thf(f68,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((subset @ X3 @ X2) => ((in @ X1 @ X3) => (in @ X1 @ X2)))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f67])).
% 80.30/11.64 thf(f69,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((subset @ X3 @ X2))) | ($true = (((in @ X1 @ X3) => (in @ X1 @ X2))))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f68])).
% 80.30/11.64 thf(f70,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((subset @ X3 @ X2))) | ($false = ((in @ X1 @ X3))) | ($true = ((in @ X1 @ X2)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f69])).
% 80.30/11.64 thf(f71,plain,(
% 80.30/11.64 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))) @ X1)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f35])).
% 80.30/11.64 thf(f72,plain,(
% 80.30/11.64 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (subset @ Y0 @ X1))))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f71])).
% 80.30/11.64 thf(f73,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (subset @ Y0 @ X1))) @ X2)))) )),
% 80.30/11.64 inference(pi_proxy_clausification,[],[f72])).
% 80.30/11.64 thf(f74,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($true = (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) => (subset @ X2 @ X1))))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f73])).
% 80.30/11.64 thf(f75,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))))) | ($true = ((subset @ X2 @ X1)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f74])).
% 80.30/11.64 thf(f76,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1))) @ (sK3 @ X1 @ X2)))) | ($true = ((subset @ X2 @ X1)))) )),
% 80.30/11.64 inference(sigma_proxy_clausification,[],[f75])).
% 80.30/11.64 thf(f77,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($false = (((in @ (sK3 @ X1 @ X2) @ X2) => (in @ (sK3 @ X1 @ X2) @ X1)))) | ($true = ((subset @ X2 @ X1)))) )),
% 80.30/11.64 inference(beta-eta_normalization,[],[f76])).
% 80.30/11.64 thf(f78,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($false = ((in @ (sK3 @ X1 @ X2) @ X1))) | ($true = ((subset @ X2 @ X1)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f77])).
% 80.30/11.64 thf(f79,plain,(
% 80.30/11.64 ( ! [X2 : $i,X1 : $i] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | ($true = ((subset @ X2 @ X1)))) )),
% 80.30/11.64 inference(imp_proxy_clausification,[],[f77])).
% 80.30/11.64 thf(f81,definition,(
% 80.30/11.64 spl4_1 <=> ! [X1 : $o] : ($true = X1)),
% 80.30/11.64 introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition])).
% 80.30/11.64 thf(f82,plain,(
% 80.30/11.64 ( ! [X1 : $o] : (($true = X1)) ) | ~spl4_1),
% 80.30/11.64 inference(avatar_component_clause,[],[f81])).
% 80.30/11.64 thf(f84,definition,(
% 80.30/11.64 spl4_2 <=> ! [X4 : $i,X2 : $i,X3 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((in @ X2 @ X3))) | ($true = ((in @ X2 @ X4))))),
% 80.30/11.64 introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition])).
% 80.30/11.64 thf(f85,plain,(
% 80.30/11.64 ( ! [X2 : $i,X3 : $i,X4 : $i] : (($false = ((in @ X2 @ (binunion @ X4 @ X3)))) | ($true = ((in @ X2 @ X3))) | ($true = ((in @ X2 @ X4)))) ) | ~spl4_2),
% 80.30/11.64 inference(avatar_component_clause,[],[f84])).
% 80.30/11.64 thf(f86,plain,(
% 80.30/11.64 spl4_1 | spl4_2),
% 80.30/11.64 inference(avatar_split_clause,[],[f58,f84,f81])).
% 80.30/11.64 thf(f88,definition,(
% 80.30/11.64 spl4_3 <=> ! [X1 : $o] : (($false = X1) | ($true = X1))),
% 80.30/11.64 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 80.30/11.64 thf(f89,plain,(
% 80.30/11.64 ( ! [X1 : $o] : (($true = X1) | ($false = X1)) ) | ~spl4_3),
% 80.30/11.64 inference(avatar_component_clause,[],[f88])).
% 80.30/11.64 thf(f102,plain,(
% 80.30/11.64 spl4_3),
% 80.30/11.64 inference(avatar_split_clause,[],[f33,f88])).
% 80.30/11.64 thf(f118,plain,(
% 80.30/11.64 ($true != $true) | ($false = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | ~spl4_3),
% 80.30/11.64 inference(constrained_superposition,[],[f43,f89])).
% 80.30/11.64 thf(f119,plain,(
% 80.30/11.64 ($false = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | ~spl4_3),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f118])).
% 80.30/11.64 thf(f129,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK1))) | ($true = ((in @ X0 @ (cartprod @ sK0 @ sK0))))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f41,f70])).
% 80.30/11.64 thf(f130,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ (cartprod @ sK0 @ sK0))))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f42,f70])).
% 80.30/11.64 thf(f133,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = ((in @ X0 @ (cartprod @ sK0 @ sK0)))) | ($false = ((in @ X0 @ sK2)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f130])).
% 80.30/11.64 thf(f134,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = ((in @ X0 @ (cartprod @ sK0 @ sK0)))) | ($false = ((in @ X0 @ sK1)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f129])).
% 80.30/11.64 thf(f143,plain,(
% 80.30/11.64 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = $false) | ($false = ((subset @ X2 @ X0))) | ($false = ((in @ (sK3 @ X0 @ X1) @ X2))) | ($true = ((subset @ X1 @ X0)))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f70,f78])).
% 80.30/11.64 thf(f144,plain,(
% 80.30/11.64 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false = ((in @ (sK3 @ X0 @ X1) @ X2))) | ($false = ((subset @ X2 @ X0))) | ($true = ((subset @ X1 @ X0)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f143])).
% 80.30/11.64 thf(f150,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ X0 @ X0))) | ($true = ((subset @ X0 @ X0)))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f78,f79])).
% 80.30/11.64 thf(f151,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ X0 @ X0)))) )),
% 80.30/11.64 inference(duplicate_literal_removal,[],[f150])).
% 80.30/11.64 thf(f152,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = ((subset @ X0 @ X0)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f151])).
% 80.30/11.64 thf(f172,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ X0 @ (cartprod @ sK0 @ sK0)))) | ($false = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ X0) @ sK1)))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f78,f134])).
% 80.30/11.64 thf(f173,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = ((subset @ X0 @ (cartprod @ sK0 @ sK0)))) | ($false = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ X0) @ sK1)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f172])).
% 80.30/11.64 thf(f240,plain,(
% 80.30/11.64 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = $false) | ($true = ((subset @ (binunion @ X1 @ X2) @ X0))) | ($true = ((in @ (sK3 @ X0 @ (binunion @ X1 @ X2)) @ X2))) | ($true = ((in @ (sK3 @ X0 @ (binunion @ X1 @ X2)) @ X1)))) ) | ~spl4_2),
% 80.30/11.64 inference(constrained_superposition,[],[f79,f85])).
% 80.30/11.64 thf(f241,plain,(
% 80.30/11.64 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((in @ (sK3 @ X0 @ (binunion @ X1 @ X2)) @ X2))) | ($true = ((in @ (sK3 @ X0 @ (binunion @ X1 @ X2)) @ X1))) | ($true = ((subset @ (binunion @ X1 @ X2) @ X0)))) ) | ~spl4_2),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f240])).
% 80.30/11.64 thf(f257,plain,(
% 80.30/11.64 ( ! [X0 : $i,X1 : $i] : (($true = $false) | ($false = ((in @ (sK3 @ X0 @ X1) @ sK2))) | ($false = ((subset @ (cartprod @ sK0 @ sK0) @ X0))) | ($true = ((subset @ X1 @ X0)))) )),
% 80.30/11.64 inference(constrained_superposition,[],[f133,f144])).
% 80.30/11.64 thf(f261,plain,(
% 80.30/11.64 ( ! [X0 : $i,X1 : $i] : (($false = ((subset @ (cartprod @ sK0 @ sK0) @ X0))) | ($false = ((in @ (sK3 @ X0 @ X1) @ sK2))) | ($true = ((subset @ X1 @ X0)))) )),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f257])).
% 80.30/11.64 thf(f653,definition,(
% 80.30/11.64 spl4_9 <=> ! [X0 : $i] : (($false = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ X0) @ sK1))) | ($true = ((subset @ X0 @ (cartprod @ sK0 @ sK0)))))),
% 80.30/11.64 introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition])).
% 80.30/11.64 thf(f654,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($false = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ X0) @ sK1))) | ($true = ((subset @ X0 @ (cartprod @ sK0 @ sK0))))) ) | ~spl4_9),
% 80.30/11.64 inference(avatar_component_clause,[],[f653])).
% 80.30/11.64 thf(f661,plain,(
% 80.30/11.64 spl4_9),
% 80.30/11.64 inference(avatar_split_clause,[],[f173,f653])).
% 80.30/11.64 thf(f17501,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ (binunion @ sK1 @ X0) @ (cartprod @ sK0 @ sK0)))) | ($true = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ (binunion @ sK1 @ X0)) @ X0))) | ($true = ((subset @ (binunion @ sK1 @ X0) @ (cartprod @ sK0 @ sK0))))) ) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(constrained_superposition,[],[f654,f241])).
% 80.30/11.64 thf(f17509,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ (binunion @ sK1 @ X0) @ (cartprod @ sK0 @ sK0)))) | ($true = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ (binunion @ sK1 @ X0)) @ X0)))) ) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(duplicate_literal_removal,[],[f17501])).
% 80.30/11.64 thf(f17510,plain,(
% 80.30/11.64 ( ! [X0 : $i] : (($true = ((in @ (sK3 @ (cartprod @ sK0 @ sK0) @ (binunion @ sK1 @ X0)) @ X0))) | ($true = ((subset @ (binunion @ sK1 @ X0) @ (cartprod @ sK0 @ sK0))))) ) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f17509])).
% 80.30/11.64 thf(f20870,definition,(
% 80.30/11.64 spl4_132 <=> ($false = ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0))))),
% 80.30/11.64 introduced(definition,[new_symbols(definition,[spl4_132])],[avatar_definition])).
% 80.30/11.64 thf(f20871,plain,(
% 80.30/11.64 ($false != ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0)))) | spl4_132),
% 80.30/11.64 inference(avatar_component_clause,[],[f20870])).
% 80.30/11.64 thf(f20872,plain,(
% 80.30/11.64 ($false = ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0)))) | ~spl4_132),
% 80.30/11.64 inference(avatar_component_clause,[],[f20870])).
% 80.30/11.64 thf(f20899,plain,(
% 80.30/11.64 $false | ~spl4_1),
% 80.30/11.64 inference(backward_subsumption_resolution,[],[f43,f82])).
% 80.30/11.64 thf(f21298,plain,(
% 80.30/11.64 ~spl4_1),
% 80.30/11.64 inference(avatar_contradiction_clause,[],[f20899])).
% 80.30/11.64 thf(f48833,plain,(
% 80.30/11.64 ($true = $false) | ~spl4_132),
% 80.30/11.64 inference(constrained_superposition,[],[f20872,f152])).
% 80.30/11.64 thf(f48873,plain,(
% 80.30/11.64 $false | ~spl4_132),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f48833])).
% 80.30/11.64 thf(f48874,plain,(
% 80.30/11.64 ~spl4_132),
% 80.30/11.64 inference(avatar_contradiction_clause,[],[f48873])).
% 80.30/11.64 thf(f118423,plain,(
% 80.30/11.64 ($true = $false) | ($true = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | ($false = ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0)))) | ($true = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(constrained_superposition,[],[f17510,f261])).
% 80.30/11.64 thf(f118612,plain,(
% 80.30/11.64 ($true = $false) | ($true = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | ($false = ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0)))) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(duplicate_literal_removal,[],[f118423])).
% 80.30/11.64 thf(f118613,plain,(
% 80.30/11.64 ($true = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | ($false = ((subset @ (cartprod @ sK0 @ sK0) @ (cartprod @ sK0 @ sK0)))) | (~spl4_2 | ~spl4_9)),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f118612])).
% 80.30/11.64 thf(f118761,plain,(
% 80.30/11.64 ($true = ((subset @ (binunion @ sK1 @ sK2) @ (cartprod @ sK0 @ sK0)))) | (~spl4_2 | ~spl4_9 | spl4_132)),
% 80.30/11.64 inference(forward_subsumption_resolution,[],[f118613,f20871])).
% 80.30/11.64 thf(f118799,plain,(
% 80.30/11.64 ($true = $false) | (~spl4_2 | ~spl4_3 | ~spl4_9 | spl4_132)),
% 80.30/11.64 inference(forward_demodulation,[],[f118761,f119])).
% 80.30/11.64 thf(f118800,plain,(
% 80.30/11.64 $false | (~spl4_2 | ~spl4_3 | ~spl4_9 | spl4_132)),
% 80.30/11.64 inference(trivial_inequality_removal,[],[f118799])).
% 80.30/11.64 thf(f118801,plain,(
% 80.30/11.64 ~spl4_2 | ~spl4_3 | ~spl4_9 | spl4_132),
% 80.30/11.64 inference(avatar_contradiction_clause,[],[f118800])).
% 80.30/11.64 cnf(s1, plain, spl4_1 | spl4_2, inference(sat_conversion,[],[f86])).
% 80.30/11.64 cnf(s5, plain, spl4_3, inference(sat_conversion,[],[f102])).
% 80.30/11.64 cnf(s9, plain, spl4_9, inference(sat_conversion,[],[f661])).
% 80.30/11.64 cnf(s789, plain, ~spl4_1, inference(sat_conversion,[],[f21298])).
% 80.30/11.64 cnf(s3021, plain, ~spl4_132, inference(sat_conversion,[],[f48874])).
% 80.30/11.64 cnf(s4009, plain, ~spl4_2 | ~spl4_3 | ~spl4_9 | spl4_132, inference(sat_conversion,[],[f118801])).
% 80.30/11.64 cnf(s4130, plain, ~spl4_2, inference(rat,[],[s4009,s3021,s9,s5])).
% 80.30/11.64 cnf(s4132, plain, $false, inference(rat,[],[s1,s4130,s789])).
% 80.30/11.64 thf(f118802,plain,(
% 80.30/11.64 $false),
% 80.30/11.64 inference(avatar_sat_refutation,[],[s4132])).
% 80.30/11.64 % SZS output end Proof for theBenchmark
% 80.30/11.64 % (163020)------------------------------
% 80.30/11.64 % (163020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 80.30/11.64 % (163020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 80.30/11.64 % (163020)CaDiCaL version: 2.1.3
% 80.30/11.64 % (163020)Termination reason: Refutation
% 80.30/11.64 % (163020)Time elapsed: 11.302 s
% 80.30/11.64 % (163020)Peak memory usage: 34 MB
% 80.30/11.64 % (163020)Instructions burned: 21718 (million)
% 80.30/11.64 % (163014)Success in time 11.387 s
% 80.30/11.64 % Vampire exiting
%------------------------------------------------------------------------------