%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU704^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:30:51 AM UTC 2026
% Result : Theorem 0.96s 0.46s
% Output : Refutation 0.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU704^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:18:20 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.34 % (1309597)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.34 % (1309604)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=868386060:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.34 % (1309604)Instruction limit reached!
% 0.22/0.34 % (1309604)------------------------------
% 0.22/0.34 % (1309604)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.34 % (1309604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.34 % (1309604)CaDiCaL version: 2.1.3
% 0.22/0.34 % (1309604)Termination reason: Instruction limit
% 0.22/0.34 % (1309604)Termination phase: Saturation
% 0.22/0.34 % (1309604)Time elapsed: 0.002 s
% 0.22/0.34 % (1309604)Peak memory usage: 11 MB
% 0.22/0.34 % (1309604)Instructions burned: 5 (million)
% 0.22/0.34 % (1309608)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.34 % (1309608)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.22/0.34 % (1309602)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=46664818:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.34 % (1309603)lrs+10_16_si=on:nwc=1.5:random_seed=1417759543:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.34 % (1309606)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=647560018:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.34 % (1309607)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2934263729:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.34 % (1309605)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=361977596: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.22/0.34 % (1309608)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=3183615793:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.34 % (1309608)Refutation not found, incomplete strategy
% 0.22/0.34 % (1309608)------------------------------
% 0.22/0.34 % (1309608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.34 % (1309608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.34 % (1309608)CaDiCaL version: 2.1.3
% 0.22/0.34 % (1309608)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.34 % (1309608)Time elapsed: 0.009 s
% 0.22/0.34 % (1309608)Peak memory usage: 12 MB
% 0.22/0.34 % (1309608)Instructions burned: 16 (million)
% 0.22/0.34 % (1309603)Instruction limit reached!
% 0.22/0.34 % (1309603)------------------------------
% 0.22/0.34 % (1309603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.34 % (1309603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.34 % (1309603)CaDiCaL version: 2.1.3
% 0.22/0.34 % (1309603)Termination reason: Instruction limit
% 0.22/0.34 % (1309603)Termination phase: Saturation
% 0.22/0.34 % (1309603)Time elapsed: 0.011 s
% 0.22/0.34 % (1309603)Peak memory usage: 12 MB
% 0.22/0.34 % (1309603)Instructions burned: 19 (million)
% 0.22/0.34 % (1309608)------------------------------
% 0.22/0.34 % (1309608)------------------------------
% 0.22/0.34 % (1309606)Instruction limit reached!
% 0.22/0.34 % (1309606)------------------------------
% 0.22/0.34 % (1309606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.34 % (1309606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.34 % (1309606)CaDiCaL version: 2.1.3
% 0.22/0.34 % (1309605)Refutation not found, incomplete strategy
% 0.22/0.34 % (1309605)------------------------------
% 0.22/0.34 % (1309605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.34 % (1309606)Termination reason: Instruction limit
% 0.22/0.34 % (1309606)Termination phase: Saturation
% 0.22/0.34 % (1309606)Time elapsed: 0.013 s
% 0.22/0.34 % (1309605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1309606)Peak memory usage: 12 MB
% 0.22/0.37 % (1309605)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1309605)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.37 % (1309605)Time elapsed: 0.013 s
% 0.22/0.37 % (1309606)Instructions burned: 24 (million)
% 0.22/0.37 % (1309605)Peak memory usage: 12 MB
% 0.22/0.37 % (1309605)Instructions burned: 41 (million)
% 0.22/0.37 % (1309605)------------------------------
% 0.22/0.37 % (1309605)------------------------------
% 0.22/0.37 % (1309610)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3756587600:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.37 % (1309610)Instruction limit reached!
% 0.22/0.37 % (1309610)------------------------------
% 0.22/0.37 % (1309610)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.37 % (1309610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1309610)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1309610)Termination reason: Instruction limit
% 0.22/0.37 % (1309610)Termination phase: Property scanning
% 0.22/0.37 % (1309610)Time elapsed: 0.002 s
% 0.22/0.37 % (1309610)Peak memory usage: 10 MB
% 0.22/0.37 % (1309610)Instructions burned: 4 (million)
% 0.22/0.37 % (1309602)Refutation not found, incomplete strategy
% 0.22/0.37 % (1309602)------------------------------
% 0.22/0.37 % (1309602)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.37 % (1309602)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1309602)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1309602)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.37 % (1309602)Time elapsed: 0.020 s
% 0.22/0.37 % (1309602)Peak memory usage: 12 MB
% 0.22/0.37 % (1309602)Instructions burned: 37 (million)
% 0.22/0.37 % (1309602)------------------------------
% 0.22/0.37 % (1309602)------------------------------
% 0.22/0.37 % (1309617)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=822406439:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.22/0.37 % (1309617)Instruction limit reached!
% 0.22/0.37 % (1309617)------------------------------
% 0.22/0.37 % (1309617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.37 % (1309617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1309617)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1309618)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.22/0.37 % (1309617)Termination reason: Instruction limit
% 0.22/0.37 % (1309617)Termination phase: Saturation
% 0.22/0.37 % (1309617)Time elapsed: 0.002 s
% 0.22/0.37 % (1309617)Peak memory usage: 11 MB
% 0.22/0.37 % (1309617)Instructions burned: 6 (million)
% 0.22/0.37 % (1309620)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.22/0.37 % (1309620)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.22/0.37 % (1309618)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3833315286:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.22/0.37 % (1309619)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1457154046:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.22/0.37 % (1309620)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3800517136: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.22/0.37 % (1309618)Instruction limit reached!
% 0.22/0.37 % (1309618)------------------------------
% 0.22/0.37 % (1309618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.37 % (1309618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.37 % (1309618)CaDiCaL version: 2.1.3
% 0.22/0.37 % (1309618)Termination reason: Instruction limit
% 0.22/0.37 % (1309618)Termination phase: Saturation
% 0.22/0.37 % (1309618)Time elapsed: 0.003 s
% 0.22/0.37 % (1309618)Peak memory usage: 12 MB
% 0.22/0.37 % (1309618)Instructions burned: 7 (million)
% 0.22/0.37 % (1309622)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=3304642599:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.96/0.39 % (1309625)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.96/0.39 % (1309625)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=932250606:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.96/0.39 % (1309623)lrs+10_1_si=on:cs=on:random_seed=1543579745:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.96/0.39 % (1309625)Instruction limit reached!
% 0.96/0.39 % (1309625)------------------------------
% 0.96/0.39 % (1309625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309625)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309625)Termination reason: Instruction limit
% 0.96/0.39 % (1309625)Termination phase: Property scanning
% 0.96/0.39 % (1309625)Time elapsed: 0.0000 s
% 0.96/0.39 % (1309625)Peak memory usage: 10 MB
% 0.96/0.39 % (1309625)Instructions burned: 2 (million)
% 0.96/0.39 % (1309619)Instruction limit reached!
% 0.96/0.39 % (1309619)------------------------------
% 0.96/0.39 % (1309619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309619)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309619)Termination reason: Instruction limit
% 0.96/0.39 % (1309619)Termination phase: Saturation
% 0.96/0.39 % (1309619)Time elapsed: 0.007 s
% 0.96/0.39 % (1309619)Peak memory usage: 12 MB
% 0.96/0.39 % (1309619)Instructions burned: 13 (million)
% 0.96/0.39 % (1309607)Instruction limit reached!
% 0.96/0.39 % (1309607)------------------------------
% 0.96/0.39 % (1309607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309607)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309607)Termination reason: Instruction limit
% 0.96/0.39 % (1309607)Termination phase: Saturation
% 0.96/0.39 % (1309607)Time elapsed: 0.041 s
% 0.96/0.39 % (1309607)Peak memory usage: 13 MB
% 0.96/0.39 % (1309607)Instructions burned: 75 (million)
% 0.96/0.39 % (1309623)Instruction limit reached!
% 0.96/0.39 % (1309623)------------------------------
% 0.96/0.39 % (1309623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309623)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309623)Termination reason: Instruction limit
% 0.96/0.39 % (1309623)Termination phase: Saturation
% 0.96/0.39 % (1309623)Time elapsed: 0.005 s
% 0.96/0.39 % (1309623)Peak memory usage: 11 MB
% 0.96/0.39 % (1309623)Instructions burned: 10 (million)
% 0.96/0.39 % (1309620)Instruction limit reached!
% 0.96/0.39 % (1309620)------------------------------
% 0.96/0.39 % (1309620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309620)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309620)Termination reason: Instruction limit
% 0.96/0.39 % (1309620)Termination phase: Saturation
% 0.96/0.39 % (1309620)Time elapsed: 0.013 s
% 0.96/0.39 % (1309620)Peak memory usage: 12 MB
% 0.96/0.39 % (1309620)Instructions burned: 28 (million)
% 0.96/0.39 % (1309633)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=2996131440:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.96/0.39 % (1309633)Refutation not found, incomplete strategy
% 0.96/0.39 % (1309633)------------------------------
% 0.96/0.39 % (1309633)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.39 % (1309633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.39 % (1309633)CaDiCaL version: 2.1.3
% 0.96/0.39 % (1309633)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.39 % (1309633)Time elapsed: 0.004 s
% 0.96/0.39 % (1309633)Peak memory usage: 12 MB
% 0.96/0.39 % (1309633)Instructions burned: 12 (million)
% 0.96/0.39 % (1309633)------------------------------
% 0.96/0.39 % (1309633)------------------------------
% 0.96/0.39 % (1309629)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3632518611:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.96/0.41 % (1309634)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=3171115657:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/25Mi)
% 0.96/0.41 % (1309635)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3260378686:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2999 on theBenchmark for (2999ds/14Mi)
% 0.96/0.41 % (1309636)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=1697028052:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/327Mi)
% 0.96/0.41 % (1309639)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=1002529533:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.96/0.41 % (1309635)Refutation not found, incomplete strategy
% 0.96/0.41 % (1309635)------------------------------
% 0.96/0.41 % (1309635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.41 % (1309635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.41 % (1309635)CaDiCaL version: 2.1.3
% 0.96/0.41 % (1309635)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.41 % (1309635)Time elapsed: 0.005 s
% 0.96/0.41 % (1309635)Peak memory usage: 12 MB
% 0.96/0.41 % (1309635)Instructions burned: 9 (million)
% 0.96/0.41 % (1309637)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=728883257:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/14Mi)
% 0.96/0.41 % (1309639)Instruction limit reached!
% 0.96/0.41 % (1309639)------------------------------
% 0.96/0.41 % (1309639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.41 % (1309639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.41 % (1309639)CaDiCaL version: 2.1.3
% 0.96/0.41 % (1309639)Termination reason: Instruction limit
% 0.96/0.41 % (1309639)Termination phase: Property scanning
% 0.96/0.41 % (1309639)Time elapsed: 0.001 s
% 0.96/0.41 % (1309639)Peak memory usage: 11 MB
% 0.96/0.41 % (1309639)Instructions burned: 5 (million)
% 0.96/0.41 % (1309635)------------------------------
% 0.96/0.41 % (1309635)------------------------------
% 0.96/0.41 % (1309636)Refutation not found, incomplete strategy
% 0.96/0.41 % (1309636)------------------------------
% 0.96/0.41 % (1309636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.41 % (1309636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.41 % (1309636)CaDiCaL version: 2.1.3
% 0.96/0.41 % (1309636)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.41 % (1309636)Time elapsed: 0.006 s
% 0.96/0.41 % (1309636)Peak memory usage: 12 MB
% 0.96/0.41 % (1309636)Instructions burned: 10 (million)
% 0.96/0.41 % (1309636)------------------------------
% 0.96/0.41 % (1309636)------------------------------
% 0.96/0.41 % (1309634)Refutation not found, incomplete strategy
% 0.96/0.41 % (1309634)------------------------------
% 0.96/0.41 % (1309634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.41 % (1309634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.41 % (1309634)CaDiCaL version: 2.1.3
% 0.96/0.41 % (1309634)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.42 % (1309634)Time elapsed: 0.014 s
% 0.96/0.42 % (1309634)Peak memory usage: 12 MB
% 0.96/0.42 % (1309634)Instructions burned: 24 (million)
% 0.96/0.42 % (1309634)------------------------------
% 0.96/0.42 % (1309634)------------------------------
% 0.96/0.42 % (1309637)Instruction limit reached!
% 0.96/0.42 % (1309637)------------------------------
% 0.96/0.42 % (1309637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.42 % (1309637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.42 % (1309637)CaDiCaL version: 2.1.3
% 0.96/0.42 % (1309637)Termination reason: Instruction limit
% 0.96/0.42 % (1309637)Termination phase: Saturation
% 0.96/0.42 % (1309637)Time elapsed: 0.008 s
% 0.96/0.42 % (1309637)Peak memory usage: 12 MB
% 0.96/0.42 % (1309637)Instructions burned: 15 (million)
% 0.96/0.42 % (1309647)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=3805831494:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 0.96/0.42 % (1309647)Instruction limit reached!
% 0.96/0.42 % (1309647)------------------------------
% 0.96/0.42 % (1309647)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.43 % (1309647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.43 % (1309647)CaDiCaL version: 2.1.3
% 0.96/0.43 % (1309647)Termination reason: Instruction limit
% 0.96/0.43 % (1309647)Termination phase: Saturation
% 0.96/0.43 % (1309647)Time elapsed: 0.006 s
% 0.96/0.43 % (1309647)Peak memory usage: 12 MB
% 0.96/0.43 % (1309647)Instructions burned: 23 (million)
% 0.96/0.43 % (1309622)Instruction limit reached!
% 0.96/0.43 % (1309622)------------------------------
% 0.96/0.43 % (1309622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.43 % (1309622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.43 % (1309622)CaDiCaL version: 2.1.3
% 0.96/0.43 % (1309622)Termination reason: Instruction limit
% 0.96/0.43 % (1309622)Termination phase: Saturation
% 0.96/0.43 % (1309622)Time elapsed: 0.049 s
% 0.96/0.43 % (1309622)Peak memory usage: 13 MB
% 0.96/0.43 % (1309622)Instructions burned: 88 (million)
% 0.96/0.43 % (1309648)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=1682643093:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 0.96/0.43 % (1309649)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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.96/0.43 % (1309649)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 0.96/0.43 % (1309650)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 0.96/0.43 % (1309629)Instruction limit reached!
% 0.96/0.43 % (1309629)------------------------------
% 0.96/0.43 % (1309629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.43 % (1309629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.43 % (1309629)CaDiCaL version: 2.1.3
% 0.96/0.43 % (1309629)Termination reason: Instruction limit
% 0.96/0.43 % (1309629)Termination phase: Saturation
% 0.96/0.43 % (1309629)Time elapsed: 0.038 s
% 0.96/0.43 % (1309629)Peak memory usage: 12 MB
% 0.96/0.43 % (1309629)Instructions burned: 41 (million)
% 0.96/0.43 % (1309649)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=1665737578:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.96/0.43 % (1309650)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=727484358:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 0.96/0.43 % (1309652)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=2979637113:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 0.96/0.43 % (1309646)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=3857095074:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 0.96/0.43 % (1309648)Refutation not found, incomplete strategy
% 0.96/0.43 % (1309648)------------------------------
% 0.96/0.43 % (1309648)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.43 % (1309648)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.43 % (1309648)CaDiCaL version: 2.1.3
% 0.96/0.43 % (1309648)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.43 % (1309648)Time elapsed: 0.009 s
% 0.96/0.43 % (1309648)Peak memory usage: 12 MB
% 0.96/0.43 % (1309648)Instructions burned: 15 (million)
% 0.96/0.43 % (1309648)------------------------------
% 0.96/0.43 % (1309648)------------------------------
% 0.96/0.43 % (1309650)Instruction limit reached!
% 0.96/0.43 % (1309650)------------------------------
% 0.96/0.43 % (1309650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.43 % (1309650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.43 % (1309650)CaDiCaL version: 2.1.3
% 0.96/0.43 % (1309650)Termination reason: Instruction limit
% 0.96/0.43 % (1309650)Termination phase: Saturation
% 0.96/0.43 % (1309650)Time elapsed: 0.004 s
% 0.96/0.43 % (1309650)Peak memory usage: 11 MB
% 0.96/0.43 % (1309650)Instructions burned: 8 (million)
% 0.96/0.46 % (1309649)Instruction limit reached!
% 0.96/0.46 % (1309649)------------------------------
% 0.96/0.46 % (1309649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309649)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309649)Termination reason: Instruction limit
% 0.96/0.46 % (1309649)Termination phase: Saturation
% 0.96/0.46 % (1309649)Time elapsed: 0.008 s
% 0.96/0.46 % (1309649)Peak memory usage: 12 MB
% 0.96/0.46 % (1309649)Instructions burned: 15 (million)
% 0.96/0.46 % (1309652)Instruction limit reached!
% 0.96/0.46 % (1309652)------------------------------
% 0.96/0.46 % (1309652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309652)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309652)Termination reason: Instruction limit
% 0.96/0.46 % (1309652)Termination phase: Saturation
% 0.96/0.46 % (1309652)Time elapsed: 0.010 s
% 0.96/0.46 % (1309652)Peak memory usage: 12 MB
% 0.96/0.46 % (1309652)Instructions burned: 32 (million)
% 0.96/0.46 % (1309646)Instruction limit reached!
% 0.96/0.46 % (1309646)------------------------------
% 0.96/0.46 % (1309646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309646)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309646)Termination reason: Instruction limit
% 0.96/0.46 % (1309646)Termination phase: Saturation
% 0.96/0.46 % (1309646)Time elapsed: 0.014 s
% 0.96/0.46 % (1309646)Peak memory usage: 12 MB
% 0.96/0.46 % (1309646)Instructions burned: 27 (million)
% 0.96/0.46 % (1309654)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=3167223555:i=7:hud=5:bd=preordered:rtra=on:bet=on_2998 on theBenchmark for (2998ds/7Mi)
% 0.96/0.46 % (1309660)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=2134724359:s2a=on:i=20:kws=inv_frequency:bd=all:rtra=on_2998 on theBenchmark for (2998ds/20Mi)
% 0.96/0.46 % (1309661)dis+1010_2:1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:slsq=on:random_seed=3090551840:i=1240:rtra=on:ixr=off_2998 on theBenchmark for (2998ds/1240Mi)
% 0.96/0.46 % (1309659)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=1182624163:i=23:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 0.96/0.46 % (1309664)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=323643490:i=42:hud=10:rtra=on_2998 on theBenchmark for (2998ds/42Mi)
% 0.96/0.46 % (1309654)Instruction limit reached!
% 0.96/0.46 % (1309654)------------------------------
% 0.96/0.46 % (1309654)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309654)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309654)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309654)Termination reason: Instruction limit
% 0.96/0.46 % (1309654)Termination phase: Saturation
% 0.96/0.46 % (1309654)Time elapsed: 0.005 s
% 0.96/0.46 % (1309654)Peak memory usage: 12 MB
% 0.96/0.46 % (1309654)Instructions burned: 8 (million)
% 0.96/0.46 % (1309662)ott+1002_32_tgt=ground:si=on:sp=const_max:acc=on:nwc=0.5:random_seed=3791550959:i=143:fgj=on:piset=pi_sigma:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/143Mi)
% 0.96/0.46 % (1309663)lrs+1002_1_sil=128000:si=on:acc=on:uwa=off:random_seed=927423996:st=5:s2a=on:i=193:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/193Mi)
% 0.96/0.46 % (1309660)Instruction limit reached!
% 0.96/0.46 % (1309660)------------------------------
% 0.96/0.46 % (1309660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309660)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309660)Termination reason: Instruction limit
% 0.96/0.46 % (1309660)Termination phase: Saturation
% 0.96/0.46 % (1309660)Time elapsed: 0.011 s
% 0.96/0.46 % (1309660)Peak memory usage: 12 MB
% 0.96/0.46 % (1309660)Instructions burned: 20 (million)
% 0.96/0.46 % (1309659)Instruction limit reached!
% 0.96/0.46 % (1309659)------------------------------
% 0.96/0.46 % (1309659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309659)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309659)Termination reason: Instruction limit
% 0.96/0.46 % (1309659)Termination phase: Saturation
% 0.96/0.46 % (1309659)Time elapsed: 0.010 s
% 0.96/0.46 % (1309659)Peak memory usage: 11 MB
% 0.96/0.46 % (1309659)Instructions burned: 24 (million)
% 0.96/0.46 % (1309664)Instruction limit reached!
% 0.96/0.46 % (1309664)------------------------------
% 0.96/0.46 % (1309664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309664)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309664)Termination reason: Instruction limit
% 0.96/0.46 % (1309664)Termination phase: Saturation
% 0.96/0.46 % (1309664)Time elapsed: 0.011 s
% 0.96/0.46 % (1309664)Peak memory usage: 12 MB
% 0.96/0.46 % (1309664)Instructions burned: 45 (million)
% 0.96/0.46 % (1309663)Refutation not found, incomplete strategy
% 0.96/0.46 % (1309663)------------------------------
% 0.96/0.46 % (1309663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309663)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309663)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.46 % (1309663)Time elapsed: 0.006 s
% 0.96/0.46 % (1309663)Peak memory usage: 12 MB
% 0.96/0.46 % (1309663)Instructions burned: 10 (million)
% 0.96/0.46 % (1309663)------------------------------
% 0.96/0.46 % (1309663)------------------------------
% 0.96/0.46 % (1309661)Refutation not found, incomplete strategy
% 0.96/0.46 % (1309661)------------------------------
% 0.96/0.46 % (1309661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309661)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309661)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.46 % (1309661)Time elapsed: 0.016 s
% 0.96/0.46 % (1309661)Peak memory usage: 12 MB
% 0.96/0.46 % (1309661)Instructions burned: 29 (million)
% 0.96/0.46 % (1309661)------------------------------
% 0.96/0.46 % (1309661)------------------------------
% 0.96/0.46 % (1309671)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.96/0.46 % (1309671)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1711144486:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2998 on theBenchmark for (2998ds/7Mi)
% 0.96/0.46 % (1309675)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(5) has been set then sine_level_split_queue(off) is equal to on
% 0.96/0.46 % (1309675)lrs+1002_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=arity:cbe=off:uwa=all:slsqc=5:random_seed=3040174132:st=4:s2a=on:i=6:add=on:doe=on:hud=10:rtra=on:bet=on:ss=axioms_2998 on theBenchmark for (2998ds/6Mi)
% 0.96/0.46 % (1309675)Instruction limit reached!
% 0.96/0.46 % (1309675)------------------------------
% 0.96/0.46 % (1309675)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309671)Instruction limit reached!
% 0.96/0.46 % (1309671)------------------------------
% 0.96/0.46 % (1309671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309671)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309671)Termination reason: Instruction limit
% 0.96/0.46 % (1309671)Termination phase: Saturation
% 0.96/0.46 % (1309671)Time elapsed: 0.004 s
% 0.96/0.46 % (1309675)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309671)Peak memory usage: 12 MB
% 0.96/0.46 % (1309675)Termination reason: Instruction limit
% 0.96/0.46 % (1309675)Termination phase: Saturation
% 0.96/0.46 % (1309671)Instructions burned: 8 (million)
% 0.96/0.46 % (1309675)Time elapsed: 0.001 s
% 0.96/0.46 % (1309675)Peak memory usage: 11 MB
% 0.96/0.46 % (1309675)Instructions burned: 6 (million)
% 0.96/0.46 % (1309673)lrs+10_1_to=lpo:sil=128000:si=on:sp=arity:urr=on:random_seed=4078556502:i=181:sd=2:bd=preordered:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/181Mi)
% 0.96/0.46 % (1309674)dis+10_8_sil=128000:plsq=on:plsqc=1:si=on:sp=unary_first:sos=on:lma=off:plsqr=64,1:uwa=interpreted_only:foolp=on:random_seed=4051627476:st=3:avsq=on:i=169:avsqr=8,1:sd=2:kws=precedence:bd=preordered:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/169Mi)
% 0.96/0.46 % (1309676)ott+2_5:4_anc=none:to=lpo:si=on:lma=off:cbe=off:uwa=ground:nwc=3:random_seed=3246315929:uwa_fpi=on:i=22:add=on:doe=on:ins=1:rtra=on_2998 on theBenchmark for (2998ds/22Mi)
% 0.96/0.46 % (1309677)dis+1010_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:sas=cadical:si=on:sos=all:uwa=off:sac=on:random_seed=3528523200:i=19:add=on:rtra=on_2998 on theBenchmark for (2998ds/19Mi)
% 0.96/0.46 % (1309680)ott+10_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:lma=off:plsqr=128,1:urr=ec_only:uwa=off:rp=on:nwc=20:br=off:random_seed=3493471283:i=316:bs=unit_only:ins=25:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/316Mi)
% 0.96/0.46 % (1309674)Refutation not found, incomplete strategy
% 0.96/0.46 % (1309674)------------------------------
% 0.96/0.46 % (1309674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309674)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309674)Termination reason: Refutation not found, incomplete strategy
% 0.96/0.46 % (1309674)Time elapsed: 0.006 s
% 0.96/0.46 % (1309674)Peak memory usage: 12 MB
% 0.96/0.46 % (1309674)Instructions burned: 10 (million)
% 0.96/0.46 % (1309674)------------------------------
% 0.96/0.46 % (1309674)------------------------------
% 0.96/0.46 % (1309662) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1309597-1309662"...
% 0.96/0.46 % (1309681)dis+1004_4:1_slsqr=1,2:to=lpo:plsq=on:fde=unused:e2e=on:si=on:spb=goal_then_units:acc=on:urr=on:uwa=off:fd=preordered:s2agt=16:slsqc=1:slsq=on:random_seed=943401453:hsq=on:hsqr=16,1:s2a=on:i=853:add=off:bd=all:nm=64:rtra=on:gtg=position:c=on:ntd=on_2998 on theBenchmark for (2998ds/853Mi)
% 0.96/0.46 % (1309677)Instruction limit reached!
% 0.96/0.46 % (1309677)------------------------------
% 0.96/0.46 % (1309677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309677)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309677)Termination reason: Instruction limit
% 0.96/0.46 % (1309677)Termination phase: Saturation
% 0.96/0.46 % (1309677)Time elapsed: 0.010 s
% 0.96/0.46 % (1309677)Peak memory usage: 12 MB
% 0.96/0.46 % (1309677)Instructions burned: 20 (million)
% 0.96/0.46 % (1309676)Instruction limit reached!
% 0.96/0.46 % (1309676)------------------------------
% 0.96/0.46 % (1309676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309676)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309676)Termination reason: Instruction limit
% 0.96/0.46 % (1309676)Termination phase: Saturation
% 0.96/0.46 % (1309676)Time elapsed: 0.012 s
% 0.96/0.46 % (1309676)Peak memory usage: 12 MB
% 0.96/0.46 % (1309676)Instructions burned: 22 (million)
% 0.96/0.46 % (1309662)...printing done.
% 0.96/0.46 % (1309662)Refutation found. Thanks to Tanya!
% 0.96/0.46 % SZS status Theorem for theBenchmark
% 0.96/0.46 % SZS output start Proof for theBenchmark
% 0.96/0.46 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.96/0.46 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.96/0.46 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.96/0.46 thf(func_def_3, type, dsetconstr: ($i > ($i > $o) > $i)).
% 0.96/0.46 thf(func_def_4, type, singleton: ($i > $o)).
% 0.96/0.46 thf(func_def_6, type, iffalseProp1: $o).
% 0.96/0.46 thf(func_def_7, type, iffalseProp2: $o).
% 0.96/0.46 thf(func_def_8, type, iftrueProp1: $o).
% 0.96/0.46 thf(func_def_9, type, iftrueProp2: $o).
% 0.96/0.46 thf(func_def_10, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.96/0.46 thf(func_def_11, type, vAND: ($o > $o > $o)).
% 0.96/0.46 thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 0.96/0.46 thf(func_def_13, type, db1: !>[X0: $tType]:(X0)).
% 0.96/0.46 thf(func_def_14, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.96/0.46 thf(func_def_15, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.96/0.46 thf(func_def_16, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.96/0.46 thf(func_def_17, type, vIMP: ($o > $o > $o)).
% 0.96/0.46 thf(func_def_18, type, db2: !>[X0: $tType]:(X0)).
% 0.96/0.46 thf(func_def_19, type, db3: !>[X0: $tType]:(X0)).
% 0.96/0.46 thf(func_def_20, type, vOR: ($o > $o > $o)).
% 0.96/0.46 thf(func_def_21, type, vNOT: ($o > $o)).
% 0.96/0.46 thf(func_def_22, type, db4: !>[X0: $tType]:(X0)).
% 0.96/0.46 thf(func_def_25, type, sK0: $o).
% 0.96/0.46 thf(func_def_29, type, sF4: $o).
% 0.96/0.46 thf(func_def_30, type, sF5: $o).
% 0.96/0.46 thf(func_def_31, type, sF6: $o).
% 0.96/0.46 thf(func_def_32, type, sF7: $o).
% 0.96/0.46 thf(func_def_33, type, sF8: $o).
% 0.96/0.46 thf(func_def_34, type, sF9: $o).
% 0.96/0.46 thf(func_def_36, type, sF11: $o).
% 0.96/0.46 thf(func_def_37, type, sF12: $o).
% 0.96/0.46 thf(func_def_40, type, sK15: $o).
% 0.96/0.46 thf(func_def_42, type, sK17: $o).
% 0.96/0.46 thf(func_def_48, type, sK23: $o).
% 0.96/0.46 thf(func_def_51, type, sK26: $o).
% 0.96/0.46 thf(func_def_56, type, sK31: ($o > $i > $i > $i)).
% 0.96/0.46 thf(func_def_57, type, sK32: ($i > $i > $o > $i)).
% 0.96/0.46 thf(func_def_58, type, sK33: ($o > $i > $i > $i)).
% 0.96/0.46 thf(f1,axiom,(
% 0.96/0.46 ((^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))) = singleton)),
% 0.96/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton)).
% 0.96/0.46 thf(f2,axiom,(
% 0.96/0.46 (! [X0 : $i,X2 : $i,X1 : $o] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (~X1 => (in @ X3 @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X1 & (X4 = X3)) | (X1 & (X4 = X2))))))))) = iffalseProp1)),
% 0.96/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iffalseProp1)).
% 0.96/0.46 thf(f3,axiom,(
% 0.96/0.46 (iffalseProp2 = ! [X1 : $o,X0 : $i,X2 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (~X1 => (((setadjoin @ X3 @ emptyset)) = ((dsetconstr @ X0 @ (^[X4 : $i] : ((X1 & (X4 = X2)) | ((X4 = X3) & ~X1))))))))))),
% 0.96/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',iffalseProp2)).
% 0.96/0.46 thf(f6,conjecture,(
% 0.96/0.46 iffalseProp1 => (iffalseProp2 => (iftrueProp1 => (iftrueProp2 => ! [X1 : $o,X2 : $i,X0 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : ((X1 & (X4 = X2)) | ((X4 = X3) & ~X1))))))))))),
% 0.96/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifSingleton)).
% 0.96/0.46 thf(f7,negated_conjecture,(
% 0.96/0.46 ~(iffalseProp1 => (iffalseProp2 => (iftrueProp1 => (iftrueProp2 => ! [X1 : $o,X2 : $i,X0 : $i] : ((in @ X2 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X4 : $i] : ((X1 & (X4 = X2)) | ((X4 = X3) & ~X1)))))))))))),
% 0.96/0.46 inference(negated_conjecture,[status(cth)],[f6])).
% 0.96/0.46 thf(f8,plain,(
% 0.96/0.46 ((^[X0 : $i] : (? [X1 : $i] : ((X0 = ((setadjoin @ X1 @ emptyset))) & (in @ X1 @ X0)))) = singleton)),
% 0.96/0.46 inference(rectify,[],[f1])).
% 0.96/0.46 thf(f9,plain,(
% 0.96/0.46 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.96/0.46 inference(fool_elimination,[],[f8])).
% 0.96/0.46 thf(f12,plain,(
% 0.96/0.46 (iffalseProp2 = ! [X0 : $o,X1 : $i,X2 : $i] : ((in @ X2 @ X1) => ! [X3 : $i] : ((in @ X3 @ X1) => (~X0 => (((setadjoin @ X3 @ emptyset)) = ((dsetconstr @ X1 @ (^[X4 : $i] : ((X0 & (X4 = X2)) | ((X4 = X3) & ~X0))))))))))),
% 0.96/0.46 inference(rectify,[],[f3])).
% 0.96/0.46 thf(f13,plain,(
% 0.96/0.46 (iffalseProp2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))))))),
% 0.96/0.46 inference(fool_elimination,[],[f12])).
% 0.96/0.46 thf(f14,plain,(
% 0.96/0.46 ~(iffalseProp1 => (iffalseProp2 => (iftrueProp1 => (iftrueProp2 => ! [X0 : $o,X1 : $i,X2 : $i] : ((in @ X1 @ X2) => ! [X3 : $i] : ((in @ X3 @ X2) => (singleton @ (dsetconstr @ X2 @ (^[X4 : $i] : ((X0 & (X1 = X4)) | ((X4 = X3) & ~X0)))))))))))),
% 0.96/0.46 inference(rectify,[],[f7])).
% 0.96/0.46 thf(f15,plain,(
% 0.96/0.46 ~((iffalseProp1 = $true) => ((iffalseProp2 = $true) => ((iftrueProp1 = $true) => ((iftrueProp2 = $true) => ! [X1 : $i,X2 : $i,X0 : $o] : (($true = ((in @ X1 @ X2))) => ! [X3 : $i] : (($true = ((in @ X3 @ X2))) => ($true = ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X0) & (X3 = Y0)) | ((X1 = Y0) & X0)))))))))))))),
% 0.96/0.46 inference(fool_elimination,[],[f14])).
% 0.96/0.46 thf(f16,plain,(
% 0.96/0.46 (! [X0 : $i,X1 : $i,X2 : $o] : ((in @ X1 @ X0) => ! [X3 : $i] : ((in @ X3 @ X0) => (~X2 => (in @ X3 @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X2 & (X4 = X3)) | (X2 & (X1 = X4))))))))) = iffalseProp1)),
% 0.96/0.46 inference(rectify,[],[f2])).
% 0.96/0.46 thf(f17,plain,(
% 0.96/0.46 (iffalseProp1 = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0)))))))))))))))))))),
% 0.96/0.46 inference(fool_elimination,[],[f16])).
% 0.96/0.46 thf(f20,plain,(
% 0.96/0.46 (((? [X0 : $o,X1 : $i,X2 : $i] : (($true = ((in @ X1 @ X2))) & ? [X3 : $i] : (($true != ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X0) & (X3 = Y0)) | ((X1 = Y0) & X0))))))) & ($true = ((in @ X3 @ X2))))) & (iftrueProp2 = $true)) & (iftrueProp1 = $true)) & (iffalseProp2 = $true)) & (iffalseProp1 = $true)),
% 0.96/0.46 inference(ennf_transformation,[],[f15])).
% 0.96/0.46 thf(f21,plain,(
% 0.96/0.46 (iffalseProp1 = $true) & (iftrueProp2 = $true) & (iffalseProp2 = $true) & ? [X0 : $o,X1 : $i,X2 : $i] : (($true = ((in @ X1 @ X2))) & ? [X3 : $i] : (($true != ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X0) & (X3 = Y0)) | ((X1 = Y0) & X0))))))) & ($true = ((in @ X3 @ X2))))) & (iftrueProp1 = $true)),
% 0.96/0.46 inference(flattening,[],[f20])).
% 0.96/0.46 thf(f22,plain,(
% 0.96/0.46 (iffalseProp1 = $true) & (iftrueProp2 = $true) & (iffalseProp2 = $true) & (($true = ((in @ sK1 @ sK2))) & (($true != ((singleton @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((~ sK0) & (sK3 = Y0)) | ((sK1 = Y0) & sK0))))))) & ($true = ((in @ sK3 @ sK2))))) & (iftrueProp1 = $true)),
% 0.96/0.46 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f21])).
% 0.96/0.46 thf(f23,plain,(
% 0.96/0.46 (iffalseProp1 = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0)))))))))))))))))))),
% 0.96/0.46 inference(cnf_transformation,[],[f17])).
% 0.96/0.46 thf(f25,plain,(
% 0.96/0.46 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
% 0.96/0.46 inference(cnf_transformation,[],[f9])).
% 0.96/0.46 thf(f26,plain,(
% 0.96/0.46 (iffalseProp2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))))))),
% 0.96/0.46 inference(cnf_transformation,[],[f13])).
% 0.96/0.46 thf(f29,plain,(
% 0.96/0.46 ($true = ((in @ sK3 @ sK2)))),
% 0.96/0.46 inference(cnf_transformation,[],[f22])).
% 0.96/0.46 thf(f30,plain,(
% 0.96/0.46 ($true != ((singleton @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((~ sK0) & (sK3 = Y0)) | ((sK1 = Y0) & sK0)))))))),
% 0.96/0.46 inference(cnf_transformation,[],[f22])).
% 0.96/0.46 thf(f31,plain,(
% 0.96/0.46 ($true = ((in @ sK1 @ sK2)))),
% 0.96/0.46 inference(cnf_transformation,[],[f22])).
% 0.96/0.46 thf(f32,plain,(
% 0.96/0.46 (iffalseProp2 = $true)),
% 0.96/0.46 inference(cnf_transformation,[],[f22])).
% 0.96/0.46 thf(f34,plain,(
% 0.96/0.46 (iffalseProp1 = $true)),
% 0.96/0.46 inference(cnf_transformation,[],[f22])).
% 0.96/0.46 thf(f36,definition,(
% 0.96/0.46 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.96/0.46 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.96/0.46 thf(f37,plain,(
% 0.96/0.46 ($true = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0)))))))))))))))))))),
% 0.96/0.46 inference(definition_unfolding,[],[f23,f34])).
% 0.96/0.46 thf(f39,plain,(
% 0.96/0.46 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))))))),
% 0.96/0.46 inference(definition_unfolding,[],[f26,f32])).
% 0.96/0.46 thf(f41,plain,(
% 0.96/0.46 ($true != (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((~ sK0) & (sK3 = Y0)) | ((sK1 = Y0) & sK0)))))))),
% 0.96/0.46 inference(definition_unfolding,[],[f30,f25])).
% 0.96/0.46 thf(f42,definition,(
% 0.96/0.46 (sF4 = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0)))))))))))))))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF4])],[function_definition])).
% 0.96/0.46 thf(f43,plain,(
% 0.96/0.46 ($true = sF4)),
% 0.96/0.46 inference(definition_folding,[],[f37,f42])).
% 0.96/0.46 thf(f46,definition,(
% 0.96/0.46 (sF6 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF6])],[function_definition])).
% 0.96/0.46 thf(f47,plain,(
% 0.96/0.46 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))))) = sF6)),
% 0.96/0.46 inference(reorient_equations,[],[f46])).
% 0.96/0.46 thf(f48,plain,(
% 0.96/0.46 ($true = sF6)),
% 0.96/0.46 inference(definition_folding,[],[f39,f47])).
% 0.96/0.46 thf(f52,definition,(
% 0.96/0.46 (sF8 = ((in @ sK1 @ sK2)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF8])],[function_definition])).
% 0.96/0.46 thf(f53,plain,(
% 0.96/0.46 ($true = sF8)),
% 0.96/0.46 inference(definition_folding,[],[f31,f52])).
% 0.96/0.46 thf(f54,definition,(
% 0.96/0.46 (sF9 = ((~ sK0)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF9])],[function_definition])).
% 0.96/0.46 thf(f55,plain,(
% 0.96/0.46 (((~ sK0)) = sF9)),
% 0.96/0.46 inference(reorient_equations,[],[f54])).
% 0.96/0.46 thf(f56,definition,(
% 0.96/0.46 (sF10 = ((dsetconstr @ sK2 @ (^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF10])],[function_definition])).
% 0.96/0.46 thf(f57,definition,(
% 0.96/0.46 (sF11 = (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ sF10)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF11])],[function_definition])).
% 0.96/0.46 thf(f58,plain,(
% 0.96/0.46 ((((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ sF10)) = sF11)),
% 0.96/0.46 inference(reorient_equations,[],[f57])).
% 0.96/0.46 thf(f59,plain,(
% 0.96/0.46 ($true != sF11)),
% 0.96/0.46 inference(definition_folding,[],[f41,f58,f56,f55])).
% 0.96/0.46 thf(f60,definition,(
% 0.96/0.46 (sF12 = ((in @ sK3 @ sK2)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[sF12])],[function_definition])).
% 0.96/0.46 thf(f61,plain,(
% 0.96/0.46 (sF12 = $true)),
% 0.96/0.46 inference(definition_folding,[],[f29,f60])).
% 0.96/0.46 thf(f63,plain,(
% 0.96/0.46 ($true = ((in @ sK3 @ sK2))) | ($false = sF12)),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f60])).
% 0.96/0.46 thf(f64,plain,(
% 0.96/0.46 ($false = sF9) | ($true = ((~ sK0)))),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f55])).
% 0.96/0.46 thf(f65,plain,(
% 0.96/0.46 ($false = ((~ sK0))) | ($true = sF9)),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f55])).
% 0.96/0.46 thf(f66,plain,(
% 0.96/0.46 ($true = sF9) | (sK0 = $true)),
% 0.96/0.46 inference(not_proxy_clausification,[],[f65])).
% 0.96/0.46 thf(f67,plain,(
% 0.96/0.46 ($false = sK0) | ($false = sF9)),
% 0.96/0.46 inference(not_proxy_clausification,[],[f64])).
% 0.96/0.46 thf(f68,plain,(
% 0.96/0.46 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2)))))))))))))))))) | ($false = sF6)),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f47])).
% 0.96/0.46 thf(f86,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($false = sF6) | ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $o @ (^[Y2 : $o]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y1) => ((~ Y2) => ((setadjoin @ Y3 @ emptyset) = (dsetconstr @ Y1 @ (^[Y4 : $i]: (((~ Y2) & (Y3 = Y4)) | ((Y0 = Y4) & Y2))))))))))))))) @ X1)) = $true)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f68])).
% 0.96/0.46 thf(f87,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((~ Y1) => ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ Y0 @ (^[Y3 : $i]: (((~ Y1) & (Y2 = Y3)) | ((X1 = Y3) & Y1)))))))))))))))) | ($false = sF6)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f86])).
% 0.96/0.46 thf(f88,plain,(
% 0.96/0.46 ( ! [X2 : $i,X1 : $i] : (($false = sF6) | ((((^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: ((in @ X1 @ Y0) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => ((~ Y1) => ((setadjoin @ Y2 @ emptyset) = (dsetconstr @ Y0 @ (^[Y3 : $i]: (((~ Y1) & (Y2 = Y3)) | ((X1 = Y3) & Y1))))))))))))) @ X2)) = $true)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f87])).
% 0.96/0.46 thf(f89,plain,(
% 0.96/0.46 ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $o @ (^[Y0 : $o]: ((in @ X1 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((~ Y0) => ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ X2 @ (^[Y2 : $i]: (((~ Y0) & (Y1 = Y2)) | ((X1 = Y2) & Y0)))))))))))))) | ($false = sF6)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f88])).
% 0.96/0.46 thf(f90,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i] : (($true = (((^[Y0 : $o]: ((in @ X1 @ X2) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X2) => ((~ Y0) => ((setadjoin @ Y1 @ emptyset) = (dsetconstr @ X2 @ (^[Y2 : $i]: (((~ Y0) & (Y1 = Y2)) | ((X1 = Y2) & Y0))))))))))) @ X3))) | ($false = sF6)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f89])).
% 0.96/0.46 thf(f91,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i] : (($false = sF6) | ($true = (((in @ X1 @ X2) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => ((~ X3) => ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ (^[Y1 : $i]: (((~ X3) & (Y0 = Y1)) | ((X1 = Y1) & X3))))))))))))) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f90])).
% 0.96/0.46 thf(f92,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i] : (($false = ((in @ X1 @ X2))) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => ((~ X3) => ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ (^[Y1 : $i]: (((~ X3) & (Y0 = Y1)) | ((X1 = Y1) & X3))))))))))) | ($false = sF6)) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f91])).
% 0.96/0.46 thf(f93,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (((((^[Y0 : $i]: ((in @ Y0 @ X2) => ((~ X3) => ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X2 @ (^[Y1 : $i]: (((~ X3) & (Y0 = Y1)) | ((X1 = Y1) & X3)))))))) @ X4)) = $true) | ($false = sF6) | ($false = ((in @ X1 @ X2)))) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f92])).
% 0.96/0.46 thf(f94,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X2))) | ($false = sF6) | ($true = (((in @ X4 @ X2) => ((~ X3) => ((setadjoin @ X4 @ emptyset) = (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3)))))))))) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f93])).
% 0.96/0.46 thf(f95,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (($false = sF6) | ($false = ((in @ X4 @ X2))) | ($false = ((in @ X1 @ X2))) | ($true = (((~ X3) => ((setadjoin @ X4 @ emptyset) = (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3))))))))) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f94])).
% 0.96/0.46 thf(f96,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (($false = ((in @ X1 @ X2))) | ($false = ((~ X3))) | ($false = sF6) | ($false = ((in @ X4 @ X2))) | ($true = (((setadjoin @ X4 @ emptyset) = (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3)))))))) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f95])).
% 0.96/0.46 thf(f97,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (($true = (((setadjoin @ X4 @ emptyset) = (dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3))))))) | ($false = sF6) | ($true = X3) | ($false = ((in @ X1 @ X2))) | ($false = ((in @ X4 @ X2)))) )),
% 0.96/0.46 inference(not_proxy_clausification,[],[f96])).
% 0.96/0.46 thf(f98,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : (($false = ((in @ X4 @ X2))) | (((setadjoin @ X4 @ emptyset)) = ((dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3)))))) | ($false = ((in @ X1 @ X2))) | ($true = X3) | ($false = sF6)) )),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f97])).
% 0.96/0.46 thf(f100,plain,(
% 0.96/0.46 ($true = ((!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0))))))))))))))))))) | ($false = sF4)),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f42])).
% 0.96/0.46 thf(f101,plain,(
% 0.96/0.46 ( ! [X1 : $o] : (($false = sF4) | ((((^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y2) => ((~ Y0) => (in @ Y3 @ (dsetconstr @ Y2 @ (^[Y4 : $i]: (((Y1 = Y4) & Y0) | ((Y3 = Y4) & (~ Y0)))))))))))))))) @ X1)) = $true)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f100])).
% 0.96/0.46 thf(f102,plain,(
% 0.96/0.46 ( ! [X1 : $o] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ X1) => (in @ Y2 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (((Y0 = Y3) & X1) | ((Y2 = Y3) & (~ X1))))))))))))))))) | ($false = sF4)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f101])).
% 0.96/0.46 thf(f103,plain,(
% 0.96/0.46 ( ! [X2 : $i,X1 : $o] : (($false = sF4) | ($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => ((~ X1) => (in @ Y2 @ (dsetconstr @ Y1 @ (^[Y3 : $i]: (((Y0 = Y3) & X1) | ((Y2 = Y3) & (~ X1)))))))))))))) @ X2)))) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f102])).
% 0.96/0.46 thf(f104,plain,(
% 0.96/0.46 ( ! [X2 : $i,X1 : $o] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((~ X1) => (in @ Y1 @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (((X2 = Y2) & X1) | ((Y1 = Y2) & (~ X1))))))))))))))) | ($false = sF4)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f103])).
% 0.96/0.46 thf(f105,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o] : (($true = (((^[Y0 : $i]: ((in @ X2 @ Y0) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => ((~ X1) => (in @ Y1 @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (((X2 = Y2) & X1) | ((Y1 = Y2) & (~ X1)))))))))))) @ X3))) | ($false = sF4)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f104])).
% 0.96/0.46 thf(f106,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o] : (($true = (((in @ X2 @ X3) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => ((~ X1) => (in @ Y0 @ (dsetconstr @ X3 @ (^[Y1 : $i]: (((X2 = Y1) & X1) | ((Y0 = Y1) & (~ X1))))))))))))) | ($false = sF4)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f105])).
% 0.96/0.46 thf(f107,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o] : (($false = sF4) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X3) => ((~ X1) => (in @ Y0 @ (dsetconstr @ X3 @ (^[Y1 : $i]: (((X2 = Y1) & X1) | ((Y0 = Y1) & (~ X1)))))))))))) | ($false = ((in @ X2 @ X3)))) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f106])).
% 0.96/0.46 thf(f108,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ X3))) | ($true = (((^[Y0 : $i]: ((in @ Y0 @ X3) => ((~ X1) => (in @ Y0 @ (dsetconstr @ X3 @ (^[Y1 : $i]: (((X2 = Y1) & X1) | ((Y0 = Y1) & (~ X1))))))))) @ X4))) | ($false = sF4)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f107])).
% 0.96/0.46 thf(f109,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = ((in @ X2 @ X3))) | ($false = sF4) | ($true = (((in @ X4 @ X3) => ((~ X1) => (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1))))))))))) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f108])).
% 0.96/0.46 thf(f110,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($true = (((~ X1) => (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1))))))))) | ($false = ((in @ X4 @ X3))) | ($false = sF4) | ($false = ((in @ X2 @ X3)))) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f109])).
% 0.96/0.46 thf(f111,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($false = sF4) | ($false = ((in @ X2 @ X3))) | ($false = ((~ X1))) | ($true = ((in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1)))))))) | ($false = ((in @ X4 @ X3)))) )),
% 0.96/0.46 inference(imp_proxy_clausification,[],[f110])).
% 0.96/0.46 thf(f112,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($true = X1) | ($true = ((in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1)))))))) | ($false = ((in @ X2 @ X3))) | ($false = sF4) | ($false = ((in @ X4 @ X3)))) )),
% 0.96/0.46 inference(not_proxy_clausification,[],[f111])).
% 0.96/0.46 thf(f185,plain,(
% 0.96/0.46 ($true = ((in @ sK1 @ sK2))) | ($false = sF8)),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f52])).
% 0.96/0.46 thf(f187,plain,(
% 0.96/0.46 ($true = sF11) | ($false = (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ sF10)))),
% 0.96/0.46 inference(iff_proxy_clausification,[],[f58])).
% 0.96/0.46 thf(f188,plain,(
% 0.96/0.46 ($false = ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ sF10) & ((setadjoin @ Y0 @ emptyset) = sF10)))))) | ($true = sF11)),
% 0.96/0.46 inference(beta-eta_normalization,[],[f187])).
% 0.96/0.46 thf(f189,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ sF10) & ((setadjoin @ Y0 @ emptyset) = sF10))) @ X1))) | ($true = sF11)) )),
% 0.96/0.46 inference(pi_proxy_clausification,[],[f188])).
% 0.96/0.46 thf(f190,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($false = (((in @ X1 @ sF10) & ((setadjoin @ X1 @ emptyset) = sF10)))) | ($true = sF11)) )),
% 0.96/0.46 inference(beta-eta_normalization,[],[f189])).
% 0.96/0.46 thf(f191,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($false = ((in @ X1 @ sF10))) | ($false = (((setadjoin @ X1 @ emptyset) = sF10))) | ($true = sF11)) )),
% 0.96/0.46 inference(and_proxy_clausification,[],[f190])).
% 0.96/0.46 thf(f192,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($true = sF11) | (((setadjoin @ X1 @ emptyset)) != sF10) | ($false = ((in @ X1 @ sF10)))) )),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f191])).
% 0.96/0.46 thf(f200,definition,(
% 0.96/0.46 spl30_1 <=> ($true = sF4)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_1])],[avatar_definition])).
% 0.96/0.46 thf(f203,plain,(
% 0.96/0.46 spl30_1),
% 0.96/0.46 inference(avatar_split_clause,[],[f43,f200])).
% 0.96/0.46 thf(f205,definition,(
% 0.96/0.46 spl30_2 <=> ($true = ((in @ sK3 @ sK2)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_2])],[avatar_definition])).
% 0.96/0.46 thf(f207,plain,(
% 0.96/0.46 ($true = ((in @ sK3 @ sK2))) | ~spl30_2),
% 0.96/0.46 inference(avatar_component_clause,[],[f205])).
% 0.96/0.46 thf(f209,definition,(
% 0.96/0.46 spl30_3 <=> ($false = sF12)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_3])],[avatar_definition])).
% 0.96/0.46 thf(f212,plain,(
% 0.96/0.46 spl30_2 | spl30_3),
% 0.96/0.46 inference(avatar_split_clause,[],[f63,f209,f205])).
% 0.96/0.46 thf(f218,definition,(
% 0.96/0.46 spl30_5 <=> (sF12 = $true)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_5])],[avatar_definition])).
% 0.96/0.46 thf(f228,definition,(
% 0.96/0.46 spl30_7 <=> ($true = sF11)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_7])],[avatar_definition])).
% 0.96/0.46 thf(f230,plain,(
% 0.96/0.46 ($true != sF11) | spl30_7),
% 0.96/0.46 inference(avatar_component_clause,[],[f228])).
% 0.96/0.46 thf(f231,plain,(
% 0.96/0.46 ~spl30_7),
% 0.96/0.46 inference(avatar_split_clause,[],[f59,f228])).
% 0.96/0.46 thf(f233,definition,(
% 0.96/0.46 spl30_8 <=> (sK0 = $true)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_8])],[avatar_definition])).
% 0.96/0.46 thf(f235,plain,(
% 0.96/0.46 (sK0 = $true) | ~spl30_8),
% 0.96/0.46 inference(avatar_component_clause,[],[f233])).
% 0.96/0.46 thf(f237,definition,(
% 0.96/0.46 spl30_9 <=> ($true = sF9)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_9])],[avatar_definition])).
% 0.96/0.46 thf(f238,plain,(
% 0.96/0.46 ($true != sF9) | spl30_9),
% 0.96/0.46 inference(avatar_component_clause,[],[f237])).
% 0.96/0.46 thf(f240,plain,(
% 0.96/0.46 spl30_8 | spl30_9),
% 0.96/0.46 inference(avatar_split_clause,[],[f66,f237,f233])).
% 0.96/0.46 thf(f242,definition,(
% 0.96/0.46 spl30_10 <=> ($false = sF9)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_10])],[avatar_definition])).
% 0.96/0.46 thf(f243,plain,(
% 0.96/0.46 ($false != sF9) | spl30_10),
% 0.96/0.46 inference(avatar_component_clause,[],[f242])).
% 0.96/0.46 thf(f244,plain,(
% 0.96/0.46 ($false = sF9) | ~spl30_10),
% 0.96/0.46 inference(avatar_component_clause,[],[f242])).
% 0.96/0.46 thf(f246,definition,(
% 0.96/0.46 spl30_11 <=> ($false = sK0)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_11])],[avatar_definition])).
% 0.96/0.46 thf(f247,plain,(
% 0.96/0.46 ($false != sK0) | spl30_11),
% 0.96/0.46 inference(avatar_component_clause,[],[f246])).
% 0.96/0.46 thf(f249,plain,(
% 0.96/0.46 spl30_10 | spl30_11),
% 0.96/0.46 inference(avatar_split_clause,[],[f67,f246,f242])).
% 0.96/0.46 thf(f251,definition,(
% 0.96/0.46 spl30_12 <=> ($true = sF8)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_12])],[avatar_definition])).
% 0.96/0.46 thf(f254,plain,(
% 0.96/0.46 spl30_12),
% 0.96/0.46 inference(avatar_split_clause,[],[f53,f251])).
% 0.96/0.46 thf(f266,definition,(
% 0.96/0.46 spl30_15 <=> ($true = sF6)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_15])],[avatar_definition])).
% 0.96/0.46 thf(f290,definition,(
% 0.96/0.46 spl30_20 <=> ! [X4 : $i,X3 : $o,X2 : $i,X1 : $i] : (($false = ((in @ X4 @ X2))) | ($true = X3) | ($false = ((in @ X1 @ X2))) | (((setadjoin @ X4 @ emptyset)) = ((dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3)))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_20])],[avatar_definition])).
% 0.96/0.46 thf(f291,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $o,X1 : $i,X4 : $i] : ((((setadjoin @ X4 @ emptyset)) = ((dsetconstr @ X2 @ (^[Y0 : $i]: (((~ X3) & (X4 = Y0)) | ((X1 = Y0) & X3)))))) | ($true = X3) | ($false = ((in @ X1 @ X2))) | ($false = ((in @ X4 @ X2)))) ) | ~spl30_20),
% 0.96/0.46 inference(avatar_component_clause,[],[f290])).
% 0.96/0.46 thf(f293,definition,(
% 0.96/0.46 spl30_21 <=> ($false = sF6)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_21])],[avatar_definition])).
% 0.96/0.46 thf(f296,plain,(
% 0.96/0.46 spl30_20 | spl30_21),
% 0.96/0.46 inference(avatar_split_clause,[],[f98,f293,f290])).
% 0.96/0.46 thf(f297,plain,(
% 0.96/0.46 spl30_15),
% 0.96/0.46 inference(avatar_split_clause,[],[f48,f266])).
% 0.96/0.46 thf(f299,definition,(
% 0.96/0.46 spl30_22 <=> ($false = sF4)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_22])],[avatar_definition])).
% 0.96/0.46 thf(f303,definition,(
% 0.96/0.46 spl30_23 <=> ! [X4 : $i,X3 : $i,X2 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X4 @ X3))) | ($false = ((in @ X2 @ X3))) | ($true = ((in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1)))))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_23])],[avatar_definition])).
% 0.96/0.46 thf(f304,plain,(
% 0.96/0.46 ( ! [X2 : $i,X3 : $i,X1 : $o,X4 : $i] : (($true = ((in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((X4 = Y0) & (~ X1)))))))) | ($false = ((in @ X4 @ X3))) | ($true = X1) | ($false = ((in @ X2 @ X3)))) ) | ~spl30_23),
% 0.96/0.46 inference(avatar_component_clause,[],[f303])).
% 0.96/0.46 thf(f305,plain,(
% 0.96/0.46 spl30_22 | spl30_23),
% 0.96/0.46 inference(avatar_split_clause,[],[f112,f303,f299])).
% 0.96/0.46 thf(f327,definition,(
% 0.96/0.46 spl30_28 <=> (sF10 = ((dsetconstr @ sK2 @ (^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_28])],[avatar_definition])).
% 0.96/0.46 thf(f329,plain,(
% 0.96/0.46 (sF10 = ((dsetconstr @ sK2 @ (^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0)))))) | ~spl30_28),
% 0.96/0.46 inference(avatar_component_clause,[],[f327])).
% 0.96/0.46 thf(f330,plain,(
% 0.96/0.46 spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f56,f327])).
% 0.96/0.46 thf(f387,plain,(
% 0.96/0.46 spl30_5),
% 0.96/0.46 inference(avatar_split_clause,[],[f61,f218])).
% 0.96/0.46 thf(f389,definition,(
% 0.96/0.46 spl30_41 <=> ($false = sF8)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_41])],[avatar_definition])).
% 0.96/0.46 thf(f393,definition,(
% 0.96/0.46 spl30_42 <=> ($true = ((in @ sK1 @ sK2)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_42])],[avatar_definition])).
% 0.96/0.46 thf(f395,plain,(
% 0.96/0.46 ($true = ((in @ sK1 @ sK2))) | ~spl30_42),
% 0.96/0.46 inference(avatar_component_clause,[],[f393])).
% 0.96/0.46 thf(f396,plain,(
% 0.96/0.46 spl30_41 | spl30_42),
% 0.96/0.46 inference(avatar_split_clause,[],[f185,f393,f389])).
% 0.96/0.46 thf(f403,definition,(
% 0.96/0.46 spl30_44 <=> ! [X1 : $i] : ((((setadjoin @ X1 @ emptyset)) != sF10) | ($false = ((in @ X1 @ sF10))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_44])],[avatar_definition])).
% 0.96/0.46 thf(f404,plain,(
% 0.96/0.46 ( ! [X1 : $i] : (($false = ((in @ X1 @ sF10))) | (((setadjoin @ X1 @ emptyset)) != sF10)) ) | ~spl30_44),
% 0.96/0.46 inference(avatar_component_clause,[],[f403])).
% 0.96/0.46 thf(f405,plain,(
% 0.96/0.46 spl30_44 | spl30_7),
% 0.96/0.46 inference(avatar_split_clause,[],[f192,f228,f403])).
% 0.96/0.46 thf(f411,definition,(
% 0.96/0.46 spl30_46 <=> ($false = sF11)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_46])],[avatar_definition])).
% 0.96/0.46 thf(f412,plain,(
% 0.96/0.46 ($false != sF11) | spl30_46),
% 0.96/0.46 inference(avatar_component_clause,[],[f411])).
% 0.96/0.46 thf(f421,definition,(
% 0.96/0.46 ($false != sF11) | ($false != sF12) | (sF12 != $true) | ($true = sF11)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f424,definition,(
% 0.96/0.46 ($false != sF11) | ($false != sF4) | ($true != sF4) | ($true = sF11)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f436,definition,(
% 0.96/0.46 ($false != sF11) | ($false != sF8) | ($true != sF8) | ($true = sF11)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f466,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) != (^[Y0 : $i]: (((~ X1) & (X0 = Y0)) | ((X2 = Y0) & X1)))) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f329,f291])).
% 0.96/0.46 thf(f467,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) != (^[Y0 : $i]: (((X1 = Y0) & X2) | ((X0 = Y0) & (~ X2))))) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f304,f329])).
% 0.96/0.46 thf(f478,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ((((^[Y0 : $i]: (((~ X1) & (X0 = Y0)) | ((X2 = Y0) & X1))) @ (sK31 @ X1 @ X0 @ X2))) != (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK31 @ X1 @ X0 @ X2)))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(negative_extensionality,[],[f466])).
% 0.96/0.46 thf(f479,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | ($true = (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK31 @ X1 @ X0 @ X2)))) | ($true = (((^[Y0 : $i]: (((~ X1) & (X0 = Y0)) | ((X2 = Y0) & X1))) @ (sK31 @ X1 @ X0 @ X2))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(xor_proxy_clausification,[],[f478])).
% 0.96/0.46 thf(f480,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK31 @ X1 @ X0 @ X2)))) | ($false = (((^[Y0 : $i]: (((~ X1) & (X0 = Y0)) | ((X2 = Y0) & X1))) @ (sK31 @ X1 @ X0 @ X2)))) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(xor_proxy_clausification,[],[f478])).
% 0.96/0.46 thf(f481,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $false) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = (((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))) | ((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0)))) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(beta-eta_normalization,[],[f480])).
% 0.96/0.46 thf(f483,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($false = (((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))))) | ($false = (((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))) | ((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f481])).
% 0.96/0.46 thf(f484,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((~ X1))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | ($false = (((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))) | ((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f483])).
% 0.96/0.46 thf(f485,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($false = (((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))) | ((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0)))) | ($true = X1) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($false = ((in @ X2 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(not_proxy_clausification,[],[f484])).
% 0.96/0.46 thf(f486,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | ($false = (((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0))) | ($false = ((in @ X0 @ sK2))) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f485])).
% 0.96/0.46 thf(f487,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | ($true = X1) | ($true = X1) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f485])).
% 0.96/0.46 thf(f488,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((sK3 = (sK31 @ X1 @ X0 @ X2)))) | ($true = X1) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | ($true = X1) | ($false = ((in @ X2 @ sK2))) | ($false = sF9)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f487])).
% 0.96/0.46 thf(f489,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sK3 != ((sK31 @ X1 @ X0 @ X2))) | ($false = sF9) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f488])).
% 0.96/0.46 thf(f490,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((((sK31 @ X1 @ X0 @ X2)) != X0) | ($true = X1) | ($true = X1) | ($false = sF9) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (sK3 != ((sK31 @ X1 @ X0 @ X2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f489])).
% 0.96/0.46 thf(f491,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK3 != ((sK31 @ X1 @ X0 @ X2))) | ($false = sF9) | ($true = X1) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (((sK31 @ X1 @ X0 @ X2)) != X0) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f490])).
% 0.96/0.46 thf(f492,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | ($false = ((X0 = (sK31 @ X1 @ X0 @ X2)))) | ($false = ((in @ X0 @ sK2))) | ($false = ((sK1 = (sK31 @ X1 @ X0 @ X2)))) | ($false = sK0)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f486])).
% 0.96/0.46 thf(f493,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($false = ((sK1 = (sK31 @ X1 @ X0 @ X2)))) | ($false = sK0) | ($true = X1) | ($true = X1) | (((sK31 @ X1 @ X0 @ X2)) != X0) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f492])).
% 0.96/0.46 thf(f494,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = sK0) | (((sK31 @ X1 @ X0 @ X2)) != X0) | (sK1 != ((sK31 @ X1 @ X0 @ X2))) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f493])).
% 0.96/0.46 thf(f495,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($false = sK0) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | (((sK31 @ X1 @ X0 @ X2)) != X0) | (sK1 != ((sK31 @ X1 @ X0 @ X2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f494])).
% 0.96/0.46 thf(f505,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = (((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))) | ((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0)))) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | ($false = ((in @ X2 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(beta-eta_normalization,[],[f479])).
% 0.96/0.46 thf(f506,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = (((sK1 = (sK31 @ X1 @ X0 @ X2)) & sK0))) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | ($true = ((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))))) | ($true = X1) | ($false = ((in @ X2 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f505])).
% 0.96/0.46 thf(f507,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = ((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))))) | ($false = ((in @ X2 @ sK2))) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | ($false = ((in @ X0 @ sK2))) | ($true = X1) | (sK0 = $true) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f506])).
% 0.96/0.46 thf(f508,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | ($true = ((sF9 & (sK3 = (sK31 @ X1 @ X0 @ X2))))) | ($false = ((in @ X0 @ sK2))) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | ($true = ((sK1 = (sK31 @ X1 @ X0 @ X2))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f506])).
% 0.96/0.46 thf(f510,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X2 @ sK2))) | ($true = ((sK1 = (sK31 @ X1 @ X0 @ X2)))) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = sF9) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f508])).
% 0.96/0.46 thf(f511,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | ($true = sF9) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f510])).
% 0.96/0.46 thf(f512,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK1 = ((sK31 @ X1 @ X0 @ X2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | ($true = (((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) | ($true = (((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))))) | ($true = sF9) | ($false = ((in @ X2 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f511])).
% 0.96/0.46 thf(f513,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($true = sF9) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | ($true = (((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))))) | ($true = X1) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f512])).
% 0.96/0.46 thf(f521,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X2 @ sK2))) | ($true = X1) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | ($true = sF9) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (((X0 = (sK31 @ X1 @ X0 @ X2))) = $true)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f513])).
% 0.96/0.46 thf(f525,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($true = X1) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = sF9) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f521])).
% 0.96/0.46 thf(f526,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X2 @ sK2))) | ($true = sF9) | ($false = ((in @ X0 @ sK2))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f525])).
% 0.96/0.46 thf(f543,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK0 = $true) | (((((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))) | ((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) = $true) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = ((sK3 = (sK31 @ X1 @ X0 @ X2)))) | ($false = ((in @ X0 @ sK2))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f507])).
% 0.96/0.46 thf(f559,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X2 @ sK2))) | ($true = (((X2 = (sK31 @ X1 @ X0 @ X2)) & X1))) | (sK0 = $true) | ($true = (((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))))) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($true = ((sK3 = (sK31 @ X1 @ X0 @ X2))))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f543])).
% 0.96/0.46 thf(f560,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = (((~ X1) & (X0 = (sK31 @ X1 @ X0 @ X2))))) | (sK0 = $true) | ($true = X1) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = ((sK3 = (sK31 @ X1 @ X0 @ X2)))) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f559])).
% 0.96/0.46 thf(f569,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X2 @ sK2))) | ($true = ((sK3 = (sK31 @ X1 @ X0 @ X2)))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (sK0 = $true) | ($true = X1) | (((X0 = (sK31 @ X1 @ X0 @ X2))) = $true) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f560])).
% 0.96/0.46 thf(f574,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | (((X0 = (sK31 @ X1 @ X0 @ X2))) = $true) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK3 = ((sK31 @ X1 @ X0 @ X2))) | ($false = ((in @ X2 @ sK2))) | (sK0 = $true) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f569])).
% 0.96/0.46 thf(f575,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($true = X1) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sK0 = $true) | (sK3 = ((sK31 @ X1 @ X0 @ X2))) | ($true = X1) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (((sK31 @ X1 @ X0 @ X2)) = X0)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f574])).
% 0.96/0.46 thf(f576,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK3 = ((sK31 @ X1 @ X0 @ X2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | (sK0 = $true) | ($true = X1)) ) | (~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f575])).
% 0.96/0.46 thf(f577,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($false = $true) | (sK1 != ((sK31 @ X1 @ X0 @ X2))) | ($true = X1) | (((sK31 @ X1 @ X0 @ X2)) != X0) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_8 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(forward_demodulation,[],[f495,f235])).
% 0.96/0.46 thf(f578,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK1 != ((sK31 @ X1 @ X0 @ X2))) | (((sK31 @ X1 @ X0 @ X2)) != X0) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_8 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f577])).
% 0.96/0.46 thf(f581,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($false = $true) | (sK1 = ((sK31 @ X1 @ X0 @ X2))) | ($true = X1)) ) | (~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(forward_demodulation,[],[f526,f244])).
% 0.96/0.46 thf(f582,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK1 = ((sK31 @ X1 @ X0 @ X2))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X0 @ sK2))) | ($true = X1) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f581])).
% 0.96/0.46 thf(f583,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $o,X1 : $i] : (($true = X0) | (sK1 != X1) | ($false = ((in @ X1 @ sK2))) | (((setadjoin @ X1 @ emptyset)) = sF10) | ($false = ((in @ X2 @ sK2))) | (((sK31 @ X0 @ X1 @ X2)) = X1) | (((setadjoin @ X1 @ emptyset)) = sF10) | ($true = X0) | ($false = ((in @ X2 @ sK2))) | (sK1 != sK1) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f578,f582])).
% 0.96/0.46 thf(f585,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $o,X1 : $i] : ((((setadjoin @ X1 @ emptyset)) = sF10) | (((sK31 @ X0 @ X1 @ X2)) = X1) | (sK1 != X1) | ($true = X0) | (sK1 != sK1) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X2 @ sK2)))) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f583])).
% 0.96/0.46 thf(f586,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $o,X1 : $i] : ((((sK31 @ X0 @ X1 @ X2)) = X1) | (((setadjoin @ X1 @ emptyset)) = sF10) | ($false = ((in @ X2 @ sK2))) | ($true = X0) | ($false = ((in @ X1 @ sK2))) | (sK1 != X1)) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f585])).
% 0.96/0.46 thf(f588,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sK1 != X0) | (X0 != X0) | ($true = X1) | ($true = X1) | (sK1 != X0) | ($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f578,f586])).
% 0.96/0.46 thf(f590,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | ($true = X1) | (sK1 != X0) | (X0 != X0) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f588])).
% 0.96/0.46 thf(f593,definition,(
% 0.96/0.46 spl30_48 <=> ! [X2 : $i] : ($false = ((in @ X2 @ sK2)))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_48])],[avatar_definition])).
% 0.96/0.46 thf(f594,plain,(
% 0.96/0.46 ( ! [X2 : $i] : (($false = ((in @ X2 @ sK2)))) ) | ~spl30_48),
% 0.96/0.46 inference(avatar_component_clause,[],[f593])).
% 0.96/0.46 thf(f596,definition,(
% 0.96/0.46 spl30_49 <=> ! [X1 : $o] : ($true = X1)),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_49])],[avatar_definition])).
% 0.96/0.46 thf(f597,plain,(
% 0.96/0.46 ( ! [X1 : $o] : (($true = X1)) ) | ~spl30_49),
% 0.96/0.46 inference(avatar_component_clause,[],[f596])).
% 0.96/0.46 thf(f599,definition,(
% 0.96/0.46 spl30_50 <=> ! [X0 : $i] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | (sK1 != X0) | ($false = ((in @ X0 @ sK2))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_50])],[avatar_definition])).
% 0.96/0.46 thf(f600,plain,(
% 0.96/0.46 ( ! [X0 : $i] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK1 != X0)) ) | ~spl30_50),
% 0.96/0.46 inference(avatar_component_clause,[],[f599])).
% 0.96/0.46 thf(f608,definition,(
% 0.96/0.46 ($false != sK0) | (sK0 != $true) | ($true != sF8) | ($false = sF8)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f611,definition,(
% 0.96/0.46 ($false != sF11) | ($false != sF6) | ($true != sF6) | ($true = sF11)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f623,definition,(
% 0.96/0.46 ($false != sF9) | ($true != sF9) | ($true != sF8) | ($false = sF8)),
% 0.96/0.46 introduced(theory,[theory_tautology_sat_conflict])).
% 0.96/0.46 thf(f625,definition,(
% 0.96/0.46 spl30_51 <=> ! [X2 : $i,X0 : $i,X1 : $o] : ((sK3 = ((sK31 @ X1 @ X0 @ X2))) | ($true = X1) | (((sK31 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_51])],[avatar_definition])).
% 0.96/0.46 thf(f626,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK3 = ((sK31 @ X1 @ X0 @ X2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | (((sK31 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2))) | ($true = X1)) ) | ~spl30_51),
% 0.96/0.46 inference(avatar_component_clause,[],[f625])).
% 0.96/0.46 thf(f627,plain,(
% 0.96/0.46 spl30_51 | spl30_8 | ~spl30_20 | ~spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f576,f327,f290,f233,f625])).
% 0.96/0.46 thf(f644,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sK3 != ((sK31 @ X1 @ X0 @ X2))) | (((sK31 @ X1 @ X0 @ X2)) != X0) | ($false = ((in @ X2 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($false = ((in @ X0 @ sK2)))) ) | (spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f491,f243])).
% 0.96/0.46 thf(f650,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $o,X1 : $i] : ((((sK31 @ X0 @ X1 @ X2)) = X1) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X2 @ sK2))) | (((setadjoin @ X1 @ emptyset)) = sF10) | ($true = X0) | (sK3 != X1)) ) | ~spl30_51),
% 0.96/0.46 inference(equality_factoring,[],[f626])).
% 0.96/0.46 thf(f654,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | (sK3 != X0) | ($false = ((in @ X2 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (sK3 != X0) | (X0 != X0) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($true = X1) | ($false = ((in @ X2 @ sK2)))) ) | (spl30_10 | ~spl30_20 | ~spl30_28 | ~spl30_51)),
% 0.96/0.46 inference(constrained_superposition,[],[f644,f650])).
% 0.96/0.46 thf(f656,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((X0 != X0) | ($false = ((in @ X0 @ sK2))) | ($true = X1) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | (sK3 != X0)) ) | (spl30_10 | ~spl30_20 | ~spl30_28 | ~spl30_51)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f654])).
% 0.96/0.46 thf(f657,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | (sK3 != X0) | ($true = X1) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X2 @ sK2)))) ) | (spl30_10 | ~spl30_20 | ~spl30_28 | ~spl30_51)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f656])).
% 0.96/0.46 thf(f659,definition,(
% 0.96/0.46 spl30_54 <=> ! [X0 : $i] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK3 != X0))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_54])],[avatar_definition])).
% 0.96/0.46 thf(f660,plain,(
% 0.96/0.46 ( ! [X0 : $i] : ((sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK3 != X0)) ) | ~spl30_54),
% 0.96/0.46 inference(avatar_component_clause,[],[f659])).
% 0.96/0.46 thf(f662,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | ((((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK32 @ X1 @ X0 @ X2))) != (((^[Y0 : $i]: (((X1 = Y0) & X2) | ((X0 = Y0) & (~ X2)))) @ (sK32 @ X1 @ X0 @ X2)))) | ($true = X2) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(negative_extensionality,[],[f467])).
% 0.96/0.46 thf(f663,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | ($true = X2) | ($true = (((^[Y0 : $i]: (((X1 = Y0) & X2) | ((X0 = Y0) & (~ X2)))) @ (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK32 @ X1 @ X0 @ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(xor_proxy_clausification,[],[f662])).
% 0.96/0.46 thf(f664,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | ($false = (((^[Y0 : $i]: ((sF9 & (sK3 = Y0)) | ((sK1 = Y0) & sK0))) @ (sK32 @ X1 @ X0 @ X2)))) | ($true = X2) | ($false = ((in @ X1 @ sK2))) | ($false = (((^[Y0 : $i]: (((X1 = Y0) & X2) | ((X0 = Y0) & (~ X2)))) @ (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(xor_proxy_clausification,[],[f662])).
% 0.96/0.46 thf(f665,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | ($false = ((((X1 = (sK32 @ X1 @ X0 @ X2)) & X2) | ((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2))))) | ($false = ((in @ X0 @ sK2))) | ($false = (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))) | ((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0)))) | ($false = ((in @ X1 @ sK2))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(beta-eta_normalization,[],[f664])).
% 0.96/0.46 thf(f666,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | ($false = (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))) | ((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0)))) | ($true = ((in @ X0 @ sF10))) | ($false = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f665])).
% 0.96/0.46 thf(f676,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f666])).
% 0.96/0.46 thf(f677,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($false = ((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f666])).
% 0.96/0.46 thf(f678,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))))) | ($false = ((~ X2))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($true = X2) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f677])).
% 0.96/0.46 thf(f679,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((~ X2))) | ($false = sF9) | ($false = ((sK3 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($true = X2) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f678])).
% 0.96/0.46 thf(f680,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X1 @ sK2))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((sK3 = (sK32 @ X1 @ X0 @ X2)))) | ($false = sF9) | ($true = ((in @ X0 @ sF10))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(not_proxy_clausification,[],[f679])).
% 0.96/0.46 thf(f681,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = sF9) | ($false = ((sK3 = (sK32 @ X1 @ X0 @ X2)))) | (((sK32 @ X1 @ X0 @ X2)) != X0) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f680])).
% 0.96/0.46 thf(f682,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) != X0) | ($false = sF9) | (sK3 != ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X1 @ sK2))) | ($true = X2) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f681])).
% 0.96/0.46 thf(f683,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != ((sK32 @ X1 @ X0 @ X2))) | (((sK32 @ X1 @ X0 @ X2)) != X0) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = sF9)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f682])).
% 0.96/0.46 thf(f684,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($false = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($false = ((in @ X1 @ sK2))) | ($false = sK0) | ($true = ((in @ X0 @ sF10))) | ($false = ((sK1 = (sK32 @ X1 @ X0 @ X2)))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f676])).
% 0.96/0.46 thf(f685,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = sK0) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((sK1 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((~ X2))) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f684])).
% 0.96/0.46 thf(f686,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($false = ((~ X2))) | ($true = ((in @ X0 @ sF10))) | (sK1 != ((sK32 @ X1 @ X0 @ X2))) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($false = sK0)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f685])).
% 0.96/0.46 thf(f687,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($false = sK0) | (sK1 != ((sK32 @ X1 @ X0 @ X2))) | ($true = X2) | ($false = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(not_proxy_clausification,[],[f686])).
% 0.96/0.46 thf(f688,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X1 @ X0 @ X2)) != X0) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | (sK1 != ((sK32 @ X1 @ X0 @ X2))) | ($false = sK0) | ($false = ((in @ X1 @ sK2))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f687])).
% 0.96/0.46 thf(f689,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($false = sK0) | (sK1 != ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X1 @ sK2))) | (((sK32 @ X1 @ X0 @ X2)) != X0)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f688])).
% 0.96/0.46 thf(f690,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((((X1 = (sK32 @ X1 @ X0 @ X2)) & X2) | ((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2))))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($true = (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))) | ((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(beta-eta_normalization,[],[f663])).
% 0.96/0.46 thf(f691,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X1 @ sK2))) | ($true = (((X1 = (sK32 @ X1 @ X0 @ X2)) & X2))) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($true = (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))) | ((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0)))) | ($false = ((in @ X0 @ sK2))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f690])).
% 0.96/0.46 thf(f692,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2))) | ((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0)))) | ($true = ((in @ X0 @ sF10))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f691])).
% 0.96/0.46 thf(f725,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | (((sF9 & (sK3 = (sK32 @ X1 @ X0 @ X2)))) = $true) | ($false = ((in @ X1 @ sK2))) | ($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(or_proxy_clausification,[],[f692])).
% 0.96/0.46 thf(f726,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($true = ((sK3 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X1 @ sK2))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = X2) | ($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = X2) | ($true = ((in @ X0 @ sF10)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f725])).
% 0.96/0.46 thf(f727,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = X2) | ($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = ((in @ X0 @ sF10))) | ($true = X2) | ($true = sF9)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f725])).
% 0.96/0.46 thf(f729,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($true = X2) | ($true = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = sF9) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f727])).
% 0.96/0.46 thf(f730,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($true = X2) | ($false = ((in @ X1 @ sK2))) | ($true = sF9) | (((sK32 @ X1 @ X0 @ X2)) = X0) | ($true = X2) | ($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = ((in @ X0 @ sF10)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f729])).
% 0.96/0.46 thf(f732,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($true = sF9) | ($true = X2) | ($true = ((sK1 = (sK32 @ X1 @ X0 @ X2))))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f730])).
% 0.96/0.46 thf(f733,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) = X0) | (sK1 = ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X1 @ sK2))) | ($true = sF9)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f732])).
% 0.96/0.46 thf(f734,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X1 @ sK2))) | ($true = sF9) | (sK1 = ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f733])).
% 0.96/0.46 thf(f743,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = (((sK1 = (sK32 @ X1 @ X0 @ X2)) & sK0))) | ($true = X2) | ($true = X2) | (sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f726])).
% 0.96/0.46 thf(f744,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = (((X0 = (sK32 @ X1 @ X0 @ X2)) & (~ X2)))) | ($true = X2) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | (sK3 = ((sK32 @ X1 @ X0 @ X2))) | (sK0 = $true) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f743])).
% 0.96/0.46 thf(f754,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($true = ((X0 = (sK32 @ X1 @ X0 @ X2)))) | ($false = ((in @ X1 @ sK2))) | ($true = X2) | (sK0 = $true) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(and_proxy_clausification,[],[f744])).
% 0.96/0.46 thf(f755,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) = X0) | ($true = X2) | (sK0 = $true) | ($false = ((in @ X1 @ sK2))) | (sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($true = X2) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(equality_proxy_clausification,[],[f754])).
% 0.96/0.46 thf(f756,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (sK0 = $true) | ($true = ((in @ X0 @ sF10))) | (sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($true = X2)) ) | (~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f755])).
% 0.96/0.46 thf(f763,plain,(
% 0.96/0.46 ($false = $true) | (~spl30_42 | ~spl30_48)),
% 0.96/0.46 inference(constrained_superposition,[],[f395,f594])).
% 0.96/0.46 thf(f771,plain,(
% 0.96/0.46 $false | (~spl30_42 | ~spl30_48)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f763])).
% 0.96/0.46 thf(f772,plain,(
% 0.96/0.46 ~spl30_42 | ~spl30_48),
% 0.96/0.46 inference(avatar_contradiction_clause,[],[f771])).
% 0.96/0.46 thf(f807,plain,(
% 0.96/0.46 ( ! [X2 : $i,X0 : $i,X1 : $o] : (($false = ((in @ X0 @ sK2))) | (sF10 = ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X2 @ sK2))) | ($true = X1) | (sK1 != X0)) ) | (~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f590])).
% 0.96/0.46 thf(f817,definition,(
% 0.96/0.46 spl30_56 <=> ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X1 @ X0 @ X2)) = X0) | ($true = X2) | (sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_56])],[avatar_definition])).
% 0.96/0.46 thf(f818,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 = ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) = X0) | ($true = X2) | ($false = ((in @ X0 @ sK2)))) ) | ~spl30_56),
% 0.96/0.46 inference(avatar_component_clause,[],[f817])).
% 0.96/0.46 thf(f819,plain,(
% 0.96/0.46 spl30_8 | spl30_56 | ~spl30_23 | ~spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f756,f327,f303,f817,f233])).
% 0.96/0.46 thf(f830,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK1 != ((sK32 @ X1 @ X0 @ X2))) | (((sK32 @ X1 @ X0 @ X2)) != X0) | ($true = ((in @ X0 @ sF10))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2)))) ) | (spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f689,f247])).
% 0.96/0.46 thf(f831,plain,(
% 0.96/0.46 spl30_49 | spl30_50 | spl30_48 | ~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f807,f327,f290,f242,f233,f593,f599,f596])).
% 0.96/0.46 thf(f833,definition,(
% 0.96/0.46 spl30_59 <=> ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != ((sK32 @ X1 @ X0 @ X2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | (((sK32 @ X1 @ X0 @ X2)) != X0))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_59])],[avatar_definition])).
% 0.96/0.46 thf(f834,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != ((sK32 @ X1 @ X0 @ X2))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | (((sK32 @ X1 @ X0 @ X2)) != X0) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2)))) ) | ~spl30_59),
% 0.96/0.46 inference(avatar_component_clause,[],[f833])).
% 0.96/0.46 thf(f835,plain,(
% 0.96/0.46 spl30_10 | spl30_59 | ~spl30_23 | ~spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f683,f327,f303,f833,f242])).
% 0.96/0.46 thf(f842,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK1 = ((sK32 @ X1 @ X0 @ X2))) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | (((sK32 @ X1 @ X0 @ X2)) = X0) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2)))) ) | (spl30_9 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f734,f238])).
% 0.96/0.46 thf(f893,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X1 @ sF10))) | (((sK32 @ X0 @ X1 @ X2)) = X1) | ($true = X2) | (sK1 != sK1) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | (sK1 != X1) | ($true = ((in @ X1 @ sF10))) | ($true = X2)) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f830,f842])).
% 0.96/0.46 thf(f895,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X1 @ sK2))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X1 @ sF10))) | (sK1 != sK1) | (sK1 != X1) | (((sK32 @ X0 @ X1 @ X2)) = X1)) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f893])).
% 0.96/0.46 thf(f896,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X0 @ X1 @ X2)) = X1) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X1 @ sF10))) | (sK1 != X1) | ($false = ((in @ X0 @ sK2))) | ($true = X2)) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f895])).
% 0.96/0.46 thf(f898,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = X2) | ($true = ((in @ X0 @ sF10))) | ($true = X2) | (X0 != X0) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | (sK1 != X0) | (sK1 != X0) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2)))) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(constrained_superposition,[],[f830,f896])).
% 0.96/0.46 thf(f899,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($false = ((in @ X0 @ sK2))) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2))) | (sK1 != X0) | (X0 != X0)) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f898])).
% 0.96/0.46 thf(f900,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK1 != X0) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X0 @ sF10)))) ) | (spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f899])).
% 0.96/0.46 thf(f903,definition,(
% 0.96/0.46 spl30_63 <=> ! [X0 : $i] : ((sK1 != X0) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_63])],[avatar_definition])).
% 0.96/0.46 thf(f904,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | (sK1 != X0)) ) | ~spl30_63),
% 0.96/0.46 inference(avatar_component_clause,[],[f903])).
% 0.96/0.46 thf(f905,plain,(
% 0.96/0.46 spl30_49 | spl30_63 | spl30_48 | spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28),
% 0.96/0.46 inference(avatar_split_clause,[],[f900,f327,f303,f246,f237,f593,f903,f596])).
% 0.96/0.46 thf(f906,plain,(
% 0.96/0.46 ( ! [X0 : $i] : ((sF10 != ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK1 != X0) | ($false = $true)) ) | (~spl30_44 | ~spl30_63)),
% 0.96/0.46 inference(constrained_superposition,[],[f904,f404])).
% 0.96/0.46 thf(f908,plain,(
% 0.96/0.46 ( ! [X0 : $i] : ((sF10 != ((setadjoin @ X0 @ emptyset))) | ($false = ((in @ X0 @ sK2))) | (sK1 != X0)) ) | (~spl30_44 | ~spl30_63)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f906])).
% 0.96/0.46 thf(f910,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK2))) | (sK1 != X0)) ) | (~spl30_44 | ~spl30_50 | ~spl30_63)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f908,f600])).
% 0.96/0.46 thf(f914,plain,(
% 0.96/0.46 ($false = $true) | (sK1 != sK1) | (~spl30_42 | ~spl30_44 | ~spl30_50 | ~spl30_63)),
% 0.96/0.46 inference(constrained_superposition,[],[f910,f395])).
% 0.96/0.46 thf(f920,plain,(
% 0.96/0.46 $false | (~spl30_42 | ~spl30_44 | ~spl30_50 | ~spl30_63)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f914])).
% 0.96/0.46 thf(f921,plain,(
% 0.96/0.46 ~spl30_42 | ~spl30_44 | ~spl30_50 | ~spl30_63),
% 0.96/0.46 inference(avatar_contradiction_clause,[],[f920])).
% 0.96/0.46 thf(f936,plain,(
% 0.96/0.46 $false | (spl30_7 | ~spl30_49)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f230,f597])).
% 0.96/0.46 thf(f937,plain,(
% 0.96/0.46 spl30_7 | ~spl30_49),
% 0.96/0.46 inference(avatar_contradiction_clause,[],[f936])).
% 0.96/0.46 thf(f951,plain,(
% 0.96/0.46 spl30_49 | spl30_54 | spl30_48 | spl30_10 | ~spl30_20 | ~spl30_28 | ~spl30_51),
% 0.96/0.46 inference(avatar_split_clause,[],[f657,f625,f327,f290,f242,f593,f659,f596])).
% 0.96/0.46 thf(f960,plain,(
% 0.96/0.46 ($false = sF11) | ($true != $true) | spl30_7),
% 0.96/0.46 inference(constrained_superposition,[],[f230,f36])).
% 0.96/0.46 thf(f961,plain,(
% 0.96/0.46 ($false = sF11) | spl30_7),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f960])).
% 0.96/0.46 thf(f962,plain,(
% 0.96/0.46 $false | (spl30_7 | spl30_46)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f961,f412])).
% 0.96/0.46 thf(f963,plain,(
% 0.96/0.46 spl30_7 | spl30_46),
% 0.96/0.46 inference(avatar_contradiction_clause,[],[f962])).
% 0.96/0.46 thf(f1144,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : (($true = ((in @ X1 @ sF10))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | (sK3 != X1) | ($false = ((in @ X1 @ sK2))) | ($true = X2) | (sK3 != sK3) | (((sK32 @ X0 @ X1 @ X2)) = X1) | ($true = ((in @ X1 @ sF10)))) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(constrained_superposition,[],[f834,f818])).
% 0.96/0.46 thf(f1146,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != X1) | (((sK32 @ X0 @ X1 @ X2)) = X1) | ($true = X2) | (sK3 != sK3) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($true = ((in @ X1 @ sF10)))) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f1144])).
% 0.96/0.46 thf(f1147,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((((sK32 @ X0 @ X1 @ X2)) = X1) | ($false = ((in @ X1 @ sK2))) | (sK3 != X1) | ($true = ((in @ X1 @ sF10))) | ($true = X2) | ($false = ((in @ X0 @ sK2)))) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f1146])).
% 0.96/0.46 thf(f1149,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != X0) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | ($false = ((in @ X0 @ sK2))) | ($false = ((in @ X1 @ sK2))) | (X0 != X0) | (sK3 != X0) | ($true = X2) | ($true = ((in @ X0 @ sF10))) | ($true = ((in @ X0 @ sF10))) | ($true = X2)) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(constrained_superposition,[],[f834,f1147])).
% 0.96/0.46 thf(f1151,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != X0) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))) | (X0 != X0) | ($true = X2) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(duplicate_literal_removal,[],[f1149])).
% 0.96/0.46 thf(f1152,plain,(
% 0.96/0.46 ( ! [X2 : $o,X0 : $i,X1 : $i] : ((sK3 != X0) | ($true = X2) | ($false = ((in @ X0 @ sK2))) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X1 @ sK2)))) ) | (~spl30_56 | ~spl30_59)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f1151])).
% 0.96/0.46 thf(f1154,definition,(
% 0.96/0.46 spl30_70 <=> ! [X0 : $i] : ((sK3 != X0) | ($true = ((in @ X0 @ sF10))) | ($false = ((in @ X0 @ sK2))))),
% 0.96/0.46 introduced(definition,[new_symbols(definition,[spl30_70])],[avatar_definition])).
% 0.96/0.46 thf(f1155,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($true = ((in @ X0 @ sF10))) | (sK3 != X0) | ($false = ((in @ X0 @ sK2)))) ) | ~spl30_70),
% 0.96/0.46 inference(avatar_component_clause,[],[f1154])).
% 0.96/0.46 thf(f1156,plain,(
% 0.96/0.46 spl30_70 | spl30_49 | spl30_48 | ~spl30_56 | ~spl30_59),
% 0.96/0.46 inference(avatar_split_clause,[],[f1152,f833,f817,f593,f596,f1154])).
% 0.96/0.46 thf(f1157,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($false = $true) | ($false = ((in @ X0 @ sK2))) | (sF10 != ((setadjoin @ X0 @ emptyset))) | (sK3 != X0)) ) | (~spl30_44 | ~spl30_70)),
% 0.96/0.46 inference(constrained_superposition,[],[f1155,f404])).
% 0.96/0.46 thf(f1159,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK2))) | (sK3 != X0) | (sF10 != ((setadjoin @ X0 @ emptyset)))) ) | (~spl30_44 | ~spl30_70)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f1157])).
% 0.96/0.46 thf(f1161,plain,(
% 0.96/0.46 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK2))) | (sK3 != X0)) ) | (~spl30_44 | ~spl30_54 | ~spl30_70)),
% 0.96/0.46 inference(forward_subsumption_resolution,[],[f1159,f660])).
% 0.96/0.46 thf(f1166,plain,(
% 0.96/0.46 ($false = $true) | (sK3 != sK3) | (~spl30_2 | ~spl30_44 | ~spl30_54 | ~spl30_70)),
% 0.96/0.46 inference(constrained_superposition,[],[f207,f1161])).
% 0.96/0.46 thf(f1170,plain,(
% 0.96/0.46 $false | (~spl30_2 | ~spl30_44 | ~spl30_54 | ~spl30_70)),
% 0.96/0.46 inference(trivial_inequality_removal,[],[f1166])).
% 0.96/0.46 thf(f1171,plain,(
% 0.96/0.46 ~spl30_2 | ~spl30_44 | ~spl30_54 | ~spl30_70),
% 0.96/0.46 inference(avatar_contradiction_clause,[],[f1170])).
% 0.96/0.46 cnf(s1, plain, spl30_1, inference(sat_conversion,[],[f203])).
% 0.96/0.46 cnf(s2, plain, spl30_2 | spl30_3, inference(sat_conversion,[],[f212])).
% 0.96/0.46 cnf(s5, plain, ~spl30_7, inference(sat_conversion,[],[f231])).
% 0.96/0.46 cnf(s6, plain, spl30_8 | spl30_9, inference(sat_conversion,[],[f240])).
% 0.96/0.46 cnf(s7, plain, spl30_10 | spl30_11, inference(sat_conversion,[],[f249])).
% 0.96/0.46 cnf(s8, plain, spl30_12, inference(sat_conversion,[],[f254])).
% 0.96/0.46 cnf(s15, plain, spl30_20 | spl30_21, inference(sat_conversion,[],[f296])).
% 0.96/0.46 cnf(s16, plain, spl30_15, inference(sat_conversion,[],[f297])).
% 0.96/0.46 cnf(s17, plain, spl30_22 | spl30_23, inference(sat_conversion,[],[f305])).
% 0.96/0.46 cnf(s22, plain, spl30_28, inference(sat_conversion,[],[f330])).
% 0.96/0.46 cnf(s33, plain, spl30_5, inference(sat_conversion,[],[f387])).
% 0.96/0.46 cnf(s34, plain, spl30_41 | spl30_42, inference(sat_conversion,[],[f396])).
% 0.96/0.46 cnf(s36, plain, spl30_7 | spl30_44, inference(sat_conversion,[],[f405])).
% 0.96/0.46 cnf(s40, plain, ~spl30_3 | ~spl30_5 | spl30_7 | ~spl30_46, inference(sat_conversion,[],[f421])).
% 0.96/0.46 cnf(s43, plain, ~spl30_1 | spl30_7 | ~spl30_22 | ~spl30_46, inference(sat_conversion,[],[f424])).
% 0.96/0.46 cnf(s55, plain, spl30_7 | ~spl30_12 | ~spl30_41 | ~spl30_46, inference(sat_conversion,[],[f436])).
% 0.96/0.46 cnf(s66, plain, ~spl30_8 | ~spl30_11 | ~spl30_12 | spl30_41, inference(sat_conversion,[],[f608])).
% 0.96/0.46 cnf(s69, plain, spl30_7 | ~spl30_15 | ~spl30_21 | ~spl30_46, inference(sat_conversion,[],[f611])).
% 0.96/0.46 cnf(s81, plain, ~spl30_9 | ~spl30_10 | ~spl30_12 | spl30_41, inference(sat_conversion,[],[f623])).
% 0.96/0.46 cnf(s82, plain, spl30_8 | ~spl30_20 | ~spl30_28 | spl30_51, inference(sat_conversion,[],[f627])).
% 0.96/0.46 cnf(s89, plain, ~spl30_42 | ~spl30_48, inference(sat_conversion,[],[f772])).
% 0.96/0.46 cnf(s94, plain, spl30_8 | ~spl30_23 | ~spl30_28 | spl30_56, inference(sat_conversion,[],[f819])).
% 0.96/0.46 cnf(s100, plain, ~spl30_8 | ~spl30_10 | ~spl30_20 | ~spl30_28 | spl30_48 | spl30_49 | spl30_50, inference(sat_conversion,[],[f831])).
% 0.96/0.46 cnf(s101, plain, spl30_10 | ~spl30_23 | ~spl30_28 | spl30_59, inference(sat_conversion,[],[f835])).
% 0.96/0.46 cnf(s106, plain, spl30_9 | spl30_11 | ~spl30_23 | ~spl30_28 | spl30_48 | spl30_49 | spl30_63, inference(sat_conversion,[],[f905])).
% 0.96/0.46 cnf(s108, plain, ~spl30_42 | ~spl30_44 | ~spl30_50 | ~spl30_63, inference(sat_conversion,[],[f921])).
% 0.96/0.46 cnf(s113, plain, spl30_7 | ~spl30_49, inference(sat_conversion,[],[f937])).
% 0.96/0.46 cnf(s114, plain, spl30_10 | ~spl30_20 | ~spl30_28 | spl30_48 | spl30_49 | ~spl30_51 | spl30_54, inference(sat_conversion,[],[f951])).
% 0.96/0.46 cnf(s115, plain, spl30_7 | spl30_46, inference(sat_conversion,[],[f963])).
% 0.96/0.46 cnf(s127, plain, spl30_48 | spl30_49 | ~spl30_56 | ~spl30_59 | spl30_70, inference(sat_conversion,[],[f1156])).
% 0.96/0.46 cnf(s129, plain, ~spl30_2 | ~spl30_44 | ~spl30_54 | ~spl30_70, inference(sat_conversion,[],[f1171])).
% 0.96/0.46 cnf(s130, plain, spl30_46, inference(rat,[],[s115,s5])).
% 0.96/0.46 cnf(s131, plain, ~spl30_49, inference(rat,[],[s113,s5])).
% 0.96/0.46 cnf(s132, plain, ~spl30_21, inference(rat,[],[s69,s130,s16,s5])).
% 0.96/0.46 cnf(s133, plain, ~spl30_41, inference(rat,[],[s55,s130,s8,s5])).
% 0.96/0.46 cnf(s136, plain, spl30_44, inference(rat,[],[s36,s5])).
% 0.96/0.46 cnf(s137, plain, ~spl30_3, inference(rat,[],[s40,s130,s33,s5])).
% 0.96/0.46 cnf(s138, plain, spl30_20, inference(rat,[],[s15,s132])).
% 0.96/0.46 cnf(s139, plain, spl30_42, inference(rat,[],[s34,s133])).
% 0.96/0.46 cnf(s142, plain, ~spl30_48, inference(rat,[],[s89,s139])).
% 0.96/0.46 cnf(s143, plain, spl30_2, inference(rat,[],[s2,s137])).
% 0.96/0.46 cnf(s144, plain, ~spl30_22, inference(rat,[],[s43,s130,s5,s1])).
% 0.96/0.46 cnf(s145, plain, spl30_23, inference(rat,[],[s17,s144])).
% 0.96/0.46 cnf(s146, plain, spl30_8, inference(rat,[],[s127,s129,s101,s114,s81,s6,s82,s94,s131,s142,s136,s143,s22,s145,s138,s8,s133])).
% 0.96/0.46 cnf(s147, plain, ~spl30_11, inference(rat,[],[s66,s133,s8,s146])).
% 0.96/0.46 cnf(s148, plain, spl30_10, inference(rat,[],[s7,s147])).
% 0.96/0.46 cnf(s151, plain, ~spl30_9, inference(rat,[],[s81,s133,s8,s148])).
% 0.96/0.46 cnf(s152, plain, spl30_50, inference(rat,[],[s100,s146,s131,s142,s22,s138,s148])).
% 0.96/0.46 cnf(s153, plain, spl30_63, inference(rat,[],[s106,s147,s131,s142,s22,s145,s151])).
% 0.96/0.46 cnf(s154, plain, $false, inference(rat,[],[s108,s139,s136,s153,s152])).
% 0.96/0.46 thf(f1175,plain,(
% 0.96/0.46 $false),
% 0.96/0.46 inference(avatar_sat_refutation,[],[s154])).
% 0.96/0.46 % SZS output end Proof for theBenchmark
% 0.96/0.46 % (1309662)------------------------------
% 0.96/0.46 % (1309662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.46 % (1309662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.46 % (1309662)CaDiCaL version: 2.1.3
% 0.96/0.46 % (1309662)Termination reason: Refutation
% 0.96/0.46 % (1309662)Time elapsed: 0.047 s
% 0.96/0.46 % (1309662)Peak memory usage: 13 MB
% 0.96/0.46 % (1309662)Instructions burned: 92 (million)
% 0.96/0.46 % (1309597)Success in time 0.211 s
% 0.96/0.46 % Vampire exiting
%------------------------------------------------------------------------------