TSTP Solution File: SEV158^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV158^5 : TPTP v8.2.0. Released v4.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 : n020.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:12:12 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV158^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % 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.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 19:20:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.34 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.13/0.36 % (29888)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.13/0.36 % (29890)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.13/0.36 % (29887)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.13/0.36 % (29891)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.13/0.36 % (29892)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.36 % (29890)Instruction limit reached!
% 0.13/0.36 % (29890)------------------------------
% 0.13/0.36 % (29890)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (29890)Termination reason: Unknown
% 0.13/0.36 % (29890)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (29890)Memory used [KB]: 895
% 0.13/0.36 % (29890)Time elapsed: 0.003 s
% 0.13/0.36 % (29890)Instructions burned: 2 (million)
% 0.13/0.36 % (29890)------------------------------
% 0.13/0.36 % (29890)------------------------------
% 0.13/0.37 % (29893)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.13/0.37 % (29887)Instruction limit reached!
% 0.13/0.37 % (29887)------------------------------
% 0.13/0.37 % (29887)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29887)Termination reason: Unknown
% 0.13/0.37 % (29887)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (29887)Memory used [KB]: 5500
% 0.13/0.37 % (29887)Time elapsed: 0.005 s
% 0.13/0.37 % (29887)Instructions burned: 4 (million)
% 0.13/0.37 % (29887)------------------------------
% 0.13/0.37 % (29887)------------------------------
% 0.13/0.37 % (29889)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (29888)Refutation not found, incomplete strategy
% 0.13/0.37 % (29888)------------------------------
% 0.13/0.37 % (29888)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29888)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (29888)Memory used [KB]: 5500
% 0.13/0.37 % (29888)Time elapsed: 0.006 s
% 0.13/0.37 % (29888)Instructions burned: 6 (million)
% 0.13/0.37 % (29888)------------------------------
% 0.13/0.37 % (29888)------------------------------
% 0.13/0.37 % (29893)Instruction limit reached!
% 0.13/0.37 % (29893)------------------------------
% 0.13/0.37 % (29893)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29893)Termination reason: Unknown
% 0.13/0.37 % (29893)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (29893)Memory used [KB]: 5500
% 0.13/0.37 % (29893)Time elapsed: 0.004 s
% 0.13/0.37 % (29893)Instructions burned: 3 (million)
% 0.13/0.37 % (29893)------------------------------
% 0.13/0.37 % (29893)------------------------------
% 0.13/0.37 % (29889)Instruction limit reached!
% 0.13/0.37 % (29889)------------------------------
% 0.13/0.37 % (29889)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29889)Termination reason: Unknown
% 0.13/0.37 % (29889)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (29889)Memory used [KB]: 5500
% 0.13/0.37 % (29889)Time elapsed: 0.004 s
% 0.13/0.37 % (29889)Instructions burned: 2 (million)
% 0.13/0.37 % (29889)------------------------------
% 0.13/0.37 % (29889)------------------------------
% 0.13/0.37 % (29892)Instruction limit reached!
% 0.13/0.37 % (29892)------------------------------
% 0.13/0.37 % (29892)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (29892)Termination reason: Unknown
% 0.13/0.37 % (29892)Termination phase: Saturation
% 0.13/0.37 % (29886)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.13/0.37
% 0.13/0.37 % (29892)Memory used [KB]: 5628
% 0.13/0.37 % (29892)Time elapsed: 0.013 s
% 0.13/0.37 % (29892)Instructions burned: 18 (million)
% 0.13/0.37 % (29892)------------------------------
% 0.13/0.37 % (29892)------------------------------
% 0.13/0.38 % (29894)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.13/0.38 % (29895)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.13/0.38 % (29891)Refutation not found, incomplete strategy
% 0.13/0.38 % (29891)------------------------------
% 0.13/0.38 % (29891)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (29891)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (29891)Memory used [KB]: 5628
% 0.13/0.38 % (29891)Time elapsed: 0.019 s
% 0.13/0.38 % (29891)Instructions burned: 28 (million)
% 0.13/0.38 % (29891)------------------------------
% 0.13/0.38 % (29891)------------------------------
% 0.13/0.38 % (29897)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.13/0.38 % (29896)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.13/0.38 % (29898)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.13/0.38 % (29896)Instruction limit reached!
% 0.13/0.38 % (29896)------------------------------
% 0.13/0.38 % (29896)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (29896)Termination reason: Unknown
% 0.13/0.38 % (29896)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (29896)Memory used [KB]: 5500
% 0.13/0.38 % (29896)Time elapsed: 0.004 s
% 0.13/0.38 % (29896)Instructions burned: 3 (million)
% 0.13/0.38 % (29896)------------------------------
% 0.13/0.38 % (29896)------------------------------
% 0.13/0.39 % (29895)First to succeed.
% 0.13/0.39 % (29898)Instruction limit reached!
% 0.13/0.39 % (29898)------------------------------
% 0.13/0.39 % (29898)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (29898)Termination reason: Unknown
% 0.13/0.39 % (29898)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (29898)Memory used [KB]: 1023
% 0.13/0.39 % (29898)Time elapsed: 0.007 s
% 0.13/0.39 % (29898)Instructions burned: 8 (million)
% 0.13/0.39 % (29898)------------------------------
% 0.13/0.39 % (29898)------------------------------
% 0.13/0.39 % (29899)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.13/0.39 % (29895)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% 0.13/0.39 thf(func_def_3, type, sP0: (($i > $o) > ($i > $o) > $o) > $o).
% 0.13/0.39 thf(func_def_4, type, sP1: (($i > $o) > ($i > $o) > $o) > $o).
% 0.13/0.39 thf(func_def_5, type, sK2: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_6, type, sK3: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_7, type, sK4: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_8, type, sK5: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_9, type, sK6: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_10, type, sK7: (($i > $o) > ($i > $o) > $o) > $i).
% 0.13/0.39 thf(func_def_11, type, sK8: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.13/0.39 thf(func_def_13, type, ph10: !>[X0: $tType]:(X0)).
% 0.13/0.39 thf(f206,plain,(
% 0.13/0.39 $false),
% 0.13/0.39 inference(avatar_sat_refutation,[],[f56,f132,f137,f142,f143,f165,f174,f180,f182,f200,f201,f203])).
% 0.13/0.39 thf(f203,plain,(
% 0.13/0.39 ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ($false != (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($false = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(theory_tautology_sat_conflict,[])).
% 0.13/0.39 thf(f201,plain,(
% 0.13/0.39 ($false != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($false != (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true != (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(theory_tautology_sat_conflict,[])).
% 0.13/0.39 thf(f200,plain,(
% 0.13/0.39 ~spl9_16 | ~spl9_19),
% 0.13/0.39 inference(avatar_contradiction_clause,[],[f199])).
% 0.13/0.39 thf(f199,plain,(
% 0.13/0.39 $false | (~spl9_16 | ~spl9_19)),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f198])).
% 0.13/0.39 thf(f198,plain,(
% 0.13/0.39 ($false = $true) | (~spl9_16 | ~spl9_19)),
% 0.13/0.39 inference(forward_demodulation,[],[f160,f173])).
% 0.13/0.39 thf(f173,plain,(
% 0.13/0.39 ($false = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_19),
% 0.13/0.39 inference(avatar_component_clause,[],[f171])).
% 0.13/0.39 thf(f171,plain,(
% 0.13/0.39 spl9_19 <=> ($false = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_19])])).
% 0.13/0.39 thf(f160,plain,(
% 0.13/0.39 ($true = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_16),
% 0.13/0.39 inference(avatar_component_clause,[],[f158])).
% 0.13/0.39 thf(f158,plain,(
% 0.13/0.39 spl9_16 <=> ($true = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_16])])).
% 0.13/0.39 thf(f182,plain,(
% 0.13/0.39 ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ($false != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($false = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(theory_tautology_sat_conflict,[])).
% 0.13/0.39 thf(f180,plain,(
% 0.13/0.39 spl9_20 | ~spl9_1),
% 0.13/0.39 inference(avatar_split_clause,[],[f150,f49,f176])).
% 0.13/0.39 thf(f176,plain,(
% 0.13/0.39 spl9_20 <=> ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_20])])).
% 0.13/0.39 thf(f49,plain,(
% 0.13/0.39 spl9_1 <=> ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true)),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_1])])).
% 0.13/0.39 thf(f150,plain,(
% 0.13/0.39 ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ~spl9_1),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f149])).
% 0.13/0.39 thf(f149,plain,(
% 0.13/0.39 (((sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) = $true) | ~spl9_1),
% 0.13/0.39 inference(beta_eta_normalization,[],[f148])).
% 0.13/0.39 thf(f148,plain,(
% 0.13/0.39 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_1),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f147])).
% 0.13/0.39 thf(f147,plain,(
% 0.13/0.39 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true != $true) | ~spl9_1),
% 0.13/0.39 inference(superposition,[],[f28,f51])).
% 0.13/0.39 thf(f51,plain,(
% 0.13/0.39 ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true) | ~spl9_1),
% 0.13/0.39 inference(avatar_component_clause,[],[f49])).
% 0.13/0.39 thf(f28,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (sK5 @ X0) @ (sK6 @ X0))) | ($true != (sP0 @ X0))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f19])).
% 0.13/0.39 thf(f19,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : ((($true = (X0 @ (sK5 @ X0) @ (sK6 @ X0))) & ((sK6 @ X0 @ (sK7 @ X0)) != (sK5 @ X0 @ (sK7 @ X0))) & ($true = (X0 @ (sK6 @ X0) @ (sK5 @ X0)))) | ($true != (sP0 @ X0)))),
% 0.13/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f16,f18,f17])).
% 0.13/0.39 thf(f17,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) = $true) & ? [X3] : ((X1 @ X3) != (X2 @ X3)) & ($true = (X0 @ X2 @ X1))) => (($true = (X0 @ (sK5 @ X0) @ (sK6 @ X0))) & ? [X3] : ((sK5 @ X0 @ X3) != (sK6 @ X0 @ X3)) & ($true = (X0 @ (sK6 @ X0) @ (sK5 @ X0)))))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f18,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X3] : ((sK5 @ X0 @ X3) != (sK6 @ X0 @ X3)) => ((sK6 @ X0 @ (sK7 @ X0)) != (sK5 @ X0 @ (sK7 @ X0))))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f16,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) = $true) & ? [X3] : ((X1 @ X3) != (X2 @ X3)) & ($true = (X0 @ X2 @ X1))) | ($true != (sP0 @ X0)))),
% 0.13/0.39 inference(rectify,[],[f15])).
% 0.13/0.39 thf(f15,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X2 : $i > $o,X1 : $i > $o] : (($true = (X0 @ X2 @ X1)) & ? [X3] : ((X1 @ X3) != (X2 @ X3)) & ((X0 @ X1 @ X2) = $true)) | ($true != (sP0 @ X0)))),
% 0.13/0.39 inference(nnf_transformation,[],[f8])).
% 0.13/0.39 thf(f8,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X2 : $i > $o,X1 : $i > $o] : (($true = (X0 @ X2 @ X1)) & ? [X3] : ((X1 @ X3) != (X2 @ X3)) & ((X0 @ X1 @ X2) = $true)) | ~($true = (sP0 @ X0)))),
% 0.13/0.39 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.13/0.39 thf(f174,plain,(
% 0.13/0.39 spl9_18 | spl9_19 | ~spl9_1),
% 0.13/0.39 inference(avatar_split_clause,[],[f156,f49,f171,f167])).
% 0.13/0.39 thf(f167,plain,(
% 0.13/0.39 spl9_18 <=> ($false = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_18])])).
% 0.13/0.39 thf(f156,plain,(
% 0.13/0.39 ($false = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($false = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_1),
% 0.13/0.39 inference(binary_proxy_clausification,[],[f154])).
% 0.13/0.39 thf(f154,plain,(
% 0.13/0.39 ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_1),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f146])).
% 0.13/0.39 thf(f146,plain,(
% 0.13/0.39 ($true != $true) | ((sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) != (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_1),
% 0.13/0.39 inference(superposition,[],[f27,f51])).
% 0.13/0.39 thf(f27,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true != (sP0 @ X0)) | ((sK6 @ X0 @ (sK7 @ X0)) != (sK5 @ X0 @ (sK7 @ X0)))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f19])).
% 0.13/0.39 thf(f165,plain,(
% 0.13/0.39 spl9_16 | spl9_17 | ~spl9_1),
% 0.13/0.39 inference(avatar_split_clause,[],[f155,f49,f162,f158])).
% 0.13/0.39 thf(f162,plain,(
% 0.13/0.39 spl9_17 <=> ($true = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_17])])).
% 0.13/0.39 thf(f155,plain,(
% 0.13/0.39 ($true = (sK6 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true = (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK7 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_1),
% 0.13/0.39 inference(binary_proxy_clausification,[],[f154])).
% 0.13/0.39 thf(f143,plain,(
% 0.13/0.39 ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) != (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ((sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) != (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(theory_tautology_sat_conflict,[])).
% 0.13/0.39 thf(f142,plain,(
% 0.13/0.39 spl9_15 | ~spl9_2),
% 0.13/0.39 inference(avatar_split_clause,[],[f121,f53,f139])).
% 0.13/0.39 thf(f139,plain,(
% 0.13/0.39 spl9_15 <=> ((sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_15])])).
% 0.13/0.39 thf(f53,plain,(
% 0.13/0.39 spl9_2 <=> ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_2])])).
% 0.13/0.39 thf(f121,plain,(
% 0.13/0.39 ((sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ~spl9_2),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f120])).
% 0.13/0.39 thf(f120,plain,(
% 0.13/0.39 ($true = ((sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(beta_eta_normalization,[],[f119])).
% 0.13/0.39 thf(f119,plain,(
% 0.13/0.39 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f118])).
% 0.13/0.39 thf(f118,plain,(
% 0.13/0.39 ($true != $true) | ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(superposition,[],[f25,f55])).
% 0.13/0.39 thf(f55,plain,(
% 0.13/0.39 ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ~spl9_2),
% 0.13/0.39 inference(avatar_component_clause,[],[f53])).
% 0.13/0.39 thf(f25,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (sK3 @ X0) @ (sK2 @ X0))) | ($true != (sP1 @ X0))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f14])).
% 0.13/0.39 thf(f14,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : ((($true = (X0 @ (sK3 @ X0) @ (sK2 @ X0))) & ($true != (X0 @ (sK4 @ X0) @ (sK2 @ X0))) & ($true = (X0 @ (sK4 @ X0) @ (sK3 @ X0)))) | ($true != (sP1 @ X0)))),
% 0.13/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f12,f13])).
% 0.13/0.39 thf(f13,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (($true = (X0 @ X2 @ X1)) & ($true != (X0 @ X3 @ X1)) & ((X0 @ X3 @ X2) = $true)) => (($true = (X0 @ (sK3 @ X0) @ (sK2 @ X0))) & ($true != (X0 @ (sK4 @ X0) @ (sK2 @ X0))) & ($true = (X0 @ (sK4 @ X0) @ (sK3 @ X0)))))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f12,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (($true = (X0 @ X2 @ X1)) & ($true != (X0 @ X3 @ X1)) & ((X0 @ X3 @ X2) = $true)) | ($true != (sP1 @ X0)))),
% 0.13/0.39 inference(rectify,[],[f11])).
% 0.13/0.39 thf(f11,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X4 : $i > $o,X6 : $i > $o,X5 : $i > $o] : (($true = (X0 @ X6 @ X4)) & ((X0 @ X5 @ X4) != $true) & ($true = (X0 @ X5 @ X6))) | ($true != (sP1 @ X0)))),
% 0.13/0.39 inference(nnf_transformation,[],[f9])).
% 0.13/0.39 thf(f9,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X4 : $i > $o,X6 : $i > $o,X5 : $i > $o] : (($true = (X0 @ X6 @ X4)) & ((X0 @ X5 @ X4) != $true) & ($true = (X0 @ X5 @ X6))) | ~($true = (sP1 @ X0)))),
% 0.13/0.39 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.13/0.39 thf(f137,plain,(
% 0.13/0.39 ~spl9_14 | ~spl9_2),
% 0.13/0.39 inference(avatar_split_clause,[],[f124,f53,f134])).
% 0.13/0.39 thf(f134,plain,(
% 0.13/0.39 spl9_14 <=> ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_14])])).
% 0.13/0.39 thf(f124,plain,(
% 0.13/0.39 ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) != (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ~spl9_2),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f123])).
% 0.13/0.39 thf(f123,plain,(
% 0.13/0.39 ($true != ((sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(beta_eta_normalization,[],[f122])).
% 0.13/0.39 thf(f122,plain,(
% 0.13/0.39 ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f117])).
% 0.13/0.39 thf(f117,plain,(
% 0.13/0.39 ($true != $true) | ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(superposition,[],[f24,f55])).
% 0.13/0.39 thf(f24,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true != (X0 @ (sK4 @ X0) @ (sK2 @ X0))) | ($true != (sP1 @ X0))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f14])).
% 0.13/0.39 thf(f132,plain,(
% 0.13/0.39 spl9_13 | ~spl9_2),
% 0.13/0.39 inference(avatar_split_clause,[],[f127,f53,f129])).
% 0.13/0.39 thf(f129,plain,(
% 0.13/0.39 spl9_13 <=> ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 introduced(avatar_definition,[new_symbols(naming,[spl9_13])])).
% 0.13/0.39 thf(f127,plain,(
% 0.13/0.39 ((sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))))) | ~spl9_2),
% 0.13/0.39 inference(equality_proxy_clausification,[],[f126])).
% 0.13/0.39 thf(f126,plain,(
% 0.13/0.39 ($true = ((sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(beta_eta_normalization,[],[f125])).
% 0.13/0.39 thf(f125,plain,(
% 0.13/0.39 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ~spl9_2),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f116])).
% 0.13/0.39 thf(f116,plain,(
% 0.13/0.39 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true != $true) | ~spl9_2),
% 0.13/0.39 inference(superposition,[],[f23,f55])).
% 0.13/0.39 thf(f23,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (sK4 @ X0) @ (sK3 @ X0))) | ($true != (sP1 @ X0))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f14])).
% 0.13/0.39 thf(f56,plain,(
% 0.13/0.39 spl9_1 | spl9_2),
% 0.13/0.39 inference(avatar_split_clause,[],[f40,f53,f49])).
% 0.13/0.39 thf(f40,plain,(
% 0.13/0.39 ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true) | ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f39])).
% 0.13/0.39 thf(f39,plain,(
% 0.13/0.39 ($true != $true) | ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true) | ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 inference(boolean_simplification,[],[f38])).
% 0.13/0.39 thf(f38,plain,(
% 0.13/0.39 ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true) | ($true != ((sK8 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = (sK8 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 inference(beta_eta_normalization,[],[f31])).
% 0.13/0.39 thf(f31,plain,(
% 0.13/0.39 ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0)))) @ (sK8 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) @ (sK8 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))) | ((sP0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))) = $true) | ($true = (sP1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (Y1 = Y0))))))),
% 0.13/0.39 inference(primitive_instantiation,[],[f29])).
% 0.13/0.39 thf(f29,plain,(
% 0.13/0.39 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true != (X0 @ (sK8 @ X0) @ (sK8 @ X0))) | ($true = (sP1 @ X0)) | ($true = (sP0 @ X0))) )),
% 0.13/0.39 inference(cnf_transformation,[],[f22])).
% 0.13/0.39 thf(f22,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (sP1 @ X0)) | ($true = (sP0 @ X0)) | ($true != (X0 @ (sK8 @ X0) @ (sK8 @ X0))))),
% 0.13/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f20,f21])).
% 0.13/0.39 thf(f21,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o] : ((X0 @ X1 @ X1) != $true) => ($true != (X0 @ (sK8 @ X0) @ (sK8 @ X0))))),
% 0.13/0.39 introduced(choice_axiom,[])).
% 0.13/0.39 thf(f20,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (sP1 @ X0)) | ($true = (sP0 @ X0)) | ? [X1 : $i > $o] : ((X0 @ X1 @ X1) != $true))),
% 0.13/0.39 inference(rectify,[],[f10])).
% 0.13/0.39 thf(f10,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (sP1 @ X0)) | ($true = (sP0 @ X0)) | ? [X7 : $i > $o] : ((X0 @ X7 @ X7) != $true))),
% 0.13/0.39 inference(definition_folding,[],[f7,f9,f8])).
% 0.13/0.39 thf(f7,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X4 : $i > $o,X6 : $i > $o,X5 : $i > $o] : (($true = (X0 @ X6 @ X4)) & ((X0 @ X5 @ X4) != $true) & ($true = (X0 @ X5 @ X6))) | ? [X2 : $i > $o,X1 : $i > $o] : (($true = (X0 @ X2 @ X1)) & ? [X3] : ((X1 @ X3) != (X2 @ X3)) & ((X0 @ X1 @ X2) = $true)) | ? [X7 : $i > $o] : ((X0 @ X7 @ X7) != $true))),
% 0.13/0.39 inference(flattening,[],[f6])).
% 0.13/0.39 thf(f6,plain,(
% 0.13/0.39 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X7 : $i > $o] : ((X0 @ X7 @ X7) != $true) | ? [X4 : $i > $o,X6 : $i > $o,X5 : $i > $o] : (((X0 @ X5 @ X4) != $true) & (($true = (X0 @ X5 @ X6)) & ($true = (X0 @ X6 @ X4)))) | ? [X1 : $i > $o,X2 : $i > $o] : (? [X3] : ((X1 @ X3) != (X2 @ X3)) & (($true = (X0 @ X2 @ X1)) & ((X0 @ X1 @ X2) = $true))))),
% 0.13/0.39 inference(ennf_transformation,[],[f5])).
% 0.13/0.39 thf(f5,plain,(
% 0.13/0.39 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (! [X7 : $i > $o] : ((X0 @ X7 @ X7) = $true) & ! [X4 : $i > $o,X6 : $i > $o,X5 : $i > $o] : ((($true = (X0 @ X5 @ X6)) & ($true = (X0 @ X6 @ X4))) => ((X0 @ X5 @ X4) = $true)) & ! [X1 : $i > $o,X2 : $i > $o] : ((($true = (X0 @ X2 @ X1)) & ((X0 @ X1 @ X2) = $true)) => ! [X3] : ((X1 @ X3) = (X2 @ X3))))),
% 0.13/0.39 inference(fool_elimination,[],[f4])).
% 0.13/0.39 thf(f4,plain,(
% 0.13/0.39 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (! [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X2 @ X1) & (X0 @ X1 @ X2)) => ! [X3] : ((X1 @ X3) = (X2 @ X3))) & ! [X4 : $i > $o,X5 : $i > $o,X6 : $i > $o] : (((X0 @ X5 @ X6) & (X0 @ X6 @ X4)) => (X0 @ X5 @ X4)) & ! [X7 : $i > $o] : (X0 @ X7 @ X7))),
% 0.13/0.39 inference(rectify,[],[f2])).
% 0.13/0.39 thf(f2,negated_conjecture,(
% 0.13/0.39 ~? [X0 : ($i > $o) > ($i > $o) > $o] : (! [X4 : $i > $o,X5 : $i > $o] : (((X0 @ X5 @ X4) & (X0 @ X4 @ X5)) => ! [X1] : ((X4 @ X1) = (X5 @ X1))) & ! [X3 : $i > $o,X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)) & ! [X1 : $i > $o] : (X0 @ X1 @ X1))),
% 0.13/0.39 inference(negated_conjecture,[],[f1])).
% 0.13/0.39 thf(f1,conjecture,(
% 0.13/0.39 ? [X0 : ($i > $o) > ($i > $o) > $o] : (! [X4 : $i > $o,X5 : $i > $o] : (((X0 @ X5 @ X4) & (X0 @ X4 @ X5)) => ! [X1] : ((X4 @ X1) = (X5 @ X1))) & ! [X3 : $i > $o,X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X3)) => (X0 @ X1 @ X3)) & ! [X1 : $i > $o] : (X0 @ X1 @ X1))),
% 0.13/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120I_1_pme)).
% 0.13/0.39 % SZS output end Proof for theBenchmark
% 0.13/0.39 % (29895)------------------------------
% 0.13/0.39 % (29895)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (29895)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (29895)Memory used [KB]: 5756
% 0.13/0.39 % (29895)Time elapsed: 0.011 s
% 0.13/0.39 % (29895)Instructions burned: 10 (million)
% 0.13/0.39 % (29895)------------------------------
% 0.13/0.39 % (29895)------------------------------
% 0.13/0.39 % (29885)Success in time 0.024 s
% 0.13/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------