TSTP Solution File: SEU645^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU645^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:50:17 EDT 2024
% Result : Theorem 0.22s 0.44s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU645^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 18:17:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.38 % (3284)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.38 % (3284)Instruction limit reached!
% 0.22/0.38 % (3284)------------------------------
% 0.22/0.38 % (3284)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (3284)Termination reason: Unknown
% 0.22/0.38 % (3284)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (3284)Memory used [KB]: 1023
% 0.22/0.38 % (3284)Time elapsed: 0.002 s
% 0.22/0.38 % (3284)Instructions burned: 3 (million)
% 0.22/0.38 % (3284)------------------------------
% 0.22/0.38 % (3284)------------------------------
% 0.22/0.39 % (3278)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.22/0.39 % (3277)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.22/0.39 % (3280)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39 % (3281)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39 % (3282)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.22/0.39 % (3283)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39 % (3280)Instruction limit reached!
% 0.22/0.39 % (3280)------------------------------
% 0.22/0.39 % (3280)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (3280)Termination reason: Unknown
% 0.22/0.39 % (3280)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (3280)Memory used [KB]: 895
% 0.22/0.39 % (3280)Time elapsed: 0.003 s
% 0.22/0.39 % (3280)Instructions burned: 2 (million)
% 0.22/0.39 % (3280)------------------------------
% 0.22/0.39 % (3280)------------------------------
% 0.22/0.39 % (3279)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.22/0.39 % (3281)Instruction limit reached!
% 0.22/0.39 % (3281)------------------------------
% 0.22/0.39 % (3281)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (3281)Termination reason: Unknown
% 0.22/0.39 % (3281)Termination phase: Property scanning
% 0.22/0.39
% 0.22/0.39 % (3281)Memory used [KB]: 1023
% 0.22/0.39 % (3281)Time elapsed: 0.004 s
% 0.22/0.39 % (3281)Instructions burned: 3 (million)
% 0.22/0.39 % (3281)------------------------------
% 0.22/0.39 % (3281)------------------------------
% 0.22/0.39 % (3278)Instruction limit reached!
% 0.22/0.39 % (3278)------------------------------
% 0.22/0.39 % (3278)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (3278)Termination reason: Unknown
% 0.22/0.39 % (3278)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (3278)Memory used [KB]: 1023
% 0.22/0.39 % (3278)Time elapsed: 0.005 s
% 0.22/0.39 % (3278)Instructions burned: 5 (million)
% 0.22/0.39 % (3278)------------------------------
% 0.22/0.39 % (3278)------------------------------
% 0.22/0.39 % (3285)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.39 % (3282)Refutation not found, incomplete strategy
% 0.22/0.39 % (3282)------------------------------
% 0.22/0.39 % (3282)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (3282)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.39
% 0.22/0.39
% 0.22/0.39 % (3282)Memory used [KB]: 5628
% 0.22/0.39 % (3282)Time elapsed: 0.009 s
% 0.22/0.39 % (3282)Instructions burned: 10 (million)
% 0.22/0.39 % (3282)------------------------------
% 0.22/0.39 % (3282)------------------------------
% 0.22/0.40 % (3283)Instruction limit reached!
% 0.22/0.40 % (3283)------------------------------
% 0.22/0.40 % (3283)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (3283)Termination reason: Unknown
% 0.22/0.40 % (3283)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (3283)Memory used [KB]: 5628
% 0.22/0.40 % (3283)Time elapsed: 0.013 s
% 0.22/0.40 % (3283)Instructions burned: 18 (million)
% 0.22/0.40 % (3283)------------------------------
% 0.22/0.40 % (3283)------------------------------
% 0.22/0.40 % (3285)Instruction limit reached!
% 0.22/0.40 % (3285)------------------------------
% 0.22/0.40 % (3285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (3285)Termination reason: Unknown
% 0.22/0.40 % (3285)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (3285)Memory used [KB]: 5756
% 0.22/0.40 % (3285)Time elapsed: 0.013 s
% 0.22/0.40 % (3285)Instructions burned: 38 (million)
% 0.22/0.40 % (3285)------------------------------
% 0.22/0.40 % (3285)------------------------------
% 0.22/0.40 % (3286)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.22/0.40 % (3287)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.40 % (3288)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.22/0.40 % (3279)Instruction limit reached!
% 0.22/0.40 % (3279)------------------------------
% 0.22/0.40 % (3279)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (3279)Termination reason: Unknown
% 0.22/0.40 % (3279)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (3279)Memory used [KB]: 5756
% 0.22/0.40 % (3279)Time elapsed: 0.019 s
% 0.22/0.40 % (3279)Instructions burned: 28 (million)
% 0.22/0.40 % (3279)------------------------------
% 0.22/0.40 % (3279)------------------------------
% 0.22/0.40 % (3287)Instruction limit reached!
% 0.22/0.40 % (3287)------------------------------
% 0.22/0.40 % (3287)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (3287)Termination reason: Unknown
% 0.22/0.40 % (3287)Termination phase: Function definition elimination
% 0.22/0.40
% 0.22/0.40 % (3287)Memory used [KB]: 1023
% 0.22/0.40 % (3287)Time elapsed: 0.004 s
% 0.22/0.40 % (3287)Instructions burned: 4 (million)
% 0.22/0.40 % (3287)------------------------------
% 0.22/0.40 % (3287)------------------------------
% 0.22/0.41 % (3289)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.41 % (3291)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.41 % (3291)Instruction limit reached!
% 0.22/0.41 % (3291)------------------------------
% 0.22/0.41 % (3291)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3291)Termination reason: Unknown
% 0.22/0.41 % (3291)Termination phase: Twee Goal Transformation
% 0.22/0.41
% 0.22/0.41 % (3291)Memory used [KB]: 1023
% 0.22/0.41 % (3291)Time elapsed: 0.003 s
% 0.22/0.41 % (3291)Instructions burned: 5 (million)
% 0.22/0.41 % (3291)------------------------------
% 0.22/0.41 % (3291)------------------------------
% 0.22/0.41 % (3286)Instruction limit reached!
% 0.22/0.41 % (3286)------------------------------
% 0.22/0.41 % (3286)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3286)Termination reason: Unknown
% 0.22/0.41 % (3286)Termination phase: Saturation
% 0.22/0.41
% 0.22/0.41 % (3286)Memory used [KB]: 5628
% 0.22/0.41 % (3286)Time elapsed: 0.011 s
% 0.22/0.41 % (3286)Instructions burned: 15 (million)
% 0.22/0.41 % (3286)------------------------------
% 0.22/0.41 % (3286)------------------------------
% 0.22/0.41 % (3290)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.22/0.41 % (3289)Instruction limit reached!
% 0.22/0.41 % (3289)------------------------------
% 0.22/0.41 % (3289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (3289)Termination reason: Unknown
% 0.22/0.41 % (3289)Termination phase: Saturation
% 0.22/0.41
% 0.22/0.41 % (3289)Memory used [KB]: 1023
% 0.22/0.41 % (3289)Time elapsed: 0.006 s
% 0.22/0.41 % (3289)Instructions burned: 7 (million)
% 0.22/0.41 % (3289)------------------------------
% 0.22/0.41 % (3289)------------------------------
% 0.22/0.42 % (3294)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.42 % (3292)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.42 % (3293)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.42 % (3294)Instruction limit reached!
% 0.22/0.42 % (3294)------------------------------
% 0.22/0.42 % (3294)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3294)Termination reason: Unknown
% 0.22/0.42 % (3294)Termination phase: Saturation
% 0.22/0.42
% 0.22/0.42 % (3294)Memory used [KB]: 5500
% 0.22/0.42 % (3294)Time elapsed: 0.003 s
% 0.22/0.42 % (3294)Instructions burned: 6 (million)
% 0.22/0.42 % (3294)------------------------------
% 0.22/0.42 % (3294)------------------------------
% 0.22/0.42 % (3292)Instruction limit reached!
% 0.22/0.42 % (3292)------------------------------
% 0.22/0.42 % (3292)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3292)Termination reason: Unknown
% 0.22/0.42 % (3292)Termination phase: Property scanning
% 0.22/0.42
% 0.22/0.42 % (3292)Memory used [KB]: 1023
% 0.22/0.42 % (3292)Time elapsed: 0.004 s
% 0.22/0.42 % (3292)Instructions burned: 4 (million)
% 0.22/0.42 % (3292)------------------------------
% 0.22/0.42 % (3292)------------------------------
% 0.22/0.42 % (3290)Instruction limit reached!
% 0.22/0.42 % (3290)------------------------------
% 0.22/0.42 % (3290)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3290)Termination reason: Unknown
% 0.22/0.42 % (3290)Termination phase: Saturation
% 0.22/0.42
% 0.22/0.42 % (3290)Memory used [KB]: 5884
% 0.22/0.42 % (3290)Time elapsed: 0.013 s
% 0.22/0.42 % (3290)Instructions burned: 16 (million)
% 0.22/0.42 % (3290)------------------------------
% 0.22/0.42 % (3290)------------------------------
% 0.22/0.42 % (3293)Instruction limit reached!
% 0.22/0.42 % (3293)------------------------------
% 0.22/0.42 % (3293)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42 % (3293)Termination reason: Unknown
% 0.22/0.42 % (3293)Termination phase: Saturation
% 0.22/0.42
% 0.22/0.42 % (3293)Memory used [KB]: 5500
% 0.22/0.42 % (3293)Time elapsed: 0.028 s
% 0.22/0.42 % (3293)Instructions burned: 7 (million)
% 0.22/0.42 % (3293)------------------------------
% 0.22/0.42 % (3293)------------------------------
% 0.22/0.43 % (3295)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.22/0.43 % (3295)Instruction limit reached!
% 0.22/0.43 % (3295)------------------------------
% 0.22/0.43 % (3295)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (3295)Termination reason: Unknown
% 0.22/0.43 % (3295)Termination phase: Function definition elimination
% 0.22/0.43
% 0.22/0.43 % (3295)Memory used [KB]: 1023
% 0.22/0.43 % (3295)Time elapsed: 0.004 s
% 0.22/0.43 % (3296)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.43 % (3295)Instructions burned: 4 (million)
% 0.22/0.43 % (3295)------------------------------
% 0.22/0.43 % (3295)------------------------------
% 0.22/0.43 % (3297)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.22/0.44 % (3298)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.22/0.44 % (3299)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.22/0.44 % (3298)Instruction limit reached!
% 0.22/0.44 % (3298)------------------------------
% 0.22/0.44 % (3298)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (3298)Termination reason: Unknown
% 0.22/0.44 % (3298)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (3300)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.22/0.44 % (3298)Memory used [KB]: 5500
% 0.22/0.44 % (3298)Time elapsed: 0.005 s
% 0.22/0.44 % (3298)Instructions burned: 6 (million)
% 0.22/0.44 % (3298)------------------------------
% 0.22/0.44 % (3298)------------------------------
% 0.22/0.44 % (3297)First to succeed.
% 0.22/0.44 % (3296)Instruction limit reached!
% 0.22/0.44 % (3296)------------------------------
% 0.22/0.44 % (3296)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (3296)Termination reason: Unknown
% 0.22/0.44 % (3296)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (3296)Memory used [KB]: 5628
% 0.22/0.44 % (3296)Time elapsed: 0.014 s
% 0.22/0.44 % (3296)Instructions burned: 19 (million)
% 0.22/0.44 % (3296)------------------------------
% 0.22/0.44 % (3296)------------------------------
% 0.22/0.44 % (3299)Refutation not found, incomplete strategy
% 0.22/0.44 % (3299)------------------------------
% 0.22/0.44 % (3299)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (3299)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44 % (3299)Memory used [KB]: 5500
% 0.22/0.44 % (3299)Time elapsed: 0.005 s
% 0.22/0.44 % (3299)Instructions burned: 5 (million)
% 0.22/0.44 % (3299)------------------------------
% 0.22/0.44 % (3299)------------------------------
% 0.22/0.44 % (3297)Refutation found. Thanks to Tanya!
% 0.22/0.44 % SZS status Theorem for theBenchmark
% 0.22/0.44 % SZS output start Proof for theBenchmark
% 0.22/0.44 thf(func_def_0, type, in: $i > $i > $o).
% 0.22/0.44 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.22/0.44 thf(func_def_3, type, setunion: $i > $i).
% 0.22/0.44 thf(func_def_4, type, dsetconstr: $i > ($i > $o) > $i).
% 0.22/0.44 thf(func_def_7, type, iskpair: $i > $o).
% 0.22/0.44 thf(func_def_8, type, kpair: $i > $i > $i).
% 0.22/0.44 thf(func_def_10, type, singleton: $i > $o).
% 0.22/0.44 thf(func_def_14, type, kfst: $i > $i).
% 0.22/0.44 thf(func_def_34, type, sK10: $i > $o).
% 0.22/0.44 thf(func_def_38, type, ph13: !>[X0: $tType]:(X0)).
% 0.22/0.44 thf(func_def_39, type, sK14: $i > $i > $i).
% 0.22/0.44 thf(func_def_40, type, sK15: $i > $i > $i > $i > $i).
% 0.22/0.44 thf(f145,plain,(
% 0.22/0.44 $false),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f144])).
% 0.22/0.44 thf(f144,plain,(
% 0.22/0.44 ($true = $false)),
% 0.22/0.44 inference(superposition,[],[f115,f139])).
% 0.22/0.44 thf(f139,plain,(
% 0.22/0.44 ((in @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) = $false)),
% 0.22/0.44 inference(forward_demodulation,[],[f138,f135])).
% 0.22/0.44 thf(f135,plain,(
% 0.22/0.44 (sK3 = (sK14 @ sK2 @ sK3))),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f134])).
% 0.22/0.44 thf(f134,plain,(
% 0.22/0.44 ($true != $true) | (sK3 = (sK14 @ sK2 @ sK3))),
% 0.22/0.44 inference(superposition,[],[f98,f133])).
% 0.22/0.44 thf(f133,plain,(
% 0.22/0.44 ($true = (in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))))),
% 0.22/0.44 inference(duplicate_literal_removal,[],[f132])).
% 0.22/0.44 thf(f132,plain,(
% 0.22/0.44 ($true = (in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)))) | ($true = (in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))))),
% 0.22/0.44 inference(equality_resolution,[],[f126])).
% 0.22/0.44 thf(f126,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) | ((in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = $true) | ($true = (in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))))) )),
% 0.22/0.44 inference(binary_proxy_clausification,[],[f125])).
% 0.22/0.44 thf(f125,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) | ((in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) != (in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))))) )),
% 0.22/0.44 inference(beta_eta_normalization,[],[f124])).
% 0.22/0.44 thf(f124,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : ((((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)))) @ (sK14 @ X1 @ X0)) != ((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) @ (sK14 @ X1 @ X0))) | ((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) )),
% 0.22/0.44 inference(negative_extensionality,[],[f123])).
% 0.22/0.44 thf(f123,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)))) != (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) | ((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) )),
% 0.22/0.44 inference(subsumption_resolution,[],[f122,f121])).
% 0.22/0.44 thf(f121,plain,(
% 0.22/0.44 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))) != (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) | (X0 = X2) | ((setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) )),
% 0.22/0.44 inference(constrained_superposition,[],[f114,f114])).
% 0.22/0.44 thf(f114,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) = X0)) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f113])).
% 0.22/0.44 thf(f113,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) = X0) | ($true != $true)) )),
% 0.22/0.44 inference(superposition,[],[f98,f112])).
% 0.22/0.44 thf(f112,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setadjoin @ (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) )),
% 0.22/0.44 inference(beta_eta_normalization,[],[f111])).
% 0.22/0.44 thf(f111,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) @ (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))))))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f110])).
% 0.22/0.44 thf(f110,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))) @ (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))))) | ($true != $true)) )),
% 0.22/0.44 inference(superposition,[],[f100,f109])).
% 0.22/0.44 thf(f109,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f108])).
% 0.22/0.44 thf(f108,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))))) | ($true != $true)) )),
% 0.22/0.44 inference(superposition,[],[f104,f107])).
% 0.22/0.44 thf(f107,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (singleton @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f106])).
% 0.22/0.44 thf(f106,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (singleton @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))))) | ($true != $true)) )),
% 0.22/0.44 inference(superposition,[],[f103,f102])).
% 0.22/0.44 thf(f102,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (iskpair @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) )),
% 0.22/0.44 inference(beta_eta_normalization,[],[f101])).
% 0.22/0.44 thf(f101,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((iskpair @ ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ X0 @ X1)) = $true)) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f90])).
% 0.22/0.44 thf(f90,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((iskpair @ ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ X0 @ X1)) = $true) | ($true != $true)) )),
% 0.22/0.44 inference(definition_unfolding,[],[f75,f82,f67])).
% 0.22/0.44 thf(f67,plain,(
% 0.22/0.44 (kpairp = $true)),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f48,plain,(
% 0.22/0.44 (theprop = $true) & (kfstsingleton = $true) & (dsetconstrER = $true) & (sK3 != (kfst @ (kpair @ sK3 @ sK2))) & (setukpairinjL1 = $true) & (kpairp = $true)),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f37,f47])).
% 0.22/0.44 thf(f47,plain,(
% 0.22/0.44 ? [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) != X1) => (sK3 != (kfst @ (kpair @ sK3 @ sK2)))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f37,plain,(
% 0.22/0.44 (theprop = $true) & (kfstsingleton = $true) & (dsetconstrER = $true) & ? [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) != X1) & (setukpairinjL1 = $true) & (kpairp = $true)),
% 0.22/0.44 inference(flattening,[],[f36])).
% 0.22/0.44 thf(f36,plain,(
% 0.22/0.44 ((((? [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) != X1) & (theprop = $true)) & (kfstsingleton = $true)) & (setukpairinjL1 = $true)) & (kpairp = $true)) & (dsetconstrER = $true)),
% 0.22/0.44 inference(ennf_transformation,[],[f18])).
% 0.22/0.44 thf(f18,plain,(
% 0.22/0.44 ~((dsetconstrER = $true) => ((kpairp = $true) => ((setukpairinjL1 = $true) => ((kfstsingleton = $true) => ((theprop = $true) => ! [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) = X1))))))),
% 0.22/0.44 inference(fool_elimination,[],[f17])).
% 0.22/0.44 thf(f17,plain,(
% 0.22/0.44 ~(dsetconstrER => (kpairp => (setukpairinjL1 => (kfstsingleton => (theprop => ! [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) = X1))))))),
% 0.22/0.44 inference(rectify,[],[f11])).
% 0.22/0.44 thf(f11,negated_conjecture,(
% 0.22/0.44 ~(dsetconstrER => (kpairp => (setukpairinjL1 => (kfstsingleton => (theprop => ! [X3,X2] : ((kfst @ (kpair @ X2 @ X3)) = X2))))))),
% 0.22/0.44 inference(negated_conjecture,[],[f10])).
% 0.22/0.44 thf(f10,conjecture,(
% 0.22/0.44 dsetconstrER => (kpairp => (setukpairinjL1 => (kfstsingleton => (theprop => ! [X3,X2] : ((kfst @ (kpair @ X2 @ X3)) = X2)))))),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq)).
% 0.22/0.44 thf(f82,plain,(
% 0.22/0.44 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.22/0.44 inference(cnf_transformation,[],[f30])).
% 0.22/0.44 thf(f30,plain,(
% 0.22/0.44 (kpair = (^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))))),
% 0.22/0.44 inference(fool_elimination,[],[f29])).
% 0.22/0.44 thf(f29,plain,(
% 0.22/0.44 (kpair = (^[X0 : $i, X1 : $i] : (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))),
% 0.22/0.44 inference(rectify,[],[f3])).
% 0.22/0.44 thf(f3,axiom,(
% 0.22/0.44 (kpair = (^[X2 : $i, X3 : $i] : (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))))),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair)).
% 0.22/0.44 thf(f75,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (iskpair @ (kpair @ X0 @ X1))) | (kpairp != $true)) )),
% 0.22/0.44 inference(cnf_transformation,[],[f52])).
% 0.22/0.44 thf(f52,plain,(
% 0.22/0.44 (! [X0,X1] : ($true = (iskpair @ (kpair @ X0 @ X1))) | (kpairp != $true)) & ((kpairp = $true) | ($true != (iskpair @ (kpair @ sK4 @ sK5))))),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f50,f51])).
% 0.22/0.44 thf(f51,plain,(
% 0.22/0.44 ? [X2,X3] : ((iskpair @ (kpair @ X2 @ X3)) != $true) => ($true != (iskpair @ (kpair @ sK4 @ sK5)))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f50,plain,(
% 0.22/0.44 (! [X0,X1] : ($true = (iskpair @ (kpair @ X0 @ X1))) | (kpairp != $true)) & ((kpairp = $true) | ? [X2,X3] : ((iskpair @ (kpair @ X2 @ X3)) != $true))),
% 0.22/0.44 inference(rectify,[],[f49])).
% 0.22/0.44 thf(f49,plain,(
% 0.22/0.44 (! [X0,X1] : ($true = (iskpair @ (kpair @ X0 @ X1))) | (kpairp != $true)) & ((kpairp = $true) | ? [X0,X1] : ($true != (iskpair @ (kpair @ X0 @ X1))))),
% 0.22/0.44 inference(nnf_transformation,[],[f24])).
% 0.22/0.44 thf(f24,plain,(
% 0.22/0.44 ! [X0,X1] : ($true = (iskpair @ (kpair @ X0 @ X1))) <=> (kpairp = $true)),
% 0.22/0.44 inference(fool_elimination,[],[f23])).
% 0.22/0.44 thf(f23,plain,(
% 0.22/0.44 (kpairp = ! [X0,X1] : (iskpair @ (kpair @ X0 @ X1)))),
% 0.22/0.44 inference(rectify,[],[f4])).
% 0.22/0.44 thf(f4,axiom,(
% 0.22/0.44 (kpairp = ! [X2,X3] : (iskpair @ (kpair @ X2 @ X3)))),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairp)).
% 0.22/0.44 thf(f103,plain,(
% 0.22/0.44 ( ! [X0 : $i] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f83])).
% 0.22/0.44 thf(f83,plain,(
% 0.22/0.44 ( ! [X0 : $i] : (($true != $true) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0))))) | ($true != (iskpair @ X0))) )),
% 0.22/0.44 inference(definition_unfolding,[],[f63,f71])).
% 0.22/0.44 thf(f71,plain,(
% 0.22/0.44 (kfstsingleton = $true)),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f63,plain,(
% 0.22/0.44 ( ! [X0 : $i] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0))))) | (kfstsingleton != $true)) )),
% 0.22/0.44 inference(cnf_transformation,[],[f42])).
% 0.22/0.44 thf(f42,plain,(
% 0.22/0.44 (! [X0] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) | (kfstsingleton != $true)) & ((kfstsingleton = $true) | (($true = (iskpair @ sK0)) & ($true != (singleton @ (dsetconstr @ (setunion @ sK0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ sK0)))))))),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f40,f41])).
% 0.22/0.44 thf(f41,plain,(
% 0.22/0.44 ? [X1] : (($true = (iskpair @ X1)) & ($true != (singleton @ (dsetconstr @ (setunion @ X1) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X1)))))) => (($true = (iskpair @ sK0)) & ($true != (singleton @ (dsetconstr @ (setunion @ sK0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ sK0))))))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f40,plain,(
% 0.22/0.44 (! [X0] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) | (kfstsingleton != $true)) & ((kfstsingleton = $true) | ? [X1] : (($true = (iskpair @ X1)) & ($true != (singleton @ (dsetconstr @ (setunion @ X1) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X1)))))))),
% 0.22/0.44 inference(rectify,[],[f39])).
% 0.22/0.44 thf(f39,plain,(
% 0.22/0.44 (! [X0] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) | (kfstsingleton != $true)) & ((kfstsingleton = $true) | ? [X0] : (($true = (iskpair @ X0)) & ($true != (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))))),
% 0.22/0.44 inference(nnf_transformation,[],[f33])).
% 0.22/0.44 thf(f33,plain,(
% 0.22/0.44 ! [X0] : (($true != (iskpair @ X0)) | ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) <=> (kfstsingleton = $true)),
% 0.22/0.44 inference(ennf_transformation,[],[f28])).
% 0.22/0.44 thf(f28,plain,(
% 0.22/0.44 ! [X0] : (($true = (iskpair @ X0)) => ($true = (singleton @ (dsetconstr @ (setunion @ X0) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ X0)))))) <=> (kfstsingleton = $true)),
% 0.22/0.44 inference(fool_elimination,[],[f27])).
% 0.22/0.44 thf(f27,plain,(
% 0.22/0.44 (! [X0] : ((iskpair @ X0) => (singleton @ (dsetconstr @ (setunion @ X0) @ (^[X1 : $i] : (in @ (setadjoin @ X1 @ emptyset) @ X0))))) = kfstsingleton)),
% 0.22/0.44 inference(rectify,[],[f7])).
% 0.22/0.44 thf(f7,axiom,(
% 0.22/0.44 (! [X5] : ((iskpair @ X5) => (singleton @ (dsetconstr @ (setunion @ X5) @ (^[X2 : $i] : (in @ (setadjoin @ X2 @ emptyset) @ X5))))) = kfstsingleton)),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstsingleton)).
% 0.22/0.44 thf(f104,plain,(
% 0.22/0.44 ( ! [X1 : $i] : (($true != (singleton @ X1)) | ($true = (in @ (setunion @ X1) @ X1))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f88])).
% 0.22/0.44 thf(f88,plain,(
% 0.22/0.44 ( ! [X1 : $i] : (($true != (singleton @ X1)) | ($true = (in @ (setunion @ X1) @ X1)) | ($true != $true)) )),
% 0.22/0.44 inference(definition_unfolding,[],[f64,f72])).
% 0.22/0.44 thf(f72,plain,(
% 0.22/0.44 (theprop = $true)),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f64,plain,(
% 0.22/0.44 ( ! [X1 : $i] : (($true != (singleton @ X1)) | ($true = (in @ (setunion @ X1) @ X1)) | (theprop != $true)) )),
% 0.22/0.44 inference(cnf_transformation,[],[f46])).
% 0.22/0.44 thf(f46,plain,(
% 0.22/0.44 ((theprop = $true) | (($true = (singleton @ sK1)) & ((in @ (setunion @ sK1) @ sK1) != $true))) & (! [X1] : (($true != (singleton @ X1)) | ($true = (in @ (setunion @ X1) @ X1))) | (theprop != $true))),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f44,f45])).
% 0.22/0.44 thf(f45,plain,(
% 0.22/0.44 ? [X0] : (($true = (singleton @ X0)) & ($true != (in @ (setunion @ X0) @ X0))) => (($true = (singleton @ sK1)) & ((in @ (setunion @ sK1) @ sK1) != $true))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f44,plain,(
% 0.22/0.44 ((theprop = $true) | ? [X0] : (($true = (singleton @ X0)) & ($true != (in @ (setunion @ X0) @ X0)))) & (! [X1] : (($true != (singleton @ X1)) | ($true = (in @ (setunion @ X1) @ X1))) | (theprop != $true))),
% 0.22/0.44 inference(rectify,[],[f43])).
% 0.22/0.44 thf(f43,plain,(
% 0.22/0.44 ((theprop = $true) | ? [X0] : (($true = (singleton @ X0)) & ($true != (in @ (setunion @ X0) @ X0)))) & (! [X0] : (($true != (singleton @ X0)) | ($true = (in @ (setunion @ X0) @ X0))) | (theprop != $true))),
% 0.22/0.44 inference(nnf_transformation,[],[f35])).
% 0.22/0.44 thf(f35,plain,(
% 0.22/0.44 (theprop = $true) <=> ! [X0] : (($true != (singleton @ X0)) | ($true = (in @ (setunion @ X0) @ X0)))),
% 0.22/0.44 inference(ennf_transformation,[],[f26])).
% 0.22/0.44 thf(f26,plain,(
% 0.22/0.44 (theprop = $true) <=> ! [X0] : (($true = (singleton @ X0)) => ($true = (in @ (setunion @ X0) @ X0)))),
% 0.22/0.44 inference(fool_elimination,[],[f25])).
% 0.22/0.44 thf(f25,plain,(
% 0.22/0.44 (! [X0] : ((singleton @ X0) => (in @ (setunion @ X0) @ X0)) = theprop)),
% 0.22/0.44 inference(rectify,[],[f8])).
% 0.22/0.44 thf(f8,axiom,(
% 0.22/0.44 (! [X6] : ((singleton @ X6) => (in @ (setunion @ X6) @ X6)) = theprop)),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop)).
% 0.22/0.44 thf(f100,plain,(
% 0.22/0.44 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (($true != (in @ X3 @ (dsetconstr @ X5 @ X4))) | ($true = (X4 @ X3))) )),
% 0.22/0.44 inference(beta_eta_normalization,[],[f99])).
% 0.22/0.44 thf(f99,plain,(
% 0.22/0.44 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (($true = (X4 @ X3)) | ($true != (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))))) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f97])).
% 0.22/0.44 thf(f97,plain,(
% 0.22/0.44 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (($true != $true) | ($true != (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0))))) | ($true = (X4 @ X3))) )),
% 0.22/0.44 inference(definition_unfolding,[],[f79,f70])).
% 0.22/0.44 thf(f70,plain,(
% 0.22/0.44 (dsetconstrER = $true)),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f79,plain,(
% 0.22/0.44 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (($true != (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0))))) | ($true = (X4 @ X3)) | (dsetconstrER != $true)) )),
% 0.22/0.44 inference(cnf_transformation,[],[f60])).
% 0.22/0.44 thf(f60,plain,(
% 0.22/0.44 ((dsetconstrER = $true) | (($true = (in @ sK9 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: (sK10 @ Y0))))) & ((sK10 @ sK9) != $true))) & (! [X3,X4 : $i > $o,X5] : (($true != (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0))))) | ($true = (X4 @ X3))) | (dsetconstrER != $true))),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f58,f59])).
% 0.22/0.44 thf(f59,plain,(
% 0.22/0.44 ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ($true != (X1 @ X0))) => (($true = (in @ sK9 @ (dsetconstr @ sK11 @ (^[Y0 : $i]: (sK10 @ Y0))))) & ((sK10 @ sK9) != $true))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f58,plain,(
% 0.22/0.44 ((dsetconstrER = $true) | ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ($true != (X1 @ X0)))) & (! [X3,X4 : $i > $o,X5] : (($true != (in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0))))) | ($true = (X4 @ X3))) | (dsetconstrER != $true))),
% 0.22/0.44 inference(rectify,[],[f57])).
% 0.22/0.44 thf(f57,plain,(
% 0.22/0.44 ((dsetconstrER = $true) | ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ($true != (X1 @ X0)))) & (! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ($true = (X1 @ X0))) | (dsetconstrER != $true))),
% 0.22/0.44 inference(nnf_transformation,[],[f38])).
% 0.22/0.44 thf(f38,plain,(
% 0.22/0.44 (dsetconstrER = $true) <=> ! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ($true = (X1 @ X0)))),
% 0.22/0.44 inference(ennf_transformation,[],[f22])).
% 0.22/0.44 thf(f22,plain,(
% 0.22/0.44 (dsetconstrER = $true) <=> ! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) => ($true = (X1 @ X0)))),
% 0.22/0.44 inference(fool_elimination,[],[f21])).
% 0.22/0.44 thf(f21,plain,(
% 0.22/0.44 (! [X0,X1 : $i > $o,X2] : ((in @ X0 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X0)) = dsetconstrER)),
% 0.22/0.44 inference(rectify,[],[f1])).
% 0.22/0.44 thf(f1,axiom,(
% 0.22/0.44 (! [X2,X1 : $i > $o,X0] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)) = dsetconstrER)),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.22/0.44 thf(f122,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : ((sK3 != X0) | ((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) | ((^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)))) != (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)))))) )),
% 0.22/0.44 inference(constrained_superposition,[],[f105,f114])).
% 0.22/0.44 thf(f105,plain,(
% 0.22/0.44 (sK3 != (setunion @ (dsetconstr @ (setunion @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) @ (^[Y0 : $i]: (in @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)))))))),
% 0.22/0.44 inference(beta_eta_normalization,[],[f89])).
% 0.22/0.44 thf(f89,plain,(
% 0.22/0.44 (sK3 != ((^[Y0 : $i]: (setunion @ (dsetconstr @ (setunion @ Y0) @ (^[Y1 : $i]: (in @ (setadjoin @ Y1 @ emptyset) @ Y0))))) @ ((^[Y0 : $i]: ((^[Y1 : $i]: (setadjoin @ (setadjoin @ Y0 @ emptyset) @ (setadjoin @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)) @ emptyset))))) @ sK3 @ sK2)))),
% 0.22/0.44 inference(definition_unfolding,[],[f69,f73,f82])).
% 0.22/0.44 thf(f73,plain,(
% 0.22/0.44 (kfst = (^[Y0 : $i]: (setunion @ (dsetconstr @ (setunion @ Y0) @ (^[Y1 : $i]: (in @ (setadjoin @ Y1 @ emptyset) @ Y0))))))),
% 0.22/0.44 inference(cnf_transformation,[],[f32])).
% 0.22/0.44 thf(f32,plain,(
% 0.22/0.44 (kfst = (^[Y0 : $i]: (setunion @ (dsetconstr @ (setunion @ Y0) @ (^[Y1 : $i]: (in @ (setadjoin @ Y1 @ emptyset) @ Y0))))))),
% 0.22/0.44 inference(fool_elimination,[],[f31])).
% 0.22/0.44 thf(f31,plain,(
% 0.22/0.44 (kfst = (^[X0 : $i] : (setunion @ (dsetconstr @ (setunion @ X0) @ (^[X1 : $i] : (in @ (setadjoin @ X1 @ emptyset) @ X0))))))),
% 0.22/0.44 inference(rectify,[],[f9])).
% 0.22/0.44 thf(f9,axiom,(
% 0.22/0.44 (kfst = (^[X5 : $i] : (setunion @ (dsetconstr @ (setunion @ X5) @ (^[X2 : $i] : (in @ (setadjoin @ X2 @ emptyset) @ X5))))))),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfst)).
% 0.22/0.44 thf(f69,plain,(
% 0.22/0.44 (sK3 != (kfst @ (kpair @ sK3 @ sK2)))),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f98,plain,(
% 0.22/0.44 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1)) )),
% 0.22/0.44 inference(trivial_inequality_removal,[],[f92])).
% 0.22/0.44 thf(f92,plain,(
% 0.22/0.44 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | ($true != $true) | ((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true)) )),
% 0.22/0.44 inference(definition_unfolding,[],[f78,f68])).
% 0.22/0.44 thf(f68,plain,(
% 0.22/0.44 (setukpairinjL1 = $true)),
% 0.22/0.44 inference(cnf_transformation,[],[f48])).
% 0.22/0.44 thf(f78,plain,(
% 0.22/0.44 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1) | (setukpairinjL1 != $true)) )),
% 0.22/0.44 inference(cnf_transformation,[],[f56])).
% 0.22/0.44 thf(f56,plain,(
% 0.22/0.44 (! [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1)) | (setukpairinjL1 != $true)) & ((setukpairinjL1 = $true) | (((in @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK7 @ emptyset) @ (setadjoin @ (setadjoin @ sK7 @ (setadjoin @ sK8 @ emptyset)) @ emptyset))) = $true) & (sK7 != sK6)))),
% 0.22/0.44 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f54,f55])).
% 0.22/0.44 thf(f55,plain,(
% 0.22/0.44 ? [X3,X4,X5] : (((in @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X5 @ emptyset)) @ emptyset))) = $true) & (X3 != X4)) => (((in @ (setadjoin @ sK6 @ emptyset) @ (setadjoin @ (setadjoin @ sK7 @ emptyset) @ (setadjoin @ (setadjoin @ sK7 @ (setadjoin @ sK8 @ emptyset)) @ emptyset))) = $true) & (sK7 != sK6))),
% 0.22/0.44 introduced(choice_axiom,[])).
% 0.22/0.44 thf(f54,plain,(
% 0.22/0.44 (! [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1)) | (setukpairinjL1 != $true)) & ((setukpairinjL1 = $true) | ? [X3,X4,X5] : (((in @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X4 @ (setadjoin @ X5 @ emptyset)) @ emptyset))) = $true) & (X3 != X4)))),
% 0.22/0.44 inference(rectify,[],[f53])).
% 0.22/0.44 thf(f53,plain,(
% 0.22/0.44 (! [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1)) | (setukpairinjL1 != $true)) & ((setukpairinjL1 = $true) | ? [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = $true) & (X0 != X1)))),
% 0.22/0.44 inference(nnf_transformation,[],[f34])).
% 0.22/0.44 thf(f34,plain,(
% 0.22/0.44 ! [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) != $true) | (X0 = X1)) <=> (setukpairinjL1 = $true)),
% 0.22/0.44 inference(ennf_transformation,[],[f20])).
% 0.22/0.44 thf(f20,plain,(
% 0.22/0.44 ! [X0,X1,X2] : (((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) = $true) => (X0 = X1)) <=> (setukpairinjL1 = $true)),
% 0.22/0.44 inference(fool_elimination,[],[f19])).
% 0.22/0.44 thf(f19,plain,(
% 0.22/0.44 (setukpairinjL1 = ! [X0,X1,X2] : ((in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset))) => (X0 = X1)))),
% 0.22/0.44 inference(rectify,[],[f6])).
% 0.22/0.44 thf(f6,axiom,(
% 0.22/0.44 (setukpairinjL1 = ! [X4,X2,X3] : ((in @ (setadjoin @ X4 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset))) => (X2 = X4)))),
% 0.22/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1)).
% 0.22/0.44 thf(f138,plain,(
% 0.22/0.44 ((in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) = $false)),
% 0.22/0.44 inference(duplicate_literal_removal,[],[f137])).
% 0.22/0.44 thf(f137,plain,(
% 0.22/0.44 ((in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) = $false) | ((in @ (setadjoin @ (sK14 @ sK2 @ sK3) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) = $false)),
% 0.22/0.44 inference(equality_resolution,[],[f127])).
% 0.22/0.44 thf(f127,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (((setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) | ((in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ emptyset) @ (setadjoin @ (setadjoin @ sK3 @ (setadjoin @ sK2 @ emptyset)) @ emptyset))) = $false) | ((in @ (setadjoin @ (sK14 @ X1 @ X0) @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))) = $false)) )),
% 0.22/0.44 inference(binary_proxy_clausification,[],[f125])).
% 0.22/0.44 thf(f115,plain,(
% 0.22/0.44 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset))))) )),
% 0.22/0.44 inference(backward_demodulation,[],[f112,f114])).
% 0.22/0.44 % SZS output end Proof for theBenchmark
% 0.22/0.44 % (3297)------------------------------
% 0.22/0.44 % (3297)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (3297)Termination reason: Refutation
% 0.22/0.44
% 0.22/0.44 % (3297)Memory used [KB]: 5756
% 0.22/0.44 % (3297)Time elapsed: 0.015 s
% 0.22/0.44 % (3297)Instructions burned: 34 (million)
% 0.22/0.44 % (3297)------------------------------
% 0.22/0.44 % (3297)------------------------------
% 0.22/0.44 % (3276)Success in time 0.074 s
% 0.22/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------