TSTP Solution File: SYO555^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO555^1 : TPTP v8.2.0. Released v5.2.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 : n005.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 09:06:12 EDT 2024
% Result : Theorem 0.16s 0.37s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SYO555^1 : TPTP v8.2.0. Released v5.2.0.
% 0.05/0.11 % 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.12/0.30 % Computer : n005.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon May 20 08:31:08 EDT 2024
% 0.12/0.31 % CPUTime :
% 0.12/0.31 This is a TH0_THM_EQU_NAR problem
% 0.12/0.31 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.16/0.32 % (19977)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.16/0.32 % (19977)Instruction limit reached!
% 0.16/0.32 % (19977)------------------------------
% 0.16/0.32 % (19977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32 % (19977)Termination reason: Unknown
% 0.16/0.32 % (19977)Termination phase: Saturation
% 0.16/0.32
% 0.16/0.32 % (19977)Memory used [KB]: 5500
% 0.16/0.32 % (19977)Time elapsed: 0.004 s
% 0.16/0.32 % (19977)Instructions burned: 5 (million)
% 0.16/0.32 % (19977)------------------------------
% 0.16/0.32 % (19977)------------------------------
% 0.16/0.33 % (19979)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.33 % (19983)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.16/0.33 % (19980)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.16/0.33 % (19979)Instruction limit reached!
% 0.16/0.33 % (19979)------------------------------
% 0.16/0.33 % (19979)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (19979)Termination reason: Unknown
% 0.16/0.33 % (19979)Termination phase: Saturation
% 0.16/0.33 % (19980)Instruction limit reached!
% 0.16/0.33 % (19980)------------------------------
% 0.16/0.33 % (19980)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33
% 0.16/0.33 % (19979)Memory used [KB]: 5373
% 0.16/0.33 % (19979)Time elapsed: 0.003 s
% 0.16/0.33 % (19979)Instructions burned: 2 (million)
% 0.16/0.33 % (19979)------------------------------
% 0.16/0.33 % (19979)------------------------------
% 0.16/0.33 % (19980)Termination reason: Unknown
% 0.16/0.33 % (19980)Termination phase: Property scanning
% 0.16/0.33
% 0.16/0.33 % (19980)Memory used [KB]: 895
% 0.16/0.33 % (19980)Time elapsed: 0.003 s
% 0.16/0.33 % (19980)Instructions burned: 2 (million)
% 0.16/0.33 % (19980)------------------------------
% 0.16/0.33 % (19980)------------------------------
% 0.16/0.33 % (19978)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.16/0.33 % (19976)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.16/0.33 % (19983)Instruction limit reached!
% 0.16/0.33 % (19983)------------------------------
% 0.16/0.33 % (19983)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (19983)Termination reason: Unknown
% 0.16/0.33 % (19983)Termination phase: Saturation
% 0.16/0.33
% 0.16/0.33 % (19983)Memory used [KB]: 5500
% 0.16/0.33 % (19983)Time elapsed: 0.004 s
% 0.16/0.33 % (19983)Instructions burned: 4 (million)
% 0.16/0.33 % (19983)------------------------------
% 0.16/0.33 % (19983)------------------------------
% 0.16/0.33 % (19978)Refutation not found, incomplete strategy
% 0.16/0.33 % (19978)------------------------------
% 0.16/0.33 % (19978)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (19978)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.33
% 0.16/0.33
% 0.16/0.33 % (19978)Memory used [KB]: 5628
% 0.16/0.33 % (19978)Time elapsed: 0.007 s
% 0.16/0.33 % (19978)Instructions burned: 16 (million)
% 0.16/0.33 % (19978)------------------------------
% 0.16/0.33 % (19978)------------------------------
% 0.16/0.33 % (19984)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.16/0.34 % (19987)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.16/0.34 % (19982)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.34 % (19981)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.16/0.34 % (19985)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.16/0.34 % (19986)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.16/0.34 % (19981)Refutation not found, incomplete strategy
% 0.16/0.34 % (19981)------------------------------
% 0.16/0.34 % (19981)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (19981)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 % (19985)Refutation not found, incomplete strategy
% 0.16/0.34 % (19985)------------------------------
% 0.16/0.34 % (19985)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (19985)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 % (19985)Memory used [KB]: 5500
% 0.16/0.34 % (19985)Time elapsed: 0.002 s
% 0.16/0.34 % (19985)Instructions burned: 2 (million)
% 0.16/0.34 % (19985)------------------------------
% 0.16/0.34 % (19985)------------------------------
% 0.16/0.34 % (19981)Memory used [KB]: 5500
% 0.16/0.34 % (19986)Refutation not found, incomplete strategy
% 0.16/0.34 % (19986)------------------------------
% 0.16/0.34 % (19986)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (19986)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 % (19986)Memory used [KB]: 5500
% 0.16/0.34 % (19986)Time elapsed: 0.002 s
% 0.16/0.34 % (19986)Instructions burned: 2 (million)
% 0.16/0.34 % (19986)------------------------------
% 0.16/0.34 % (19986)------------------------------
% 0.16/0.34 % (19981)Time elapsed: 0.006 s
% 0.16/0.34 % (19981)Instructions burned: 2 (million)
% 0.16/0.34 % (19981)------------------------------
% 0.16/0.34 % (19981)------------------------------
% 0.16/0.34 % (19988)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.16/0.34 % (19988)Instruction limit reached!
% 0.16/0.34 % (19988)------------------------------
% 0.16/0.34 % (19988)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (19988)Termination reason: Unknown
% 0.16/0.34 % (19988)Termination phase: Saturation
% 0.16/0.34
% 0.16/0.34 % (19988)Memory used [KB]: 1023
% 0.16/0.34 % (19988)Time elapsed: 0.004 s
% 0.16/0.34 % (19988)Instructions burned: 8 (million)
% 0.16/0.34 % (19988)------------------------------
% 0.16/0.34 % (19988)------------------------------
% 0.16/0.34 % (19984)Instruction limit reached!
% 0.16/0.34 % (19984)------------------------------
% 0.16/0.34 % (19984)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (19984)Termination reason: Unknown
% 0.16/0.34 % (19984)Termination phase: Saturation
% 0.16/0.34
% 0.16/0.34 % (19984)Memory used [KB]: 5756
% 0.16/0.34 % (19984)Time elapsed: 0.012 s
% 0.16/0.34 % (19984)Instructions burned: 39 (million)
% 0.16/0.34 % (19984)------------------------------
% 0.16/0.34 % (19984)------------------------------
% 0.16/0.35 % (19987)Refutation not found, incomplete strategy
% 0.16/0.35 % (19987)------------------------------
% 0.16/0.35 % (19987)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (19987)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.35
% 0.16/0.35
% 0.16/0.35 % (19987)Memory used [KB]: 5628
% 0.16/0.35 % (19987)Time elapsed: 0.013 s
% 0.16/0.35 % (19987)Instructions burned: 33 (million)
% 0.16/0.35 % (19987)------------------------------
% 0.16/0.35 % (19987)------------------------------
% 0.16/0.35 % (19989)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.16/0.35 % (19990)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.16/0.35 % (19990)Instruction limit reached!
% 0.16/0.35 % (19990)------------------------------
% 0.16/0.35 % (19990)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (19990)Termination reason: Unknown
% 0.16/0.35 % (19990)Termination phase: Saturation
% 0.16/0.35
% 0.16/0.35 % (19990)Memory used [KB]: 5500
% 0.16/0.35 % (19990)Time elapsed: 0.003 s
% 0.16/0.35 % (19990)Instructions burned: 4 (million)
% 0.16/0.35 % (19990)------------------------------
% 0.16/0.35 % (19990)------------------------------
% 0.16/0.35 % (19982)Instruction limit reached!
% 0.16/0.35 % (19982)------------------------------
% 0.16/0.35 % (19982)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (19982)Termination reason: Unknown
% 0.16/0.35 % (19982)Termination phase: Saturation
% 0.16/0.35
% 0.16/0.35 % (19982)Memory used [KB]: 5500
% 0.16/0.35 % (19982)Time elapsed: 0.016 s
% 0.16/0.35 % (19982)Instructions burned: 18 (million)
% 0.16/0.35 % (19982)------------------------------
% 0.16/0.35 % (19982)------------------------------
% 0.16/0.35 % (19992)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.16/0.35 % (19993)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.16/0.35 % (19993)Instruction limit reached!
% 0.16/0.35 % (19993)------------------------------
% 0.16/0.35 % (19993)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (19993)Termination reason: Unknown
% 0.16/0.35 % (19993)Termination phase: Saturation
% 0.16/0.35
% 0.16/0.35 % (19993)Memory used [KB]: 5500
% 0.16/0.35 % (19993)Time elapsed: 0.003 s
% 0.16/0.35 % (19993)Instructions burned: 5 (million)
% 0.16/0.35 % (19993)------------------------------
% 0.16/0.35 % (19993)------------------------------
% 0.16/0.35 % (19992)Instruction limit reached!
% 0.16/0.35 % (19992)------------------------------
% 0.16/0.35 % (19992)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (19992)Termination reason: Unknown
% 0.16/0.35 % (19992)Termination phase: Saturation
% 0.16/0.35
% 0.16/0.35 % (19992)Memory used [KB]: 5500
% 0.16/0.35 % (19992)Time elapsed: 0.004 s
% 0.16/0.35 % (19992)Instructions burned: 8 (million)
% 0.16/0.35 % (19992)------------------------------
% 0.16/0.35 % (19992)------------------------------
% 0.16/0.36 % (19989)Instruction limit reached!
% 0.16/0.36 % (19989)------------------------------
% 0.16/0.36 % (19989)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (19989)Termination reason: Unknown
% 0.16/0.36 % (19989)Termination phase: Saturation
% 0.16/0.36
% 0.16/0.36 % (19989)Memory used [KB]: 5628
% 0.16/0.36 % (19989)Time elapsed: 0.008 s
% 0.16/0.36 % (19989)Instructions burned: 18 (million)
% 0.16/0.36 % (19989)------------------------------
% 0.16/0.36 % (19989)------------------------------
% 0.16/0.36 % (19994)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.16/0.36 % (19994)Instruction limit reached!
% 0.16/0.36 % (19994)------------------------------
% 0.16/0.36 % (19994)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (19994)Termination reason: Unknown
% 0.16/0.36 % (19994)Termination phase: Saturation
% 0.16/0.36
% 0.16/0.36 % (19994)Memory used [KB]: 5500
% 0.16/0.36 % (19994)Time elapsed: 0.003 s
% 0.16/0.36 % (19994)Instructions burned: 4 (million)
% 0.16/0.36 % (19994)------------------------------
% 0.16/0.36 % (19994)------------------------------
% 0.16/0.36 % (19995)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.16/0.36 % (19997)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.16/0.36 % (19991)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.16/0.36 % (19998)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.16/0.36 % (19999)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.16/0.36 % (19991)Instruction limit reached!
% 0.16/0.36 % (19991)------------------------------
% 0.16/0.36 % (19991)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (19991)Termination reason: Unknown
% 0.16/0.36 % (19991)Termination phase: Saturation
% 0.16/0.36
% 0.16/0.36 % (19991)Memory used [KB]: 895
% 0.16/0.36 % (19991)Time elapsed: 0.003 s
% 0.16/0.36 % (19991)Instructions burned: 3 (million)
% 0.16/0.36 % (19991)------------------------------
% 0.16/0.36 % (19991)------------------------------
% 0.16/0.36 % (19997)Instruction limit reached!
% 0.16/0.36 % (19997)------------------------------
% 0.16/0.36 % (19997)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (19997)Termination reason: Unknown
% 0.16/0.36 % (19997)Termination phase: Saturation
% 0.16/0.36
% 0.16/0.36 % (19997)Memory used [KB]: 5500
% 0.16/0.36 % (19997)Time elapsed: 0.004 s
% 0.16/0.36 % (19997)Instructions burned: 9 (million)
% 0.16/0.36 % (19997)------------------------------
% 0.16/0.36 % (19997)------------------------------
% 0.16/0.36 % (19998)Refutation not found, incomplete strategy
% 0.16/0.36 % (19998)------------------------------
% 0.16/0.36 % (19998)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (19998)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.36
% 0.16/0.36
% 0.16/0.36 % (19998)Memory used [KB]: 5500
% 0.16/0.36 % (19998)Time elapsed: 0.002 s
% 0.16/0.36 % (19998)Instructions burned: 2 (million)
% 0.16/0.36 % (19998)------------------------------
% 0.16/0.36 % (19998)------------------------------
% 0.16/0.37 % (19995)First to succeed.
% 0.16/0.37 % (19996)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.16/0.37 % (20000)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.16/0.37 % (19995)Refutation found. Thanks to Tanya!
% 0.16/0.37 % SZS status Theorem for theBenchmark
% 0.16/0.37 % SZS output start Proof for theBenchmark
% 0.16/0.37 thf(func_def_0, type, eps1: ($i > $o) > $i).
% 0.16/0.37 thf(func_def_2, type, if1: $o > $i > $i > $i).
% 0.16/0.37 thf(func_def_3, type, eps2: ($i > $o) > $i).
% 0.16/0.37 thf(func_def_4, type, if2: $o > $i > $i > $i).
% 0.16/0.37 thf(func_def_17, type, ph1: !>[X0: $tType]:(X0)).
% 0.16/0.37 thf(f204,plain,(
% 0.16/0.37 $false),
% 0.16/0.37 inference(avatar_sat_refutation,[],[f120,f128,f169,f181,f194,f203])).
% 0.16/0.37 thf(f203,plain,(
% 0.16/0.37 ~spl0_1),
% 0.16/0.37 inference(avatar_contradiction_clause,[],[f202])).
% 0.16/0.37 thf(f202,plain,(
% 0.16/0.37 $false | ~spl0_1),
% 0.16/0.37 inference(equality_resolution,[],[f115])).
% 0.16/0.37 thf(f115,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK4 != X0)) ) | ~spl0_1),
% 0.16/0.37 inference(avatar_component_clause,[],[f114])).
% 0.16/0.37 thf(f114,plain,(
% 0.16/0.37 spl0_1 <=> ! [X0] : (sK4 != X0)),
% 0.16/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.16/0.37 thf(f194,plain,(
% 0.16/0.37 ~spl0_10),
% 0.16/0.37 inference(avatar_contradiction_clause,[],[f193])).
% 0.16/0.37 thf(f193,plain,(
% 0.16/0.37 $false | ~spl0_10),
% 0.16/0.37 inference(equality_resolution,[],[f168])).
% 0.16/0.37 thf(f168,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK3 != X0)) ) | ~spl0_10),
% 0.16/0.37 inference(avatar_component_clause,[],[f167])).
% 0.16/0.37 thf(f167,plain,(
% 0.16/0.37 spl0_10 <=> ! [X0] : (sK3 != X0)),
% 0.16/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_10])])).
% 0.16/0.37 thf(f181,plain,(
% 0.16/0.37 spl0_10 | spl0_9),
% 0.16/0.37 inference(avatar_split_clause,[],[f180,f163,f167])).
% 0.16/0.37 thf(f163,plain,(
% 0.16/0.37 spl0_9 <=> (sK3 = (if1 @ $true @ sK3 @ sK4))),
% 0.16/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_9])])).
% 0.16/0.37 thf(f180,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK3 != X0)) ) | spl0_9),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f179])).
% 0.16/0.37 thf(f179,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK3 != X0) | (sK3 != sK3) | ($false = $true)) ) | spl0_9),
% 0.16/0.37 inference(superposition,[],[f165,f52])).
% 0.16/0.37 thf(f52,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((if1 @ X1 @ X0 @ X2) = X0) | ($false = X1) | (X0 != X3)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f51])).
% 0.16/0.37 thf(f51,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((X0 = X3) = $false) | ($false = X1) | ((if1 @ X1 @ X0 @ X2) = X0)) )),
% 0.16/0.37 inference(duplicate_literal_removal,[],[f50])).
% 0.16/0.37 thf(f50,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = X1) | ((X0 = X3) = $false) | ($false = X1) | ((if1 @ X1 @ X0 @ X2) = X0)) )),
% 0.16/0.37 inference(not_proxy_clausification,[],[f49])).
% 0.16/0.37 thf(f49,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = X1) | ((if1 @ X1 @ X0 @ X2) = X0) | ($true = (~ X1)) | ((X0 = X3) = $false)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f47])).
% 0.16/0.37 thf(f47,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true) | ((if1 @ X1 @ X0 @ X2) = X0) | ($false = X1) | ((X0 = X3) = $false)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f46])).
% 0.16/0.37 thf(f46,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((X0 = (if1 @ X1 @ X0 @ X2)) = $true) | ((X0 = X3) = $false) | ($false = X1) | (((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f44])).
% 0.16/0.37 thf(f44,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) = $true) | ($false = X1) | (((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true) | ((X0 = X3) = $false)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f43])).
% 0.16/0.37 thf(f43,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = ((X0 = X3) & X1)) | (((X0 = (if1 @ X1 @ X0 @ X2)) & X1) = $true) | (((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f42])).
% 0.16/0.37 thf(f42,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) | ((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2)))) = $true) | ($false = ((X0 = X3) & X1))) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f40])).
% 0.16/0.37 thf(f40,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true != (((X0 = X3) & X1) | ((~ X1) & (X2 = X3)))) | ((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) | ((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2)))) = $true)) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f39])).
% 0.16/0.37 thf(f39,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X2 = Y0)))) @ X3) != $true) | (((^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X2 = Y0)))) @ (if1 @ X1 @ X0 @ X2)) = $true)) )),
% 0.16/0.37 inference(superposition,[],[f22,f36])).
% 0.16/0.37 thf(f36,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X1 : $o] : (((if1 @ X1 @ X2 @ X3) = (eps1 @ (^[Y0 : $i]: (((X2 = Y0) & X1) | ((~ X1) & (X3 = Y0))))))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f35])).
% 0.16/0.37 thf(f35,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X1 : $o] : (((if1 @ X1 @ X2 @ X3) = ((^[Y0 : $i]: (eps1 @ (^[Y1 : $i]: (((X2 = Y1) & X1) | ((~ X1) & (Y0 = Y1)))))) @ X3))) )),
% 0.16/0.37 inference(argument_congruence,[],[f32])).
% 0.16/0.37 thf(f32,plain,(
% 0.16/0.37 ( ! [X2 : $i,X1 : $o] : (((^[Y0 : $i]: (eps1 @ (^[Y1 : $i]: (((X2 = Y1) & X1) | ((~ X1) & (Y0 = Y1)))))) = (if1 @ X1 @ X2))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f31])).
% 0.16/0.37 thf(f31,plain,(
% 0.16/0.37 ( ! [X2 : $i,X1 : $o] : ((((^[Y0 : $i]: ((^[Y1 : $i]: (eps1 @ (^[Y2 : $i]: (((Y0 = Y2) & X1) | ((~ X1) & (Y1 = Y2)))))))) @ X2) = (if1 @ X1 @ X2))) )),
% 0.16/0.37 inference(argument_congruence,[],[f26])).
% 0.16/0.37 thf(f26,plain,(
% 0.16/0.37 ( ! [X1 : $o] : (((^[Y0 : $i]: ((^[Y1 : $i]: (eps1 @ (^[Y2 : $i]: (((Y0 = Y2) & X1) | ((~ X1) & (Y1 = Y2)))))))) = (if1 @ X1))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f25])).
% 0.16/0.37 thf(f25,plain,(
% 0.16/0.37 ( ! [X1 : $o] : ((((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps1 @ (^[Y3 : $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))) @ X1) = (if1 @ X1))) )),
% 0.16/0.37 inference(argument_congruence,[],[f19])).
% 0.16/0.37 thf(f19,plain,(
% 0.16/0.37 (if1 = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps1 @ (^[Y3 : $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))))),
% 0.16/0.37 inference(cnf_transformation,[],[f13])).
% 0.16/0.37 thf(f13,plain,(
% 0.16/0.37 (if1 = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps1 @ (^[Y3 : $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))))),
% 0.16/0.37 inference(fool_elimination,[],[f12])).
% 0.16/0.37 thf(f12,plain,(
% 0.16/0.37 ((^[X0 : $o, X1 : $i, X2 : $i] : (eps1 @ (^[X3 : $i] : (((X2 = X3) & ~X0) | (X0 & (X1 = X3)))))) = if1)),
% 0.16/0.37 inference(rectify,[],[f2])).
% 0.16/0.37 thf(f2,axiom,(
% 0.16/0.37 ((^[X2 : $o, X1 : $i, X3 : $i] : (eps1 @ (^[X4 : $i] : (((X3 = X4) & ~X2) | (X2 & (X1 = X4)))))) = if1)),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if1d)).
% 0.16/0.37 thf(f22,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (eps1 @ X0)) = $true) | ((X0 @ X1) != $true)) )),
% 0.16/0.37 inference(cnf_transformation,[],[f17])).
% 0.16/0.37 thf(f17,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (((X0 @ (eps1 @ X0)) = $true) | ! [X1] : ((X0 @ X1) != $true))),
% 0.16/0.37 inference(ennf_transformation,[],[f15])).
% 0.16/0.37 thf(f15,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : ((X0 @ X1) = $true) => ((X0 @ (eps1 @ X0)) = $true))),
% 0.16/0.37 inference(fool_elimination,[],[f14])).
% 0.16/0.37 thf(f14,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : (X0 @ X1) => (X0 @ (eps1 @ X0)))),
% 0.16/0.37 inference(rectify,[],[f1])).
% 0.16/0.37 thf(f1,axiom,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : (X0 @ X1) => (X0 @ (eps1 @ X0)))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax1)).
% 0.16/0.37 thf(f165,plain,(
% 0.16/0.37 (sK3 != (if1 @ $true @ sK3 @ sK4)) | spl0_9),
% 0.16/0.37 inference(avatar_component_clause,[],[f163])).
% 0.16/0.37 thf(f169,plain,(
% 0.16/0.37 ~spl0_9 | spl0_10 | spl0_3),
% 0.16/0.37 inference(avatar_split_clause,[],[f161,f125,f167,f163])).
% 0.16/0.37 thf(f125,plain,(
% 0.16/0.37 spl0_3 <=> ((if2 @ $true @ sK3 @ sK4) = (if1 @ $true @ sK3 @ sK4))),
% 0.16/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.16/0.37 thf(f161,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK3 != X0) | (sK3 != (if1 @ $true @ sK3 @ sK4))) ) | spl0_3),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f159])).
% 0.16/0.37 thf(f159,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK3 != (if1 @ $true @ sK3 @ sK4)) | ($false = $true) | (sK3 != X0)) ) | spl0_3),
% 0.16/0.37 inference(superposition,[],[f127,f108])).
% 0.16/0.37 thf(f108,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((if2 @ X1 @ X2 @ X0) = X2) | ($false = X1) | (X2 != X3)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f106])).
% 0.16/0.37 thf(f106,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = X1) | ((X2 = (if2 @ X1 @ X2 @ X0)) = $true) | (X2 != X3)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f105])).
% 0.16/0.37 thf(f105,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((X2 != X3) | ($false = X1) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f104])).
% 0.16/0.37 thf(f104,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = (X2 = X3)) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | ($false = X1)) )),
% 0.16/0.37 inference(duplicate_literal_removal,[],[f103])).
% 0.16/0.37 thf(f103,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = X1) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | ($false = (X2 = X3)) | ($false = X1)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f99])).
% 0.16/0.37 thf(f99,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = X1) | ((X1 & (X2 = X3)) = $false) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f98])).
% 0.16/0.37 thf(f98,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((((X0 = X3) & (~ X1)) | (X1 & (X2 = X3))) != $true) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | ($false = X1)) )),
% 0.16/0.37 inference(not_proxy_clausification,[],[f76])).
% 0.16/0.37 thf(f76,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = (~ X1)) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | ((((X0 = X3) & (~ X1)) | (X1 & (X2 = X3))) != $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f75])).
% 0.16/0.37 thf(f75,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((X0 = (if2 @ X1 @ X2 @ X0)) & (~ X1)) = $true) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | ((((X0 = X3) & (~ X1)) | (X1 & (X2 = X3))) != $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f74])).
% 0.16/0.37 thf(f74,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((((X0 = (if2 @ X1 @ X2 @ X0)) & (~ X1)) | (X1 & (X2 = (if2 @ X1 @ X2 @ X0)))) = $true) | ((((X0 = X3) & (~ X1)) | (X1 & (X2 = X3))) != $true)) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f73])).
% 0.16/0.37 thf(f73,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((^[Y0 : $i]: (((X0 = Y0) & (~ X1)) | (X1 & (X2 = Y0)))) @ X3) != $true) | (((^[Y0 : $i]: (((X0 = Y0) & (~ X1)) | (X1 & (X2 = Y0)))) @ (if2 @ X1 @ X2 @ X0)) = $true)) )),
% 0.16/0.37 inference(superposition,[],[f23,f38])).
% 0.16/0.37 thf(f38,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X1 : $o] : (((eps2 @ (^[Y0 : $i]: (((X3 = Y0) & (~ X1)) | (X1 & (X2 = Y0))))) = (if2 @ X1 @ X2 @ X3))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f37])).
% 0.16/0.37 thf(f37,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X1 : $o] : ((((^[Y0 : $i]: (eps2 @ (^[Y1 : $i]: (((Y0 = Y1) & (~ X1)) | (X1 & (X2 = Y1)))))) @ X3) = (if2 @ X1 @ X2 @ X3))) )),
% 0.16/0.37 inference(argument_congruence,[],[f34])).
% 0.16/0.37 thf(f34,plain,(
% 0.16/0.37 ( ! [X2 : $i,X1 : $o] : (((if2 @ X1 @ X2) = (^[Y0 : $i]: (eps2 @ (^[Y1 : $i]: (((Y0 = Y1) & (~ X1)) | (X1 & (X2 = Y1)))))))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f33])).
% 0.16/0.37 thf(f33,plain,(
% 0.16/0.37 ( ! [X2 : $i,X1 : $o] : ((((^[Y0 : $i]: ((^[Y1 : $i]: (eps2 @ (^[Y2 : $i]: (((Y1 = Y2) & (~ X1)) | (X1 & (Y0 = Y2)))))))) @ X2) = (if2 @ X1 @ X2))) )),
% 0.16/0.37 inference(argument_congruence,[],[f29])).
% 0.16/0.37 thf(f29,plain,(
% 0.16/0.37 ( ! [X1 : $o] : (((^[Y0 : $i]: ((^[Y1 : $i]: (eps2 @ (^[Y2 : $i]: (((Y1 = Y2) & (~ X1)) | (X1 & (Y0 = Y2)))))))) = (if2 @ X1))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f28])).
% 0.16/0.37 thf(f28,plain,(
% 0.16/0.37 ( ! [X1 : $o] : ((((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps2 @ (^[Y3 : $i]: (((Y2 = Y3) & (~ Y0)) | (Y0 & (Y1 = Y3)))))))))) @ X1) = (if2 @ X1))) )),
% 0.16/0.37 inference(argument_congruence,[],[f21])).
% 0.16/0.37 thf(f21,plain,(
% 0.16/0.37 (if2 = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps2 @ (^[Y3 : $i]: (((Y2 = Y3) & (~ Y0)) | (Y0 & (Y1 = Y3)))))))))))),
% 0.16/0.37 inference(cnf_transformation,[],[f11])).
% 0.16/0.37 thf(f11,plain,(
% 0.16/0.37 (if2 = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps2 @ (^[Y3 : $i]: (((Y2 = Y3) & (~ Y0)) | (Y0 & (Y1 = Y3)))))))))))),
% 0.16/0.37 inference(fool_elimination,[],[f10])).
% 0.16/0.37 thf(f10,plain,(
% 0.16/0.37 (if2 = (^[X0 : $o, X1 : $i, X2 : $i] : (eps2 @ (^[X3 : $i] : (((X1 = X3) & X0) | (~X0 & (X2 = X3)))))))),
% 0.16/0.37 inference(rectify,[],[f4])).
% 0.16/0.37 thf(f4,axiom,(
% 0.16/0.37 (if2 = (^[X2 : $o, X1 : $i, X3 : $i] : (eps2 @ (^[X4 : $i] : (((X1 = X4) & X2) | (~X2 & (X3 = X4)))))))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',if2d)).
% 0.16/0.37 thf(f23,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (eps2 @ X0)) = $true) | ((X0 @ X1) != $true)) )),
% 0.16/0.37 inference(cnf_transformation,[],[f18])).
% 0.16/0.37 thf(f18,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (! [X1] : ((X0 @ X1) != $true) | ((X0 @ (eps2 @ X0)) = $true))),
% 0.16/0.37 inference(ennf_transformation,[],[f9])).
% 0.16/0.37 thf(f9,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : ((X0 @ X1) = $true) => ((X0 @ (eps2 @ X0)) = $true))),
% 0.16/0.37 inference(fool_elimination,[],[f8])).
% 0.16/0.37 thf(f8,plain,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : (X0 @ X1) => (X0 @ (eps2 @ X0)))),
% 0.16/0.37 inference(rectify,[],[f3])).
% 0.16/0.37 thf(f3,axiom,(
% 0.16/0.37 ! [X0 : $i > $o] : (? [X1] : (X0 @ X1) => (X0 @ (eps2 @ X0)))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax2)).
% 0.16/0.37 thf(f127,plain,(
% 0.16/0.37 ((if2 @ $true @ sK3 @ sK4) != (if1 @ $true @ sK3 @ sK4)) | spl0_3),
% 0.16/0.37 inference(avatar_component_clause,[],[f125])).
% 0.16/0.37 thf(f128,plain,(
% 0.16/0.37 ~spl0_3 | ~spl0_2),
% 0.16/0.37 inference(avatar_split_clause,[],[f121,f117,f125])).
% 0.16/0.37 thf(f117,plain,(
% 0.16/0.37 spl0_2 <=> (sK2 = $true)),
% 0.16/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.16/0.37 thf(f121,plain,(
% 0.16/0.37 ((if2 @ $true @ sK3 @ sK4) != (if1 @ $true @ sK3 @ sK4)) | ~spl0_2),
% 0.16/0.37 inference(backward_demodulation,[],[f30,f119])).
% 0.16/0.37 thf(f119,plain,(
% 0.16/0.37 (sK2 = $true) | ~spl0_2),
% 0.16/0.37 inference(avatar_component_clause,[],[f117])).
% 0.16/0.37 thf(f30,plain,(
% 0.16/0.37 ((if2 @ sK2 @ sK3 @ sK4) != (if1 @ sK2 @ sK3 @ sK4))),
% 0.16/0.37 inference(negative_extensionality,[],[f27])).
% 0.16/0.37 thf(f27,plain,(
% 0.16/0.37 ((if2 @ sK2 @ sK3) != (if1 @ sK2 @ sK3))),
% 0.16/0.37 inference(negative_extensionality,[],[f24])).
% 0.16/0.37 thf(f24,plain,(
% 0.16/0.37 ((if1 @ sK2) != (if2 @ sK2))),
% 0.16/0.37 inference(negative_extensionality,[],[f20])).
% 0.16/0.37 thf(f20,plain,(
% 0.16/0.37 (if1 != if2)),
% 0.16/0.37 inference(cnf_transformation,[],[f16])).
% 0.16/0.37 thf(f16,plain,(
% 0.16/0.37 (if1 != if2)),
% 0.16/0.37 inference(flattening,[],[f6])).
% 0.16/0.37 thf(f6,negated_conjecture,(
% 0.16/0.37 ~(if1 = if2)),
% 0.16/0.37 inference(negated_conjecture,[],[f5])).
% 0.16/0.37 thf(f5,conjecture,(
% 0.16/0.37 (if1 = if2)),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.16/0.37 thf(f120,plain,(
% 0.16/0.37 spl0_1 | spl0_2),
% 0.16/0.37 inference(avatar_split_clause,[],[f112,f117,f114])).
% 0.16/0.37 thf(f112,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK4 != X0) | (sK2 = $true)) )),
% 0.16/0.37 inference(subsumption_resolution,[],[f111,f72])).
% 0.16/0.37 thf(f72,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((if1 @ X1 @ X0 @ X2) = X2) | ($true = X1) | (X2 != X3)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f71])).
% 0.16/0.37 thf(f71,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = X1) | ((X2 = (if1 @ X1 @ X0 @ X2)) = $true) | (X2 != X3)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f67])).
% 0.16/0.37 thf(f67,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = (X2 = X3)) | ($true = X1) | ((X2 = (if1 @ X1 @ X0 @ X2)) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f66])).
% 0.16/0.37 thf(f66,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true) | ($false = (X2 = X3)) | ($true = X1)) )),
% 0.16/0.37 inference(duplicate_literal_removal,[],[f58])).
% 0.16/0.37 thf(f58,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true) | ($true = X1) | ($false = (X2 = X3)) | ($true = X1)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f57])).
% 0.16/0.37 thf(f57,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) = $true) | (((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true) | ($true = X1) | ($false = (X2 = X3))) )),
% 0.16/0.37 inference(not_proxy_clausification,[],[f56])).
% 0.16/0.37 thf(f56,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($false = (~ X1)) | ($false = (X2 = X3)) | (((X0 = (if1 @ X1 @ X0 @ X2)) & X1) = $true) | (((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f55])).
% 0.16/0.37 thf(f55,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) | ((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2)))) = $true) | ($false = (~ X1)) | ($false = (X2 = X3))) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f41])).
% 0.16/0.37 thf(f41,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((~ X1) & (X2 = X3)) = $false) | ((((X0 = (if1 @ X1 @ X0 @ X2)) & X1) | ((~ X1) & (X2 = (if1 @ X1 @ X0 @ X2)))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f40])).
% 0.16/0.37 thf(f111,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((sK4 != (if1 @ sK2 @ sK3 @ sK4)) | (sK4 != X0) | (sK2 = $true)) )),
% 0.16/0.37 inference(superposition,[],[f30,f86])).
% 0.16/0.37 thf(f86,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((if2 @ X1 @ X2 @ X0) = X0) | ($true = X1) | (X0 != X3)) )),
% 0.16/0.37 inference(duplicate_literal_removal,[],[f85])).
% 0.16/0.37 thf(f85,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = X1) | (X0 != X3) | ($true = X1) | ((if2 @ X1 @ X2 @ X0) = X0)) )),
% 0.16/0.37 inference(not_proxy_clausification,[],[f84])).
% 0.16/0.37 thf(f84,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = X1) | ((if2 @ X1 @ X2 @ X0) = X0) | ($false = (~ X1)) | (X0 != X3)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f83])).
% 0.16/0.37 thf(f83,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((if2 @ X1 @ X2 @ X0) = X0) | ($true = X1) | ((X0 = X3) = $false) | ($false = (~ X1))) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f82])).
% 0.16/0.37 thf(f82,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : ((((X0 = X3) & (~ X1)) = $false) | ((if2 @ X1 @ X2 @ X0) = X0) | ($true = X1)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f81])).
% 0.16/0.37 thf(f81,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = X1) | ((X0 = (if2 @ X1 @ X2 @ X0)) = $true) | (((X0 = X3) & (~ X1)) = $false)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f79])).
% 0.16/0.37 thf(f79,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true) | (((X0 = X3) & (~ X1)) = $false) | ((X0 = (if2 @ X1 @ X2 @ X0)) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f77])).
% 0.16/0.37 thf(f77,plain,(
% 0.16/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((((X0 = X3) & (~ X1)) | (X1 & (X2 = X3))) != $true) | ((X0 = (if2 @ X1 @ X2 @ X0)) = $true) | ((X1 & (X2 = (if2 @ X1 @ X2 @ X0))) = $true)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f75])).
% 0.16/0.37 % SZS output end Proof for theBenchmark
% 0.16/0.37 % (19995)------------------------------
% 0.16/0.37 % (19995)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (19995)Termination reason: Refutation
% 0.16/0.37
% 0.16/0.37 % (19995)Memory used [KB]: 5628
% 0.16/0.37 % (19995)Time elapsed: 0.009 s
% 0.16/0.37 % (19995)Instructions burned: 15 (million)
% 0.16/0.37 % (19995)------------------------------
% 0.16/0.37 % (19995)------------------------------
% 0.16/0.37 % (19973)Success in time 0.047 s
% 0.16/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------