TSTP Solution File: SEU705^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU705^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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:54 EDT 2024
% Result : Theorem 2.28s 0.67s
% Output : Refutation 2.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU705^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.37 % Computer : n016.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sun May 19 16:48:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 % (31708)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.14/0.39 % (31709)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.14/0.39 % (31711)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (31710)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.14/0.39 % (31712)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.14/0.39 % (31713)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.14/0.39 % (31714)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (31715)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.14/0.39 % (31711)Instruction limit reached!
% 0.14/0.39 % (31711)------------------------------
% 0.14/0.39 % (31711)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31711)Termination reason: Unknown
% 0.14/0.39 % (31711)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (31712)Instruction limit reached!
% 0.14/0.39 % (31712)------------------------------
% 0.14/0.39 % (31712)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31712)Termination reason: Unknown
% 0.14/0.39 % (31712)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (31712)Memory used [KB]: 1023
% 0.14/0.39 % (31712)Time elapsed: 0.003 s
% 0.14/0.39 % (31712)Instructions burned: 2 (million)
% 0.14/0.39 % (31712)------------------------------
% 0.14/0.39 % (31712)------------------------------
% 0.14/0.39 % (31711)Memory used [KB]: 1023
% 0.14/0.39 % (31711)Time elapsed: 0.003 s
% 0.14/0.39 % (31711)Instructions burned: 2 (million)
% 0.14/0.39 % (31711)------------------------------
% 0.14/0.39 % (31711)------------------------------
% 0.14/0.39 % (31709)Instruction limit reached!
% 0.14/0.39 % (31709)------------------------------
% 0.14/0.39 % (31709)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31709)Termination reason: Unknown
% 0.14/0.39 % (31709)Termination phase: Function definition elimination
% 0.14/0.39
% 0.14/0.39 % (31709)Memory used [KB]: 1023
% 0.14/0.39 % (31709)Time elapsed: 0.003 s
% 0.14/0.39 % (31709)Instructions burned: 4 (million)
% 0.14/0.39 % (31709)------------------------------
% 0.14/0.39 % (31709)------------------------------
% 0.14/0.39 % (31715)Instruction limit reached!
% 0.14/0.39 % (31715)------------------------------
% 0.14/0.39 % (31715)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (31715)Termination reason: Unknown
% 0.14/0.39 % (31715)Termination phase: Function definition elimination
% 0.14/0.39
% 0.14/0.39 % (31715)Memory used [KB]: 1023
% 0.14/0.39 % (31715)Time elapsed: 0.004 s
% 0.14/0.39 % (31715)Instructions burned: 4 (million)
% 0.14/0.39 % (31715)------------------------------
% 0.14/0.39 % (31715)------------------------------
% 0.14/0.40 % (31714)Instruction limit reached!
% 0.14/0.40 % (31714)------------------------------
% 0.14/0.40 % (31714)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (31714)Termination reason: Unknown
% 0.14/0.40 % (31714)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (31714)Memory used [KB]: 5628
% 0.14/0.40 % (31714)Time elapsed: 0.013 s
% 0.14/0.40 % (31714)Instructions burned: 19 (million)
% 0.14/0.40 % (31714)------------------------------
% 0.14/0.40 % (31714)------------------------------
% 0.14/0.41 % (31710)Instruction limit reached!
% 0.14/0.41 % (31710)------------------------------
% 0.14/0.41 % (31710)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (31710)Termination reason: Unknown
% 0.14/0.41 % (31710)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (31710)Memory used [KB]: 5628
% 0.14/0.41 % (31710)Time elapsed: 0.016 s
% 0.14/0.41 % (31710)Instructions burned: 27 (million)
% 0.14/0.41 % (31710)------------------------------
% 0.14/0.41 % (31710)------------------------------
% 0.14/0.41 % (31716)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.14/0.41 % (31717)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.14/0.41 % (31718)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.14/0.41 % (31719)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.14/0.41 % (31718)Instruction limit reached!
% 0.14/0.41 % (31718)------------------------------
% 0.14/0.41 % (31718)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (31718)Termination reason: Unknown
% 0.14/0.41 % (31718)Termination phase: Property scanning
% 0.14/0.41
% 0.14/0.41 % (31718)Memory used [KB]: 1023
% 0.14/0.41 % (31718)Time elapsed: 0.004 s
% 0.14/0.41 % (31718)Instructions burned: 4 (million)
% 0.14/0.41 % (31718)------------------------------
% 0.14/0.41 % (31718)------------------------------
% 0.14/0.42 % (31717)Instruction limit reached!
% 0.14/0.42 % (31717)------------------------------
% 0.14/0.42 % (31717)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (31717)Termination reason: Unknown
% 0.14/0.42 % (31717)Termination phase: Saturation
% 0.14/0.42
% 0.14/0.42 % (31717)Memory used [KB]: 5756
% 0.14/0.42 % (31717)Time elapsed: 0.011 s
% 0.14/0.42 % (31717)Instructions burned: 15 (million)
% 0.14/0.42 % (31717)------------------------------
% 0.14/0.42 % (31717)------------------------------
% 0.14/0.42 % (31720)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.14/0.42 % (31721)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.14/0.42 % (31720)Instruction limit reached!
% 0.14/0.42 % (31720)------------------------------
% 0.14/0.42 % (31720)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (31720)Termination reason: Unknown
% 0.14/0.42 % (31720)Termination phase: Saturation
% 0.14/0.42
% 0.14/0.42 % (31720)Memory used [KB]: 1023
% 0.14/0.42 % (31720)Time elapsed: 0.006 s
% 0.14/0.42 % (31720)Instructions burned: 8 (million)
% 0.14/0.42 % (31720)------------------------------
% 0.14/0.42 % (31720)------------------------------
% 0.14/0.43 % (31722)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.14/0.43 % (31722)Instruction limit reached!
% 0.14/0.43 % (31722)------------------------------
% 0.14/0.43 % (31722)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.43 % (31722)Termination reason: Unknown
% 0.14/0.43 % (31722)Termination phase: Twee Goal Transformation
% 0.14/0.43
% 0.14/0.43 % (31722)Memory used [KB]: 1023
% 0.14/0.43 % (31722)Time elapsed: 0.004 s
% 0.14/0.43 % (31722)Instructions burned: 4 (million)
% 0.14/0.43 % (31722)------------------------------
% 0.14/0.43 % (31722)------------------------------
% 0.14/0.43 % (31716)Instruction limit reached!
% 0.14/0.43 % (31716)------------------------------
% 0.14/0.43 % (31716)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.43 % (31716)Termination reason: Unknown
% 0.14/0.43 % (31716)Termination phase: Saturation
% 0.14/0.43
% 0.14/0.43 % (31716)Memory used [KB]: 5756
% 0.14/0.43 % (31716)Time elapsed: 0.022 s
% 0.14/0.43 % (31716)Instructions burned: 38 (million)
% 0.14/0.43 % (31716)------------------------------
% 0.14/0.43 % (31716)------------------------------
% 0.14/0.43 % (31721)Instruction limit reached!
% 0.14/0.43 % (31721)------------------------------
% 0.14/0.43 % (31721)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.43 % (31723)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.14/0.43 % (31721)Termination reason: Unknown
% 0.14/0.43 % (31721)Termination phase: Saturation
% 0.14/0.43
% 0.14/0.43 % (31721)Memory used [KB]: 5884
% 0.14/0.43 % (31721)Time elapsed: 0.012 s
% 0.14/0.43 % (31721)Instructions burned: 16 (million)
% 0.14/0.43 % (31721)------------------------------
% 0.14/0.43 % (31721)------------------------------
% 0.23/0.43 % (31723)Instruction limit reached!
% 0.23/0.43 % (31723)------------------------------
% 0.23/0.43 % (31723)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43 % (31723)Termination reason: Unknown
% 0.23/0.43 % (31723)Termination phase: Function definition elimination
% 0.23/0.43
% 0.23/0.43 % (31723)Memory used [KB]: 1023
% 0.23/0.43 % (31723)Time elapsed: 0.004 s
% 0.23/0.43 % (31723)Instructions burned: 4 (million)
% 0.23/0.43 % (31723)------------------------------
% 0.23/0.43 % (31723)------------------------------
% 0.23/0.44 % (31724)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.23/0.44 % (31724)Refutation not found, incomplete strategy
% 0.23/0.44 % (31724)------------------------------
% 0.23/0.44 % (31724)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (31724)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.44
% 0.23/0.44
% 0.23/0.44 % (31724)Memory used [KB]: 5500
% 0.23/0.44 % (31724)Time elapsed: 0.005 s
% 0.23/0.44 % (31724)Instructions burned: 5 (million)
% 0.23/0.44 % (31724)------------------------------
% 0.23/0.44 % (31724)------------------------------
% 0.23/0.44 % (31725)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.23/0.44 % (31726)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.23/0.44 % (31725)Instruction limit reached!
% 0.23/0.44 % (31725)------------------------------
% 0.23/0.44 % (31725)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (31725)Termination reason: Unknown
% 0.23/0.44 % (31725)Termination phase: Property scanning
% 0.23/0.44
% 0.23/0.44 % (31725)Memory used [KB]: 1023
% 0.23/0.44 % (31725)Time elapsed: 0.003 s
% 0.23/0.44 % (31725)Instructions burned: 3 (million)
% 0.23/0.44 % (31725)------------------------------
% 0.23/0.44 % (31725)------------------------------
% 0.23/0.44 % (31726)Instruction limit reached!
% 0.23/0.44 % (31726)------------------------------
% 0.23/0.44 % (31726)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44 % (31726)Termination reason: Unknown
% 0.23/0.44 % (31726)Termination phase: Property scanning
% 0.23/0.44
% 0.23/0.44 % (31726)Memory used [KB]: 1023
% 0.23/0.44 % (31726)Time elapsed: 0.004 s
% 0.23/0.44 % (31726)Instructions burned: 4 (million)
% 0.23/0.44 % (31726)------------------------------
% 0.23/0.44 % (31726)------------------------------
% 0.23/0.45 % (31727)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.23/0.45 % (31728)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.23/0.46 % (31729)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.23/0.46 % (31727)Instruction limit reached!
% 0.23/0.46 % (31727)------------------------------
% 0.23/0.46 % (31727)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.46 % (31730)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.23/0.46 % (31727)Termination reason: Unknown
% 0.23/0.46 % (31727)Termination phase: Saturation
% 0.23/0.46
% 0.23/0.46 % (31727)Memory used [KB]: 5628
% 0.23/0.46 % (31727)Time elapsed: 0.013 s
% 0.23/0.46 % (31727)Instructions burned: 19 (million)
% 0.23/0.46 % (31727)------------------------------
% 0.23/0.46 % (31727)------------------------------
% 0.23/0.46 % (31729)Instruction limit reached!
% 0.23/0.46 % (31729)------------------------------
% 0.23/0.46 % (31729)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.46 % (31729)Termination reason: Unknown
% 0.23/0.46 % (31729)Termination phase: Saturation
% 0.23/0.46
% 0.23/0.46 % (31729)Memory used [KB]: 5500
% 0.23/0.46 % (31729)Time elapsed: 0.005 s
% 0.23/0.46 % (31729)Instructions burned: 6 (million)
% 0.23/0.46 % (31729)------------------------------
% 0.23/0.46 % (31729)------------------------------
% 0.23/0.46 % (31731)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.23/0.47 % (31732)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.23/0.47 % (31731)Instruction limit reached!
% 0.23/0.47 % (31731)------------------------------
% 0.23/0.47 % (31731)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.47 % (31731)Termination reason: Unknown
% 0.23/0.47 % (31731)Termination phase: Saturation
% 0.23/0.47
% 0.23/0.47 % (31731)Memory used [KB]: 5628
% 0.23/0.47 % (31731)Time elapsed: 0.015 s
% 0.23/0.47 % (31731)Instructions burned: 22 (million)
% 0.23/0.47 % (31731)------------------------------
% 0.23/0.47 % (31731)------------------------------
% 0.23/0.47 % (31733)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.23/0.47 % (31732)Instruction limit reached!
% 0.23/0.47 % (31732)------------------------------
% 0.23/0.47 % (31732)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.47 % (31732)Termination reason: Unknown
% 0.23/0.48 % (31732)Termination phase: Saturation
% 0.23/0.48
% 0.23/0.48 % (31732)Memory used [KB]: 5500
% 0.23/0.48 % (31732)Time elapsed: 0.005 s
% 0.23/0.48 % (31732)Instructions burned: 6 (million)
% 0.23/0.48 % (31732)------------------------------
% 0.23/0.48 % (31732)------------------------------
% 0.23/0.48 % (31733)Instruction limit reached!
% 0.23/0.48 % (31733)------------------------------
% 0.23/0.48 % (31733)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.48 % (31733)Termination reason: Unknown
% 0.23/0.48 % (31733)Termination phase: Saturation
% 0.23/0.48
% 0.23/0.48 % (31733)Memory used [KB]: 5500
% 0.23/0.48 % (31733)Time elapsed: 0.004 s
% 0.23/0.48 % (31733)Instructions burned: 6 (million)
% 0.23/0.48 % (31733)------------------------------
% 0.23/0.48 % (31733)------------------------------
% 0.23/0.49 % (31708)Instruction limit reached!
% 0.23/0.49 % (31708)------------------------------
% 0.23/0.49 % (31708)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.49 % (31708)Termination reason: Unknown
% 0.23/0.49 % (31708)Termination phase: Saturation
% 0.23/0.49
% 0.23/0.49 % (31708)Memory used [KB]: 6140
% 0.23/0.49 % (31708)Time elapsed: 0.094 s
% 0.23/0.49 % (31708)Instructions burned: 183 (million)
% 0.23/0.49 % (31708)------------------------------
% 0.23/0.49 % (31708)------------------------------
% 0.23/0.49 % (31734)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.23/0.49 % (31735)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.23/0.49 % (31736)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.23/0.49 % (31713)Instruction limit reached!
% 0.23/0.49 % (31713)------------------------------
% 0.23/0.49 % (31713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.49 % (31713)Termination reason: Unknown
% 0.23/0.49 % (31713)Termination phase: Saturation
% 0.23/0.49
% 0.23/0.49 % (31713)Memory used [KB]: 5756
% 0.23/0.49 % (31713)Time elapsed: 0.102 s
% 0.23/0.49 % (31713)Instructions burned: 276 (million)
% 0.23/0.49 % (31713)------------------------------
% 0.23/0.49 % (31713)------------------------------
% 0.23/0.50 % (31736)Refutation not found, incomplete strategy
% 0.23/0.50 % (31736)------------------------------
% 0.23/0.50 % (31736)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.50 % (31736)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.50
% 0.23/0.50
% 0.23/0.50 % (31736)Memory used [KB]: 5500
% 0.23/0.50 % (31736)Time elapsed: 0.009 s
% 0.23/0.50 % (31736)Instructions burned: 13 (million)
% 0.23/0.50 % (31736)------------------------------
% 0.23/0.50 % (31736)------------------------------
% 0.23/0.50 % (31737)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2998ds/879Mi)
% 0.23/0.51 % (31738)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2998ds/17Mi)
% 0.23/0.51 % (31739)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.23/0.51 % (31739)Instruction limit reached!
% 0.23/0.51 % (31739)------------------------------
% 0.23/0.51 % (31739)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.51 % (31739)Termination reason: Unknown
% 0.23/0.51 % (31739)Termination phase: Property scanning
% 0.23/0.51
% 0.23/0.51 % (31739)Memory used [KB]: 1023
% 0.23/0.51 % (31739)Time elapsed: 0.003 s
% 0.23/0.51 % (31739)Instructions burned: 4 (million)
% 0.23/0.51 % (31739)------------------------------
% 0.23/0.51 % (31739)------------------------------
% 0.23/0.52 % (31738)Instruction limit reached!
% 0.23/0.52 % (31738)------------------------------
% 0.23/0.52 % (31738)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.52 % (31738)Termination reason: Unknown
% 0.23/0.52 % (31738)Termination phase: Saturation
% 0.23/0.52
% 0.23/0.52 % (31738)Memory used [KB]: 5628
% 0.23/0.52 % (31738)Time elapsed: 0.012 s
% 0.23/0.52 % (31738)Instructions burned: 17 (million)
% 0.23/0.52 % (31738)------------------------------
% 0.23/0.52 % (31738)------------------------------
% 0.23/0.53 % (31740)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 0.23/0.53 % (31741)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.23/0.53 % (31740)Refutation not found, incomplete strategy
% 0.23/0.53 % (31740)------------------------------
% 0.23/0.53 % (31740)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.53 % (31740)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.53
% 0.23/0.53
% 0.23/0.53 % (31740)Memory used [KB]: 5500
% 0.23/0.53 % (31740)Time elapsed: 0.007 s
% 0.23/0.53 % (31740)Instructions burned: 9 (million)
% 0.23/0.53 % (31740)------------------------------
% 0.23/0.53 % (31740)------------------------------
% 0.23/0.55 % (31742)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 1.73/0.60 % (31741)Instruction limit reached!
% 1.73/0.60 % (31741)------------------------------
% 1.73/0.60 % (31741)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.73/0.60 % (31741)Termination reason: Unknown
% 1.73/0.60 % (31741)Termination phase: Saturation
% 1.73/0.60
% 1.73/0.60 % (31741)Memory used [KB]: 5756
% 1.73/0.60 % (31741)Time elapsed: 0.069 s
% 1.73/0.60 % (31741)Instructions burned: 127 (million)
% 1.73/0.60 % (31741)------------------------------
% 1.73/0.60 % (31741)------------------------------
% 1.73/0.60 % (31742)Instruction limit reached!
% 1.73/0.60 % (31742)------------------------------
% 1.73/0.60 % (31742)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.73/0.60 % (31742)Termination reason: Unknown
% 1.73/0.60 % (31742)Termination phase: Saturation
% 1.73/0.60
% 1.73/0.60 % (31742)Memory used [KB]: 6012
% 1.73/0.60 % (31742)Time elapsed: 0.054 s
% 1.73/0.60 % (31742)Instructions burned: 100 (million)
% 1.73/0.60 % (31742)------------------------------
% 1.73/0.60 % (31742)------------------------------
% 1.73/0.62 % (31743)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on theBenchmark for (2997ds/3Mi)
% 1.73/0.62 % (31744)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on theBenchmark for (2997ds/20Mi)
% 1.73/0.62 % (31743)Instruction limit reached!
% 1.73/0.62 % (31743)------------------------------
% 1.73/0.62 % (31743)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.73/0.62 % (31743)Termination reason: Unknown
% 1.73/0.62 % (31743)Termination phase: Property scanning
% 1.73/0.62
% 1.73/0.62 % (31743)Memory used [KB]: 1023
% 1.73/0.62 % (31743)Time elapsed: 0.003 s
% 1.73/0.62 % (31743)Instructions burned: 3 (million)
% 1.73/0.62 % (31743)------------------------------
% 1.73/0.62 % (31743)------------------------------
% 1.73/0.63 % (31744)Instruction limit reached!
% 1.73/0.63 % (31744)------------------------------
% 1.73/0.63 % (31744)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.73/0.63 % (31744)Termination reason: Unknown
% 1.73/0.63 % (31744)Termination phase: Saturation
% 1.73/0.63
% 1.73/0.63 % (31744)Memory used [KB]: 5628
% 1.73/0.63 % (31744)Time elapsed: 0.013 s
% 1.73/0.63 % (31744)Instructions burned: 21 (million)
% 1.73/0.63 % (31744)------------------------------
% 1.73/0.63 % (31744)------------------------------
% 1.73/0.63 % (31745)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on theBenchmark for (2997ds/86Mi)
% 2.17/0.64 % (31746)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on theBenchmark for (2997ds/107Mi)
% 2.28/0.66 % (31746)First to succeed.
% 2.28/0.66 % (31734)Instruction limit reached!
% 2.28/0.66 % (31734)------------------------------
% 2.28/0.66 % (31734)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.28/0.66 % (31734)Termination reason: Unknown
% 2.28/0.66 % (31734)Termination phase: Saturation
% 2.28/0.66
% 2.28/0.66 % (31734)Memory used [KB]: 6268
% 2.28/0.66 % (31734)Time elapsed: 0.178 s
% 2.28/0.66 % (31734)Instructions burned: 378 (million)
% 2.28/0.66 % (31734)------------------------------
% 2.28/0.66 % (31734)------------------------------
% 2.28/0.67 % (31746)Refutation found. Thanks to Tanya!
% 2.28/0.67 % SZS status Theorem for theBenchmark
% 2.28/0.67 % SZS output start Proof for theBenchmark
% 2.28/0.67 thf(func_def_0, type, in: $i > $i > $o).
% 2.28/0.67 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 2.28/0.67 thf(func_def_3, type, setunion: $i > $i).
% 2.28/0.67 thf(func_def_4, type, dsetconstr: $i > ($i > $o) > $i).
% 2.28/0.67 thf(func_def_5, type, subset: $i > $i > $o).
% 2.28/0.67 thf(func_def_9, type, singleton: $i > $o).
% 2.28/0.67 thf(func_def_12, type, if: $i > $o > $i > $i > $i).
% 2.28/0.67 thf(func_def_33, type, sK5: $i > $i > $i > $o > $i).
% 2.28/0.67 thf(func_def_34, type, ph6: !>[X0: $tType]:(X0)).
% 2.28/0.67 thf(f165,plain,(
% 2.28/0.67 $false),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f164])).
% 2.28/0.67 thf(f164,plain,(
% 2.28/0.67 ($false = $true)),
% 2.28/0.67 inference(backward_demodulation,[],[f38,f163])).
% 2.28/0.67 thf(f163,plain,(
% 2.28/0.67 ((in @ sK3 @ sK2) = $false)),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f162])).
% 2.28/0.67 thf(f162,plain,(
% 2.28/0.67 ((in @ sK3 @ sK2) = $false) | ($false = $true)),
% 2.28/0.67 inference(forward_demodulation,[],[f157,f40])).
% 2.28/0.67 thf(f40,plain,(
% 2.28/0.67 ((in @ sK0 @ sK2) = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f28,plain,(
% 2.28/0.67 (sepSubset = $true) & (((in @ sK0 @ sK2) = $true) & (((in @ (if @ sK2 @ sK1 @ sK0 @ sK3) @ sK2) != $true) & ((in @ sK3 @ sK2) = $true))) & (theprop = $true) & (subsetE = $true) & (ifSingleton = $true)),
% 2.28/0.67 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f25,f27,f26])).
% 2.28/0.67 thf(f26,plain,(
% 2.28/0.67 ? [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) & ? [X3] : (((in @ (if @ X2 @ X1 @ X0 @ X3) @ X2) != $true) & ((in @ X3 @ X2) = $true))) => (((in @ sK0 @ sK2) = $true) & ? [X3] : (((in @ (if @ sK2 @ sK1 @ sK0 @ X3) @ sK2) != $true) & ((in @ X3 @ sK2) = $true)))),
% 2.28/0.67 introduced(choice_axiom,[])).
% 2.28/0.67 thf(f27,plain,(
% 2.28/0.67 ? [X3] : (((in @ (if @ sK2 @ sK1 @ sK0 @ X3) @ sK2) != $true) & ((in @ X3 @ sK2) = $true)) => (((in @ (if @ sK2 @ sK1 @ sK0 @ sK3) @ sK2) != $true) & ((in @ sK3 @ sK2) = $true))),
% 2.28/0.67 introduced(choice_axiom,[])).
% 2.28/0.67 thf(f25,plain,(
% 2.28/0.67 (sepSubset = $true) & ? [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) & ? [X3] : (((in @ (if @ X2 @ X1 @ X0 @ X3) @ X2) != $true) & ((in @ X3 @ X2) = $true))) & (theprop = $true) & (subsetE = $true) & (ifSingleton = $true)),
% 2.28/0.67 inference(flattening,[],[f24])).
% 2.28/0.67 thf(f24,plain,(
% 2.28/0.67 (((? [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) & ? [X3] : (((in @ (if @ X2 @ X1 @ X0 @ X3) @ X2) != $true) & ((in @ X3 @ X2) = $true))) & (ifSingleton = $true)) & (theprop = $true)) & (sepSubset = $true)) & (subsetE = $true)),
% 2.28/0.67 inference(ennf_transformation,[],[f15])).
% 2.28/0.67 thf(f15,plain,(
% 2.28/0.67 ~((subsetE = $true) => ((sepSubset = $true) => ((theprop = $true) => ((ifSingleton = $true) => ! [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) => ! [X3] : (((in @ X3 @ X2) = $true) => ((in @ (if @ X2 @ X1 @ X0 @ X3) @ X2) = $true)))))))),
% 2.28/0.67 inference(fool_elimination,[],[f14])).
% 2.28/0.67 thf(f14,plain,(
% 2.28/0.67 ~(subsetE => (sepSubset => (theprop => (ifSingleton => ! [X0,X1 : $o,X2] : ((in @ X0 @ X2) => ! [X3] : ((in @ X3 @ X2) => (in @ (if @ X2 @ X1 @ X0 @ X3) @ X2)))))))),
% 2.28/0.67 inference(rectify,[],[f8])).
% 2.28/0.67 thf(f8,negated_conjecture,(
% 2.28/0.67 ~(subsetE => (sepSubset => (theprop => (ifSingleton => ! [X2,X3 : $o,X0] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (in @ (if @ X0 @ X3 @ X2 @ X5) @ X0)))))))),
% 2.28/0.67 inference(negated_conjecture,[],[f7])).
% 2.28/0.67 thf(f7,conjecture,(
% 2.28/0.67 subsetE => (sepSubset => (theprop => (ifSingleton => ! [X2,X3 : $o,X0] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (in @ (if @ X0 @ X3 @ X2 @ X5) @ X0))))))),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifp)).
% 2.28/0.67 thf(f157,plain,(
% 2.28/0.67 ((in @ sK3 @ sK2) = $false) | ($false = (in @ sK0 @ sK2))),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f154])).
% 2.28/0.67 thf(f154,plain,(
% 2.28/0.67 ($true != $true) | ((in @ sK3 @ sK2) = $false) | ($false = (in @ sK0 @ sK2))),
% 2.28/0.67 inference(superposition,[],[f104,f151])).
% 2.28/0.67 thf(f151,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (((in @ (setunion @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset)) @ X0) = $true) | ($false = (in @ X1 @ X0)) | ((in @ X2 @ X0) = $false)) )),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f150])).
% 2.28/0.67 thf(f150,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (((in @ X2 @ X0) = $false) | ($false = (in @ X1 @ X0)) | ($false = $true) | ((in @ (setunion @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset)) @ X0) = $true)) )),
% 2.28/0.67 inference(duplicate_literal_removal,[],[f146])).
% 2.28/0.67 thf(f146,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($false = $true) | ((in @ X2 @ X0) = $false) | ((in @ X2 @ X0) = $false) | ($false = (in @ X1 @ X0)) | ((in @ (setunion @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset)) @ X0) = $true) | ($false = (in @ X1 @ X0))) )),
% 2.28/0.67 inference(superposition,[],[f119,f100])).
% 2.28/0.67 thf(f100,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i] : (((in @ (sK5 @ X0 @ X3 @ X1 @ X2) @ (setadjoin @ (sK5 @ X0 @ X3 @ X1 @ X2) @ emptyset)) = $true) | ($false = (in @ X1 @ X0)) | ((in @ X3 @ X0) = $false)) )),
% 2.28/0.67 inference(duplicate_literal_removal,[],[f98])).
% 2.28/0.67 thf(f98,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i] : (((in @ X3 @ X0) = $false) | ($false = (in @ X1 @ X0)) | ((in @ X3 @ X0) = $false) | ((in @ (sK5 @ X0 @ X3 @ X1 @ X2) @ (setadjoin @ (sK5 @ X0 @ X3 @ X1 @ X2) @ emptyset)) = $true) | ($false = (in @ X1 @ X0))) )),
% 2.28/0.67 inference(superposition,[],[f83,f85])).
% 2.28/0.67 thf(f85,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (((setadjoin @ (sK5 @ X1 @ X3 @ X4 @ X2) @ emptyset) = (dsetconstr @ X1 @ (^[Y0 : $i]: (((X4 = Y0) & (~ X2)) | (X2 & (X3 = Y0)))))) | ($false = (in @ X3 @ X1)) | ((in @ X4 @ X1) = $false)) )),
% 2.28/0.67 inference(equality_proxy_clausification,[],[f84])).
% 2.28/0.67 thf(f84,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($true = ((setadjoin @ (sK5 @ X1 @ X3 @ X4 @ X2) @ emptyset) = (dsetconstr @ X1 @ (^[Y0 : $i]: (((X4 = Y0) & (~ X2)) | (X2 & (X3 = Y0))))))) | ((in @ X4 @ X1) = $false) | ($false = (in @ X3 @ X1))) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f82])).
% 2.28/0.67 thf(f82,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (((((setadjoin @ (sK5 @ X1 @ X3 @ X4 @ X2) @ emptyset) = (dsetconstr @ X1 @ (^[Y0 : $i]: (((X4 = Y0) & (~ X2)) | (X2 & (X3 = Y0)))))) & (in @ (sK5 @ X1 @ X3 @ X4 @ X2) @ (dsetconstr @ X1 @ (^[Y0 : $i]: (((X4 = Y0) & (~ X2)) | (X2 & (X3 = Y0))))))) = $true) | ((in @ X4 @ X1) = $false) | ($false = (in @ X3 @ X1))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f81])).
% 2.28/0.67 thf(f81,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (in @ X3 @ X1)) | ((in @ X4 @ X1) = $false) | ($true = ((^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1)))))) & (in @ Y0 @ (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1)))))))) @ (sK5 @ X1 @ X3 @ X4 @ X2)))) )),
% 2.28/0.67 inference(sigma_clausification,[],[f80])).
% 2.28/0.67 thf(f80,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (in @ X3 @ X1)) | ((in @ X4 @ X1) = $false) | ((?? @ $i @ (^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1)))))) & (in @ Y0 @ (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1))))))))) = $true)) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f79])).
% 2.28/0.67 thf(f79,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : ((((in @ X4 @ X1) => (?? @ $i @ (^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1)))))) & (in @ Y0 @ (dsetconstr @ X1 @ (^[Y1 : $i]: (((X4 = Y1) & (~ X2)) | (X2 & (X3 = Y1)))))))))) = $true) | ($false = (in @ X3 @ X1))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f78])).
% 2.28/0.67 thf(f78,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($false = (in @ X3 @ X1)) | (((^[Y0 : $i]: ((in @ Y0 @ X1) => (?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2)))))) & (in @ Y1 @ (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2))))))))))) @ X4) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f77])).
% 2.28/0.67 thf(f77,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($false = (in @ X3 @ X1)) | ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => (?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2)))))) & (in @ Y1 @ (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2)))))))))))) = $true)) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f76])).
% 2.28/0.67 thf(f76,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i] : (($true = ((in @ X3 @ X1) => (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => (?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2)))))) & (in @ Y1 @ (dsetconstr @ X1 @ (^[Y2 : $i]: (((Y0 = Y2) & (~ X2)) | (X2 & (X3 = Y2))))))))))))))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f75])).
% 2.28/0.67 thf(f75,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ X1) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (?? @ $i @ (^[Y2 : $i]: (((setadjoin @ Y2 @ emptyset) = (dsetconstr @ X1 @ (^[Y3 : $i]: (((Y1 = Y3) & (~ X2)) | (X2 & (Y0 = Y3)))))) & (in @ Y2 @ (dsetconstr @ X1 @ (^[Y3 : $i]: (((Y1 = Y3) & (~ X2)) | (X2 & (Y0 = Y3)))))))))))))) @ X3) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f74])).
% 2.28/0.67 thf(f74,plain,(
% 2.28/0.67 ( ! [X2 : $o,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X1) => (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (?? @ $i @ (^[Y2 : $i]: (((setadjoin @ Y2 @ emptyset) = (dsetconstr @ X1 @ (^[Y3 : $i]: (((Y1 = Y3) & (~ X2)) | (X2 & (Y0 = Y3)))))) & (in @ Y2 @ (dsetconstr @ X1 @ (^[Y3 : $i]: (((Y1 = Y3) & (~ X2)) | (X2 & (Y0 = Y3))))))))))))))))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f73])).
% 2.28/0.67 thf(f73,plain,(
% 2.28/0.67 ( ! [X2 : $o,X1 : $i] : (($true = ((^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ X1) => (?? @ $i @ (^[Y3 : $i]: (((setadjoin @ Y3 @ emptyset) = (dsetconstr @ X1 @ (^[Y4 : $i]: (((Y2 = Y4) & (~ Y0)) | (Y0 & (Y1 = Y4)))))) & (in @ Y3 @ (dsetconstr @ X1 @ (^[Y4 : $i]: (((Y2 = Y4) & (~ Y0)) | (Y0 & (Y1 = Y4)))))))))))))))) @ X2))) )),
% 2.28/0.67 inference(pi_clausification,[],[f72])).
% 2.28/0.67 thf(f72,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (($true = (!! @ $o @ (^[Y0 : $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ X1) => (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ X1) => (?? @ $i @ (^[Y3 : $i]: (((setadjoin @ Y3 @ emptyset) = (dsetconstr @ X1 @ (^[Y4 : $i]: (((Y2 = Y4) & (~ Y0)) | (Y0 & (Y1 = Y4)))))) & (in @ Y3 @ (dsetconstr @ X1 @ (^[Y4 : $i]: (((Y2 = Y4) & (~ Y0)) | (Y0 & (Y1 = Y4))))))))))))))))))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f71])).
% 2.28/0.67 thf(f71,plain,(
% 2.28/0.67 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (?? @ $i @ (^[Y4 : $i]: (((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y0 @ (^[Y5 : $i]: (((Y3 = Y5) & (~ Y1)) | (Y1 & (Y2 = Y5)))))) & (in @ Y4 @ (dsetconstr @ Y0 @ (^[Y5 : $i]: (((Y3 = Y5) & (~ Y1)) | (Y1 & (Y2 = Y5)))))))))))))))))) @ X1) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f70])).
% 2.28/0.67 thf(f70,plain,(
% 2.28/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (?? @ $i @ (^[Y4 : $i]: (((setadjoin @ Y4 @ emptyset) = (dsetconstr @ Y0 @ (^[Y5 : $i]: (((Y3 = Y5) & (~ Y1)) | (Y1 & (Y2 = Y5)))))) & (in @ Y4 @ (dsetconstr @ Y0 @ (^[Y5 : $i]: (((Y3 = Y5) & (~ Y1)) | (Y1 & (Y2 = Y5))))))))))))))))))) = $true)),
% 2.28/0.67 inference(beta_eta_normalization,[],[f48])).
% 2.28/0.67 thf(f48,plain,(
% 2.28/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (((setadjoin @ Y5 @ emptyset) = Y4) & (in @ Y5 @ Y4))))) @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4)))))))))))))))) = $true)),
% 2.28/0.67 inference(definition_unfolding,[],[f35,f43])).
% 2.28/0.67 thf(f43,plain,(
% 2.28/0.67 (ifSingleton = (!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => ((^[Y4 : $i]: (?? @ $i @ (^[Y5 : $i]: (((setadjoin @ Y5 @ emptyset) = Y4) & (in @ Y5 @ Y4))))) @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4)))))))))))))))))),
% 2.28/0.67 inference(definition_unfolding,[],[f34,f31])).
% 2.28/0.67 thf(f31,plain,(
% 2.28/0.67 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = Y0) & (in @ Y1 @ Y0))))))),
% 2.28/0.67 inference(cnf_transformation,[],[f21])).
% 2.28/0.67 thf(f21,plain,(
% 2.28/0.67 (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = Y0) & (in @ Y1 @ Y0))))))),
% 2.28/0.67 inference(fool_elimination,[],[f20])).
% 2.28/0.67 thf(f20,plain,(
% 2.28/0.67 ((^[X0 : $i] : (? [X1] : ((in @ X1 @ X0) & ((setadjoin @ X1 @ emptyset) = X0)))) = singleton)),
% 2.28/0.67 inference(rectify,[],[f3])).
% 2.28/0.67 thf(f3,axiom,(
% 2.28/0.67 ((^[X0 : $i] : (? [X2] : ((in @ X2 @ X0) & ((setadjoin @ X2 @ emptyset) = X0)))) = singleton)),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton)).
% 2.28/0.67 thf(f34,plain,(
% 2.28/0.67 (ifSingleton = (!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (singleton @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4)))))))))))))))))),
% 2.28/0.67 inference(cnf_transformation,[],[f11])).
% 2.28/0.67 thf(f11,plain,(
% 2.28/0.67 (ifSingleton = (!! @ $i @ (^[Y0 : $i]: (!! @ $o @ (^[Y1 : $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y0) => (!! @ $i @ (^[Y3 : $i]: ((in @ Y3 @ Y0) => (singleton @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4)))))))))))))))))),
% 2.28/0.67 inference(fool_elimination,[],[f10])).
% 2.28/0.67 thf(f10,plain,(
% 2.28/0.67 (ifSingleton = ! [X0,X1 : $o,X2] : ((in @ X0 @ X2) => ! [X3] : ((in @ X3 @ X2) => (singleton @ (dsetconstr @ X2 @ (^[X4 : $i] : (((X0 = X4) & X1) | (~X1 & (X3 = X4)))))))))),
% 2.28/0.67 inference(rectify,[],[f5])).
% 2.28/0.67 thf(f5,axiom,(
% 2.28/0.67 (ifSingleton = ! [X2,X3 : $o,X0] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X6 : $i] : (((X2 = X6) & X3) | (~X3 & (X5 = X6)))))))))),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifSingleton)).
% 2.28/0.67 thf(f35,plain,(
% 2.28/0.67 (ifSingleton = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f83,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X1 : $i,X4 : $i] : (($true = (in @ (sK5 @ X1 @ X3 @ X4 @ X2) @ (dsetconstr @ X1 @ (^[Y0 : $i]: (((X4 = Y0) & (~ X2)) | (X2 & (X3 = Y0))))))) | ($false = (in @ X3 @ X1)) | ((in @ X4 @ X1) = $false)) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f82])).
% 2.28/0.67 thf(f119,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($false = (in @ (sK5 @ X0 @ X1 @ X2 @ X3) @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset))) | ($false = (in @ X1 @ X0)) | ((in @ X2 @ X0) = $false) | ((in @ (setunion @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset)) @ X0) = $true)) )),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f115])).
% 2.28/0.67 thf(f115,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (((in @ (setunion @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset)) @ X0) = $true) | ($false = $true) | ((in @ X2 @ X0) = $false) | ($false = (in @ (sK5 @ X0 @ X1 @ X2 @ X3) @ (setadjoin @ (sK5 @ X0 @ X1 @ X2 @ X3) @ emptyset))) | ($false = (in @ X1 @ X0))) )),
% 2.28/0.67 inference(superposition,[],[f91,f96])).
% 2.28/0.67 thf(f96,plain,(
% 2.28/0.67 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($false = (in @ X4 @ (setadjoin @ (sK5 @ X0 @ X3 @ X1 @ X2) @ emptyset))) | ($false = (in @ X1 @ X0)) | ((in @ X3 @ X0) = $false) | ((in @ X4 @ X0) = $true)) )),
% 2.28/0.67 inference(superposition,[],[f90,f85])).
% 2.28/0.67 thf(f90,plain,(
% 2.28/0.67 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ X1)) = $false) | ((in @ X2 @ X0) = $true)) )),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f88])).
% 2.28/0.67 thf(f88,plain,(
% 2.28/0.67 ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($false = $true) | ((in @ X2 @ X0) = $true) | ((in @ X2 @ (dsetconstr @ X0 @ X1)) = $false)) )),
% 2.28/0.67 inference(superposition,[],[f61,f56])).
% 2.28/0.67 thf(f56,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = (subset @ X2 @ X1)) | ((in @ X3 @ X1) = $true) | ($false = (in @ X3 @ X2))) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f55])).
% 2.28/0.67 thf(f55,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X3 @ X2) => (in @ X3 @ X1)) = $true) | ($false = (subset @ X2 @ X1))) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f54])).
% 2.28/0.67 thf(f54,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((subset @ X2 @ X1) => ((in @ X3 @ X2) => (in @ X3 @ X1))) = $true)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f53])).
% 2.28/0.67 thf(f53,plain,(
% 2.28/0.67 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((subset @ X2 @ X1) => ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) @ X3))) )),
% 2.28/0.67 inference(pi_clausification,[],[f52])).
% 2.28/0.67 thf(f52,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((subset @ X2 @ X1) => ((in @ Y0 @ X2) => (in @ Y0 @ X1))))) = $true)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f51])).
% 2.28/0.67 thf(f51,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ X1) => ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))))) @ X2) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f50])).
% 2.28/0.67 thf(f50,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((subset @ Y0 @ X1) => ((in @ Y1 @ Y0) => (in @ Y1 @ X1))))))))) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f49])).
% 2.28/0.67 thf(f49,plain,(
% 2.28/0.67 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y0) => ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))))))) @ X1) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f47])).
% 2.28/0.67 thf(f47,plain,(
% 2.28/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y0) => ((in @ Y2 @ Y1) => (in @ Y2 @ Y0))))))))) = $true)),
% 2.28/0.67 inference(definition_unfolding,[],[f36,f30])).
% 2.28/0.67 thf(f30,plain,(
% 2.28/0.67 (subsetE = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y0) => ((in @ Y2 @ Y1) => (in @ Y2 @ Y0))))))))))),
% 2.28/0.67 inference(cnf_transformation,[],[f23])).
% 2.28/0.67 thf(f23,plain,(
% 2.28/0.67 (subsetE = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((subset @ Y1 @ Y0) => ((in @ Y2 @ Y1) => (in @ Y2 @ Y0))))))))))),
% 2.28/0.67 inference(fool_elimination,[],[f22])).
% 2.28/0.67 thf(f22,plain,(
% 2.28/0.67 (subsetE = ! [X0,X1,X2] : ((subset @ X1 @ X2) => ((in @ X0 @ X1) => (in @ X0 @ X2))))),
% 2.28/0.67 inference(rectify,[],[f1])).
% 2.28/0.67 thf(f1,axiom,(
% 2.28/0.67 (subsetE = ! [X2,X0,X1] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 2.28/0.67 thf(f36,plain,(
% 2.28/0.67 (subsetE = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f61,plain,(
% 2.28/0.67 ( ! [X2 : $i > $o,X1 : $i] : (((subset @ (dsetconstr @ X1 @ X2) @ X1) = $true)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f60])).
% 2.28/0.67 thf(f60,plain,(
% 2.28/0.67 ( ! [X2 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: (subset @ (dsetconstr @ X1 @ Y0) @ X1)) @ X2) = $true)) )),
% 2.28/0.67 inference(pi_clausification,[],[f59])).
% 2.28/0.67 thf(f59,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (subset @ (dsetconstr @ X1 @ Y0) @ X1))) = $true)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f58])).
% 2.28/0.67 thf(f58,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ Y1) @ Y0)))) @ X1))) )),
% 2.28/0.67 inference(pi_clausification,[],[f57])).
% 2.28/0.67 thf(f57,plain,(
% 2.28/0.67 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ Y1) @ Y0))))))),
% 2.28/0.67 inference(beta_eta_normalization,[],[f44])).
% 2.28/0.67 thf(f44,plain,(
% 2.28/0.67 ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))) @ Y0))))) = $true)),
% 2.28/0.67 inference(definition_unfolding,[],[f41,f32])).
% 2.28/0.67 thf(f32,plain,(
% 2.28/0.67 (sepSubset = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))) @ Y0))))))),
% 2.28/0.67 inference(cnf_transformation,[],[f13])).
% 2.28/0.67 thf(f13,plain,(
% 2.28/0.67 (sepSubset = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (subset @ (dsetconstr @ Y0 @ (^[Y2 : $i]: (Y1 @ Y2))) @ Y0))))))),
% 2.28/0.67 inference(fool_elimination,[],[f12])).
% 2.28/0.67 thf(f12,plain,(
% 2.28/0.67 (! [X0 : $i > $o,X1] : (subset @ (dsetconstr @ X1 @ (^[X2 : $i] : (X0 @ X2))) @ X1) = sepSubset)),
% 2.28/0.67 inference(rectify,[],[f2])).
% 2.28/0.67 thf(f2,axiom,(
% 2.28/0.67 (! [X3 : $i > $o,X0] : (subset @ (dsetconstr @ X0 @ (^[X2 : $i] : (X3 @ X2))) @ X0) = sepSubset)),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sepSubset)).
% 2.28/0.67 thf(f41,plain,(
% 2.28/0.67 (sepSubset = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f91,plain,(
% 2.28/0.67 ( ! [X0 : $i] : (($true = (in @ (setunion @ (setadjoin @ X0 @ emptyset)) @ (setadjoin @ X0 @ emptyset))) | ($false = (in @ X0 @ (setadjoin @ X0 @ emptyset)))) )),
% 2.28/0.67 inference(equality_resolution,[],[f69])).
% 2.28/0.67 thf(f69,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : (((setadjoin @ X2 @ emptyset) != X1) | ((in @ (setunion @ X1) @ X1) = $true) | ((in @ X2 @ X1) = $false)) )),
% 2.28/0.67 inference(equality_proxy_clausification,[],[f68])).
% 2.28/0.67 thf(f68,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : (((in @ (setunion @ X1) @ X1) = $true) | (((setadjoin @ X2 @ emptyset) = X1) = $false) | ((in @ X2 @ X1) = $false)) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f67])).
% 2.28/0.67 thf(f67,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : (((in @ (setunion @ X1) @ X1) = $true) | ((((setadjoin @ X2 @ emptyset) = X1) & (in @ X2 @ X1)) = $false)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f66])).
% 2.28/0.67 thf(f66,plain,(
% 2.28/0.67 ( ! [X2 : $i,X1 : $i] : (((in @ (setunion @ X1) @ X1) = $true) | (((^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = X1) & (in @ Y0 @ X1))) @ X2) = $false)) )),
% 2.28/0.67 inference(pi_clausification,[],[f65])).
% 2.28/0.67 thf(f65,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (((in @ (setunion @ X1) @ X1) = $true) | ($false = (?? @ $i @ (^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = X1) & (in @ Y0 @ X1)))))) )),
% 2.28/0.67 inference(binary_proxy_clausification,[],[f64])).
% 2.28/0.67 thf(f64,plain,(
% 2.28/0.67 ( ! [X1 : $i] : ((((?? @ $i @ (^[Y0 : $i]: (((setadjoin @ Y0 @ emptyset) = X1) & (in @ Y0 @ X1)))) => (in @ (setunion @ X1) @ X1)) = $true)) )),
% 2.28/0.67 inference(beta_eta_normalization,[],[f63])).
% 2.28/0.67 thf(f63,plain,(
% 2.28/0.67 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = Y0) & (in @ Y1 @ Y0)))) => (in @ (setunion @ Y0) @ Y0))) @ X1))) )),
% 2.28/0.67 inference(pi_clausification,[],[f62])).
% 2.28/0.67 thf(f62,plain,(
% 2.28/0.67 ($true = (!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((setadjoin @ Y1 @ emptyset) = Y0) & (in @ Y1 @ Y0)))) => (in @ (setunion @ Y0) @ Y0)))))),
% 2.28/0.67 inference(beta_eta_normalization,[],[f46])).
% 2.28/0.67 thf(f46,plain,(
% 2.28/0.67 ((!! @ $i @ (^[Y0 : $i]: (((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (((setadjoin @ Y2 @ emptyset) = Y1) & (in @ Y2 @ Y1))))) @ Y0) => (in @ (setunion @ Y0) @ Y0)))) = $true)),
% 2.28/0.67 inference(definition_unfolding,[],[f37,f42])).
% 2.28/0.67 thf(f42,plain,(
% 2.28/0.67 (theprop = (!! @ $i @ (^[Y0 : $i]: (((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (((setadjoin @ Y2 @ emptyset) = Y1) & (in @ Y2 @ Y1))))) @ Y0) => (in @ (setunion @ Y0) @ Y0)))))),
% 2.28/0.67 inference(definition_unfolding,[],[f33,f31])).
% 2.28/0.67 thf(f33,plain,(
% 2.28/0.67 (theprop = (!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (in @ (setunion @ Y0) @ Y0)))))),
% 2.28/0.67 inference(cnf_transformation,[],[f17])).
% 2.28/0.67 thf(f17,plain,(
% 2.28/0.67 (theprop = (!! @ $i @ (^[Y0 : $i]: ((singleton @ Y0) => (in @ (setunion @ Y0) @ Y0)))))),
% 2.28/0.67 inference(fool_elimination,[],[f16])).
% 2.28/0.67 thf(f16,plain,(
% 2.28/0.67 (theprop = ! [X0] : ((singleton @ X0) => (in @ (setunion @ X0) @ X0)))),
% 2.28/0.67 inference(rectify,[],[f4])).
% 2.28/0.67 thf(f4,axiom,(
% 2.28/0.67 (theprop = ! [X4] : ((singleton @ X4) => (in @ (setunion @ X4) @ X4)))),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theprop)).
% 2.28/0.67 thf(f37,plain,(
% 2.28/0.67 (theprop = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f104,plain,(
% 2.28/0.67 ((in @ (setunion @ (setadjoin @ (sK5 @ sK2 @ sK0 @ sK3 @ sK1) @ emptyset)) @ sK2) != $true)),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f103])).
% 2.28/0.67 thf(f103,plain,(
% 2.28/0.67 ($false = $true) | ((in @ (setunion @ (setadjoin @ (sK5 @ sK2 @ sK0 @ sK3 @ sK1) @ emptyset)) @ sK2) != $true)),
% 2.28/0.67 inference(forward_demodulation,[],[f102,f38])).
% 2.28/0.67 thf(f102,plain,(
% 2.28/0.67 ((in @ (setunion @ (setadjoin @ (sK5 @ sK2 @ sK0 @ sK3 @ sK1) @ emptyset)) @ sK2) != $true) | ((in @ sK3 @ sK2) = $false)),
% 2.28/0.67 inference(trivial_inequality_removal,[],[f101])).
% 2.28/0.67 thf(f101,plain,(
% 2.28/0.67 ((in @ sK3 @ sK2) = $false) | ((in @ (setunion @ (setadjoin @ (sK5 @ sK2 @ sK0 @ sK3 @ sK1) @ emptyset)) @ sK2) != $true) | ($false = $true)),
% 2.28/0.67 inference(forward_demodulation,[],[f99,f40])).
% 2.28/0.67 thf(f99,plain,(
% 2.28/0.67 ($false = (in @ sK0 @ sK2)) | ((in @ (setunion @ (setadjoin @ (sK5 @ sK2 @ sK0 @ sK3 @ sK1) @ emptyset)) @ sK2) != $true) | ((in @ sK3 @ sK2) = $false)),
% 2.28/0.67 inference(superposition,[],[f86,f85])).
% 2.28/0.67 thf(f86,plain,(
% 2.28/0.67 ($true != (in @ (setunion @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & (~ sK1)) | (sK1 & (sK0 = Y0)))))) @ sK2))),
% 2.28/0.67 inference(beta_eta_normalization,[],[f45])).
% 2.28/0.67 thf(f45,plain,(
% 2.28/0.67 ((in @ ((^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4))))))))))))) @ sK2 @ sK1 @ sK0 @ sK3) @ sK2) != $true)),
% 2.28/0.67 inference(definition_unfolding,[],[f39,f29])).
% 2.28/0.67 thf(f29,plain,(
% 2.28/0.67 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4))))))))))))))),
% 2.28/0.67 inference(cnf_transformation,[],[f19])).
% 2.28/0.67 thf(f19,plain,(
% 2.28/0.67 (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: (((Y3 = Y4) & (~ Y1)) | (Y1 & (Y2 = Y4))))))))))))))),
% 2.28/0.67 inference(fool_elimination,[],[f18])).
% 2.28/0.67 thf(f18,plain,(
% 2.28/0.67 (if = (^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : (((X2 = X4) & X1) | (~X1 & (X3 = X4))))))))),
% 2.28/0.67 inference(rectify,[],[f6])).
% 2.28/0.67 thf(f6,axiom,(
% 2.28/0.67 (if = (^[X0 : $i, X3 : $o, X2 : $i, X5 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X6 : $i] : (((X2 = X6) & X3) | (~X3 & (X5 = X6))))))))),
% 2.28/0.67 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if)).
% 2.28/0.67 thf(f39,plain,(
% 2.28/0.67 ((in @ (if @ sK2 @ sK1 @ sK0 @ sK3) @ sK2) != $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 thf(f38,plain,(
% 2.28/0.67 ((in @ sK3 @ sK2) = $true)),
% 2.28/0.67 inference(cnf_transformation,[],[f28])).
% 2.28/0.67 % SZS output end Proof for theBenchmark
% 2.28/0.67 % (31746)------------------------------
% 2.28/0.67 % (31746)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 2.28/0.67 % (31746)Termination reason: Refutation
% 2.28/0.67
% 2.28/0.67 % (31746)Memory used [KB]: 5756
% 2.28/0.67 % (31746)Time elapsed: 0.027 s
% 2.28/0.67 % (31746)Instructions burned: 39 (million)
% 2.28/0.67 % (31746)------------------------------
% 2.28/0.67 % (31746)------------------------------
% 2.28/0.67 % (31707)Success in time 0.283 s
% 2.28/0.67 % Vampire---4.8 exiting
%------------------------------------------------------------------------------