TSTP Solution File: SEV482^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV482^1 : TPTP v8.2.0. Released v7.0.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 : n032.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 04:13:57 EDT 2024
% Result : Theorem 0.11s 0.40s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SEV482^1 : TPTP v8.2.0. Released v7.0.0.
% 0.02/0.09 % 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.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 19:07:37 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.07/0.27 This is a TH1_THM_EQU_NAR problem
% 0.07/0.27 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.07/0.28 % (29734)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.07/0.28 % (29736)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 (3000ds/27Mi)
% 0.07/0.29 % (29737)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.07/0.29 % (29738)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 (3000ds/2Mi)
% 0.07/0.29 % (29739)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 (3000ds/275Mi)
% 0.07/0.29 % (29740)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.07/0.29 % (29741)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.07/0.29 % Exception at run slice level
% 0.07/0.29 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.07/0.29 % (29737)Instruction limit reached!
% 0.07/0.29 % (29737)------------------------------
% 0.07/0.29 % (29737)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.29 % (29737)Termination reason: Unknown
% 0.07/0.29 % (29737)Termination phase: Saturation
% 0.07/0.29
% 0.07/0.29 % (29737)Memory used [KB]: 5500
% 0.07/0.29 % (29737)Time elapsed: 0.003 s
% 0.07/0.29 % (29737)Instructions burned: 3 (million)
% 0.07/0.29 % (29737)------------------------------
% 0.07/0.29 % (29737)------------------------------
% 0.07/0.29 % (29741)Instruction limit reached!
% 0.07/0.29 % (29741)------------------------------
% 0.07/0.29 % (29741)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.29 % (29741)Termination reason: Unknown
% 0.07/0.29 % (29741)Termination phase: Saturation
% 0.07/0.29
% 0.07/0.29 % (29741)Memory used [KB]: 5500
% 0.07/0.29 % (29741)Time elapsed: 0.003 s
% 0.07/0.29 % (29741)Instructions burned: 3 (million)
% 0.07/0.29 % (29741)------------------------------
% 0.07/0.29 % (29741)------------------------------
% 0.07/0.29 % (29739)Refutation not found, incomplete strategy
% 0.07/0.29 % (29739)------------------------------
% 0.07/0.29 % (29739)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.29 % (29739)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.29
% 0.07/0.29
% 0.07/0.29 % (29739)Memory used [KB]: 5500
% 0.07/0.29 % (29739)Time elapsed: 0.005 s
% 0.07/0.29 % (29739)Instructions burned: 6 (million)
% 0.07/0.29 % (29739)------------------------------
% 0.07/0.29 % (29739)------------------------------
% 0.07/0.30 % (29735)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 (3000ds/4Mi)
% 0.07/0.30 % (29736)Instruction limit reached!
% 0.07/0.30 % (29736)------------------------------
% 0.07/0.30 % (29736)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.30 % (29736)Termination reason: Unknown
% 0.07/0.30 % (29736)Termination phase: Saturation
% 0.07/0.30
% 0.07/0.30 % (29736)Memory used [KB]: 5628
% 0.07/0.30 % (29736)Time elapsed: 0.013 s
% 0.07/0.30 % (29736)Instructions burned: 27 (million)
% 0.07/0.30 % (29736)------------------------------
% 0.07/0.30 % (29736)------------------------------
% 0.07/0.30 % (29735)Instruction limit reached!
% 0.07/0.30 % (29735)------------------------------
% 0.07/0.30 % (29735)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.30 % (29735)Termination reason: Unknown
% 0.07/0.30 % (29735)Termination phase: Saturation
% 0.07/0.30
% 0.07/0.30 % (29735)Memory used [KB]: 5500
% 0.07/0.30 % (29735)Time elapsed: 0.003 s
% 0.07/0.30 % (29735)Instructions burned: 5 (million)
% 0.07/0.30 % (29735)------------------------------
% 0.07/0.30 % (29735)------------------------------
% 0.07/0.30 % (29740)Instruction limit reached!
% 0.07/0.30 % (29740)------------------------------
% 0.07/0.30 % (29740)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.30 % (29740)Termination reason: Unknown
% 0.07/0.30 % (29740)Termination phase: Saturation
% 0.07/0.30
% 0.07/0.30 % (29740)Memory used [KB]: 5628
% 0.07/0.30 % (29740)Time elapsed: 0.011 s
% 0.07/0.30 % (29740)Instructions burned: 18 (million)
% 0.07/0.30 % (29740)------------------------------
% 0.07/0.30 % (29740)------------------------------
% 0.07/0.30 % (29742)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.07/0.30 % (29744)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.07/0.30 % Exception at run slice level
% 0.07/0.30 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.07/0.30 % (29744)Instruction limit reached!
% 0.07/0.30 % (29744)------------------------------
% 0.07/0.30 % (29744)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.30 % (29744)Termination reason: Unknown
% 0.07/0.30 % (29744)Termination phase: Saturation
% 0.07/0.30
% 0.07/0.30 % (29744)Memory used [KB]: 5500
% 0.07/0.30 % (29744)Time elapsed: 0.003 s
% 0.07/0.30 % (29744)Instructions burned: 3 (million)
% 0.07/0.30 % (29744)------------------------------
% 0.07/0.30 % (29744)------------------------------
% 0.07/0.30 % (29747)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.07/0.30 % (29746)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.07/0.31 % (29743)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.11/0.31 % (29746)Instruction limit reached!
% 0.11/0.31 % (29746)------------------------------
% 0.11/0.31 % (29746)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.31 % (29746)Termination reason: Unknown
% 0.11/0.31 % (29746)Termination phase: Saturation
% 0.11/0.31
% 0.11/0.31 % (29746)Memory used [KB]: 1023
% 0.11/0.31 % (29746)Time elapsed: 0.004 s
% 0.11/0.31 % (29746)Instructions burned: 7 (million)
% 0.11/0.31 % (29746)------------------------------
% 0.11/0.31 % (29746)------------------------------
% 0.11/0.31 % (29745)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.11/0.31 % (29747)Instruction limit reached!
% 0.11/0.31 % (29747)------------------------------
% 0.11/0.31 % (29747)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.31 % (29747)Termination reason: Unknown
% 0.11/0.31 % (29747)Termination phase: Saturation
% 0.11/0.31
% 0.11/0.31 % (29747)Memory used [KB]: 5756
% 0.11/0.31 % (29747)Time elapsed: 0.007 s
% 0.11/0.31 % (29747)Instructions burned: 16 (million)
% 0.11/0.31 % (29747)------------------------------
% 0.11/0.31 % (29747)------------------------------
% 0.11/0.31 % Exception at run slice level
% 0.11/0.31 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.31 % (29748)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.11/0.31 % (29748)Instruction limit reached!
% 0.11/0.31 % (29748)------------------------------
% 0.11/0.31 % (29748)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.31 % (29748)Termination reason: Unknown
% 0.11/0.31 % (29748)Termination phase: Twee Goal Transformation
% 0.11/0.31
% 0.11/0.31 % (29748)Memory used [KB]: 1023
% 0.11/0.31 % (29748)Time elapsed: 0.003 s
% 0.11/0.31 % (29748)Instructions burned: 3 (million)
% 0.11/0.31 % (29748)------------------------------
% 0.11/0.31 % (29748)------------------------------
% 0.11/0.31 % (29743)Instruction limit reached!
% 0.11/0.31 % (29743)------------------------------
% 0.11/0.31 % (29743)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.31 % (29743)Termination reason: Unknown
% 0.11/0.31 % (29743)Termination phase: Saturation
% 0.11/0.31
% 0.11/0.31 % (29743)Memory used [KB]: 5756
% 0.11/0.31 % (29743)Time elapsed: 0.010 s
% 0.11/0.31 % (29743)Instructions burned: 15 (million)
% 0.11/0.31 % (29743)------------------------------
% 0.11/0.31 % (29743)------------------------------
% 0.11/0.32 % (29751)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.11/0.32 % Exception at run slice level
% 0.11/0.32 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.32 % (29750)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.11/0.32 % (29752)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.11/0.32 % (29749)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.11/0.32 % (29749)Instruction limit reached!
% 0.11/0.32 % (29749)------------------------------
% 0.11/0.32 % (29749)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.32 % (29749)Termination reason: Unknown
% 0.11/0.32 % (29749)Termination phase: Property scanning
% 0.11/0.32
% 0.11/0.32 % (29749)Memory used [KB]: 1023
% 0.11/0.32 % (29749)Time elapsed: 0.003 s
% 0.11/0.32 % (29749)Instructions burned: 3 (million)
% 0.11/0.32 % (29749)------------------------------
% 0.11/0.32 % (29749)------------------------------
% 0.11/0.32 % (29750)Refutation not found, incomplete strategy
% 0.11/0.32 % (29750)------------------------------
% 0.11/0.32 % (29750)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.32 % (29750)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.32
% 0.11/0.32
% 0.11/0.32 % (29750)Memory used [KB]: 5500
% 0.11/0.32 % (29750)Time elapsed: 0.004 s
% 0.11/0.32 % (29750)Instructions burned: 5 (million)
% 0.11/0.32 % (29750)------------------------------
% 0.11/0.32 % (29750)------------------------------
% 0.11/0.32 % (29752)Instruction limit reached!
% 0.11/0.32 % (29752)------------------------------
% 0.11/0.32 % (29752)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.32 % (29752)Termination reason: Unknown
% 0.11/0.32 % (29752)Termination phase: Saturation
% 0.11/0.32
% 0.11/0.32 % (29752)Memory used [KB]: 5500
% 0.11/0.32 % (29752)Time elapsed: 0.003 s
% 0.11/0.32 % (29752)Instructions burned: 6 (million)
% 0.11/0.32 % (29752)------------------------------
% 0.11/0.32 % (29752)------------------------------
% 0.11/0.32 % (29754)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.11/0.33 % (29753)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.11/0.33 % (29755)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.11/0.33 % (29756)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.11/0.33 % (29756)Refutation not found, incomplete strategy
% 0.11/0.33 % (29756)------------------------------
% 0.11/0.33 % (29756)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.33 % (29756)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.33
% 0.11/0.33
% 0.11/0.33 % (29756)Memory used [KB]: 5500
% 0.11/0.33 % (29756)Time elapsed: 0.003 s
% 0.11/0.33 % (29756)Instructions burned: 5 (million)
% 0.11/0.33 % (29756)------------------------------
% 0.11/0.33 % (29756)------------------------------
% 0.11/0.33 % (29755)Instruction limit reached!
% 0.11/0.33 % (29755)------------------------------
% 0.11/0.33 % (29755)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.33 % (29755)Termination reason: Unknown
% 0.11/0.33 % (29755)Termination phase: Saturation
% 0.11/0.33
% 0.11/0.33 % (29755)Memory used [KB]: 5500
% 0.11/0.33 % (29755)Time elapsed: 0.005 s
% 0.11/0.33 % (29755)Instructions burned: 7 (million)
% 0.11/0.33 % (29755)------------------------------
% 0.11/0.33 % (29755)------------------------------
% 0.11/0.33 % (29757)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.11/0.33 % (29759)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.11/0.33 % Exception at run slice level
% 0.11/0.33 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.34 % (29760)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.11/0.34 % (29753)Instruction limit reached!
% 0.11/0.34 % (29753)------------------------------
% 0.11/0.34 % (29753)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (29753)Termination reason: Unknown
% 0.11/0.34 % (29753)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (29753)Memory used [KB]: 5628
% 0.11/0.34 % (29753)Time elapsed: 0.012 s
% 0.11/0.34 % (29753)Instructions burned: 19 (million)
% 0.11/0.34 % (29753)------------------------------
% 0.11/0.34 % (29753)------------------------------
% 0.11/0.34 % (29758)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.11/0.34 % Exception at run slice level
% 0.11/0.34 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.34 % (29757)Instruction limit reached!
% 0.11/0.34 % (29757)------------------------------
% 0.11/0.34 % (29757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (29757)Termination reason: Unknown
% 0.11/0.34 % (29757)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (29757)Memory used [KB]: 5628
% 0.11/0.34 % (29757)Time elapsed: 0.013 s
% 0.11/0.34 % (29757)Instructions burned: 21 (million)
% 0.11/0.34 % (29757)------------------------------
% 0.11/0.34 % (29757)------------------------------
% 0.11/0.34 % (29761)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.11/0.35 % Exception at run slice level
% 0.11/0.35 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.35 % (29762)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.11/0.35 % Exception at run slice level
% 0.11/0.35 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.35 % (29763)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.11/0.35 % (29764)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.11/0.36 % (29765)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.11/0.36 % (29765)Instruction limit reached!
% 0.11/0.36 % (29765)------------------------------
% 0.11/0.36 % (29765)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.36 % (29765)Termination reason: Unknown
% 0.11/0.36 % (29765)Termination phase: Property scanning
% 0.11/0.36
% 0.11/0.36 % (29765)Memory used [KB]: 1023
% 0.11/0.36 % (29765)Time elapsed: 0.003 s
% 0.11/0.36 % (29765)Instructions burned: 3 (million)
% 0.11/0.36 % (29765)------------------------------
% 0.11/0.36 % (29765)------------------------------
% 0.11/0.36 % (29766)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.11/0.36 % (29764)Instruction limit reached!
% 0.11/0.36 % (29764)------------------------------
% 0.11/0.36 % (29764)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.36 % (29764)Termination reason: Unknown
% 0.11/0.36 % (29764)Termination phase: Saturation
% 0.11/0.36
% 0.11/0.36 % (29764)Memory used [KB]: 5628
% 0.11/0.36 % (29764)Time elapsed: 0.010 s
% 0.11/0.36 % (29764)Instructions burned: 17 (million)
% 0.11/0.36 % (29764)------------------------------
% 0.11/0.36 % (29764)------------------------------
% 0.11/0.36 % (29734)Instruction limit reached!
% 0.11/0.36 % (29734)------------------------------
% 0.11/0.36 % (29734)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.36 % (29734)Termination reason: Unknown
% 0.11/0.36 % (29734)Termination phase: Saturation
% 0.11/0.36
% 0.11/0.36 % (29734)Memory used [KB]: 6524
% 0.11/0.36 % (29734)Time elapsed: 0.082 s
% 0.11/0.36 % (29734)Instructions burned: 184 (million)
% 0.11/0.36 % (29734)------------------------------
% 0.11/0.36 % (29734)------------------------------
% 0.11/0.37 % (29767)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 (2999ds/127Mi)
% 0.11/0.37 % (29766)Instruction limit reached!
% 0.11/0.37 % (29766)------------------------------
% 0.11/0.37 % (29766)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.37 % (29766)Termination reason: Unknown
% 0.11/0.37 % (29766)Termination phase: Saturation
% 0.11/0.37
% 0.11/0.37 % (29766)Memory used [KB]: 5628
% 0.11/0.37 % (29766)Time elapsed: 0.016 s
% 0.11/0.37 % (29766)Instructions burned: 31 (million)
% 0.11/0.37 % (29766)------------------------------
% 0.11/0.37 % (29766)------------------------------
% 0.11/0.37 % (29769)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 (2999ds/3Mi)
% 0.11/0.38 % Exception at run slice level
% 0.11/0.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.11/0.38 % (29768)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 (2999ds/100Mi)
% 0.11/0.39 % (29771)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 (2999ds/86Mi)
% 0.11/0.39 % (29772)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 (2999ds/107Mi)
% 0.11/0.39 % (29770)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 (2999ds/20Mi)
% 0.11/0.39 % (29768)Refutation not found, incomplete strategy
% 0.11/0.39 % (29768)------------------------------
% 0.11/0.39 % (29768)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.39 % (29768)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 % (29768)Memory used [KB]: 5756
% 0.11/0.39 % (29768)Time elapsed: 0.038 s
% 0.11/0.39 % (29768)Instructions burned: 28 (million)
% 0.11/0.39 % (29768)------------------------------
% 0.11/0.39 % (29768)------------------------------
% 0.11/0.40 % (29763)First to succeed.
% 0.11/0.40 % (29760)Also succeeded, but the first one will report.
% 0.11/0.40 % (29763)Refutation found. Thanks to Tanya!
% 0.11/0.40 % SZS status Theorem for theBenchmark
% 0.11/0.40 % SZS output start Proof for theBenchmark
% 0.11/0.40 thf(type_def_6, type, 'type/pair/prod': ($tType * $tType) > $tType).
% 0.11/0.40 thf(type_def_7, type, sK0: $tType).
% 0.11/0.40 thf(type_def_8, type, sK1: $tType).
% 0.11/0.40 thf(func_def_0, type, 'type/pair/prod': ($tType * $tType) > $tType).
% 0.11/0.40 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:(X0 > (X0 > $o) > $o)).
% 0.11/0.40 thf(func_def_2, type, 'const/sets/CROSS': !>[X0: $tType, X1: $tType]:((X0 > $o) > (X1 > $o) > 'type/pair/prod' @ X0 @ X1 > $o)).
% 0.11/0.40 thf(func_def_3, type, 'const/pair/,': !>[X0: $tType, X1: $tType]:(X0 > X1 > 'type/pair/prod' @ X0 @ X1)).
% 0.11/0.40 thf(func_def_13, type, sK2: 'type/pair/prod' @ sK0 @ sK1 > $o).
% 0.11/0.40 thf(func_def_14, type, sK3: sK0 > $o).
% 0.11/0.40 thf(func_def_15, type, sK4: sK1 > $o).
% 0.11/0.40 thf(func_def_17, type, sK6: !>[X0: $tType, X1: $tType]:(('type/pair/prod' @ X0 @ X1 > $o) > 'type/pair/prod' @ X0 @ X1)).
% 0.11/0.40 thf(func_def_18, type, sK7: !>[X0: $tType, X1: $tType]:(('type/pair/prod' @ X0 @ X1 > $o) > X1)).
% 0.11/0.40 thf(func_def_19, type, sK8: !>[X0: $tType, X1: $tType]:(('type/pair/prod' @ X0 @ X1 > $o) > X0)).
% 0.11/0.40 thf(func_def_20, type, sK9: sK1).
% 0.11/0.40 thf(func_def_21, type, sK10: sK0).
% 0.11/0.40 thf(func_def_22, type, sK11: 'type/pair/prod' @ sK0 @ sK1).
% 0.11/0.40 thf(func_def_23, type, sK12: 'type/pair/prod' @ sK0 @ sK1).
% 0.11/0.40 thf(func_def_24, type, sK13: 'type/pair/prod' @ sK0 @ sK1).
% 0.11/0.40 thf(func_def_26, type, ph14: !>[X0: $tType]:(X0)).
% 0.11/0.40 thf(f474,plain,(
% 0.11/0.40 $false),
% 0.11/0.40 inference(avatar_sat_refutation,[],[f73,f82,f87,f96,f101,f110,f115,f148,f161,f210,f372,f454,f463])).
% 0.11/0.40 thf(f463,plain,(
% 0.11/0.40 spl5_2 | ~spl5_1),
% 0.11/0.40 inference(avatar_split_clause,[],[f446,f68,f71])).
% 0.11/0.40 thf(f71,plain,(
% 0.11/0.40 spl5_2 <=> ! [X1 : 'type/pair/prod' @ sK0 @ sK1] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($true = (sK2 @ X1)))),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_2])])).
% 0.11/0.40 thf(f68,plain,(
% 0.11/0.40 spl5_1 <=> ! [X2 : sK1,X3 : sK0] : ((('const/sets/IN' @ sK0 @ X3 @ sK3) = $false) | (('const/sets/IN' @ sK1 @ X2 @ sK4) = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X3 @ X2)) = $true))),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_1])])).
% 0.11/0.40 thf(f446,plain,(
% 0.11/0.40 ( ! [X0 : 'type/pair/prod' @ sK0 @ sK1] : (((sK2 @ X0) = $true) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false)) ) | ~spl5_1),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f435])).
% 0.11/0.40 thf(f435,plain,(
% 0.11/0.40 ( ! [X0 : 'type/pair/prod' @ sK0 @ sK1] : (((sK2 @ X0) = $true) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($false != $false)) ) | ~spl5_1),
% 0.11/0.40 inference(equality_factoring,[],[f413])).
% 0.11/0.40 thf(f413,plain,(
% 0.11/0.40 ( ! [X2 : sK0 > $o,X0 : 'type/pair/prod' @ sK0 @ sK1,X1 : sK1 > $o] : (($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ X1))) | ($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X2 @ sK4))) | ((sK2 @ X0) = $true)) ) | ~spl5_1),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f408])).
% 0.11/0.40 thf(f408,plain,(
% 0.11/0.40 ( ! [X2 : sK0 > $o,X0 : 'type/pair/prod' @ sK0 @ sK1,X1 : sK1 > $o] : (($true = $false) | ((sK2 @ X0) = $true) | ($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X2 @ sK4))) | ($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ X1)))) ) | ~spl5_1),
% 0.11/0.40 inference(superposition,[],[f399,f352])).
% 0.11/0.40 thf(f352,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X1 @ X0,X3 : X1 > $o,X4 : X0 > $o] : (($true = ('const/sets/IN' @ X0 @ (sK7 @ X1 @ X0 @ (^[Y0 : 'type/pair/prod' @ X1 @ X0]: (~ (X2 = Y0)))) @ X4)) | (('const/sets/IN' @ 'type/pair/prod' @ X1 @ X0 @ X2 @ ('const/sets/CROSS' @ X1 @ X0 @ X3 @ X4)) = $false)) )),
% 0.11/0.40 inference(superposition,[],[f34,f125])).
% 0.11/0.40 thf(f125,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X1 @ X0] : ((('const/pair/,' @ X1 @ X0 @ (sK8 @ X1 @ X0 @ (^[Y0 : 'type/pair/prod' @ X1 @ X0]: (~ (X2 = Y0)))) @ (sK7 @ X1 @ X0 @ (^[Y0 : 'type/pair/prod' @ X1 @ X0]: (~ (X2 = Y0))))) = X2)) )),
% 0.11/0.40 inference(leibniz_equality_elimination,[],[f30])).
% 0.11/0.40 thf(f30,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : 'type/pair/prod' @ X0 @ X1] : (((X2 @ ('const/pair/,' @ X0 @ X1 @ (sK8 @ X0 @ X1 @ X2) @ (sK7 @ X0 @ X1 @ X2))) = $false) | ((X2 @ X3) = $true)) )),
% 0.11/0.40 inference(pi_clausification,[],[f29])).
% 0.11/0.40 thf(f29,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = $true) | ((X2 @ ('const/pair/,' @ X0 @ X1 @ (sK8 @ X0 @ X1 @ X2) @ (sK7 @ X0 @ X1 @ X2))) = $false)) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f28])).
% 0.11/0.40 thf(f28,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : ((((^[Y0 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y0 @ (sK7 @ X0 @ X1 @ X2)))) @ (sK8 @ X0 @ X1 @ X2)) = $false) | ((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = $true)) )),
% 0.11/0.40 inference(sigma_clausification,[],[f27])).
% 0.11/0.40 thf(f27,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (($false = (!! @ X0 @ (^[Y0 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y0 @ (sK7 @ X0 @ X1 @ X2)))))) | ((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = $true)) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f26])).
% 0.11/0.40 thf(f26,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : ((((^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0))))) @ (sK7 @ X0 @ X1 @ X2)) = $false) | ((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = $true)) )),
% 0.11/0.40 inference(sigma_clausification,[],[f19])).
% 0.11/0.40 thf(f19,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (($false = (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0))))))) | ((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = $true)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f18])).
% 0.11/0.40 thf(f18,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (((!! @ 'type/pair/prod' @ X0 @ X1 @ X2) = (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0)))))))) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f17])).
% 0.11/0.40 thf(f17,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (((!! @ 'type/pair/prod' @ X0 @ X1 @ (^[Y0 : 'type/pair/prod' @ X0 @ X1]: (X2 @ Y0))) = (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0)))))))) )),
% 0.11/0.40 inference(cnf_transformation,[],[f9])).
% 0.11/0.40 thf(f9,plain,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : ((!! @ 'type/pair/prod' @ X0 @ X1 @ (^[Y0 : 'type/pair/prod' @ X0 @ X1]: (X2 @ Y0))) = (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0)))))))),
% 0.11/0.40 inference(fool_elimination,[],[f8])).
% 0.11/0.40 thf(f8,plain,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o] : (! [X3 : X0,X4 : X1] : (X2 @ ('const/pair/,' @ X0 @ X1 @ X3 @ X4)) = ! [X5 : 'type/pair/prod' @ X0 @ X1] : (X2 @ X5))),
% 0.11/0.40 inference(rectify,[],[f2])).
% 0.11/0.40 thf(f2,axiom,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X7 : 'type/pair/prod' @ X0 @ X1 > $o] : (! [X3 : X0,X4 : X1] : (X7 @ ('const/pair/,' @ X0 @ X1 @ X3 @ X4)) = ! [X3 : 'type/pair/prod' @ X0 @ X1] : (X7 @ X3))),
% 0.11/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/pair/FORALL_PAIR_THM_')).
% 0.11/0.40 thf(f34,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = $false) | (('const/sets/IN' @ X1 @ X3 @ X5) = $true)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f32])).
% 0.11/0.40 thf(f32,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : (($true = (('const/sets/IN' @ X1 @ X3 @ X5) & ('const/sets/IN' @ X0 @ X2 @ X4))) | (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = $false)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f16])).
% 0.11/0.40 thf(f16,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = (('const/sets/IN' @ X1 @ X3 @ X5) & ('const/sets/IN' @ X0 @ X2 @ X4)))) )),
% 0.11/0.40 inference(cnf_transformation,[],[f7])).
% 0.11/0.40 thf(f7,plain,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = (('const/sets/IN' @ X1 @ X3 @ X5) & ('const/sets/IN' @ X0 @ X2 @ X4)))),
% 0.11/0.40 inference(fool_elimination,[],[f6])).
% 0.11/0.40 thf(f6,plain,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : (('const/sets/IN' @ X0 @ X2 @ X4) & ('const/sets/IN' @ X1 @ X3 @ X5) = ('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)))),
% 0.11/0.40 inference(rectify,[],[f1])).
% 0.11/0.40 thf(f1,axiom,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X3 : X0,X4 : X1,X5 : X0 > $o,X6 : X1 > $o] : (('const/sets/IN' @ X0 @ X3 @ X5) & ('const/sets/IN' @ X1 @ X4 @ X6) = ('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X3 @ X4) @ ('const/sets/CROSS' @ X0 @ X1 @ X5 @ X6)))),
% 0.11/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_CROSS_')).
% 0.11/0.40 thf(f399,plain,(
% 0.11/0.40 ( ! [X0 : 'type/pair/prod' @ sK0 @ sK1,X1 : sK1 > $o] : ((('const/sets/IN' @ sK1 @ (sK7 @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (~ (X0 = Y0)))) @ sK4) = $false) | ($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ X1))) | ((sK2 @ X0) = $true)) ) | ~spl5_1),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f396])).
% 0.11/0.40 thf(f396,plain,(
% 0.11/0.40 ( ! [X0 : 'type/pair/prod' @ sK0 @ sK1,X1 : sK1 > $o] : (($false = ('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ X1))) | (('const/sets/IN' @ sK1 @ (sK7 @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (~ (X0 = Y0)))) @ sK4) = $false) | ($true = $false) | ((sK2 @ X0) = $true)) ) | ~spl5_1),
% 0.11/0.40 inference(superposition,[],[f353,f358])).
% 0.11/0.40 thf(f358,plain,(
% 0.11/0.40 ( ! [X0 : 'type/pair/prod' @ sK0 @ sK1] : (($false = ('const/sets/IN' @ sK0 @ (sK8 @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (~ (X0 = Y0)))) @ sK3)) | ((sK2 @ X0) = $true) | (('const/sets/IN' @ sK1 @ (sK7 @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (~ (X0 = Y0)))) @ sK4) = $false)) ) | ~spl5_1),
% 0.11/0.40 inference(superposition,[],[f69,f125])).
% 0.11/0.40 thf(f69,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X3 : sK0] : (((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X3 @ X2)) = $true) | (('const/sets/IN' @ sK0 @ X3 @ sK3) = $false) | (('const/sets/IN' @ sK1 @ X2 @ sK4) = $false)) ) | ~spl5_1),
% 0.11/0.40 inference(avatar_component_clause,[],[f68])).
% 0.11/0.40 thf(f353,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : 'type/pair/prod' @ X1 @ X0,X3 : X1 > $o,X4 : X0 > $o] : (($true = ('const/sets/IN' @ X1 @ (sK8 @ X1 @ X0 @ (^[Y0 : 'type/pair/prod' @ X1 @ X0]: (~ (X2 = Y0)))) @ X3)) | (('const/sets/IN' @ 'type/pair/prod' @ X1 @ X0 @ X2 @ ('const/sets/CROSS' @ X1 @ X0 @ X3 @ X4)) = $false)) )),
% 0.11/0.40 inference(superposition,[],[f33,f125])).
% 0.11/0.40 thf(f33,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = $false) | (('const/sets/IN' @ X0 @ X2 @ X4) = $true)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f32])).
% 0.11/0.40 thf(f454,plain,(
% 0.11/0.40 ~spl5_1 | ~spl5_9 | ~spl5_11),
% 0.11/0.40 inference(avatar_contradiction_clause,[],[f453])).
% 0.11/0.40 thf(f453,plain,(
% 0.11/0.40 $false | (~spl5_1 | ~spl5_9 | ~spl5_11)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f452])).
% 0.11/0.40 thf(f452,plain,(
% 0.11/0.40 ($true = $false) | (~spl5_1 | ~spl5_9 | ~spl5_11)),
% 0.11/0.40 inference(backward_demodulation,[],[f114,f451])).
% 0.11/0.40 thf(f451,plain,(
% 0.11/0.40 ( ! [X0 : sK0 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X0 @ sK4)) = $false)) ) | (~spl5_1 | ~spl5_9 | ~spl5_11)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f450])).
% 0.11/0.40 thf(f450,plain,(
% 0.11/0.40 ( ! [X0 : sK0 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X0 @ sK4)) = $false) | ($true = $false)) ) | (~spl5_1 | ~spl5_9 | ~spl5_11)),
% 0.11/0.40 inference(forward_demodulation,[],[f449,f105])).
% 0.11/0.40 thf(f105,plain,(
% 0.11/0.40 ((sK2 @ sK11) = $false) | ~spl5_9),
% 0.11/0.40 inference(avatar_component_clause,[],[f103])).
% 0.11/0.40 thf(f103,plain,(
% 0.11/0.40 spl5_9 <=> ((sK2 @ sK11) = $false)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_9])])).
% 0.11/0.40 thf(f449,plain,(
% 0.11/0.40 ( ! [X0 : sK0 > $o] : (($true = (sK2 @ sK11)) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X0 @ sK4)) = $false)) ) | (~spl5_1 | ~spl5_11)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f422])).
% 0.11/0.40 thf(f422,plain,(
% 0.11/0.40 ( ! [X0 : sK0 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ X0 @ sK4)) = $false) | ($true = $false) | ($true = (sK2 @ sK11))) ) | (~spl5_1 | ~spl5_11)),
% 0.11/0.40 inference(superposition,[],[f413,f114])).
% 0.11/0.40 thf(f114,plain,(
% 0.11/0.40 (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true) | ~spl5_11),
% 0.11/0.40 inference(avatar_component_clause,[],[f112])).
% 0.11/0.40 thf(f112,plain,(
% 0.11/0.40 spl5_11 <=> (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_11])])).
% 0.11/0.40 thf(f372,plain,(
% 0.11/0.40 ~spl5_2 | ~spl5_6 | ~spl5_8),
% 0.11/0.40 inference(avatar_contradiction_clause,[],[f371])).
% 0.11/0.40 thf(f371,plain,(
% 0.11/0.40 $false | (~spl5_2 | ~spl5_6 | ~spl5_8)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f370])).
% 0.11/0.40 thf(f370,plain,(
% 0.11/0.40 ($true = $false) | (~spl5_2 | ~spl5_6 | ~spl5_8)),
% 0.11/0.40 inference(forward_demodulation,[],[f365,f91])).
% 0.11/0.40 thf(f91,plain,(
% 0.11/0.40 ((sK2 @ sK12) = $false) | ~spl5_6),
% 0.11/0.40 inference(avatar_component_clause,[],[f89])).
% 0.11/0.40 thf(f89,plain,(
% 0.11/0.40 spl5_6 <=> ((sK2 @ sK12) = $false)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_6])])).
% 0.11/0.40 thf(f365,plain,(
% 0.11/0.40 ((sK2 @ sK12) = $true) | (~spl5_2 | ~spl5_8)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f363])).
% 0.11/0.40 thf(f363,plain,(
% 0.11/0.40 ((sK2 @ sK12) = $true) | ($true = $false) | (~spl5_2 | ~spl5_8)),
% 0.11/0.40 inference(superposition,[],[f100,f72])).
% 0.11/0.40 thf(f72,plain,(
% 0.11/0.40 ( ! [X1 : 'type/pair/prod' @ sK0 @ sK1] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($true = (sK2 @ X1))) ) | ~spl5_2),
% 0.11/0.40 inference(avatar_component_clause,[],[f71])).
% 0.11/0.40 thf(f100,plain,(
% 0.11/0.40 (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK12 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true) | ~spl5_8),
% 0.11/0.40 inference(avatar_component_clause,[],[f98])).
% 0.11/0.40 thf(f98,plain,(
% 0.11/0.40 spl5_8 <=> (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK12 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_8])])).
% 0.11/0.40 thf(f210,plain,(
% 0.11/0.40 ~spl5_2 | ~spl5_4 | ~spl5_5),
% 0.11/0.40 inference(avatar_contradiction_clause,[],[f209])).
% 0.11/0.40 thf(f209,plain,(
% 0.11/0.40 $false | (~spl5_2 | ~spl5_4 | ~spl5_5)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f208])).
% 0.11/0.40 thf(f208,plain,(
% 0.11/0.40 ($true = $false) | (~spl5_2 | ~spl5_4 | ~spl5_5)),
% 0.11/0.40 inference(forward_demodulation,[],[f203,f81])).
% 0.11/0.40 thf(f81,plain,(
% 0.11/0.40 ((sK2 @ sK13) = $false) | ~spl5_4),
% 0.11/0.40 inference(avatar_component_clause,[],[f79])).
% 0.11/0.40 thf(f79,plain,(
% 0.11/0.40 spl5_4 <=> ((sK2 @ sK13) = $false)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_4])])).
% 0.11/0.40 thf(f203,plain,(
% 0.11/0.40 ((sK2 @ sK13) = $true) | (~spl5_2 | ~spl5_5)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f202])).
% 0.11/0.40 thf(f202,plain,(
% 0.11/0.40 ((sK2 @ sK13) = $true) | ($true = $false) | (~spl5_2 | ~spl5_5)),
% 0.11/0.40 inference(superposition,[],[f72,f86])).
% 0.11/0.40 thf(f86,plain,(
% 0.11/0.40 (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK13 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true) | ~spl5_5),
% 0.11/0.40 inference(avatar_component_clause,[],[f84])).
% 0.11/0.40 thf(f84,plain,(
% 0.11/0.40 spl5_5 <=> (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK13 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_5])])).
% 0.11/0.40 thf(f161,plain,(
% 0.11/0.40 ~spl5_1 | ~spl5_3 | ~spl5_7 | ~spl5_10),
% 0.11/0.40 inference(avatar_contradiction_clause,[],[f160])).
% 0.11/0.40 thf(f160,plain,(
% 0.11/0.40 $false | (~spl5_1 | ~spl5_3 | ~spl5_7 | ~spl5_10)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f159])).
% 0.11/0.40 thf(f159,plain,(
% 0.11/0.40 ($true = $false) | (~spl5_1 | ~spl5_3 | ~spl5_7 | ~spl5_10)),
% 0.11/0.40 inference(backward_demodulation,[],[f109,f158])).
% 0.11/0.40 thf(f158,plain,(
% 0.11/0.40 ($false = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | (~spl5_1 | ~spl5_3 | ~spl5_7)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f157])).
% 0.11/0.40 thf(f157,plain,(
% 0.11/0.40 ($false = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | ($true = $false) | (~spl5_1 | ~spl5_3 | ~spl5_7)),
% 0.11/0.40 inference(forward_demodulation,[],[f156,f95])).
% 0.11/0.40 thf(f95,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | ~spl5_7),
% 0.11/0.40 inference(avatar_component_clause,[],[f93])).
% 0.11/0.40 thf(f93,plain,(
% 0.11/0.40 spl5_7 <=> ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3))),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_7])])).
% 0.11/0.40 thf(f156,plain,(
% 0.11/0.40 ($false = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | ($false = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | (~spl5_1 | ~spl5_3)),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f149])).
% 0.11/0.40 thf(f149,plain,(
% 0.11/0.40 ($false = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | ($true = $false) | ($false = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | (~spl5_1 | ~spl5_3)),
% 0.11/0.40 inference(superposition,[],[f69,f77])).
% 0.11/0.40 thf(f77,plain,(
% 0.11/0.40 ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false) | ~spl5_3),
% 0.11/0.40 inference(avatar_component_clause,[],[f75])).
% 0.11/0.40 thf(f75,plain,(
% 0.11/0.40 spl5_3 <=> ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false)),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_3])])).
% 0.11/0.40 thf(f109,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | ~spl5_10),
% 0.11/0.40 inference(avatar_component_clause,[],[f107])).
% 0.11/0.40 thf(f107,plain,(
% 0.11/0.40 spl5_10 <=> ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4))),
% 0.11/0.40 introduced(avatar_definition,[new_symbols(naming,[spl5_10])])).
% 0.11/0.40 thf(f148,plain,(
% 0.11/0.40 spl5_1 | ~spl5_2),
% 0.11/0.40 inference(avatar_split_clause,[],[f145,f71,f68])).
% 0.11/0.40 thf(f145,plain,(
% 0.11/0.40 ( ! [X0 : sK0,X1 : sK1] : ((('const/sets/IN' @ sK0 @ X0 @ sK3) = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X0 @ X1)) = $true) | ($false = ('const/sets/IN' @ sK1 @ X1 @ sK4))) ) | ~spl5_2),
% 0.11/0.40 inference(trivial_inequality_removal,[],[f143])).
% 0.11/0.40 thf(f143,plain,(
% 0.11/0.40 ( ! [X0 : sK0,X1 : sK1] : (($false = ('const/sets/IN' @ sK1 @ X1 @ sK4)) | (('const/sets/IN' @ sK0 @ X0 @ sK3) = $false) | ($true = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X0 @ X1)) = $true)) ) | ~spl5_2),
% 0.11/0.40 inference(superposition,[],[f35,f72])).
% 0.11/0.40 thf(f35,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : ((('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = $true) | (('const/sets/IN' @ X0 @ X2 @ X4) = $false) | (('const/sets/IN' @ X1 @ X3 @ X5) = $false)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f31])).
% 0.11/0.40 thf(f31,plain,(
% 0.11/0.40 ( ! [X1 : $tType,X0 : $tType,X2 : X0,X3 : X1,X4 : X0 > $o,X5 : X1 > $o] : (((('const/sets/IN' @ X1 @ X3 @ X5) & ('const/sets/IN' @ X0 @ X2 @ X4)) = $false) | (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ ('const/pair/,' @ X0 @ X1 @ X2 @ X3) @ ('const/sets/CROSS' @ X0 @ X1 @ X4 @ X5)) = $true)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f16])).
% 0.11/0.40 thf(f115,plain,(
% 0.11/0.40 spl5_10 | spl5_11),
% 0.11/0.40 inference(avatar_split_clause,[],[f49,f112,f107])).
% 0.11/0.40 thf(f49,plain,(
% 0.11/0.40 (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true) | ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4))),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f47])).
% 0.11/0.40 thf(f47,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK11 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ sK11)) = $false)),
% 0.11/0.40 inference(beta_eta_normalization,[],[f46])).
% 0.11/0.40 thf(f46,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | (((^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0))) @ sK11) = $false)),
% 0.11/0.40 inference(sigma_clausification,[],[f45])).
% 0.11/0.40 thf(f45,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f43])).
% 0.11/0.40 thf(f43,plain,(
% 0.11/0.40 ($true = (('const/sets/IN' @ sK1 @ sK9 @ sK4) & ('const/sets/IN' @ sK0 @ sK10 @ sK3))) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f41])).
% 0.11/0.40 thf(f41,plain,(
% 0.11/0.40 ($false = ((('const/sets/IN' @ sK1 @ sK9 @ sK4) & ('const/sets/IN' @ sK0 @ sK10 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)))) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(beta_eta_normalization,[],[f40])).
% 0.11/0.40 thf(f40,plain,(
% 0.11/0.40 (((^[Y0 : sK0]: ((('const/sets/IN' @ sK1 @ sK9 @ sK4) & ('const/sets/IN' @ sK0 @ Y0 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y0 @ sK9)))) @ sK10) = $false) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(sigma_clausification,[],[f39])).
% 0.11/0.40 thf(f39,plain,(
% 0.11/0.40 ($false = (!! @ sK0 @ (^[Y0 : sK0]: ((('const/sets/IN' @ sK1 @ sK9 @ sK4) & ('const/sets/IN' @ sK0 @ Y0 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y0 @ sK9)))))) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(beta_eta_normalization,[],[f38])).
% 0.11/0.40 thf(f38,plain,(
% 0.11/0.40 (((^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0)))))) @ sK9) = $false) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(sigma_clausification,[],[f37])).
% 0.11/0.40 thf(f37,plain,(
% 0.11/0.40 ($false = (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0)))))))) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f15])).
% 0.11/0.40 thf(f15,plain,(
% 0.11/0.40 ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) != (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))),
% 0.11/0.40 inference(cnf_transformation,[],[f14])).
% 0.11/0.40 thf(f14,plain,(
% 0.11/0.40 ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) != (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))),
% 0.11/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f12,f13])).
% 0.11/0.40 thf(f13,plain,(
% 0.11/0.40 ? [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : ((!! @ 'type/pair/prod' @ X0 @ X1 @ (^[Y0 : 'type/pair/prod' @ X0 @ X1]: (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ Y0 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X2 @ Y0)))) != (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: ((('const/sets/IN' @ X1 @ Y0 @ X4) & ('const/sets/IN' @ X0 @ Y1 @ X3)) => (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0)))))))) => ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) != (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))),
% 0.11/0.40 introduced(choice_axiom,[])).
% 0.11/0.40 thf(f12,plain,(
% 0.11/0.40 ? [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : ((!! @ 'type/pair/prod' @ X0 @ X1 @ (^[Y0 : 'type/pair/prod' @ X0 @ X1]: (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ Y0 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X2 @ Y0)))) != (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: ((('const/sets/IN' @ X1 @ Y0 @ X4) & ('const/sets/IN' @ X0 @ Y1 @ X3)) => (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0))))))))),
% 0.11/0.40 inference(ennf_transformation,[],[f11])).
% 0.11/0.40 thf(f11,plain,(
% 0.11/0.40 ~! [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : ((!! @ 'type/pair/prod' @ X0 @ X1 @ (^[Y0 : 'type/pair/prod' @ X0 @ X1]: (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ Y0 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X2 @ Y0)))) = (!! @ X1 @ (^[Y0 : X1]: (!! @ X0 @ (^[Y1 : X0]: ((('const/sets/IN' @ X1 @ Y0 @ X4) & ('const/sets/IN' @ X0 @ Y1 @ X3)) => (X2 @ ('const/pair/,' @ X0 @ X1 @ Y1 @ Y0))))))))),
% 0.11/0.40 inference(fool_elimination,[],[f10])).
% 0.11/0.40 thf(f10,plain,(
% 0.11/0.40 ~! [X0 : $tType,X1 : $tType,X2 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : (! [X5 : X0,X6 : X1] : ((('const/sets/IN' @ X0 @ X5 @ X3) & ('const/sets/IN' @ X1 @ X6 @ X4)) => (X2 @ ('const/pair/,' @ X0 @ X1 @ X5 @ X6))) = ! [X7 : 'type/pair/prod' @ X0 @ X1] : (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ X7 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X2 @ X7)))),
% 0.11/0.40 inference(rectify,[],[f4])).
% 0.11/0.40 thf(f4,negated_conjecture,(
% 0.11/0.40 ~! [X0 : $tType,X1 : $tType,X7 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : (! [X5 : X0,X6 : X1] : ((('const/sets/IN' @ X0 @ X5 @ X3) & ('const/sets/IN' @ X1 @ X6 @ X4)) => (X7 @ ('const/pair/,' @ X0 @ X1 @ X5 @ X6))) = ! [X5 : 'type/pair/prod' @ X0 @ X1] : (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ X5 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X7 @ X5)))),
% 0.11/0.40 inference(negated_conjecture,[],[f3])).
% 0.11/0.40 thf(f3,conjecture,(
% 0.11/0.40 ! [X0 : $tType,X1 : $tType,X7 : 'type/pair/prod' @ X0 @ X1 > $o,X3 : X0 > $o,X4 : X1 > $o] : (! [X5 : X0,X6 : X1] : ((('const/sets/IN' @ X0 @ X5 @ X3) & ('const/sets/IN' @ X1 @ X6 @ X4)) => (X7 @ ('const/pair/,' @ X0 @ X1 @ X5 @ X6))) = ! [X5 : 'type/pair/prod' @ X0 @ X1] : (('const/sets/IN' @ 'type/pair/prod' @ X0 @ X1 @ X5 @ ('const/sets/CROSS' @ X0 @ X1 @ X3 @ X4)) => (X7 @ X5)))),
% 0.11/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FORALL_IN_CROSS_')).
% 0.11/0.40 thf(f110,plain,(
% 0.11/0.40 spl5_9 | spl5_10),
% 0.11/0.40 inference(avatar_split_clause,[],[f48,f107,f103])).
% 0.11/0.40 thf(f48,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK1 @ sK9 @ sK4)) | ((sK2 @ sK11) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f47])).
% 0.11/0.40 thf(f101,plain,(
% 0.11/0.40 spl5_8 | spl5_7),
% 0.11/0.40 inference(avatar_split_clause,[],[f53,f93,f98])).
% 0.11/0.40 thf(f53,plain,(
% 0.11/0.40 (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK12 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true) | ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3))),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f51])).
% 0.11/0.40 thf(f51,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK12 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ sK12)) = $false)),
% 0.11/0.40 inference(beta_eta_normalization,[],[f50])).
% 0.11/0.40 thf(f50,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | (((^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0))) @ sK12) = $false)),
% 0.11/0.40 inference(sigma_clausification,[],[f44])).
% 0.11/0.40 thf(f44,plain,(
% 0.11/0.40 ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3)) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f43])).
% 0.11/0.40 thf(f96,plain,(
% 0.11/0.40 spl5_6 | spl5_7),
% 0.11/0.40 inference(avatar_split_clause,[],[f52,f93,f89])).
% 0.11/0.40 thf(f52,plain,(
% 0.11/0.40 ((sK2 @ sK12) = $false) | ($true = ('const/sets/IN' @ sK0 @ sK10 @ sK3))),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f51])).
% 0.11/0.40 thf(f87,plain,(
% 0.11/0.40 spl5_5 | spl5_3),
% 0.11/0.40 inference(avatar_split_clause,[],[f57,f75,f84])).
% 0.11/0.40 thf(f57,plain,(
% 0.11/0.40 ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK13 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $true)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f55])).
% 0.11/0.40 thf(f55,plain,(
% 0.11/0.40 ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false) | ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ sK13 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ sK13)) = $false)),
% 0.11/0.40 inference(beta_eta_normalization,[],[f54])).
% 0.11/0.40 thf(f54,plain,(
% 0.11/0.40 (((^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0))) @ sK13) = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false)),
% 0.11/0.40 inference(sigma_clausification,[],[f42])).
% 0.11/0.40 thf(f42,plain,(
% 0.11/0.40 ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false) | ((!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0)))) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f41])).
% 0.11/0.40 thf(f82,plain,(
% 0.11/0.40 spl5_3 | spl5_4),
% 0.11/0.40 inference(avatar_split_clause,[],[f56,f79,f75])).
% 0.11/0.40 thf(f56,plain,(
% 0.11/0.40 ((sK2 @ sK13) = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ sK10 @ sK9)) = $false)),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f55])).
% 0.11/0.40 thf(f73,plain,(
% 0.11/0.40 spl5_1 | spl5_2),
% 0.11/0.40 inference(avatar_split_clause,[],[f66,f71,f68])).
% 0.11/0.40 thf(f66,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X3 : sK0,X1 : 'type/pair/prod' @ sK0 @ sK1] : ((('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | (('const/sets/IN' @ sK0 @ X3 @ sK3) = $false) | ((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X3 @ X2)) = $true) | (('const/sets/IN' @ sK1 @ X2 @ sK4) = $false) | ($true = (sK2 @ X1))) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f65])).
% 0.11/0.40 thf(f65,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X3 : sK0,X1 : 'type/pair/prod' @ sK0 @ sK1] : (((sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X3 @ X2)) = $true) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($true = (sK2 @ X1)) | ((('const/sets/IN' @ sK1 @ X2 @ sK4) & ('const/sets/IN' @ sK0 @ X3 @ sK3)) = $false)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f64])).
% 0.11/0.40 thf(f64,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X3 : sK0,X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = (sK2 @ X1)) | ($true = ((('const/sets/IN' @ sK1 @ X2 @ sK4) & ('const/sets/IN' @ sK0 @ X3 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ X3 @ X2)))) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false)) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f63])).
% 0.11/0.40 thf(f63,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X3 : sK0,X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = ((^[Y0 : sK0]: ((('const/sets/IN' @ sK1 @ X2 @ sK4) & ('const/sets/IN' @ sK0 @ Y0 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y0 @ X2)))) @ X3)) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($true = (sK2 @ X1))) )),
% 0.11/0.40 inference(pi_clausification,[],[f62])).
% 0.11/0.40 thf(f62,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = (!! @ sK0 @ (^[Y0 : sK0]: ((('const/sets/IN' @ sK1 @ X2 @ sK4) & ('const/sets/IN' @ sK0 @ Y0 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y0 @ X2)))))) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false) | ($true = (sK2 @ X1))) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f61])).
% 0.11/0.40 thf(f61,plain,(
% 0.11/0.40 ( ! [X2 : sK1,X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = (sK2 @ X1)) | ($true = ((^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0)))))) @ X2)) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false)) )),
% 0.11/0.40 inference(pi_clausification,[],[f60])).
% 0.11/0.40 thf(f60,plain,(
% 0.11/0.40 ( ! [X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0)))))))) | ($true = (sK2 @ X1)) | (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) = $false)) )),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f59])).
% 0.11/0.40 thf(f59,plain,(
% 0.11/0.40 ( ! [X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ X1 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ X1))) | ($true = (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))) )),
% 0.11/0.40 inference(beta_eta_normalization,[],[f58])).
% 0.11/0.40 thf(f58,plain,(
% 0.11/0.40 ( ! [X1 : 'type/pair/prod' @ sK0 @ sK1] : (($true = ((^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0))) @ X1)) | ($true = (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))) )),
% 0.11/0.40 inference(pi_clausification,[],[f36])).
% 0.11/0.40 thf(f36,plain,(
% 0.11/0.40 ($true = (!! @ 'type/pair/prod' @ sK0 @ sK1 @ (^[Y0 : 'type/pair/prod' @ sK0 @ sK1]: (('const/sets/IN' @ 'type/pair/prod' @ sK0 @ sK1 @ Y0 @ ('const/sets/CROSS' @ sK0 @ sK1 @ sK3 @ sK4)) => (sK2 @ Y0))))) | ($true = (!! @ sK1 @ (^[Y0 : sK1]: (!! @ sK0 @ (^[Y1 : sK0]: ((('const/sets/IN' @ sK1 @ Y0 @ sK4) & ('const/sets/IN' @ sK0 @ Y1 @ sK3)) => (sK2 @ ('const/pair/,' @ sK0 @ sK1 @ Y1 @ Y0))))))))),
% 0.11/0.40 inference(binary_proxy_clausification,[],[f15])).
% 0.11/0.40 % SZS output end Proof for theBenchmark
% 0.11/0.40 % (29763)------------------------------
% 0.11/0.40 % (29763)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.40 % (29763)Termination reason: Refutation
% 0.11/0.40
% 0.11/0.40 % (29763)Memory used [KB]: 5884
% 0.11/0.40 % (29763)Time elapsed: 0.050 s
% 0.11/0.40 % (29763)Instructions burned: 88 (million)
% 0.11/0.40 % (29763)------------------------------
% 0.11/0.40 % (29763)------------------------------
% 0.11/0.40 % (29733)Success in time 0.108 s
% 0.11/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------