%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV460^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:38:40 AM UTC 2026
% Result : Theorem 0.19s 0.35s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV460^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n010.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 15:49:18 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.35 % (3030479)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.35 % (3030486)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1407649548:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.19/0.35 % (3030486)Instruction limit reached!
% 0.19/0.35 % (3030486)------------------------------
% 0.19/0.35 % (3030486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030486)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030486)Termination reason: Instruction limit
% 0.19/0.35 % (3030486)Termination phase: Saturation
% 0.19/0.35 % (3030486)Time elapsed: 0.002 s
% 0.19/0.35 % (3030486)Peak memory usage: 12 MB
% 0.19/0.35 % (3030486)Instructions burned: 5 (million)
% 0.19/0.35 % (3030484)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=276280242:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.19/0.35 % (3030485)lrs+10_16_si=on:nwc=1.5:random_seed=1657954126:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.19/0.35 % (3030488)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2976998700:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.19/0.35 % (3030487)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1842154135:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.19/0.35 % (3030489)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3319923459:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.19/0.35 % (3030490)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.19/0.35 % (3030490)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.19/0.35 % (3030485)Instruction limit reached!
% 0.19/0.35 % (3030485)------------------------------
% 0.19/0.35 % (3030485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030485)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030485)Termination reason: Instruction limit
% 0.19/0.35 % (3030485)Termination phase: Saturation
% 0.19/0.35 % (3030485)Time elapsed: 0.012 s
% 0.19/0.35 % (3030485)Peak memory usage: 12 MB
% 0.19/0.35 % (3030485)Instructions burned: 19 (million)
% 0.19/0.35 % (3030490)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1347694991:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.19/0.35 % (3030488)Instruction limit reached!
% 0.19/0.35 % (3030488)------------------------------
% 0.19/0.35 % (3030488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030488)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030488)Termination reason: Instruction limit
% 0.19/0.35 % (3030488)Termination phase: Saturation
% 0.19/0.35 % (3030488)Time elapsed: 0.015 s
% 0.19/0.35 % (3030488)Peak memory usage: 12 MB
% 0.19/0.35 % (3030488)Instructions burned: 25 (million)
% 0.19/0.35 % (3030496)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3977692200:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.19/0.35 % (3030496)Instruction limit reached!
% 0.19/0.35 % (3030496)------------------------------
% 0.19/0.35 % (3030496)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030496)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030496)Termination reason: Instruction limit
% 0.19/0.35 % (3030496)Termination phase: Saturation
% 0.19/0.35 % (3030496)Time elapsed: 0.002 s
% 0.19/0.35 % (3030496)Peak memory usage: 12 MB
% 0.19/0.35 % (3030496)Instructions burned: 2 (million)
% 0.19/0.35 % (3030489)Instruction limit reached!
% 0.19/0.35 % (3030489)------------------------------
% 0.19/0.35 % (3030489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030489)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030489)Termination reason: Instruction limit
% 0.19/0.35 % (3030489)Termination phase: Saturation
% 0.19/0.35 % (3030489)Time elapsed: 0.023 s
% 0.19/0.35 % (3030489)Peak memory usage: 12 MB
% 0.19/0.35 % (3030489)Instructions burned: 76 (million)
% 0.19/0.35 % (3030500)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.19/0.35 % (3030499)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1389406502:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.19/0.35 % (3030500)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=662272108:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.19/0.35 % (3030499)Instruction limit reached!
% 0.19/0.35 % (3030499)------------------------------
% 0.19/0.35 % (3030499)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030499)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030499)Termination reason: Instruction limit
% 0.19/0.35 % (3030499)Termination phase: Saturation
% 0.19/0.35 % (3030499)Time elapsed: 0.004 s
% 0.19/0.35 % (3030499)Peak memory usage: 12 MB
% 0.19/0.35 % (3030499)Instructions burned: 6 (million)
% 0.19/0.35 % (3030502)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2983317714:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.19/0.35 % (3030500)Instruction limit reached!
% 0.19/0.35 % (3030500)------------------------------
% 0.19/0.35 % (3030500)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030500)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030500)Termination reason: Instruction limit
% 0.19/0.35 % (3030500)Termination phase: Saturation
% 0.19/0.35 % (3030500)Time elapsed: 0.005 s
% 0.19/0.35 % (3030500)Peak memory usage: 12 MB
% 0.19/0.35 % (3030500)Instructions burned: 8 (million)
% 0.19/0.35 % (3030502)Instruction limit reached!
% 0.19/0.35 % (3030502)------------------------------
% 0.19/0.35 % (3030502)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030502)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030502)Termination reason: Instruction limit
% 0.19/0.35 % (3030502)Termination phase: Saturation
% 0.19/0.35 % (3030502)Time elapsed: 0.004 s
% 0.19/0.35 % (3030502)Peak memory usage: 12 MB
% 0.19/0.35 % (3030502)Instructions burned: 13 (million)
% 0.19/0.35 % (3030503)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.19/0.35 % (3030503)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.19/0.35 % (3030484)Instruction limit reached!
% 0.19/0.35 % (3030484)------------------------------
% 0.19/0.35 % (3030484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030484)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030484)Termination reason: Instruction limit
% 0.19/0.35 % (3030484)Termination phase: Saturation
% 0.19/0.35 % (3030484)Time elapsed: 0.045 s
% 0.19/0.35 % (3030484)Peak memory usage: 12 MB
% 0.19/0.35 % (3030484)Instructions burned: 88 (million)
% 0.19/0.35 % (3030503)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1428536174:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.19/0.35 % (3030509)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.19/0.35 % (3030509)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=3376157933:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.19/0.35 % (3030506)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=1962555940:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.19/0.35 % (3030509)Instruction limit reached!
% 0.19/0.35 % (3030509)------------------------------
% 0.19/0.35 % (3030509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030509)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030509)Termination reason: Instruction limit
% 0.19/0.35 % (3030509)Termination phase: Saturation
% 0.19/0.35 % (3030509)Time elapsed: 0.003 s
% 0.19/0.35 % (3030509)Peak memory usage: 12 MB
% 0.19/0.35 % (3030509)Instructions burned: 10 (million)
% 0.19/0.35 % (3030508)lrs+10_1_si=on:cs=on:random_seed=3242026306:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.19/0.35 % (3030503)Instruction limit reached!
% 0.19/0.35 % (3030503)------------------------------
% 0.19/0.35 % (3030503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030503)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030503)Termination reason: Instruction limit
% 0.19/0.35 % (3030503)Termination phase: Saturation
% 0.19/0.35 % (3030503)Time elapsed: 0.017 s
% 0.19/0.35 % (3030503)Peak memory usage: 12 MB
% 0.19/0.35 % (3030503)Instructions burned: 29 (million)
% 0.19/0.35 % (3030510)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=618235613:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.19/0.35 % (3030508)Instruction limit reached!
% 0.19/0.35 % (3030508)------------------------------
% 0.19/0.35 % (3030508)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030508)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030508)Termination reason: Instruction limit
% 0.19/0.35 % (3030508)Termination phase: Saturation
% 0.19/0.35 % (3030508)Time elapsed: 0.005 s
% 0.19/0.35 % (3030508)Peak memory usage: 12 MB
% 0.19/0.35 % (3030508)Instructions burned: 10 (million)
% 0.19/0.35 % (3030514)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3551639017:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.19/0.35 % (3030514)Refutation not found, incomplete strategy
% 0.19/0.35 % (3030514)------------------------------
% 0.19/0.35 % (3030514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030514)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030514)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.35 % (3030514)Time elapsed: 0.001 s
% 0.19/0.35 % (3030514)Peak memory usage: 12 MB
% 0.19/0.35 % (3030514)Instructions burned: 2 (million)
% 0.19/0.35 % (3030514)------------------------------
% 0.19/0.35 % (3030514)------------------------------
% 0.19/0.35 % (3030520)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=1945685657:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.19/0.35 % (3030518)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=4292525010:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.19/0.35 % (3030517)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=3579617361:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.19/0.35 % (3030510)Instruction limit reached!
% 0.19/0.35 % (3030510)------------------------------
% 0.19/0.35 % (3030510)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030510)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030510)Termination reason: Instruction limit
% 0.19/0.35 % (3030510)Termination phase: Saturation
% 0.19/0.35 % (3030510)Time elapsed: 0.023 s
% 0.19/0.35 % (3030510)Peak memory usage: 12 MB
% 0.19/0.35 % (3030510)Instructions burned: 39 (million)
% 0.19/0.35 % (3030518)Instruction limit reached!
% 0.19/0.35 % (3030518)------------------------------
% 0.19/0.35 % (3030518)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.35 % (3030518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.35 % (3030518)CaDiCaL version: 2.1.3
% 0.19/0.35 % (3030518)Termination reason: Instruction limit
% 0.19/0.35 % (3030518)Termination phase: Saturation
% 0.19/0.35 % (3030518)Time elapsed: 0.010 s
% 0.19/0.35 % (3030518)Peak memory usage: 12 MB
% 0.19/0.35 % (3030518)Instructions burned: 15 (million)
% 0.19/0.35 % (3030520) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3030479-3030520"...
% 0.19/0.35 % (3030520)...printing done.
% 0.19/0.35 % (3030520)Refutation found. Thanks to Tanya!
% 0.19/0.35 % SZS status Theorem for theBenchmark
% 0.19/0.35 % SZS output start Proof for theBenchmark
% 0.19/0.35 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.35 thf(type_def_6, type, sK0: $tType).
% 0.19/0.35 thf(func_def_0, type, 'const/sets/INTER': !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0 > $o))).
% 0.19/0.35 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:((X0 > (X0 > $o) > $o))).
% 0.19/0.35 thf(func_def_2, type, 'const/sets/DELETE': !>[X0: $tType]:(((X0 > $o) > X0 > X0 > $o))).
% 0.19/0.35 thf(func_def_4, type, vAND: ($o > $o > $o)).
% 0.19/0.35 thf(func_def_5, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.35 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.19/0.35 thf(func_def_7, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.35 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.19/0.35 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.19/0.35 thf(func_def_10, type, sK1: (sK0 > $o)).
% 0.19/0.35 thf(func_def_11, type, sK2: (sK0 > $o)).
% 0.19/0.35 thf(func_def_12, type, sK3: sK0).
% 0.19/0.35 thf(func_def_15, type, sK4: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.35 thf(func_def_16, type, sK5: sK0).
% 0.19/0.35 thf(func_def_18, type, sK7: ((sK0 > $o) > sK0)).
% 0.19/0.35 thf(func_def_19, type, sK8: ((sK0 > $o) > sK0)).
% 0.19/0.35 thf(func_def_20, type, sK9: ((sK0 > sK0) > sK0)).
% 0.19/0.35 thf(func_def_21, type, sK10: ((sK0 > $o) > sK0)).
% 0.19/0.35 thf(func_def_22, type, sK11: ((sK0 > $o) > sK0)).
% 0.19/0.35 thf(f1,axiom,(
% 0.19/0.35 ! [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : ((('const/sets/IN' @ X0 @ X2 @ X1)) = ((X1 @ X2)))),
% 0.19/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_')).
% 0.19/0.35 thf(f2,axiom,(
% 0.19/0.35 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o),X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X1 @ X2))) = ('const/sets/IN' @ X0 @ X3 @ X1) & ('const/sets/IN' @ X0 @ X3 @ X2))),
% 0.19/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_INTER_')).
% 0.19/0.35 thf(f3,axiom,(
% 0.19/0.35 ! [X0 : $tType,X3 : X0,X2 : X0,X1 : (X0 > $o)] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = ('const/sets/IN' @ X0 @ X2 @ X1) & (X2 != X3))),
% 0.19/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_DELETE_')).
% 0.19/0.35 thf(f5,conjecture,(
% 0.19/0.35 ! [X0 : $tType,X3 : X0,X2 : (X0 > $o),X1 : (X0 > $o)] : ((('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X3) @ X2)) = (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X1 @ X2) @ X3)))),
% 0.19/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/DELETE_INTER_')).
% 0.19/0.35 thf(f6,negated_conjecture,(
% 0.19/0.35 ~ ! [X0 : $tType,X3 : X0,X2 : (X0 > $o),X1 : (X0 > $o)] : ((('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X3) @ X2)) = (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X1 @ X2) @ X3)))),
% 0.19/0.35 inference(negated_conjecture,[status(cth)],[f5])).
% 0.19/0.35 thf(f7,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o),X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X2 @ X1))) = ('const/sets/IN' @ X0 @ X3 @ X2) & ('const/sets/IN' @ X0 @ X3 @ X1))),
% 0.19/0.35 inference(rectify,[],[f2])).
% 0.19/0.35 thf(f8,plain,(
% 0.19/0.35 ! [X0 : $tType,X3 : X0,X1 : (X0 > $o),X2 : (X0 > $o)] : (((('const/sets/IN' @ X0 @ X3 @ X1) & ('const/sets/IN' @ X0 @ X3 @ X2))) = (('const/sets/IN' @ X0 @ X3 @ ('const/sets/INTER' @ X0 @ X2 @ X1))))),
% 0.19/0.35 inference(fool_elimination,[],[f7])).
% 0.19/0.35 thf(f9,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : X0,X2 : X0,X3 : (X0 > $o)] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X3 @ X1))) = ('const/sets/IN' @ X0 @ X2 @ X3) & (X1 != X2))),
% 0.19/0.35 inference(rectify,[],[f3])).
% 0.19/0.35 thf(f10,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : X0,X3 : (X0 > $o),X2 : X0] : ((((~ (X1 = X2)) & ('const/sets/IN' @ X0 @ X2 @ X3))) = (('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X3 @ X1))))),
% 0.19/0.35 inference(fool_elimination,[],[f9])).
% 0.19/0.35 thf(f13,plain,(
% 0.19/0.35 ~ ! [X0 : $tType,X1 : X0,X2 : (X0 > $o),X3 : (X0 > $o)] : ((('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X3 @ X1) @ X2)) = (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X3 @ X2) @ X1)))),
% 0.19/0.35 inference(rectify,[],[f6])).
% 0.19/0.35 thf(f14,plain,(
% 0.19/0.35 ? [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : ((('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X3 @ X1) @ X2)) != (('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X3 @ X2) @ X1)))),
% 0.19/0.35 inference(ennf_transformation,[],[f13])).
% 0.19/0.35 thf(f15,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : X0,X2 : (X0 > $o)] : ((('const/sets/IN' @ X0 @ X1 @ X2)) = ((X2 @ X1)))),
% 0.19/0.35 inference(rectify,[],[f1])).
% 0.19/0.35 thf(f16,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : X0,X2 : (X0 > $o),X3 : X0] : ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = (((~ (X1 = X3)) & ('const/sets/IN' @ X0 @ X3 @ X2))))),
% 0.19/0.35 inference(rectify,[],[f10])).
% 0.19/0.35 thf(f17,plain,(
% 0.19/0.35 ! [X0 : $tType,X1 : X0,X2 : (X0 > $o),X3 : (X0 > $o)] : ((('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2))) = ((('const/sets/IN' @ X0 @ X1 @ X2) & ('const/sets/IN' @ X0 @ X1 @ X3))))),
% 0.19/0.36 inference(rectify,[],[f8])).
% 0.19/0.36 thf(f18,plain,(
% 0.19/0.36 ? [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o),X3 : X0] : ((('const/sets/DELETE' @ X0 @ ('const/sets/INTER' @ X0 @ X2 @ X1) @ X3)) != (('const/sets/INTER' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1)))),
% 0.19/0.36 inference(rectify,[],[f14])).
% 0.19/0.36 thf(f19,plain,(
% 0.19/0.36 ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3)))),
% 0.19/0.36 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f18])).
% 0.19/0.36 thf(f20,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ X2)) = ((X2 @ X1)))) )),
% 0.19/0.36 inference(cnf_transformation,[],[f15])).
% 0.19/0.36 thf(f21,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = (((~ (X1 = X3)) & ('const/sets/IN' @ X0 @ X3 @ X2))))) )),
% 0.19/0.36 inference(cnf_transformation,[],[f16])).
% 0.19/0.36 thf(f23,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2))) = ((('const/sets/IN' @ X0 @ X1 @ X2) & ('const/sets/IN' @ X0 @ X1 @ X3))))) )),
% 0.19/0.36 inference(cnf_transformation,[],[f17])).
% 0.19/0.36 thf(f24,plain,(
% 0.19/0.36 ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1)) != (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3)))),
% 0.19/0.36 inference(cnf_transformation,[],[f19])).
% 0.19/0.36 thf(f26,definition,(
% 0.19/0.36 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.19/0.36 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.19/0.36 thf(f27,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((((~ (X1 = X3)) & ('const/sets/IN' @ X0 @ X3 @ X2))) = $false) | ($true = (('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))))) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f21])).
% 0.19/0.36 thf(f28,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $false) | ($true = (((~ (X1 = X3)) & ('const/sets/IN' @ X0 @ X3 @ X2))))) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f21])).
% 0.19/0.36 thf(f29,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $false) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true)) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f28])).
% 0.19/0.36 thf(f30,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = ((~ (X1 = X3)))) | ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $false)) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f28])).
% 0.19/0.36 thf(f31,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $false) | (((X1 = X3)) = $false)) )),
% 0.19/0.36 inference(not_proxy_clausification,[],[f30])).
% 0.19/0.36 thf(f32,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $false) | (X1 != X3)) )),
% 0.19/0.36 inference(equality_proxy_clausification,[],[f31])).
% 0.19/0.36 thf(f33,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : ((((~ (X1 = X3))) = $false) | ($true = (('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1)))) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $false)) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f27])).
% 0.19/0.36 thf(f34,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = ((X1 = X3))) | ($true = (('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1)))) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $false)) )),
% 0.19/0.36 inference(not_proxy_clausification,[],[f33])).
% 0.19/0.36 thf(f35,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = (('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1)))) | (X1 = X3) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $false)) )),
% 0.19/0.36 inference(equality_proxy_clausification,[],[f34])).
% 0.19/0.36 thf(f36,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (($true = (('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2)))) | ($false = ((('const/sets/IN' @ X0 @ X1 @ X2) & ('const/sets/IN' @ X0 @ X1 @ X3))))) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f23])).
% 0.19/0.36 thf(f37,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2))) = $false) | ($true = ((('const/sets/IN' @ X0 @ X1 @ X2) & ('const/sets/IN' @ X0 @ X1 @ X3))))) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f23])).
% 0.19/0.36 thf(f38,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2))) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X3)))) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f37])).
% 0.19/0.36 thf(f39,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2))) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X2)))) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f37])).
% 0.19/0.36 thf(f40,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (($true = (('const/sets/IN' @ X0 @ X1 @ ('const/sets/INTER' @ X0 @ X3 @ X2)))) | ((('const/sets/IN' @ X0 @ X1 @ X2)) = $false) | ((('const/sets/IN' @ X0 @ X1 @ X3)) = $false)) )),
% 0.19/0.36 inference(and_proxy_clausification,[],[f36])).
% 0.19/0.36 thf(f55,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : X0] : (($true = (('const/sets/IN' @ X0 @ X1 @ X2))) | (((X2 @ X1)) = $false)) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f20])).
% 0.19/0.36 thf(f56,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ X2)) = $false) | ($true = ((X2 @ X1)))) )),
% 0.19/0.36 inference(iff_proxy_clausification,[],[f20])).
% 0.19/0.36 thf(f57,plain,(
% 0.19/0.36 ((('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)) != (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)))),
% 0.19/0.36 inference(negative_extensionality,[],[f24])).
% 0.19/0.36 thf(f58,plain,(
% 0.19/0.36 ($true = (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5))) | ($true = (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)))),
% 0.19/0.36 inference(xor_proxy_clausification,[],[f57])).
% 0.19/0.36 thf(f59,plain,(
% 0.19/0.36 ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)) = $false) | ((('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)) = $false)),
% 0.19/0.36 inference(xor_proxy_clausification,[],[f57])).
% 0.19/0.36 thf(f61,definition,(
% 0.19/0.36 spl6_1 <=> ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)) = $false)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition])).
% 0.19/0.36 thf(f63,plain,(
% 0.19/0.36 ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)) = $false) | ~spl6_1),
% 0.19/0.36 inference(avatar_component_clause,[],[f61])).
% 0.19/0.36 thf(f65,definition,(
% 0.19/0.36 spl6_2 <=> ((('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)) = $false)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition])).
% 0.19/0.36 thf(f67,plain,(
% 0.19/0.36 ((('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)) = $false) | ~spl6_2),
% 0.19/0.36 inference(avatar_component_clause,[],[f65])).
% 0.19/0.36 thf(f68,plain,(
% 0.19/0.36 spl6_1 | spl6_2),
% 0.19/0.36 inference(avatar_split_clause,[],[f59,f65,f61])).
% 0.19/0.36 thf(f70,definition,(
% 0.19/0.36 spl6_3 <=> ($true = (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)))),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition])).
% 0.19/0.36 thf(f71,plain,(
% 0.19/0.36 ($true != (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5))) | spl6_3),
% 0.19/0.36 inference(avatar_component_clause,[],[f70])).
% 0.19/0.36 thf(f72,plain,(
% 0.19/0.36 ($true = (('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5))) | ~spl6_3),
% 0.19/0.36 inference(avatar_component_clause,[],[f70])).
% 0.19/0.36 thf(f74,definition,(
% 0.19/0.36 spl6_4 <=> ($true = (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5)))),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition])).
% 0.19/0.36 thf(f76,plain,(
% 0.19/0.36 ($true = (('const/sets/DELETE' @ sK0 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1) @ sK3 @ sK5))) | ~spl6_4),
% 0.19/0.36 inference(avatar_component_clause,[],[f74])).
% 0.19/0.36 thf(f77,plain,(
% 0.19/0.36 spl6_3 | spl6_4),
% 0.19/0.36 inference(avatar_split_clause,[],[f58,f74,f70])).
% 0.19/0.36 thf(f90,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/IN' @ X0 @ X1 @ X3)) = $false) | ($true = (('const/sets/INTER' @ X0 @ X2 @ X3 @ X1))) | ((('const/sets/IN' @ X0 @ X1 @ X2)) = $false) | ($true = $false)) )),
% 0.19/0.36 inference(superposition,[],[f40,f56])).
% 0.19/0.36 thf(f93,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (($true = (('const/sets/INTER' @ X0 @ X2 @ X3 @ X1))) | ((('const/sets/IN' @ X0 @ X1 @ X3)) = $false) | ((('const/sets/IN' @ X0 @ X1 @ X2)) = $false)) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f90])).
% 0.19/0.36 thf(f99,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = $false) | ($false = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1))) | (X1 != X3)) )),
% 0.19/0.36 inference(superposition,[],[f55,f32])).
% 0.19/0.36 thf(f101,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($false = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1))) | (X1 != X3)) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f99])).
% 0.19/0.36 thf(f104,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1)) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X2))) | ($true = $false)) )),
% 0.19/0.36 inference(superposition,[],[f38,f55])).
% 0.19/0.36 thf(f108,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1)) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X2)))) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f104])).
% 0.19/0.36 thf(f116,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (($true = $false) | ((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1)) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X3)))) )),
% 0.19/0.36 inference(superposition,[],[f39,f55])).
% 0.19/0.36 thf(f122,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : (X0 > $o),X1 : X0] : (((('const/sets/INTER' @ X0 @ X2 @ X3 @ X1)) = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X3)))) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f116])).
% 0.19/0.36 thf(f125,plain,(
% 0.19/0.36 ($true = $false) | ($true = (('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3)))) | ~spl6_3),
% 0.19/0.36 inference(superposition,[],[f108,f72])).
% 0.19/0.36 thf(f129,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3)))) | ~spl6_3),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f125])).
% 0.19/0.36 thf(f131,plain,(
% 0.19/0.36 ($true = $false) | (sK5 != sK3) | ~spl6_3),
% 0.19/0.36 inference(superposition,[],[f129,f32])).
% 0.19/0.36 thf(f136,plain,(
% 0.19/0.36 (sK5 != sK3) | ~spl6_3),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f131])).
% 0.19/0.36 thf(f141,plain,(
% 0.19/0.36 ($true = $false) | ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK1))) | ~spl6_3),
% 0.19/0.36 inference(superposition,[],[f72,f122])).
% 0.19/0.36 thf(f142,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK1))) | ~spl6_3),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f141])).
% 0.19/0.36 thf(f164,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = $false) | ($true = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1))) | (X1 = X3) | ((('const/sets/IN' @ X0 @ X1 @ X2)) = $false)) )),
% 0.19/0.36 inference(superposition,[],[f56,f35])).
% 0.19/0.36 thf(f165,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1))) | ((('const/sets/IN' @ X0 @ X1 @ X2)) = $false) | (X1 = X3)) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f164])).
% 0.19/0.36 thf(f196,plain,(
% 0.19/0.36 ($true = $false) | (sK5 = sK3) | ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) = $false) | ~spl6_2),
% 0.19/0.36 inference(superposition,[],[f165,f67])).
% 0.19/0.36 thf(f200,plain,(
% 0.19/0.36 (sK5 = sK3) | ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) = $false) | ~spl6_2),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f196])).
% 0.19/0.36 thf(f202,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(forward_subsumption_resolution,[],[f200,f136])).
% 0.19/0.36 thf(f204,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false) | ($true = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(superposition,[],[f202,f40])).
% 0.19/0.36 thf(f210,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f204])).
% 0.19/0.36 thf(f214,plain,(
% 0.19/0.36 ($true = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(forward_demodulation,[],[f210,f142])).
% 0.19/0.36 thf(f215,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f214])).
% 0.19/0.36 thf(f220,plain,(
% 0.19/0.36 ($true = $false) | ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK2))) | ~spl6_3),
% 0.19/0.36 inference(superposition,[],[f29,f129])).
% 0.19/0.36 thf(f223,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($true = $false) | ($true = (('const/sets/IN' @ X0 @ X1 @ X2))) | ($false = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1)))) )),
% 0.19/0.36 inference(superposition,[],[f55,f29])).
% 0.19/0.36 thf(f226,plain,(
% 0.19/0.36 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (($false = (('const/sets/DELETE' @ X0 @ X2 @ X3 @ X1))) | ($true = (('const/sets/IN' @ X0 @ X1 @ X2)))) )),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f223])).
% 0.19/0.36 thf(f228,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK2))) | ~spl6_3),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f220])).
% 0.19/0.36 thf(f288,plain,(
% 0.19/0.36 ($true = $false) | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(superposition,[],[f215,f228])).
% 0.19/0.36 thf(f293,plain,(
% 0.19/0.36 $false | (~spl6_2 | ~spl6_3)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f288])).
% 0.19/0.36 thf(f294,plain,(
% 0.19/0.36 ~spl6_2 | ~spl6_3),
% 0.19/0.36 inference(avatar_contradiction_clause,[],[f293])).
% 0.19/0.36 thf(f303,plain,(
% 0.19/0.36 ($true = $false) | (~spl6_1 | ~spl6_3)),
% 0.19/0.36 inference(superposition,[],[f72,f63])).
% 0.19/0.36 thf(f307,plain,(
% 0.19/0.36 $false | (~spl6_1 | ~spl6_3)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f303])).
% 0.19/0.36 thf(f308,plain,(
% 0.19/0.36 ~spl6_1 | ~spl6_3),
% 0.19/0.36 inference(avatar_contradiction_clause,[],[f307])).
% 0.19/0.36 thf(f319,definition,(
% 0.19/0.36 spl6_5 <=> ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) = $false)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition])).
% 0.19/0.36 thf(f320,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) != $false) | spl6_5),
% 0.19/0.36 inference(avatar_component_clause,[],[f319])).
% 0.19/0.36 thf(f321,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1))) = $false) | ~spl6_5),
% 0.19/0.36 inference(avatar_component_clause,[],[f319])).
% 0.19/0.36 thf(f323,definition,(
% 0.19/0.36 spl6_6 <=> (sK5 = sK3)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition])).
% 0.19/0.36 thf(f324,plain,(
% 0.19/0.36 (sK5 != sK3) | spl6_6),
% 0.19/0.36 inference(avatar_component_clause,[],[f323])).
% 0.19/0.36 thf(f373,plain,(
% 0.19/0.36 ($true != $true) | ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)) = $false) | spl6_3),
% 0.19/0.36 inference(superposition,[],[f71,f26])).
% 0.19/0.36 thf(f375,plain,(
% 0.19/0.36 ((('const/sets/INTER' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3) @ sK1 @ sK5)) = $false) | spl6_3),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f373])).
% 0.19/0.36 thf(f377,definition,(
% 0.19/0.36 spl6_9 <=> ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3))) = $false)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition])).
% 0.19/0.36 thf(f379,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3))) = $false) | ~spl6_9),
% 0.19/0.36 inference(avatar_component_clause,[],[f377])).
% 0.19/0.36 thf(f381,definition,(
% 0.19/0.36 spl6_10 <=> ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false)),
% 0.19/0.36 introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition])).
% 0.19/0.36 thf(f383,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false) | ~spl6_10),
% 0.19/0.36 inference(avatar_component_clause,[],[f381])).
% 0.19/0.36 thf(f385,plain,(
% 0.19/0.36 spl6_1 | spl6_3),
% 0.19/0.36 inference(avatar_split_clause,[],[f375,f70,f61])).
% 0.19/0.36 thf(f386,plain,(
% 0.19/0.36 ($true = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3))) = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false) | ~spl6_1),
% 0.19/0.36 inference(superposition,[],[f63,f93])).
% 0.19/0.36 thf(f391,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK1)) = $false) | ((('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK3))) = $false) | ~spl6_1),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f386])).
% 0.19/0.36 thf(f394,plain,(
% 0.19/0.36 spl6_10 | spl6_9 | ~spl6_1),
% 0.19/0.36 inference(avatar_split_clause,[],[f391,f61,f377,f381])).
% 0.19/0.36 thf(f395,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (sK5 = sK3) | ($true = $false) | ~spl6_9),
% 0.19/0.36 inference(superposition,[],[f379,f35])).
% 0.19/0.36 thf(f400,plain,(
% 0.19/0.36 (sK5 = sK3) | ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | ~spl6_9),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f395])).
% 0.19/0.36 thf(f405,plain,(
% 0.19/0.36 ((('const/sets/IN' @ sK0 @ sK5 @ sK2)) = $false) | (spl6_6 | ~spl6_9)),
% 0.19/0.36 inference(forward_subsumption_resolution,[],[f400,f324])).
% 0.19/0.36 thf(f422,plain,(
% 0.19/0.36 (sK5 != sK3) | ($true = $false) | ~spl6_4),
% 0.19/0.36 inference(superposition,[],[f76,f101])).
% 0.19/0.36 thf(f426,plain,(
% 0.19/0.36 (sK5 != sK3) | ~spl6_4),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f422])).
% 0.19/0.36 thf(f494,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1)))) | ($true = $false) | ~spl6_4),
% 0.19/0.36 inference(superposition,[],[f226,f76])).
% 0.19/0.36 thf(f500,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ ('const/sets/INTER' @ sK0 @ sK2 @ sK1)))) | ~spl6_4),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f494])).
% 0.19/0.36 thf(f508,plain,(
% 0.19/0.36 ($true = $false) | (~spl6_4 | ~spl6_5)),
% 0.19/0.36 inference(forward_demodulation,[],[f500,f321])).
% 0.19/0.36 thf(f509,plain,(
% 0.19/0.36 $false | (~spl6_4 | ~spl6_5)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f508])).
% 0.19/0.36 thf(f510,plain,(
% 0.19/0.36 ~spl6_4 | ~spl6_5),
% 0.19/0.36 inference(avatar_contradiction_clause,[],[f509])).
% 0.19/0.36 thf(f519,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK1))) | ($false != $false) | spl6_5),
% 0.19/0.36 inference(superposition,[],[f320,f39])).
% 0.19/0.36 thf(f520,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK2))) | ($false != $false) | spl6_5),
% 0.19/0.36 inference(superposition,[],[f320,f38])).
% 0.19/0.36 thf(f529,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK1))) | spl6_5),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f519])).
% 0.19/0.36 thf(f530,plain,(
% 0.19/0.36 ($true = (('const/sets/IN' @ sK0 @ sK5 @ sK2))) | spl6_5),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f520])).
% 0.19/0.36 thf(f531,plain,(
% 0.19/0.36 ($true = $false) | (spl6_5 | spl6_6 | ~spl6_9)),
% 0.19/0.36 inference(forward_demodulation,[],[f530,f405])).
% 0.19/0.36 thf(f532,plain,(
% 0.19/0.36 $false | (spl6_5 | spl6_6 | ~spl6_9)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f531])).
% 0.19/0.36 thf(f533,plain,(
% 0.19/0.36 spl6_5 | spl6_6 | ~spl6_9),
% 0.19/0.36 inference(avatar_contradiction_clause,[],[f532])).
% 0.19/0.36 thf(f585,plain,(
% 0.19/0.36 ($true = $false) | (spl6_5 | ~spl6_10)),
% 0.19/0.36 inference(forward_demodulation,[],[f529,f383])).
% 0.19/0.36 thf(f586,plain,(
% 0.19/0.36 $false | (spl6_5 | ~spl6_10)),
% 0.19/0.36 inference(trivial_inequality_removal,[],[f585])).
% 0.19/0.36 thf(f587,plain,(
% 0.19/0.36 spl6_5 | ~spl6_10),
% 0.19/0.36 inference(avatar_contradiction_clause,[],[f586])).
% 0.19/0.36 thf(f597,plain,(
% 0.19/0.36 ~spl6_6 | ~spl6_4),
% 0.19/0.36 inference(avatar_split_clause,[],[f426,f74,f323])).
% 0.19/0.36 cnf(s1, plain, spl6_1 | spl6_2, inference(sat_conversion,[],[f68])).
% 0.19/0.36 cnf(s2, plain, spl6_3 | spl6_4, inference(sat_conversion,[],[f77])).
% 0.19/0.36 cnf(s3, plain, ~spl6_2 | ~spl6_3, inference(sat_conversion,[],[f294])).
% 0.19/0.36 cnf(s6, plain, ~spl6_1 | ~spl6_3, inference(sat_conversion,[],[f308])).
% 0.19/0.36 cnf(s16, plain, spl6_1 | spl6_3, inference(sat_conversion,[],[f385])).
% 0.19/0.36 cnf(s18, plain, ~spl6_1 | spl6_9 | spl6_10, inference(sat_conversion,[],[f394])).
% 0.19/0.36 cnf(s21, plain, ~spl6_4 | ~spl6_5, inference(sat_conversion,[],[f510])).
% 0.19/0.36 cnf(s23, plain, spl6_5 | spl6_6 | ~spl6_9, inference(sat_conversion,[],[f533])).
% 0.19/0.36 cnf(s24, plain, spl6_5 | ~spl6_10, inference(sat_conversion,[],[f587])).
% 0.19/0.36 cnf(s25, plain, ~spl6_4 | ~spl6_6, inference(sat_conversion,[],[f597])).
% 0.19/0.36 cnf(s36, plain, spl6_1, inference(rat,[],[s3,s1,s16])).
% 0.19/0.36 cnf(s37, plain, ~spl6_3, inference(rat,[],[s6,s36])).
% 0.19/0.36 cnf(s38, plain, spl6_4, inference(rat,[],[s2,s37])).
% 0.19/0.36 cnf(s39, plain, ~spl6_6, inference(rat,[],[s25,s38])).
% 0.19/0.36 cnf(s40, plain, ~spl6_5, inference(rat,[],[s21,s38])).
% 0.19/0.36 cnf(s42, plain, ~spl6_10, inference(rat,[],[s24,s40])).
% 0.19/0.36 cnf(s43, plain, ~spl6_9, inference(rat,[],[s23,s39,s40])).
% 0.19/0.36 cnf(s44, plain, $false, inference(rat,[],[s18,s36,s43,s42])).
% 0.19/0.36 thf(f611,plain,(
% 0.19/0.36 $false),
% 0.19/0.36 inference(avatar_sat_refutation,[],[s44])).
% 0.19/0.36 % SZS output end Proof for theBenchmark
% 0.19/0.36 % (3030520)------------------------------
% 0.19/0.36 % (3030520)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.36 % (3030520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.36 % (3030520)CaDiCaL version: 2.1.3
% 0.19/0.36 % (3030520)Termination reason: Refutation
% 0.19/0.36 % (3030520)Time elapsed: 0.015 s
% 0.19/0.36 % (3030520)Peak memory usage: 13 MB
% 0.19/0.36 % (3030520)Instructions burned: 46 (million)
% 0.19/0.36 % (3030479)Success in time 0.135 s
% 0.19/0.36 % Vampire exiting
%------------------------------------------------------------------------------