TSTP Solution File: SYO264^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO264^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:03:42 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO264^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:44:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.22/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.38 % (32472)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.22/0.38 % (32474)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.22/0.38 % (32473)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.22/0.38 % (32475)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.38 % (32476)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.22/0.38 % (32478)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.22/0.38 % (32477)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.22/0.38 % (32479)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.22/0.38 % (32476)Instruction limit reached!
% 0.22/0.38 % (32476)------------------------------
% 0.22/0.38 % (32476)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (32476)Termination reason: Unknown
% 0.22/0.38 % (32476)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (32476)Memory used [KB]: 895
% 0.22/0.38 % (32476)Time elapsed: 0.003 s
% 0.22/0.38 % (32476)Instructions burned: 2 (million)
% 0.22/0.38 % (32476)------------------------------
% 0.22/0.38 % (32476)------------------------------
% 0.22/0.38 % (32475)Instruction limit reached!
% 0.22/0.38 % (32475)------------------------------
% 0.22/0.38 % (32475)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (32475)Termination reason: Unknown
% 0.22/0.38 % (32475)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (32475)Memory used [KB]: 5500
% 0.22/0.38 % (32475)Time elapsed: 0.004 s
% 0.22/0.38 % (32475)Instructions burned: 2 (million)
% 0.22/0.38 % (32475)------------------------------
% 0.22/0.38 % (32475)------------------------------
% 0.22/0.38 % (32479)Instruction limit reached!
% 0.22/0.38 % (32479)------------------------------
% 0.22/0.38 % (32479)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (32479)Termination reason: Unknown
% 0.22/0.38 % (32479)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (32479)Memory used [KB]: 5500
% 0.22/0.38 % (32479)Time elapsed: 0.005 s
% 0.22/0.38 % (32479)Instructions burned: 4 (million)
% 0.22/0.38 % (32479)------------------------------
% 0.22/0.38 % (32479)------------------------------
% 0.22/0.38 % (32474)Refutation not found, incomplete strategy
% 0.22/0.38 % (32474)------------------------------
% 0.22/0.38 % (32474)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (32474)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.38
% 0.22/0.38
% 0.22/0.38 % (32474)Memory used [KB]: 5500
% 0.22/0.38 % (32474)Time elapsed: 0.005 s
% 0.22/0.38 % (32474)Instructions burned: 4 (million)
% 0.22/0.38 % (32474)------------------------------
% 0.22/0.38 % (32474)------------------------------
% 0.22/0.38 % (32473)Instruction limit reached!
% 0.22/0.38 % (32473)------------------------------
% 0.22/0.38 % (32473)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (32473)Termination reason: Unknown
% 0.22/0.38 % (32473)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (32473)Memory used [KB]: 5500
% 0.22/0.38 % (32473)Time elapsed: 0.006 s
% 0.22/0.38 % (32473)Instructions burned: 4 (million)
% 0.22/0.38 % (32473)------------------------------
% 0.22/0.38 % (32473)------------------------------
% 0.22/0.39 % (32478)Instruction limit reached!
% 0.22/0.39 % (32478)------------------------------
% 0.22/0.39 % (32478)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (32478)Termination reason: Unknown
% 0.22/0.39 % (32478)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (32478)Memory used [KB]: 5628
% 0.22/0.39 % (32478)Time elapsed: 0.015 s
% 0.22/0.39 % (32478)Instructions burned: 19 (million)
% 0.22/0.39 % (32478)------------------------------
% 0.22/0.39 % (32478)------------------------------
% 0.22/0.40 % (32480)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.40 % (32481)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.22/0.40 % (32477)First to succeed.
% 0.22/0.40 % (32482)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.40 % (32483)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.22/0.40 % (32484)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.40 % (32482)Instruction limit reached!
% 0.22/0.40 % (32482)------------------------------
% 0.22/0.40 % (32482)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (32482)Termination reason: Unknown
% 0.22/0.40 % (32482)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (32482)Memory used [KB]: 5500
% 0.22/0.40 % (32482)Time elapsed: 0.004 s
% 0.22/0.40 % (32482)Instructions burned: 3 (million)
% 0.22/0.40 % (32482)------------------------------
% 0.22/0.40 % (32482)------------------------------
% 0.22/0.40 % (32477)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% 0.22/0.40 thf(func_def_3, type, sP0: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_4, type, sK1: $i > $o).
% 0.22/0.40 thf(func_def_8, type, sK5: ($i > $o) > $i).
% 0.22/0.40 thf(func_def_11, type, ph7: !>[X0: $tType]:(X0)).
% 0.22/0.40 thf(f323,plain,(
% 0.22/0.40 $false),
% 0.22/0.40 inference(avatar_sat_refutation,[],[f51,f52,f66,f83,f201,f214,f311,f322])).
% 0.22/0.40 thf(f322,plain,(
% 0.22/0.40 ~spl6_21 | ~spl6_22),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f321])).
% 0.22/0.40 thf(f321,plain,(
% 0.22/0.40 $false | (~spl6_21 | ~spl6_22)),
% 0.22/0.40 inference(subsumption_resolution,[],[f316,f209])).
% 0.22/0.40 thf(f209,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ~spl6_21),
% 0.22/0.40 inference(avatar_component_clause,[],[f207])).
% 0.22/0.40 thf(f207,plain,(
% 0.22/0.40 spl6_21 <=> ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_21])])).
% 0.22/0.40 thf(f316,plain,(
% 0.22/0.40 ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_21 | ~spl6_22)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f312])).
% 0.22/0.40 thf(f312,plain,(
% 0.22/0.40 ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true = $false) | (~spl6_21 | ~spl6_22)),
% 0.22/0.40 inference(superposition,[],[f209,f253])).
% 0.22/0.40 thf(f253,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (((X3 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) = $false) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true)) ) | ~spl6_22),
% 0.22/0.40 inference(not_proxy_clausification,[],[f252])).
% 0.22/0.40 thf(f252,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (((~ (X3 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0)))))) = $true) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true)) ) | ~spl6_22),
% 0.22/0.40 inference(beta_eta_normalization,[],[f248])).
% 0.22/0.40 thf(f248,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : ((((^[Y0 : $i]: (~ (X3 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) = $true) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true)) ) | ~spl6_22),
% 0.22/0.40 inference(primitive_instantiation,[],[f213])).
% 0.22/0.40 thf(f213,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((X0 @ (sK5 @ X0)) = $true) | ((sK1 @ (sK5 @ X0)) != $true)) ) | ~spl6_22),
% 0.22/0.40 inference(avatar_component_clause,[],[f212])).
% 0.22/0.40 thf(f212,plain,(
% 0.22/0.40 spl6_22 <=> ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) != $true) | ((X0 @ (sK5 @ X0)) = $true))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_22])])).
% 0.22/0.40 thf(f311,plain,(
% 0.22/0.40 spl6_21 | ~spl6_9 | ~spl6_22),
% 0.22/0.40 inference(avatar_split_clause,[],[f289,f212,f77,f207])).
% 0.22/0.40 thf(f77,plain,(
% 0.22/0.40 spl6_9 <=> ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) = $true) | ((X0 @ (sK5 @ X0)) != $true))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_9])])).
% 0.22/0.40 thf(f289,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_22)),
% 0.22/0.40 inference(not_proxy_clausification,[],[f288])).
% 0.22/0.40 thf(f288,plain,(
% 0.22/0.40 ($true != (~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))) | (~spl6_9 | ~spl6_22)),
% 0.22/0.40 inference(beta_eta_normalization,[],[f287])).
% 0.22/0.40 thf(f287,plain,(
% 0.22/0.40 ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_22)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f281])).
% 0.22/0.40 thf(f281,plain,(
% 0.22/0.40 ($true = $false) | ($true != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_22)),
% 0.22/0.40 inference(superposition,[],[f253,f78])).
% 0.22/0.40 thf(f78,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) = $true) | ((X0 @ (sK5 @ X0)) != $true)) ) | ~spl6_9),
% 0.22/0.40 inference(avatar_component_clause,[],[f77])).
% 0.22/0.40 thf(f214,plain,(
% 0.22/0.40 ~spl6_10 | spl6_22 | ~spl6_7),
% 0.22/0.40 inference(avatar_split_clause,[],[f87,f49,f212,f80])).
% 0.22/0.40 thf(f80,plain,(
% 0.22/0.40 spl6_10 <=> ((sK1 @ sK3) = $true)),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_10])])).
% 0.22/0.40 thf(f49,plain,(
% 0.22/0.40 spl6_7 <=> ! [X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK3)) | ($true != (sK1 @ (sK5 @ X5))) | ((X5 @ (sK5 @ X5)) = $true))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_7])])).
% 0.22/0.40 thf(f87,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) != $true) | ((sK1 @ sK3) != $true) | ((X0 @ (sK5 @ X0)) = $true)) ) | ~spl6_7),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f85])).
% 0.22/0.40 thf(f85,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((sK1 @ sK3) != $true) | ($true != $true) | ((sK1 @ (sK5 @ X0)) != $true) | ((X0 @ (sK5 @ X0)) = $true)) ) | ~spl6_7),
% 0.22/0.40 inference(superposition,[],[f18,f50])).
% 0.22/0.40 thf(f50,plain,(
% 0.22/0.40 ( ! [X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK3)) | ((X5 @ (sK5 @ X5)) = $true) | ($true != (sK1 @ (sK5 @ X5)))) ) | ~spl6_7),
% 0.22/0.40 inference(avatar_component_clause,[],[f49])).
% 0.22/0.40 thf(f18,plain,(
% 0.22/0.40 ( ! [X2 : $i > $o,X0 : $i,X1 : $i > $o] : (($true != (sP0 @ X2 @ X1 @ X0)) | ((X1 @ X0) != $true)) )),
% 0.22/0.40 inference(cnf_transformation,[],[f11])).
% 0.22/0.40 thf(f11,plain,(
% 0.22/0.40 ! [X0,X1 : $i > $o,X2 : $i > $o] : ((((X1 @ X0) != $true) & ($true != (X2 @ X0))) | ($true != (sP0 @ X2 @ X1 @ X0)))),
% 0.22/0.40 inference(rectify,[],[f10])).
% 0.22/0.40 thf(f10,plain,(
% 0.22/0.40 ! [X3,X0 : $i > $o,X5 : $i > $o] : ((((X0 @ X3) != $true) & ($true != (X5 @ X3))) | ($true != (sP0 @ X5 @ X0 @ X3)))),
% 0.22/0.40 inference(nnf_transformation,[],[f8])).
% 0.22/0.40 thf(f8,plain,(
% 0.22/0.40 ! [X3,X0 : $i > $o,X5 : $i > $o] : ((((X0 @ X3) != $true) & ($true != (X5 @ X3))) | ~($true = (sP0 @ X5 @ X0 @ X3)))),
% 0.22/0.40 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.22/0.40 thf(f201,plain,(
% 0.22/0.40 ~spl6_5 | ~spl6_7 | spl6_10),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f200])).
% 0.22/0.40 thf(f200,plain,(
% 0.22/0.40 $false | (~spl6_5 | ~spl6_7 | spl6_10)),
% 0.22/0.40 inference(subsumption_resolution,[],[f195,f82])).
% 0.22/0.40 thf(f82,plain,(
% 0.22/0.40 ((sK1 @ sK3) != $true) | spl6_10),
% 0.22/0.40 inference(avatar_component_clause,[],[f80])).
% 0.22/0.40 thf(f195,plain,(
% 0.22/0.40 ((sK1 @ sK3) = $true) | (~spl6_5 | ~spl6_7 | spl6_10)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f194])).
% 0.22/0.40 thf(f194,plain,(
% 0.22/0.40 ((sK1 @ sK3) = $true) | ($true != $true) | ($true = $false) | (~spl6_5 | ~spl6_7 | spl6_10)),
% 0.22/0.40 inference(superposition,[],[f127,f185])).
% 0.22/0.40 thf(f185,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_5 | ~spl6_7 | spl6_10)),
% 0.22/0.40 inference(subsumption_resolution,[],[f176,f82])).
% 0.22/0.40 thf(f176,plain,(
% 0.22/0.40 ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ((sK1 @ sK3) = $true) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(not_proxy_clausification,[],[f175])).
% 0.22/0.40 thf(f175,plain,(
% 0.22/0.40 ($true != (~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))) | ((sK1 @ sK3) = $true) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(duplicate_literal_removal,[],[f174])).
% 0.22/0.40 thf(f174,plain,(
% 0.22/0.40 ((sK1 @ sK3) = $true) | ((sK1 @ sK3) = $true) | ($true != (~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(not_proxy_clausification,[],[f173])).
% 0.22/0.40 thf(f173,plain,(
% 0.22/0.40 ($true != (~ (sK1 @ sK3))) | ($true != (~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))) | ((sK1 @ sK3) = $true) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(beta_eta_normalization,[],[f172])).
% 0.22/0.40 thf(f172,plain,(
% 0.22/0.40 ((sK1 @ sK3) = $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3)) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f151])).
% 0.22/0.40 thf(f151,plain,(
% 0.22/0.40 ((sK1 @ sK3) = $true) | ($true = $false) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3)) | ($true != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_5 | ~spl6_7)),
% 0.22/0.40 inference(superposition,[],[f127,f74])).
% 0.22/0.40 thf(f74,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) = $true) | ((X0 @ (sK5 @ X0)) != $true) | ($true != (X0 @ sK3))) ) | ~spl6_5),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f72])).
% 0.22/0.40 thf(f72,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (($true != (X0 @ sK3)) | ((sK1 @ (sK5 @ X0)) = $true) | ($true != $true) | ((X0 @ (sK5 @ X0)) != $true)) ) | ~spl6_5),
% 0.22/0.40 inference(superposition,[],[f17,f43])).
% 0.22/0.40 thf(f43,plain,(
% 0.22/0.40 ( ! [X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK3)) | ((X5 @ (sK5 @ X5)) != $true) | ($true = (sK1 @ (sK5 @ X5)))) ) | ~spl6_5),
% 0.22/0.40 inference(avatar_component_clause,[],[f42])).
% 0.22/0.40 thf(f42,plain,(
% 0.22/0.40 spl6_5 <=> ! [X5 : $i > $o] : (((X5 @ (sK5 @ X5)) != $true) | ($true = (sP0 @ X5 @ sK1 @ sK3)) | ($true = (sK1 @ (sK5 @ X5))))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_5])])).
% 0.22/0.40 thf(f17,plain,(
% 0.22/0.40 ( ! [X2 : $i > $o,X0 : $i,X1 : $i > $o] : (($true != (sP0 @ X2 @ X1 @ X0)) | ($true != (X2 @ X0))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f11])).
% 0.22/0.40 thf(f127,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (((X3 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) = $false) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true) | ((X3 @ sK3) = $true)) ) | ~spl6_7),
% 0.22/0.40 inference(not_proxy_clausification,[],[f126])).
% 0.22/0.40 thf(f126,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true) | ((X3 @ sK3) = $true) | ((~ (X3 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0)))))) = $true)) ) | ~spl6_7),
% 0.22/0.40 inference(not_proxy_clausification,[],[f125])).
% 0.22/0.40 thf(f125,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (($true != (~ (X3 @ sK3))) | ((~ (X3 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0)))))) = $true) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true)) ) | ~spl6_7),
% 0.22/0.40 inference(beta_eta_normalization,[],[f122])).
% 0.22/0.40 thf(f122,plain,(
% 0.22/0.40 ( ! [X3 : $i > $o] : (($true != ((^[Y0 : $i]: (~ (X3 @ Y0))) @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) != $true) | (((^[Y0 : $i]: (~ (X3 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X3 @ Y0))))) = $true)) ) | ~spl6_7),
% 0.22/0.40 inference(primitive_instantiation,[],[f86])).
% 0.22/0.40 thf(f86,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((X0 @ (sK5 @ X0)) = $true) | ($true != (X0 @ sK3)) | ((sK1 @ (sK5 @ X0)) != $true)) ) | ~spl6_7),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f84])).
% 0.22/0.40 thf(f84,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (($true != $true) | ((sK1 @ (sK5 @ X0)) != $true) | ((X0 @ (sK5 @ X0)) = $true) | ($true != (X0 @ sK3))) ) | ~spl6_7),
% 0.22/0.40 inference(superposition,[],[f17,f50])).
% 0.22/0.40 thf(f83,plain,(
% 0.22/0.40 spl6_9 | ~spl6_10 | ~spl6_5),
% 0.22/0.40 inference(avatar_split_clause,[],[f75,f42,f80,f77])).
% 0.22/0.40 thf(f75,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((sK1 @ (sK5 @ X0)) = $true) | ((sK1 @ sK3) != $true) | ((X0 @ (sK5 @ X0)) != $true)) ) | ~spl6_5),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f73])).
% 0.22/0.40 thf(f73,plain,(
% 0.22/0.40 ( ! [X0 : $i > $o] : (((X0 @ (sK5 @ X0)) != $true) | ($true != $true) | ((sK1 @ sK3) != $true) | ((sK1 @ (sK5 @ X0)) = $true)) ) | ~spl6_5),
% 0.22/0.40 inference(superposition,[],[f18,f43])).
% 0.22/0.40 thf(f66,plain,(
% 0.22/0.40 ~spl6_6),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f65])).
% 0.22/0.40 thf(f65,plain,(
% 0.22/0.40 $false | ~spl6_6),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f64])).
% 0.22/0.40 thf(f64,plain,(
% 0.22/0.40 ($true != $true) | ~spl6_6),
% 0.22/0.40 inference(duplicate_literal_removal,[],[f63])).
% 0.22/0.40 thf(f63,plain,(
% 0.22/0.40 ($true != $true) | ($true != $true) | ~spl6_6),
% 0.22/0.40 inference(beta_eta_normalization,[],[f60])).
% 0.22/0.40 thf(f60,plain,(
% 0.22/0.40 ($true != ((^[Y0 : $i]: ($true)) @ sK4)) | ($true != ((^[Y0 : $i]: ($true)) @ sK2)) | ~spl6_6),
% 0.22/0.40 inference(primitive_instantiation,[],[f47])).
% 0.22/0.40 thf(f47,plain,(
% 0.22/0.40 ( ! [X4 : $i > $o] : (($true != (X4 @ sK4)) | ((X4 @ sK2) != $true)) ) | ~spl6_6),
% 0.22/0.40 inference(avatar_component_clause,[],[f46])).
% 0.22/0.40 thf(f46,plain,(
% 0.22/0.40 spl6_6 <=> ! [X4 : $i > $o] : (((X4 @ sK2) != $true) | ($true != (X4 @ sK4)))),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl6_6])])).
% 0.22/0.40 thf(f52,plain,(
% 0.22/0.40 spl6_6 | spl6_5),
% 0.22/0.40 inference(avatar_split_clause,[],[f26,f42,f46])).
% 0.22/0.40 thf(f26,plain,(
% 0.22/0.40 ( ! [X4 : $i > $o,X5 : $i > $o] : (((X4 @ sK2) != $true) | ($true = (sK1 @ (sK5 @ X5))) | ((X5 @ (sK5 @ X5)) != $true) | ($true != (X4 @ sK4)) | ($true = (sP0 @ X5 @ sK1 @ sK3))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f16])).
% 0.22/0.40 thf(f16,plain,(
% 0.22/0.40 ! [X4 : $i > $o,X5 : $i > $o] : ((($true != (X4 @ sK4)) & ($true != (X5 @ sK4))) | (((X4 @ sK2) != $true) & ((sK1 @ sK2) = $true)) | ((((X5 @ (sK5 @ X5)) != $true) | ($true = (sK1 @ (sK5 @ X5)))) & (((X5 @ (sK5 @ X5)) = $true) | ($true != (sK1 @ (sK5 @ X5))))) | ($true = (sP0 @ X5 @ sK1 @ sK3)))),
% 0.22/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f13,f15,f14])).
% 0.22/0.40 thf(f14,plain,(
% 0.22/0.40 ? [X0 : $i > $o,X1,X2,X3] : ! [X4 : $i > $o,X5 : $i > $o] : ((($true != (X4 @ X3)) & ($true != (X5 @ X3))) | (((X4 @ X1) != $true) & ($true = (X0 @ X1))) | ? [X6] : ((((X5 @ X6) != $true) | ($true = (X0 @ X6))) & (((X5 @ X6) = $true) | ($true != (X0 @ X6)))) | ($true = (sP0 @ X5 @ X0 @ X2))) => ! [X5 : $i > $o,X4 : $i > $o] : ((($true != (X4 @ sK4)) & ($true != (X5 @ sK4))) | (((X4 @ sK2) != $true) & ((sK1 @ sK2) = $true)) | ? [X6] : ((((X5 @ X6) != $true) | ($true = (sK1 @ X6))) & (((X5 @ X6) = $true) | ($true != (sK1 @ X6)))) | ($true = (sP0 @ X5 @ sK1 @ sK3)))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f15,plain,(
% 0.22/0.40 ! [X5 : $i > $o] : (? [X6] : ((((X5 @ X6) != $true) | ($true = (sK1 @ X6))) & (((X5 @ X6) = $true) | ($true != (sK1 @ X6)))) => ((((X5 @ (sK5 @ X5)) != $true) | ($true = (sK1 @ (sK5 @ X5)))) & (((X5 @ (sK5 @ X5)) = $true) | ($true != (sK1 @ (sK5 @ X5))))))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f13,plain,(
% 0.22/0.40 ? [X0 : $i > $o,X1,X2,X3] : ! [X4 : $i > $o,X5 : $i > $o] : ((($true != (X4 @ X3)) & ($true != (X5 @ X3))) | (((X4 @ X1) != $true) & ($true = (X0 @ X1))) | ? [X6] : ((((X5 @ X6) != $true) | ($true = (X0 @ X6))) & (((X5 @ X6) = $true) | ($true != (X0 @ X6)))) | ($true = (sP0 @ X5 @ X0 @ X2)))),
% 0.22/0.40 inference(rectify,[],[f12])).
% 0.22/0.40 thf(f12,plain,(
% 0.22/0.40 ? [X0 : $i > $o,X2,X3,X1] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X4 @ X1) != $true) & ((X5 @ X1) != $true)) | (((X4 @ X2) != $true) & ((X0 @ X2) = $true)) | ? [X6] : ((((X5 @ X6) != $true) | ($true = (X0 @ X6))) & (((X5 @ X6) = $true) | ($true != (X0 @ X6)))) | ($true = (sP0 @ X5 @ X0 @ X3)))),
% 0.22/0.40 inference(nnf_transformation,[],[f9])).
% 0.22/0.40 thf(f9,plain,(
% 0.22/0.40 ? [X0 : $i > $o,X2,X3,X1] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X4 @ X1) != $true) & ((X5 @ X1) != $true)) | (((X4 @ X2) != $true) & ((X0 @ X2) = $true)) | ? [X6] : (($true != (X0 @ X6)) <~> ((X5 @ X6) = $true)) | ($true = (sP0 @ X5 @ X0 @ X3)))),
% 0.22/0.40 inference(definition_folding,[],[f7,f8])).
% 0.22/0.40 thf(f7,plain,(
% 0.22/0.40 ? [X0 : $i > $o,X2,X3,X1] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X4 @ X1) != $true) & ((X5 @ X1) != $true)) | (((X4 @ X2) != $true) & ((X0 @ X2) = $true)) | ? [X6] : (($true != (X0 @ X6)) <~> ((X5 @ X6) = $true)) | (((X0 @ X3) != $true) & ($true != (X5 @ X3))))),
% 0.22/0.40 inference(ennf_transformation,[],[f6])).
% 0.22/0.40 thf(f6,plain,(
% 0.22/0.40 ~! [X2,X3,X0 : $i > $o,X1] : ? [X5 : $i > $o,X4 : $i > $o] : ((((X4 @ X2) = $true) | ((X0 @ X2) != $true)) & ! [X6] : (($true != (X0 @ X6)) <=> ((X5 @ X6) = $true)) & (((X0 @ X3) = $true) | ($true = (X5 @ X3))) & (((X5 @ X1) = $true) | ((X4 @ X1) = $true)))),
% 0.22/0.40 inference(flattening,[],[f5])).
% 0.22/0.40 thf(f5,plain,(
% 0.22/0.40 ~! [X0 : $i > $o,X1,X2,X3] : ? [X4 : $i > $o,X5 : $i > $o] : (! [X6] : (~($true = (X0 @ X6)) <=> ((X5 @ X6) = $true)) & (((X5 @ X1) = $true) | ((X4 @ X1) = $true)) & (((X0 @ X3) = $true) | ($true = (X5 @ X3))) & (~((X0 @ X2) = $true) | ((X4 @ X2) = $true)))),
% 0.22/0.40 inference(fool_elimination,[],[f4])).
% 0.22/0.40 thf(f4,plain,(
% 0.22/0.40 ~! [X0 : $i > $o,X1,X2,X3] : ? [X4 : $i > $o,X5 : $i > $o] : (! [X6] : (~(X0 @ X6) <=> (X5 @ X6)) & ((X4 @ X1) | (X5 @ X1)) & ((X5 @ X3) | (X0 @ X3)) & (~(X0 @ X2) | (X4 @ X2)))),
% 0.22/0.40 inference(rectify,[],[f2])).
% 0.22/0.40 thf(f2,negated_conjecture,(
% 0.22/0.40 ~! [X3 : $i > $o,X0,X2,X1] : ? [X4 : $i > $o,X5 : $i > $o] : (! [X6] : (~(X3 @ X6) <=> (X5 @ X6)) & ((X4 @ X0) | (X5 @ X0)) & ((X5 @ X1) | (X3 @ X1)) & (~(X3 @ X2) | (X4 @ X2)))),
% 0.22/0.40 inference(negated_conjecture,[],[f1])).
% 0.22/0.40 thf(f1,conjecture,(
% 0.22/0.40 ! [X3 : $i > $o,X0,X2,X1] : ? [X4 : $i > $o,X5 : $i > $o] : (! [X6] : (~(X3 @ X6) <=> (X5 @ X6)) & ((X4 @ X0) | (X5 @ X0)) & ((X5 @ X1) | (X3 @ X1)) & (~(X3 @ X2) | (X4 @ X2)))),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM125C)).
% 0.22/0.40 thf(f51,plain,(
% 0.22/0.40 spl6_6 | spl6_7),
% 0.22/0.40 inference(avatar_split_clause,[],[f25,f49,f46])).
% 0.22/0.40 thf(f25,plain,(
% 0.22/0.40 ( ! [X4 : $i > $o,X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK3)) | ((X5 @ (sK5 @ X5)) = $true) | ((X4 @ sK2) != $true) | ($true != (sK1 @ (sK5 @ X5))) | ($true != (X4 @ sK4))) )),
% 0.22/0.40 inference(cnf_transformation,[],[f16])).
% 0.22/0.40 % SZS output end Proof for theBenchmark
% 0.22/0.40 % (32477)------------------------------
% 0.22/0.40 % (32477)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (32477)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (32477)Memory used [KB]: 5628
% 0.22/0.40 % (32477)Time elapsed: 0.022 s
% 0.22/0.40 % (32477)Instructions burned: 24 (million)
% 0.22/0.40 % (32477)------------------------------
% 0.22/0.40 % (32477)------------------------------
% 0.22/0.40 % (32471)Success in time 0.021 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------