%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU640^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 : n026.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:32:47 AM UTC 2026
% Result : Theorem 15.80s 2.58s
% Output : Refutation 15.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU640^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.07/0.18 % Computer : n026.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:03:58 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.03/1.19 % (649567)Will run a generic schedule for satisfiability detection.
% 6.03/1.19 % (649574)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=942253426:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.03/1.19 % (649573)% WARNING: option uhcvi not known.
% 6.03/1.19 % (649572)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1047433679_2999 on theBenchmark for (2999ds/0Mi)
% 6.03/1.19 % (649573)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=746622585:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.03/1.19 % (649576)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3847098405:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.03/1.19 % (649575)dis+10_1_sil=32000:sp=arity:random_seed=799495642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.03/1.19 % (649573)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.03/1.19 % (649576)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.03/1.19 % Exception at run slice level
% 6.03/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.03/1.19 % (649573)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.03/1.19 % (649577)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3517438395:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.03/1.19 % (649578)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3547277216:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.03/1.19 % (649584)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4095481738:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.03/1.19 % Exception at run slice level
% 6.03/1.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.03/1.19 % (649575)Instruction limit reached!
% 6.03/1.19 % (649575)------------------------------
% 6.03/1.19 % (649575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.03/1.19 % (649575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/1.19 % (649575)CaDiCaL version: 2.1.3
% 6.03/1.19 % (649575)Termination reason: Instruction limit
% 6.03/1.19 % (649575)Termination phase: Saturation
% 6.03/1.19 % (649575)Time elapsed: 0.050 s
% 6.03/1.19 % (649575)Peak memory usage: 12 MB
% 6.03/1.19 % (649575)Instructions burned: 105 (million)
% 6.03/1.19 % (649588)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4008577009:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.03/1.19 % (649589)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=3015497373:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 6.03/1.19 % (649589)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.03/1.19 % (649589)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.03/1.19 % (649577)Instruction limit reached!
% 6.03/1.19 % (649577)------------------------------
% 6.03/1.19 % (649577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.03/1.19 % (649577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/1.19 % (649577)CaDiCaL version: 2.1.3
% 6.03/1.19 % (649577)Termination reason: Instruction limit
% 6.03/1.19 % (649577)Termination phase: Saturation
% 6.03/1.19 % (649577)Time elapsed: 0.074 s
% 6.03/1.19 % (649577)Peak memory usage: 12 MB
% 6.03/1.19 % (649577)Instructions burned: 131 (million)
% 6.03/1.19 % (649576)Instruction limit reached!
% 6.03/1.19 % (649576)------------------------------
% 6.03/1.19 % (649576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.03/1.19 % (649576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.03/1.19 % (649576)CaDiCaL version: 2.1.3
% 6.03/1.19 % (649576)Termination reason: Instruction limit
% 6.03/1.19 % (649576)Termination phase: Saturation
% 6.03/1.19 % (649576)Time elapsed: 0.096 s
% 6.03/1.19 % (649576)Peak memory usage: 12 MB
% 6.03/1.19 % (649576)Instructions burned: 116 (million)
% 6.03/1.19 % (649594)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3812888362:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.03/1.19 % (649593)ott-21_1_sil=16000:fs=off:random_seed=2733474969:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 15.80/2.58 % (649578)Instruction limit reached!
% 15.80/2.58 % (649578)------------------------------
% 15.80/2.58 % (649578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649578)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649578)Termination reason: Instruction limit
% 15.80/2.58 % (649578)Termination phase: Saturation
% 15.80/2.58 % (649578)Time elapsed: 0.141 s
% 15.80/2.58 % (649578)Peak memory usage: 12 MB
% 15.80/2.58 % (649578)Instructions burned: 159 (million)
% 15.80/2.58 % (649598)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2866244892:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649588)Instruction limit reached!
% 15.80/2.58 % (649588)------------------------------
% 15.80/2.58 % (649588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649588)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649588)Termination reason: Instruction limit
% 15.80/2.58 % (649588)Termination phase: Saturation
% 15.80/2.58 % (649588)Time elapsed: 0.129 s
% 15.80/2.58 % (649588)Peak memory usage: 12 MB
% 15.80/2.58 % (649588)Instructions burned: 132 (million)
% 15.80/2.58 % (649600)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3812385432:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 15.80/2.58 % (649601)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3681881445:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649604)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=1940653910: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)
% 15.80/2.58 % (649604)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.80/2.58 % (649593)Instruction limit reached!
% 15.80/2.58 % (649593)------------------------------
% 15.80/2.58 % (649593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649593)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649593)Termination reason: Instruction limit
% 15.80/2.58 % (649593)Termination phase: Saturation
% 15.80/2.58 % (649593)Time elapsed: 0.167 s
% 15.80/2.58 % (649593)Peak memory usage: 12 MB
% 15.80/2.58 % (649593)Instructions burned: 182 (million)
% 15.80/2.58 % (649606)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=229548722:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 15.80/2.58 % (649606)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.80/2.58 % (649589)Instruction limit reached!
% 15.80/2.58 % (649589)------------------------------
% 15.80/2.58 % (649589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649589)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649589)Termination reason: Instruction limit
% 15.80/2.58 % (649589)Termination phase: Saturation
% 15.80/2.58 % (649589)Time elapsed: 0.413 s
% 15.80/2.58 % (649589)Peak memory usage: 13 MB
% 15.80/2.58 % (649589)Instructions burned: 685 (million)
% 15.80/2.58 % (649608)fmb+10_1_sil=64000:random_seed=557924786:i=22061:nm=2:gsp=on_2994 on theBenchmark for (2994ds/22061Mi)
% 15.80/2.58 % (649608)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649610)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3680272346:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649612)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2013309202:fmbsr=1.7:i=920_2994 on theBenchmark for (2994ds/920Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649594)Instruction limit reached!
% 15.80/2.58 % (649594)------------------------------
% 15.80/2.58 % (649594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649594)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649594)Termination reason: Instruction limit
% 15.80/2.58 % (649594)Termination phase: Saturation
% 15.80/2.58 % (649594)Time elapsed: 0.435 s
% 15.80/2.58 % (649594)Peak memory usage: 13 MB
% 15.80/2.58 % (649594)Instructions burned: 477 (million)
% 15.80/2.58 % (649614)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3241986815:i=5131_2994 on theBenchmark for (2994ds/5131Mi)
% 15.80/2.58 % (649614)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.80/2.58 % (649615)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=390469656:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 15.80/2.58 % (649615)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 15.80/2.58 % (649615)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.80/2.58 % (649604)Instruction limit reached!
% 15.80/2.58 % (649604)------------------------------
% 15.80/2.58 % (649604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649604)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649604)Termination reason: Instruction limit
% 15.80/2.58 % (649604)Termination phase: Saturation
% 15.80/2.58 % (649604)Time elapsed: 0.407 s
% 15.80/2.58 % (649604)Peak memory usage: 15 MB
% 15.80/2.58 % (649604)Instructions burned: 693 (million)
% 15.80/2.58 % (649618)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=4118179766:i=6324_2992 on theBenchmark for (2992ds/6324Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649620)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=657267149:fmbsr=2.30978:i=2174_2992 on theBenchmark for (2992ds/2174Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649622)ott-2_1_sil=16000:newcnf=on:random_seed=3042825879:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2992 on theBenchmark for (2992ds/869Mi)
% 15.80/2.58 % (649622)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.80/2.58 % (649600)Instruction limit reached!
% 15.80/2.58 % (649600)------------------------------
% 15.80/2.58 % (649600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649600)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649600)Termination reason: Instruction limit
% 15.80/2.58 % (649600)Termination phase: Saturation
% 15.80/2.58 % (649600)Time elapsed: 0.606 s
% 15.80/2.58 % (649600)Peak memory usage: 16 MB
% 15.80/2.58 % (649600)Instructions burned: 1180 (million)
% 15.80/2.58 % (649624)ott+10_1_sil=32000:tgt=ground:random_seed=1776467300:i=5114:av=off_2991 on theBenchmark for (2991ds/5114Mi)
% 15.80/2.58 % (649606)Instruction limit reached!
% 15.80/2.58 % (649606)------------------------------
% 15.80/2.58 % (649606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649606)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649606)Termination reason: Instruction limit
% 15.80/2.58 % (649606)Termination phase: Saturation
% 15.80/2.58 % (649606)Time elapsed: 0.578 s
% 15.80/2.58 % (649606)Peak memory usage: 15 MB
% 15.80/2.58 % (649606)Instructions burned: 880 (million)
% 15.80/2.58 % (649626)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1718286691:i=54282_2990 on theBenchmark for (2990ds/54282Mi)
% 15.80/2.58 % Exception at run slice level
% 15.80/2.58 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.80/2.58 % (649628)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2960731190:i=3512:aac=none_2990 on theBenchmark for (2990ds/3512Mi)
% 15.80/2.58 % (649628)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.80/2.58 % (649622)Instruction limit reached!
% 15.80/2.58 % (649622)------------------------------
% 15.80/2.58 % (649622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649622)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649622)Termination reason: Instruction limit
% 15.80/2.58 % (649622)Termination phase: Saturation
% 15.80/2.58 % (649622)Time elapsed: 0.650 s
% 15.80/2.58 % (649622)Peak memory usage: 15 MB
% 15.80/2.58 % (649622)Instructions burned: 869 (million)
% 15.80/2.58 % (649630)dis+21_1_sil=32000:sas=cadical:random_seed=3368812101:i=3773:amm=off_2985 on theBenchmark for (2985ds/3773Mi)
% 15.80/2.58 % (649615)Instruction limit reached!
% 15.80/2.58 % (649615)------------------------------
% 15.80/2.58 % (649615)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649615)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649615)Termination reason: Instruction limit
% 15.80/2.58 % (649615)Termination phase: Saturation
% 15.80/2.58 % (649615)Time elapsed: 0.809 s
% 15.80/2.58 % (649615)Peak memory usage: 18 MB
% 15.80/2.58 % (649615)Instructions burned: 1474 (million)
% 15.80/2.58 % (649632)ott+11_1_sil=16000:gs=on:random_seed=1141073074:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2985 on theBenchmark for (2985ds/2251Mi)
% 15.80/2.58 % (649632)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.80/2.58 % (649574) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-649567-649574"...
% 15.80/2.58 % (649574)...printing done.
% 15.80/2.58 % (649574)Refutation found. Thanks to Tanya!
% 15.80/2.58 % SZS status Theorem for theBenchmark
% 15.80/2.58 % SZS output start Proof for theBenchmark
% 15.80/2.58 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 15.80/2.58 thf(func_def_0, type, in: ($i > $i > $o)).
% 15.80/2.58 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 15.80/2.58 thf(func_def_3, type, dsetconstr: ($i > ($i > $o) > $i)).
% 15.80/2.58 thf(func_def_4, type, singleton: ($i > $o)).
% 15.80/2.58 thf(func_def_6, type, singletonprop: $o).
% 15.80/2.58 thf(func_def_7, type, ex1: ($i > ($i > $o) > $o)).
% 15.80/2.58 thf(func_def_8, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 15.80/2.58 thf(func_def_9, type, vAND: ($o > $o > $o)).
% 15.80/2.58 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 15.80/2.58 thf(func_def_11, type, db1: !>[X0: $tType]:(X0)).
% 15.80/2.58 thf(func_def_12, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 15.80/2.58 thf(func_def_13, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 15.80/2.58 thf(func_def_14, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 15.80/2.58 thf(func_def_15, type, vIMP: ($o > $o > $o)).
% 15.80/2.58 thf(func_def_16, type, db2: !>[X0: $tType]:(X0)).
% 15.80/2.58 thf(func_def_17, type, db3: !>[X0: $tType]:(X0)).
% 15.80/2.58 thf(func_def_21, type, sK1: ($i > $o)).
% 15.80/2.58 thf(func_def_23, type, vNOT: ($o > $o)).
% 15.80/2.58 thf(func_def_24, type, sK3: (($i > $o) > $i > $i)).
% 15.80/2.58 thf(func_def_25, type, sK4: (($i > $o) > $i > $i)).
% 15.80/2.58 thf(func_def_26, type, sK5: (($i > $o) > $i > $i)).
% 15.80/2.58 thf(func_def_28, type, sK7: (($i > $o) > $i)).
% 15.80/2.58 thf(func_def_29, type, sK8: (($i > $o) > $i)).
% 15.80/2.58 thf(func_def_30, type, sK9: (($i > $o) > $i)).
% 15.80/2.58 thf(f1,axiom,(
% 15.80/2.58 (singleton = (^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))))),
% 15.80/2.58 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton)).
% 15.80/2.58 thf(f2,axiom,(
% 15.80/2.58 (singletonprop = ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => ((X1 @ X2) => ((X1 @ X3) => (X2 = X3))))) => (? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0)) => (singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))))),
% 15.80/2.58 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singletonprop)).
% 15.80/2.58 thf(f3,axiom,(
% 15.80/2.58 (ex1 = (^[X0 : $i, X1 : ($i > $o)] : ((singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))))),
% 15.80/2.58 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1)).
% 15.80/2.58 thf(f4,conjecture,(
% 15.80/2.58 singletonprop => ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => ((X1 @ X2) => ((X1 @ X3) => (X2 = X3))))) => (? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0)) => (ex1 @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))),
% 15.80/2.58 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1I2)).
% 15.80/2.58 thf(f5,negated_conjecture,(
% 15.80/2.58 ~(singletonprop => ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => ((X1 @ X2) => ((X1 @ X3) => (X2 = X3))))) => (? [X2 : $i] : ((X1 @ X2) & (in @ X2 @ X0)) => (ex1 @ X0 @ (^[X2 : $i] : ((X1 @ X2)))))))),
% 15.80/2.58 inference(negated_conjecture,[status(cth)],[f4])).
% 15.80/2.58 thf(f6,plain,(
% 15.80/2.58 (singleton = (^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))))),
% 15.80/2.58 inference(rectify,[],[f1])).
% 15.80/2.58 thf(f7,plain,(
% 15.80/2.58 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 15.80/2.58 inference(fool_elimination,[],[f6])).
% 15.80/2.58 thf(f8,plain,(
% 15.80/2.58 (singletonprop = ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => ((X1 @ X2) => ((X1 @ X3) => (X2 = X3))))) => (? [X4 : $i] : ((X1 @ X4) & (in @ X4 @ X0)) => (singleton @ (dsetconstr @ X0 @ (^[X5 : $i] : ((X1 @ X5))))))))),
% 15.80/2.58 inference(rectify,[],[f2])).
% 15.80/2.58 thf(f9,plain,(
% 15.80/2.58 (singletonprop = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((Y0 @ Y2) => ((Y0 @ Y3) => (Y2 = Y3))))))))) => ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))) => (singleton @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))))))))))))),
% 15.80/2.58 inference(fool_elimination,[],[f8])).
% 15.80/2.58 thf(f10,plain,(
% 15.80/2.58 (ex1 = (^[X0 : $i, X1 : ($i > $o)] : ((singleton @ (dsetconstr @ X0 @ (^[X2 : $i] : ((X1 @ X2))))))))),
% 15.80/2.58 inference(rectify,[],[f3])).
% 15.80/2.58 thf(f11,plain,(
% 15.80/2.58 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 15.80/2.58 inference(fool_elimination,[],[f10])).
% 15.80/2.58 thf(f12,plain,(
% 15.80/2.58 ~(singletonprop => ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => ((X1 @ X2) => ((X1 @ X3) => (X2 = X3))))) => (? [X4 : $i] : ((X1 @ X4) & (in @ X4 @ X0)) => (ex1 @ X0 @ (^[X5 : $i] : ((X1 @ X5)))))))),
% 15.80/2.58 inference(rectify,[],[f5])).
% 15.80/2.58 thf(f13,plain,(
% 15.80/2.58 ~((singletonprop = $true) => ! [X0 : $i,X1 : ($i > $o)] : (! [X2 : $i] : ((((in @ X2 @ X0)) = $true) => ! [X3 : $i] : ((((in @ X3 @ X0)) = $true) => ((((X1 @ X2)) = $true) => ((((X1 @ X3)) = $true) => (X2 = X3))))) => (? [X4 : $i] : ((((X1 @ X4)) = $true) & (((in @ X4 @ X0)) = $true)) => ($true = ((ex1 @ X0 @ (^[Y0 : $i]: (X1 @ Y0))))))))),
% 15.80/2.58 inference(fool_elimination,[],[f12])).
% 15.80/2.58 thf(f14,plain,(
% 15.80/2.58 ? [X0 : $i,X1 : ($i > $o)] : ((($true != ((ex1 @ X0 @ (^[Y0 : $i]: (X1 @ Y0))))) & ? [X4 : $i] : ((((X1 @ X4)) = $true) & (((in @ X4 @ X0)) = $true))) & ! [X2 : $i] : (! [X3 : $i] : ((((X2 = X3) | (((X1 @ X3)) != $true)) | (((X1 @ X2)) != $true)) | (((in @ X3 @ X0)) != $true)) | (((in @ X2 @ X0)) != $true))) & (singletonprop = $true)),
% 15.80/2.58 inference(ennf_transformation,[],[f13])).
% 15.80/2.58 thf(f15,plain,(
% 15.80/2.58 ? [X0 : $i,X1 : ($i > $o)] : (($true != ((ex1 @ X0 @ (^[Y0 : $i]: (X1 @ Y0))))) & ? [X4 : $i] : ((((X1 @ X4)) = $true) & (((in @ X4 @ X0)) = $true)) & ! [X2 : $i] : (! [X3 : $i] : ((X2 = X3) | (((X1 @ X3)) != $true) | (((X1 @ X2)) != $true) | (((in @ X3 @ X0)) != $true)) | (((in @ X2 @ X0)) != $true))) & (singletonprop = $true)),
% 15.80/2.58 inference(flattening,[],[f14])).
% 15.80/2.58 thf(f16,plain,(
% 15.80/2.58 ? [X0 : $i,X1 : ($i > $o)] : (($true != ((ex1 @ X0 @ (^[Y0 : $i]: (X1 @ Y0))))) & ? [X2 : $i] : ((((X1 @ X2)) = $true) & (((in @ X2 @ X0)) = $true)) & ! [X3 : $i] : (! [X4 : $i] : ((X3 = X4) | (((X1 @ X4)) != $true) | (((X1 @ X3)) != $true) | (((in @ X4 @ X0)) != $true)) | (((in @ X3 @ X0)) != $true))) & (singletonprop = $true)),
% 15.80/2.58 inference(rectify,[],[f15])).
% 15.80/2.58 thf(f17,plain,(
% 15.80/2.58 (($true != ((ex1 @ sK0 @ (^[Y0 : $i]: (sK1 @ Y0))))) & (($true = ((sK1 @ sK2))) & ($true = ((in @ sK2 @ sK0)))) & ! [X3 : $i] : (! [X4 : $i] : ((X3 = X4) | ($true != ((sK1 @ X4))) | ($true != ((sK1 @ X3))) | ($true != ((in @ X4 @ sK0)))) | ($true != ((in @ X3 @ sK0))))) & (singletonprop = $true)),
% 15.80/2.58 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16])).
% 15.80/2.58 thf(f18,plain,(
% 15.80/2.58 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 15.80/2.58 inference(cnf_transformation,[],[f7])).
% 15.80/2.58 thf(f19,plain,(
% 15.80/2.58 (singletonprop = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((Y0 @ Y2) => ((Y0 @ Y3) => (Y2 = Y3))))))))) => ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))) => (singleton @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))))))))))))),
% 15.80/2.58 inference(cnf_transformation,[],[f9])).
% 15.80/2.58 thf(f20,plain,(
% 15.80/2.58 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: (singleton @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 15.80/2.58 inference(cnf_transformation,[],[f11])).
% 15.80/2.58 thf(f21,plain,(
% 15.80/2.58 (singletonprop = $true)),
% 15.80/2.58 inference(cnf_transformation,[],[f17])).
% 15.80/2.58 thf(f22,plain,(
% 15.80/2.58 ( ! [X3 : $i,X4 : $i] : (($true != ((in @ X4 @ sK0))) | ($true != ((sK1 @ X4))) | ($true != ((sK1 @ X3))) | (X3 = X4) | ($true != ((in @ X3 @ sK0)))) )),
% 15.80/2.58 inference(cnf_transformation,[],[f17])).
% 15.80/2.58 thf(f23,plain,(
% 15.80/2.58 ($true = ((in @ sK2 @ sK0)))),
% 15.80/2.58 inference(cnf_transformation,[],[f17])).
% 15.80/2.58 thf(f24,plain,(
% 15.80/2.58 ($true = ((sK1 @ sK2)))),
% 15.80/2.58 inference(cnf_transformation,[],[f17])).
% 15.80/2.58 thf(f25,plain,(
% 15.80/2.58 ($true != ((ex1 @ sK0 @ (^[Y0 : $i]: (sK1 @ Y0)))))),
% 15.80/2.58 inference(cnf_transformation,[],[f17])).
% 15.80/2.58 thf(f27,definition,(
% 15.80/2.58 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 15.80/2.58 introduced(theory,[fool_exhaustiveness_axiom])).
% 15.80/2.58 thf(f28,plain,(
% 15.80/2.58 (ex1 = (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))))),
% 15.80/2.58 inference(definition_unfolding,[],[f20,f18])).
% 15.80/2.58 thf(f29,plain,(
% 15.80/2.58 ($true = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((Y0 @ Y2) => ((Y0 @ Y3) => (Y2 = Y3))))))))) => ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))) => ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))))))))))))),
% 15.80/2.58 inference(definition_unfolding,[],[f19,f21,f18])).
% 15.80/2.58 thf(f30,plain,(
% 15.80/2.58 ($true != (((^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))))))) @ sK0 @ (^[Y0 : $i]: (sK1 @ Y0)))))),
% 15.80/2.58 inference(definition_unfolding,[],[f25,f28])).
% 15.80/2.58 thf(f31,plain,(
% 15.80/2.58 ($true != ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK0 @ sK1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK0 @ sK1)))))))),
% 15.80/2.58 inference(beta-eta_normalization,[],[f30])).
% 15.80/2.58 thf(f32,plain,(
% 15.80/2.58 ( ! [X1 : $i] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ sK0 @ sK1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ sK0 @ sK1)))) @ X1)))) )),
% 15.80/2.58 inference(pi_proxy_clausification,[],[f31])).
% 15.80/2.58 thf(f33,plain,(
% 15.80/2.58 ( ! [X1 : $i] : (($false = (((in @ X1 @ (dsetconstr @ sK0 @ sK1)) & ((setadjoin @ X1 @ emptyset) = (dsetconstr @ sK0 @ sK1)))))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f32])).
% 15.80/2.58 thf(f34,plain,(
% 15.80/2.58 ( ! [X1 : $i] : (($false = (((setadjoin @ X1 @ emptyset) = (dsetconstr @ sK0 @ sK1)))) | ($false = ((in @ X1 @ (dsetconstr @ sK0 @ sK1))))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f33])).
% 15.80/2.58 thf(f35,plain,(
% 15.80/2.58 ( ! [X1 : $i] : ((((setadjoin @ X1 @ emptyset)) != ((dsetconstr @ sK0 @ sK1))) | ($false = ((in @ X1 @ (dsetconstr @ sK0 @ sK1))))) )),
% 15.80/2.58 inference(equality_proxy_clausification,[],[f34])).
% 15.80/2.58 thf(f36,plain,(
% 15.80/2.58 ( ! [X1 : ($i > $o)] : (($true = (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((Y0 @ Y2) => ((Y0 @ Y3) => (Y2 = Y3))))))))) => ((?? @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) & (Y0 @ Y2)))) => ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) & ((setadjoin @ Y3 @ emptyset) = Y2))))) @ (dsetconstr @ Y1 @ (^[Y2 : $i]: (Y0 @ Y2))))))))) @ X1)))) )),
% 15.80/2.58 inference(pi_proxy_clausification,[],[f29])).
% 15.80/2.58 thf(f37,plain,(
% 15.80/2.58 ( ! [X1 : ($i > $o)] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((X1 @ Y1) => ((X1 @ Y2) => (Y1 = Y2))))))))) => ((?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & (X1 @ Y1)))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ Y0 @ X1)) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ Y0 @ X1)))))))))))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f36])).
% 15.80/2.58 thf(f38,plain,(
% 15.80/2.58 ( ! [X2 : $i,X1 : ($i > $o)] : (($true = (((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((X1 @ Y1) => ((X1 @ Y2) => (Y1 = Y2))))))))) => ((?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & (X1 @ Y1)))) => (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (dsetconstr @ Y0 @ X1)) & ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ Y0 @ X1)))))))) @ X2)))) )),
% 15.80/2.58 inference(pi_proxy_clausification,[],[f37])).
% 15.80/2.58 thf(f39,plain,(
% 15.80/2.58 ( ! [X2 : $i,X1 : ($i > $o)] : (($true = (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1))))))))) => ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0)))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1)))))))))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f38])).
% 15.80/2.58 thf(f40,plain,(
% 15.80/2.58 ( ! [X2 : $i,X1 : ($i > $o)] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1))))))))))) | ($true = (((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0)))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1))))))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f39])).
% 15.80/2.58 thf(f41,plain,(
% 15.80/2.58 ( ! [X2 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1)))))))) @ (sK3 @ X1 @ X2)))) | ($true = (((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0)))) => (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1))))))))) )),
% 15.80/2.58 inference(sigma_proxy_clausification,[],[f40])).
% 15.80/2.58 thf(f42,plain,(
% 15.80/2.58 ( ! [X2 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1)))))))) @ (sK3 @ X1 @ X2)))) | ($false = ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0)))))) | ($true = ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1)))))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f41])).
% 15.80/2.58 thf(f43,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1)))))))) @ (sK3 @ X1 @ X2)))) | ($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0))) @ X3))) | ($true = ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1)))))))) )),
% 15.80/2.58 inference(pi_proxy_clausification,[],[f42])).
% 15.80/2.58 thf(f44,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((X1 @ Y0) => ((X1 @ Y1) => (Y0 = Y1)))))))) @ (sK3 @ X1 @ X2)))) | ($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) & (X1 @ Y0))) @ X3))) | ($true = (((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ X1)))) @ (sK4 @ X1 @ X2))))) )),
% 15.80/2.58 inference(sigma_proxy_clausification,[],[f43])).
% 15.80/2.58 thf(f45,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((in @ (sK3 @ X1 @ X2) @ X2) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))))))) | ($false = (((in @ X3 @ X2) & (X1 @ X3)))) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f44])).
% 15.80/2.58 thf(f46,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0)))))))) | ($false = (((in @ X3 @ X2) & (X1 @ X3)))) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f45])).
% 15.80/2.58 thf(f47,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | ($false = (((in @ X3 @ X2) & (X1 @ X3)))) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f45])).
% 15.80/2.58 thf(f48,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | (((X1 @ X3)) = $false) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1))))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f47])).
% 15.80/2.58 thf(f49,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | (((X1 @ X3)) = $false) | ($true = (((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f48])).
% 15.80/2.58 thf(f50,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK3 @ X1 @ X2) @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f48])).
% 15.80/2.58 thf(f51,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset)))) )),
% 15.80/2.58 inference(equality_proxy_clausification,[],[f49])).
% 15.80/2.58 thf(f52,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))) @ (sK5 @ X1 @ X2)))) | ($false = (((in @ X3 @ X2) & (X1 @ X3)))) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))))) )),
% 15.80/2.58 inference(sigma_proxy_clausification,[],[f46])).
% 15.80/2.58 thf(f53,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))) @ (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | ($true = (((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)) & ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1))))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f52])).
% 15.80/2.58 thf(f54,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))) @ (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | ($true = (((setadjoin @ (sK4 @ X1 @ X2) @ emptyset) = (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f53])).
% 15.80/2.58 thf(f55,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))) @ (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(and_proxy_clausification,[],[f53])).
% 15.80/2.58 thf(f56,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((in @ (sK5 @ X1 @ X2) @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2))))))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f55])).
% 15.80/2.58 thf(f57,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2)))))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f56])).
% 15.80/2.58 thf(f58,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK5 @ X1 @ X2) @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f56])).
% 15.80/2.58 thf(f59,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2))))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f57])).
% 15.80/2.58 thf(f60,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | ($true = ((X1 @ (sK3 @ X1 @ X2))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f57])).
% 15.80/2.58 thf(f61,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f59])).
% 15.80/2.58 thf(f62,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | ($true = ((X1 @ (sK5 @ X1 @ X2))))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f59])).
% 15.80/2.58 thf(f63,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : ((((sK3 @ X1 @ X2)) != ((sK5 @ X1 @ X2))) | (((X1 @ X3)) = $false) | ($true = ((in @ (sK4 @ X1 @ X2) @ (dsetconstr @ X2 @ X1)))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(equality_proxy_clausification,[],[f61])).
% 15.80/2.58 thf(f64,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ Y0) => ((sK3 @ X1 @ X2) = Y0))))) @ (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(equality_proxy_clausification,[],[f54])).
% 15.80/2.58 thf(f65,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((in @ (sK5 @ X1 @ X2) @ X2) => ((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2))))))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(beta-eta_normalization,[],[f64])).
% 15.80/2.58 thf(f66,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((X1 @ (sK3 @ X1 @ X2)) => ((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2)))))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f65])).
% 15.80/2.58 thf(f67,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((in @ (sK5 @ X1 @ X2) @ X2))) | ($false = ((in @ X3 @ X2))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f65])).
% 15.80/2.58 thf(f68,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((X1 @ (sK5 @ X1 @ X2)) => ((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2))))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f66])).
% 15.80/2.58 thf(f69,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((X1 @ (sK3 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f66])).
% 15.80/2.58 thf(f70,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($false = (((sK3 @ X1 @ X2) = (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f68])).
% 15.80/2.58 thf(f71,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : (($true = ((X1 @ (sK5 @ X1 @ X2)))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(imp_proxy_clausification,[],[f68])).
% 15.80/2.58 thf(f72,plain,(
% 15.80/2.58 ( ! [X2 : $i,X3 : $i,X1 : ($i > $o)] : ((((sK3 @ X1 @ X2)) != ((sK5 @ X1 @ X2))) | (((X1 @ X3)) = $false) | (((dsetconstr @ X2 @ X1)) = ((setadjoin @ (sK4 @ X1 @ X2) @ emptyset))) | ($false = ((in @ X3 @ X2)))) )),
% 15.80/2.58 inference(equality_proxy_clausification,[],[f70])).
% 15.80/2.58 thf(f82,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true != $true) | ($true != ((sK1 @ sK2))) | ($true != ((sK1 @ X0))) | (sK2 = X0) | ($true != ((in @ X0 @ sK0)))) )),
% 15.80/2.58 inference(constrained_superposition,[],[f22,f23])).
% 15.80/2.58 thf(f83,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true != ((sK1 @ sK2))) | ($true != ((sK1 @ X0))) | (sK2 = X0) | ($true != ((in @ X0 @ sK0)))) )),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f82])).
% 15.80/2.58 thf(f84,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true != ((in @ X0 @ sK0))) | (sK2 = X0) | ($true != ((sK1 @ X0)))) )),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f83,f24])).
% 15.80/2.58 thf(f341,definition,(
% 15.80/2.58 spl6_11 <=> ($true = ((sK1 @ (sK3 @ sK1 @ sK0))))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition])).
% 15.80/2.58 thf(f342,plain,(
% 15.80/2.58 ($true != ((sK1 @ (sK3 @ sK1 @ sK0)))) | spl6_11),
% 15.80/2.58 inference(avatar_component_clause,[],[f341])).
% 15.80/2.58 thf(f343,plain,(
% 15.80/2.58 ($true = ((sK1 @ (sK3 @ sK1 @ sK0)))) | ~spl6_11),
% 15.80/2.58 inference(avatar_component_clause,[],[f341])).
% 15.80/2.58 thf(f351,definition,(
% 15.80/2.58 spl6_14 <=> ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_14])],[avatar_definition])).
% 15.80/2.58 thf(f352,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | ~spl6_14),
% 15.80/2.58 inference(avatar_component_clause,[],[f351])).
% 15.80/2.58 thf(f388,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true != $true) | (sK2 = X0) | ($true != ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) )),
% 15.80/2.58 inference(constrained_superposition,[],[f84,f27])).
% 15.80/2.58 thf(f398,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true != ((sK1 @ X0))) | (sK2 = X0) | ($false = ((in @ X0 @ sK0)))) )),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f388])).
% 15.80/2.58 thf(f403,plain,(
% 15.80/2.58 ($true != $true) | (sK2 = ((sK3 @ sK1 @ sK0))) | ($false = ((in @ (sK3 @ sK1 @ sK0) @ sK0))) | ~spl6_11),
% 15.80/2.58 inference(constrained_superposition,[],[f398,f343])).
% 15.80/2.58 thf(f408,plain,(
% 15.80/2.58 (sK2 = ((sK3 @ sK1 @ sK0))) | ($false = ((in @ (sK3 @ sK1 @ sK0) @ sK0))) | ~spl6_11),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f403])).
% 15.80/2.58 thf(f415,definition,(
% 15.80/2.58 spl6_17 <=> ($false = ((in @ (sK3 @ sK1 @ sK0) @ sK0)))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_17])],[avatar_definition])).
% 15.80/2.58 thf(f417,plain,(
% 15.80/2.58 ($false = ((in @ (sK3 @ sK1 @ sK0) @ sK0))) | ~spl6_17),
% 15.80/2.58 inference(avatar_component_clause,[],[f415])).
% 15.80/2.58 thf(f419,definition,(
% 15.80/2.58 spl6_18 <=> (sK2 = ((sK3 @ sK1 @ sK0)))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_18])],[avatar_definition])).
% 15.80/2.58 thf(f421,plain,(
% 15.80/2.58 (sK2 = ((sK3 @ sK1 @ sK0))) | ~spl6_18),
% 15.80/2.58 inference(avatar_component_clause,[],[f419])).
% 15.80/2.58 thf(f422,plain,(
% 15.80/2.58 spl6_17 | spl6_18 | ~spl6_11),
% 15.80/2.58 inference(avatar_split_clause,[],[f408,f341,f419,f415])).
% 15.80/2.58 thf(f833,plain,(
% 15.80/2.58 ($true = $false) | (((sK1 @ sK2)) = $false) | ~spl6_14),
% 15.80/2.58 inference(constrained_superposition,[],[f23,f352])).
% 15.80/2.58 thf(f837,plain,(
% 15.80/2.58 (((sK1 @ sK2)) = $false) | ~spl6_14),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f833])).
% 15.80/2.58 thf(f841,plain,(
% 15.80/2.58 ($true = $false) | ~spl6_14),
% 15.80/2.58 inference(constrained_superposition,[],[f837,f24])).
% 15.80/2.58 thf(f847,plain,(
% 15.80/2.58 $false | ~spl6_14),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f841])).
% 15.80/2.58 thf(f848,plain,(
% 15.80/2.58 ~spl6_14),
% 15.80/2.58 inference(avatar_contradiction_clause,[],[f847])).
% 15.80/2.58 thf(f1510,plain,(
% 15.80/2.58 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($false = (((^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ X1))) | (((dsetconstr @ X0 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = ((setadjoin @ (sK4 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ X0) @ emptyset))) | (((in @ X1 @ X0)) = $false) | (sK0 != X0)) ) | spl6_11),
% 15.80/2.58 inference(constrained_superposition,[],[f342,f69])).
% 15.80/2.58 thf(f1514,plain,(
% 15.80/2.58 ( ! [X0 : $i,X1 : $i] : (($false = (((^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ X1))) | (((dsetconstr @ X0 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = ((setadjoin @ (sK4 @ (^[Y0 : $i]: (sK1 @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ X0) @ emptyset))) | (((in @ X1 @ X0)) = $false) | (sK0 != X0)) ) | spl6_11),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f1510])).
% 15.80/2.58 thf(f1515,plain,(
% 15.80/2.58 ( ! [X0 : $i,X1 : $i] : ((sK0 != X0) | (((dsetconstr @ X0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ X0) @ emptyset))) | (((in @ X1 @ X0)) = $false) | ($false = ((sK1 @ X1)))) ) | spl6_11),
% 15.80/2.58 inference(beta-eta_normalization,[],[f1514])).
% 15.80/2.58 thf(f1560,plain,(
% 15.80/2.58 ( ! [X0 : $i] : ((((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset))) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | spl6_11),
% 15.80/2.58 inference(equality_resolution,[],[f1515])).
% 15.80/2.58 thf(f1562,definition,(
% 15.80/2.58 spl6_33 <=> (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset)))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_33])],[avatar_definition])).
% 15.80/2.58 thf(f1563,plain,(
% 15.80/2.58 (((dsetconstr @ sK0 @ sK1)) != ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset))) | spl6_33),
% 15.80/2.58 inference(avatar_component_clause,[],[f1562])).
% 15.80/2.58 thf(f1564,plain,(
% 15.80/2.58 (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset))) | ~spl6_33),
% 15.80/2.58 inference(avatar_component_clause,[],[f1562])).
% 15.80/2.58 thf(f1565,plain,(
% 15.80/2.58 spl6_14 | spl6_33 | spl6_11),
% 15.80/2.58 inference(avatar_split_clause,[],[f1560,f341,f1562,f351])).
% 15.80/2.58 thf(f1566,plain,(
% 15.80/2.58 (((dsetconstr @ sK0 @ sK1)) != ((dsetconstr @ sK0 @ sK1))) | ($false = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f35,f1564])).
% 15.80/2.58 thf(f1567,plain,(
% 15.80/2.58 ($false = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f1566])).
% 15.80/2.58 thf(f1572,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((in @ (sK3 @ sK1 @ sK0) @ sK0)))) ) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f50,f1567])).
% 15.80/2.58 thf(f1573,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((sK1 @ (sK3 @ sK1 @ sK0))))) ) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f60,f1567])).
% 15.80/2.58 thf(f1577,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((sK1 @ (sK3 @ sK1 @ sK0))))) ) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f1573])).
% 15.80/2.58 thf(f1578,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((in @ (sK3 @ sK1 @ sK0) @ sK0)))) ) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f1572])).
% 15.80/2.58 thf(f1584,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (spl6_11 | ~spl6_33)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f1577,f342])).
% 15.80/2.58 thf(f1586,plain,(
% 15.80/2.58 spl6_14 | spl6_11 | ~spl6_33),
% 15.80/2.58 inference(avatar_split_clause,[],[f1584,f1562,f341,f351])).
% 15.80/2.58 thf(f1641,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_17 | ~spl6_33)),
% 15.80/2.58 inference(forward_demodulation,[],[f1578,f417])).
% 15.80/2.58 thf(f1642,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_17 | ~spl6_33)),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f1641])).
% 15.80/2.58 thf(f1643,plain,(
% 15.80/2.58 spl6_14 | ~spl6_17 | ~spl6_33),
% 15.80/2.58 inference(avatar_split_clause,[],[f1642,f1562,f415,f351])).
% 15.80/2.58 thf(f2505,plain,(
% 15.80/2.58 ( ! [X0 : $i] : ((((dsetconstr @ sK0 @ sK1)) != ((dsetconstr @ sK0 @ sK1))) | ($true = ((sK1 @ (sK5 @ sK1 @ sK0)))) | ($false = ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) ) | spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f1563,f71])).
% 15.80/2.58 thf(f2556,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = ((sK1 @ (sK5 @ sK1 @ sK0)))) | ($false = ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) ) | spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f2505])).
% 15.80/2.58 thf(f2795,definition,(
% 15.80/2.58 spl6_37 <=> ($true = ((sK1 @ (sK5 @ sK1 @ sK0))))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_37])],[avatar_definition])).
% 15.80/2.58 thf(f2796,plain,(
% 15.80/2.58 ($true != ((sK1 @ (sK5 @ sK1 @ sK0)))) | spl6_37),
% 15.80/2.58 inference(avatar_component_clause,[],[f2795])).
% 15.80/2.58 thf(f2797,plain,(
% 15.80/2.58 ($true = ((sK1 @ (sK5 @ sK1 @ sK0)))) | ~spl6_37),
% 15.80/2.58 inference(avatar_component_clause,[],[f2795])).
% 15.80/2.58 thf(f2798,plain,(
% 15.80/2.58 spl6_14 | spl6_37 | spl6_33),
% 15.80/2.58 inference(avatar_split_clause,[],[f2556,f1562,f2795,f351])).
% 15.80/2.58 thf(f2812,plain,(
% 15.80/2.58 ($true != $true) | (sK2 = ((sK5 @ sK1 @ sK0))) | ($false = ((in @ (sK5 @ sK1 @ sK0) @ sK0))) | ~spl6_37),
% 15.80/2.58 inference(constrained_superposition,[],[f398,f2797])).
% 15.80/2.58 thf(f2843,plain,(
% 15.80/2.58 (sK2 = ((sK5 @ sK1 @ sK0))) | ($false = ((in @ (sK5 @ sK1 @ sK0) @ sK0))) | ~spl6_37),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f2812])).
% 15.80/2.58 thf(f2868,definition,(
% 15.80/2.58 spl6_38 <=> ($false = ((in @ (sK5 @ sK1 @ sK0) @ sK0)))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_38])],[avatar_definition])).
% 15.80/2.58 thf(f2870,plain,(
% 15.80/2.58 ($false = ((in @ (sK5 @ sK1 @ sK0) @ sK0))) | ~spl6_38),
% 15.80/2.58 inference(avatar_component_clause,[],[f2868])).
% 15.80/2.58 thf(f2872,definition,(
% 15.80/2.58 spl6_39 <=> (sK2 = ((sK5 @ sK1 @ sK0)))),
% 15.80/2.58 introduced(definition,[new_symbols(definition,[spl6_39])],[avatar_definition])).
% 15.80/2.58 thf(f2874,plain,(
% 15.80/2.58 (sK2 = ((sK5 @ sK1 @ sK0))) | ~spl6_39),
% 15.80/2.58 inference(avatar_component_clause,[],[f2872])).
% 15.80/2.58 thf(f2875,plain,(
% 15.80/2.58 spl6_38 | spl6_39 | ~spl6_37),
% 15.80/2.58 inference(avatar_split_clause,[],[f2843,f2795,f2872,f2868])).
% 15.80/2.58 thf(f4080,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset)))) ) | ~spl6_17),
% 15.80/2.58 inference(constrained_superposition,[],[f417,f51])).
% 15.80/2.58 thf(f4295,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset)))) ) | ~spl6_17),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f4080])).
% 15.80/2.58 thf(f4428,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_17 | spl6_33)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f4295,f1563])).
% 15.80/2.58 thf(f4438,plain,(
% 15.80/2.58 spl6_14 | ~spl6_17 | spl6_33),
% 15.80/2.58 inference(avatar_split_clause,[],[f4428,f1562,f415,f351])).
% 15.80/2.58 thf(f8220,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset)))) ) | ~spl6_38),
% 15.80/2.58 inference(constrained_superposition,[],[f2870,f67])).
% 15.80/2.58 thf(f8544,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset)))) ) | ~spl6_38),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f8220])).
% 15.80/2.58 thf(f8733,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (spl6_33 | ~spl6_38)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f8544,f1563])).
% 15.80/2.58 thf(f8756,plain,(
% 15.80/2.58 spl6_14 | spl6_33 | ~spl6_38),
% 15.80/2.58 inference(avatar_split_clause,[],[f8733,f2868,f1562,f351])).
% 15.80/2.58 thf(f41344,plain,(
% 15.80/2.58 ( ! [X0 : $i] : ((sK2 != ((sK3 @ sK1 @ sK0))) | ($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset))) | ($false = ((in @ X0 @ sK0)))) ) | ~spl6_39),
% 15.80/2.58 inference(constrained_superposition,[],[f72,f2874])).
% 15.80/2.58 thf(f41348,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((sK1 @ X0))) | (((dsetconstr @ sK0 @ sK1)) = ((setadjoin @ (sK4 @ sK1 @ sK0) @ emptyset))) | ($false = ((in @ X0 @ sK0)))) ) | (~spl6_18 | ~spl6_39)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f41344,f421])).
% 15.80/2.58 thf(f41349,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) ) | (~spl6_18 | spl6_33 | ~spl6_39)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f41348,f1563])).
% 15.80/2.58 thf(f41350,plain,(
% 15.80/2.58 spl6_14 | ~spl6_18 | spl6_33 | ~spl6_39),
% 15.80/2.58 inference(avatar_split_clause,[],[f41349,f2872,f1562,f419,f351])).
% 15.80/2.58 thf(f42261,plain,(
% 15.80/2.58 (((dsetconstr @ sK0 @ sK1)) != ((dsetconstr @ sK0 @ sK1))) | ($false = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f35,f1564])).
% 15.80/2.58 thf(f42262,plain,(
% 15.80/2.58 ($false = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f42261])).
% 15.80/2.58 thf(f42350,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((sK1 @ (sK5 @ sK1 @ sK0))))) ) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f62,f42262])).
% 15.80/2.58 thf(f42464,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((sK1 @ (sK5 @ sK1 @ sK0))))) ) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f42350])).
% 15.80/2.58 thf(f42500,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_33 | spl6_37)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f42464,f2796])).
% 15.80/2.58 thf(f42509,plain,(
% 15.80/2.58 spl6_14 | ~spl6_33 | spl6_37),
% 15.80/2.58 inference(avatar_split_clause,[],[f42500,f2795,f1562,f351])).
% 15.80/2.58 thf(f62944,plain,(
% 15.80/2.58 ( ! [X0 : $i] : ((sK2 != ((sK3 @ sK1 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ($false = ((in @ X0 @ sK0)))) ) | ~spl6_39),
% 15.80/2.58 inference(constrained_superposition,[],[f63,f2874])).
% 15.80/2.58 thf(f62955,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((sK1 @ X0))) | ($true = ((in @ (sK4 @ sK1 @ sK0) @ (dsetconstr @ sK0 @ sK1)))) | ($false = ((in @ X0 @ sK0)))) ) | (~spl6_18 | ~spl6_39)),
% 15.80/2.58 inference(forward_subsumption_resolution,[],[f62944,f421])).
% 15.80/2.58 thf(f62960,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) ) | (~spl6_18 | ~spl6_33 | ~spl6_39)),
% 15.80/2.58 inference(forward_demodulation,[],[f62955,f42262])).
% 15.80/2.58 thf(f62961,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((sK1 @ X0))) | ($false = ((in @ X0 @ sK0)))) ) | (~spl6_18 | ~spl6_33 | ~spl6_39)),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f62960])).
% 15.80/2.58 thf(f62965,plain,(
% 15.80/2.58 spl6_14 | ~spl6_18 | ~spl6_33 | ~spl6_39),
% 15.80/2.58 inference(avatar_split_clause,[],[f62961,f2872,f1562,f419,f351])).
% 15.80/2.58 thf(f69213,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((in @ (sK5 @ sK1 @ sK0) @ sK0)))) ) | ~spl6_33),
% 15.80/2.58 inference(constrained_superposition,[],[f42262,f58])).
% 15.80/2.58 thf(f69746,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0))) | ($true = ((in @ (sK5 @ sK1 @ sK0) @ sK0)))) ) | ~spl6_33),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f69213])).
% 15.80/2.58 thf(f69987,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_33 | ~spl6_38)),
% 15.80/2.58 inference(forward_demodulation,[],[f69746,f2870])).
% 15.80/2.58 thf(f69988,plain,(
% 15.80/2.58 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK0))) | ($false = ((sK1 @ X0)))) ) | (~spl6_33 | ~spl6_38)),
% 15.80/2.58 inference(trivial_inequality_removal,[],[f69987])).
% 15.80/2.58 thf(f70007,plain,(
% 15.80/2.58 spl6_14 | ~spl6_33 | ~spl6_38),
% 15.80/2.58 inference(avatar_split_clause,[],[f69988,f2868,f1562,f351])).
% 15.80/2.58 cnf(s135, plain, ~spl6_11 | spl6_17 | spl6_18, inference(sat_conversion,[],[f422])).
% 15.80/2.58 cnf(s253, plain, ~spl6_14, inference(sat_conversion,[],[f848])).
% 15.80/2.58 cnf(s501, plain, spl6_11 | spl6_14 | spl6_33, inference(sat_conversion,[],[f1565])).
% 15.80/2.58 cnf(s513, plain, spl6_11 | spl6_14 | ~spl6_33, inference(sat_conversion,[],[f1586])).
% 15.80/2.58 cnf(s539, plain, spl6_14 | ~spl6_17 | ~spl6_33, inference(sat_conversion,[],[f1643])).
% 15.80/2.58 cnf(s779, plain, spl6_14 | spl6_33 | spl6_37, inference(sat_conversion,[],[f2798])).
% 15.80/2.58 cnf(s792, plain, ~spl6_37 | spl6_38 | spl6_39, inference(sat_conversion,[],[f2875])).
% 15.80/2.58 cnf(s1091, plain, spl6_14 | ~spl6_17 | spl6_33, inference(sat_conversion,[],[f4438])).
% 15.80/2.58 cnf(s1813, plain, spl6_14 | spl6_33 | ~spl6_38, inference(sat_conversion,[],[f8756])).
% 15.80/2.58 cnf(s5404, plain, spl6_14 | ~spl6_18 | spl6_33 | ~spl6_39, inference(sat_conversion,[],[f41350])).
% 15.80/2.58 cnf(s5940, plain, spl6_14 | ~spl6_33 | spl6_37, inference(sat_conversion,[],[f42509])).
% 15.80/2.58 cnf(s9243, plain, spl6_14 | ~spl6_18 | ~spl6_33 | ~spl6_39, inference(sat_conversion,[],[f62965])).
% 15.80/2.58 cnf(s10734, plain, spl6_14 | ~spl6_33 | ~spl6_38, inference(sat_conversion,[],[f70007])).
% 15.80/2.58 cnf(s10738, plain, spl6_11, inference(rat,[],[s501,s513,s253])).
% 15.80/2.58 cnf(s10741, plain, spl6_33 | ~spl6_18, inference(rat,[],[s792,s5404,s779,s1813,s253])).
% 15.80/2.58 cnf(s10742, plain, ~spl6_18, inference(rat,[],[s792,s9243,s5940,s10734,s10741,s253])).
% 15.80/2.58 cnf(s10744, plain, spl6_17, inference(rat,[],[s135,s10738,s10742])).
% 15.80/2.58 cnf(s10745, plain, spl6_33, inference(rat,[],[s1091,s253,s10744])).
% 15.80/2.58 cnf(s10746, plain, $false, inference(rat,[],[s539,s253,s10745,s10744])).
% 15.80/2.58 thf(f70008,plain,(
% 15.80/2.58 $false),
% 15.80/2.58 inference(avatar_sat_refutation,[],[s10746])).
% 15.80/2.58 % SZS output end Proof for theBenchmark
% 15.80/2.58 % (649574)------------------------------
% 15.80/2.58 % (649574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.80/2.58 % (649574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.80/2.58 % (649574)CaDiCaL version: 2.1.3
% 15.80/2.58 % (649574)Termination reason: Refutation
% 15.80/2.58 % (649574)Time elapsed: 2.328 s
% 15.80/2.58 % (649574)Peak memory usage: 31 MB
% 15.80/2.58 % (649574)Instructions burned: 9446 (million)
% 15.80/2.58 % (649567)Success in time 2.361 s
% 15.80/2.58 % Vampire exiting
%------------------------------------------------------------------------------