TSTP Solution File: SEV434^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV434^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:13:46 EDT 2024
% Result : Theorem 0.15s 0.34s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV434^1 : TPTP v8.2.0. Released v5.2.0.
% 0.02/0.10 % 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.09/0.30 % Computer : n027.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 18:33:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_EQU_NAR problem
% 0.09/0.30 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.15/0.31 % (25433)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.15/0.31 % (25428)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.15/0.31 % (25429)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.15/0.31 % (25431)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.31 % (25432)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.15/0.31 % (25430)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.15/0.31 % (25435)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.15/0.31 % (25434)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (25433)Refutation not found, incomplete strategy
% 0.15/0.32 % (25433)------------------------------
% 0.15/0.32 % (25433)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25433)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (25433)Memory used [KB]: 5373
% 0.15/0.32 % (25433)Time elapsed: 0.002 s
% 0.15/0.32 % (25433)Instructions burned: 1 (million)
% 0.15/0.32 % (25433)------------------------------
% 0.15/0.32 % (25433)------------------------------
% 0.15/0.32 % (25431)Refutation not found, incomplete strategy
% 0.15/0.32 % (25431)------------------------------
% 0.15/0.32 % (25431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25431)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (25430)Refutation not found, incomplete strategy
% 0.15/0.32 % (25430)------------------------------
% 0.15/0.32 % (25430)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25430)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (25430)Memory used [KB]: 5500
% 0.15/0.32 % (25430)Time elapsed: 0.002 s
% 0.15/0.32 % (25430)Instructions burned: 1 (million)
% 0.15/0.32 % (25430)------------------------------
% 0.15/0.32 % (25430)------------------------------
% 0.15/0.32 % (25431)Memory used [KB]: 5500
% 0.15/0.32 % (25431)Time elapsed: 0.002 s
% 0.15/0.32 % (25431)Instructions burned: 1 (million)
% 0.15/0.32 % (25431)------------------------------
% 0.15/0.32 % (25431)------------------------------
% 0.15/0.32 % (25432)Instruction limit reached!
% 0.15/0.32 % (25432)------------------------------
% 0.15/0.32 % (25432)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25432)Termination reason: Unknown
% 0.15/0.32 % (25432)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (25432)Memory used [KB]: 5500
% 0.15/0.32 % (25432)Time elapsed: 0.003 s
% 0.15/0.32 % (25432)Instructions burned: 3 (million)
% 0.15/0.32 % (25432)------------------------------
% 0.15/0.32 % (25432)------------------------------
% 0.15/0.32 % (25435)Refutation not found, incomplete strategy
% 0.15/0.32 % (25435)------------------------------
% 0.15/0.32 % (25435)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25435)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (25435)Memory used [KB]: 5500
% 0.15/0.32 % (25435)Time elapsed: 0.003 s
% 0.15/0.32 % (25435)Instructions burned: 1 (million)
% 0.15/0.32 % (25435)------------------------------
% 0.15/0.32 % (25435)------------------------------
% 0.15/0.32 % (25429)Instruction limit reached!
% 0.15/0.32 % (25429)------------------------------
% 0.15/0.32 % (25429)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (25429)Termination reason: Unknown
% 0.15/0.32 % (25429)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (25429)Memory used [KB]: 5500
% 0.15/0.32 % (25429)Time elapsed: 0.005 s
% 0.15/0.32 % (25429)Instructions burned: 5 (million)
% 0.15/0.32 % (25429)------------------------------
% 0.15/0.32 % (25429)------------------------------
% 0.15/0.32 % (25434)Instruction limit reached!
% 0.15/0.32 % (25434)------------------------------
% 0.15/0.32 % (25434)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (25434)Termination reason: Unknown
% 0.15/0.33 % (25434)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (25434)Memory used [KB]: 5500
% 0.15/0.33 % (25434)Time elapsed: 0.012 s
% 0.15/0.33 % (25434)Instructions burned: 19 (million)
% 0.15/0.33 % (25434)------------------------------
% 0.15/0.33 % (25434)------------------------------
% 0.15/0.33 % (25439)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.15/0.33 % (25438)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.15/0.33 % (25437)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.15/0.33 % (25440)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.15/0.33 % (25441)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.15/0.33 % (25438)Refutation not found, incomplete strategy
% 0.15/0.33 % (25438)------------------------------
% 0.15/0.33 % (25438)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (25438)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 % (25438)Memory used [KB]: 5500
% 0.15/0.33 % (25438)Time elapsed: 0.002 s
% 0.15/0.33 % (25438)Instructions burned: 1 (million)
% 0.15/0.33 % (25438)------------------------------
% 0.15/0.33 % (25438)------------------------------
% 0.15/0.33 % (25439)Instruction limit reached!
% 0.15/0.33 % (25439)------------------------------
% 0.15/0.33 % (25439)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (25439)Termination reason: Unknown
% 0.15/0.33 % (25439)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (25439)Memory used [KB]: 5500
% 0.15/0.33 % (25439)Time elapsed: 0.003 s
% 0.15/0.33 % (25443)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.15/0.33 % (25439)Instructions burned: 3 (million)
% 0.15/0.33 % (25439)------------------------------
% 0.15/0.33 % (25439)------------------------------
% 0.15/0.33 % (25440)Refutation not found, incomplete strategy
% 0.15/0.33 % (25440)------------------------------
% 0.15/0.33 % (25440)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (25440)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 % (25440)Memory used [KB]: 5500
% 0.15/0.33 % (25440)Time elapsed: 0.005 s
% 0.15/0.33 % (25440)Instructions burned: 5 (million)
% 0.15/0.33 % (25440)------------------------------
% 0.15/0.33 % (25440)------------------------------
% 0.15/0.33 % (25441)Instruction limit reached!
% 0.15/0.33 % (25441)------------------------------
% 0.15/0.33 % (25441)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (25441)Termination reason: Unknown
% 0.15/0.33 % (25441)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (25441)Memory used [KB]: 1023
% 0.15/0.33 % (25441)Time elapsed: 0.005 s
% 0.15/0.33 % (25441)Instructions burned: 7 (million)
% 0.15/0.33 % (25441)------------------------------
% 0.15/0.33 % (25441)------------------------------
% 0.15/0.34 % (25428)First to succeed.
% 0.15/0.34 % (25444)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.15/0.34 % (25444)Refutation not found, incomplete strategy
% 0.15/0.34 % (25444)------------------------------
% 0.15/0.34 % (25444)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.34 % (25444)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.34
% 0.15/0.34
% 0.15/0.34 % (25444)Memory used [KB]: 5500
% 0.15/0.34 % (25444)Time elapsed: 0.002 s
% 0.15/0.34 % (25444)Instructions burned: 1 (million)
% 0.15/0.34 % (25444)------------------------------
% 0.15/0.34 % (25444)------------------------------
% 0.15/0.34 % (25428)Refutation found. Thanks to Tanya!
% 0.15/0.34 % SZS status Theorem for theBenchmark
% 0.15/0.34 % SZS output start Proof for theBenchmark
% 0.15/0.34 thf(func_def_0, type, f: $o > $i).
% 0.15/0.34 thf(func_def_4, type, sK0: $i > $o).
% 0.15/0.34 thf(func_def_9, type, ph5: !>[X0: $tType]:(X0)).
% 0.15/0.34 thf(f350,plain,(
% 0.15/0.34 $false),
% 0.15/0.34 inference(avatar_sat_refutation,[],[f46,f135,f348])).
% 0.15/0.34 thf(f348,plain,(
% 0.15/0.34 ~spl4_2),
% 0.15/0.34 inference(avatar_contradiction_clause,[],[f347])).
% 0.15/0.34 thf(f347,plain,(
% 0.15/0.34 $false | ~spl4_2),
% 0.15/0.34 inference(equality_resolution,[],[f328])).
% 0.15/0.34 thf(f328,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((sK1 != X0)) ) | ~spl4_2),
% 0.15/0.34 inference(duplicate_literal_removal,[],[f318])).
% 0.15/0.34 thf(f318,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((sK1 != X0) | (sK1 != X0)) ) | ~spl4_2),
% 0.15/0.34 inference(superposition,[],[f15,f285])).
% 0.15/0.34 thf(f285,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((sK3 = X0) | (sK1 != X0)) ) | ~spl4_2),
% 0.15/0.34 inference(trivial_inequality_removal,[],[f273])).
% 0.15/0.34 thf(f273,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((sK2 != sK2) | (sK3 = X0) | (sK1 != X0)) ) | ~spl4_2),
% 0.15/0.34 inference(superposition,[],[f14,f242])).
% 0.15/0.34 thf(f242,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : ((sK2 = X1) | (sK1 != X0) | (X0 = X1)) ) | ~spl4_2),
% 0.15/0.34 inference(superposition,[],[f13,f241])).
% 0.15/0.34 thf(f241,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | (X0 = X2) | (X0 = X1)) ) | ~spl4_2),
% 0.15/0.34 inference(subsumption_resolution,[],[f233,f240])).
% 0.15/0.34 thf(f240,plain,(
% 0.15/0.34 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | (X1 = X2) | (X1 = X3) | (X2 = X3)) ) | ~spl4_2),
% 0.15/0.34 inference(subsumption_resolution,[],[f214,f206])).
% 0.15/0.34 thf(f206,plain,(
% 0.15/0.34 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((sK0 @ X3) = $false) | (X0 = X4) | (X0 = X1) | (X3 = X4) | (X0 = X2) | (X1 = X2)) )),
% 0.15/0.34 inference(trivial_inequality_removal,[],[f199])).
% 0.15/0.34 thf(f199,plain,(
% 0.15/0.34 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((sK0 @ X3) = $false) | (X1 = X2) | (X0 = X1) | ($true != $true) | (X3 = X4) | (X0 = X4) | (X0 = X2)) )),
% 0.15/0.34 inference(superposition,[],[f184,f26])).
% 0.15/0.34 thf(f26,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (sK0 @ X1)) | ((sK0 @ X2) = $false) | (X0 = X1) | (X0 = X2)) )),
% 0.15/0.34 inference(trivial_inequality_removal,[],[f22])).
% 0.15/0.34 thf(f22,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | (X0 = X2) | ($true = $false) | ((sK0 @ X2) = $false) | ($true = (sK0 @ X1))) )),
% 0.15/0.34 inference(superposition,[],[f17,f18])).
% 0.15/0.34 thf(f18,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (((sK0 @ X1) = $false) | (X0 = X1) | ((sK0 @ X0) = $false)) )),
% 0.15/0.34 inference(binary_proxy_clausification,[],[f16])).
% 0.15/0.34 thf(f16,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (((sK0 @ X1) != (sK0 @ X0)) | (X0 = X1)) )),
% 0.15/0.34 inference(constrained_superposition,[],[f12,f12])).
% 0.15/0.34 thf(f12,plain,(
% 0.15/0.34 ( ! [X0 : $i] : (((f @ (sK0 @ X0)) = X0)) )),
% 0.15/0.34 inference(cnf_transformation,[],[f8])).
% 0.15/0.34 thf(f8,plain,(
% 0.15/0.34 ! [X0] : ((f @ (sK0 @ X0)) = X0)),
% 0.15/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f7])).
% 0.15/0.34 thf(f7,plain,(
% 0.15/0.34 ! [X0] : (? [X1 : $o] : ((f @ X1) = X0) => ((f @ (sK0 @ X0)) = X0))),
% 0.15/0.34 introduced(choice_axiom,[])).
% 0.15/0.34 thf(f1,axiom,(
% 0.15/0.34 ! [X0] : ? [X1 : $o] : ((f @ X1) = X0)),
% 0.15/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj)).
% 0.15/0.34 thf(f17,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (($true = (sK0 @ X1)) | ($true = (sK0 @ X0)) | (X0 = X1)) )),
% 0.15/0.34 inference(binary_proxy_clausification,[],[f16])).
% 0.15/0.34 thf(f184,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (sK0 @ X0)) | (X0 = X1) | (X0 = X2) | (X1 = X2)) )),
% 0.15/0.34 inference(constrained_superposition,[],[f29,f12])).
% 0.15/0.34 thf(f29,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (((f @ $true) = X1) | (X0 = X1) | ((f @ $true) = X0)) )),
% 0.15/0.34 inference(superposition,[],[f12,f19])).
% 0.15/0.34 thf(f19,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (($true = (sK0 @ X1)) | ((f @ $true) = X0) | (X0 = X1)) )),
% 0.15/0.34 inference(superposition,[],[f12,f17])).
% 0.15/0.34 thf(f214,plain,(
% 0.15/0.34 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | (X1 = X3) | (X0 = X1) | ((sK0 @ X0) != $false) | (X2 = X3)) ) | ~spl4_2),
% 0.15/0.34 inference(constrained_superposition,[],[f12,f182])).
% 0.15/0.34 thf(f182,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((f @ $false) = X0) | (X0 = X2) | (X1 = X2) | (X0 = X1)) ) | ~spl4_2),
% 0.15/0.34 inference(superposition,[],[f29,f56])).
% 0.15/0.34 thf(f56,plain,(
% 0.15/0.34 ( ! [X0 : $i] : (((f @ $true) = X0) | ((f @ $false) = X0)) ) | ~spl4_2),
% 0.15/0.34 inference(trivial_inequality_removal,[],[f51])).
% 0.15/0.34 thf(f51,plain,(
% 0.15/0.34 ( ! [X0 : $i] : (((f @ $false) = X0) | ($true = $false) | ((f @ $true) = X0)) ) | ~spl4_2),
% 0.15/0.34 inference(superposition,[],[f19,f45])).
% 0.15/0.34 thf(f45,plain,(
% 0.15/0.34 ((sK0 @ (f @ $false)) = $false) | ~spl4_2),
% 0.15/0.34 inference(avatar_component_clause,[],[f43])).
% 0.15/0.34 thf(f43,plain,(
% 0.15/0.34 spl4_2 <=> ((sK0 @ (f @ $false)) = $false)),
% 0.15/0.34 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.15/0.34 thf(f233,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X1 = X2) | ((f @ $false) != X1) | (X0 = X2) | (X0 = X1)) ) | ~spl4_2),
% 0.15/0.34 inference(equality_factoring,[],[f182])).
% 0.15/0.34 thf(f13,plain,(
% 0.15/0.34 (sK2 != sK1)),
% 0.15/0.34 inference(cnf_transformation,[],[f11])).
% 0.15/0.34 thf(f11,plain,(
% 0.15/0.34 (sK1 != sK3) & (sK2 != sK3) & (sK2 != sK1)),
% 0.15/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f9,f10])).
% 0.15/0.34 thf(f10,plain,(
% 0.15/0.34 ? [X0,X1,X2] : ((X0 != X2) & (X1 != X2) & (X0 != X1)) => ((sK1 != sK3) & (sK2 != sK3) & (sK2 != sK1))),
% 0.15/0.34 introduced(choice_axiom,[])).
% 0.15/0.34 thf(f9,plain,(
% 0.15/0.34 ? [X0,X1,X2] : ((X0 != X2) & (X1 != X2) & (X0 != X1))),
% 0.15/0.34 inference(rectify,[],[f6])).
% 0.15/0.34 thf(f6,plain,(
% 0.15/0.34 ? [X2,X1,X0] : ((X0 != X2) & (X0 != X1) & (X1 != X2))),
% 0.15/0.34 inference(ennf_transformation,[],[f5])).
% 0.15/0.34 thf(f5,plain,(
% 0.15/0.34 ~! [X0,X1,X2] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.15/0.34 inference(rectify,[],[f3])).
% 0.15/0.34 thf(f3,negated_conjecture,(
% 0.15/0.34 ~! [X2,X0,X1] : ((X0 = X2) | (X1 = X2) | (X0 = X1))),
% 0.15/0.34 inference(negated_conjecture,[],[f2])).
% 0.15/0.34 thf(f2,conjecture,(
% 0.15/0.34 ! [X2,X0,X1] : ((X0 = X2) | (X1 = X2) | (X0 = X1))),
% 0.15/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3)).
% 0.15/0.34 thf(f14,plain,(
% 0.15/0.34 (sK2 != sK3)),
% 0.15/0.34 inference(cnf_transformation,[],[f11])).
% 0.15/0.34 thf(f15,plain,(
% 0.15/0.34 (sK1 != sK3)),
% 0.15/0.34 inference(cnf_transformation,[],[f11])).
% 0.15/0.34 thf(f135,plain,(
% 0.15/0.34 ~spl4_1),
% 0.15/0.34 inference(avatar_contradiction_clause,[],[f134])).
% 0.15/0.34 thf(f134,plain,(
% 0.15/0.34 $false | ~spl4_1),
% 0.15/0.34 inference(subsumption_resolution,[],[f116,f107])).
% 0.15/0.34 thf(f107,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : ((X0 = X1)) ) | ~spl4_1),
% 0.15/0.34 inference(subsumption_resolution,[],[f99,f98])).
% 0.15/0.34 thf(f98,plain,(
% 0.15/0.34 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((X0 = X1) | (X0 = X2) | ((sK0 @ X2) = $false)) ) | ~spl4_1),
% 0.15/0.34 inference(superposition,[],[f41,f23])).
% 0.15/0.34 thf(f23,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (((f @ $false) = X0) | ((sK0 @ X1) = $false) | (X0 = X1)) )),
% 0.15/0.34 inference(superposition,[],[f12,f18])).
% 0.15/0.34 thf(f41,plain,(
% 0.15/0.34 ( ! [X0 : $i] : (((f @ $false) = X0)) ) | ~spl4_1),
% 0.15/0.34 inference(avatar_component_clause,[],[f40])).
% 0.15/0.34 thf(f40,plain,(
% 0.15/0.34 spl4_1 <=> ! [X0] : ((f @ $false) = X0)),
% 0.15/0.34 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.15/0.34 thf(f99,plain,(
% 0.15/0.34 ( ! [X0 : $i,X1 : $i] : (((sK0 @ X0) != $false) | (X0 = X1)) ) | ~spl4_1),
% 0.15/0.34 inference(constrained_superposition,[],[f41,f12])).
% 0.15/0.34 thf(f116,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((sK1 != X0)) ) | ~spl4_1),
% 0.15/0.34 inference(superposition,[],[f13,f107])).
% 0.15/0.34 thf(f46,plain,(
% 0.15/0.34 spl4_1 | spl4_2),
% 0.15/0.34 inference(avatar_split_clause,[],[f38,f43,f40])).
% 0.15/0.34 thf(f38,plain,(
% 0.15/0.34 ( ! [X0 : $i] : (((f @ $false) = X0) | ((sK0 @ (f @ $false)) = $false)) )),
% 0.15/0.34 inference(trivial_inequality_removal,[],[f36])).
% 0.15/0.34 thf(f36,plain,(
% 0.15/0.34 ( ! [X0 : $i] : ((X0 != X0) | ((sK0 @ (f @ $false)) = $false) | ((f @ $false) = X0)) )),
% 0.15/0.34 inference(equality_factoring,[],[f23])).
% 0.15/0.34 % SZS output end Proof for theBenchmark
% 0.15/0.34 % (25428)------------------------------
% 0.15/0.34 % (25428)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.34 % (25428)Termination reason: Refutation
% 0.15/0.34
% 0.15/0.34 % (25428)Memory used [KB]: 5628
% 0.15/0.34 % (25428)Time elapsed: 0.025 s
% 0.15/0.34 % (25428)Instructions burned: 40 (million)
% 0.15/0.34 % (25428)------------------------------
% 0.15/0.34 % (25428)------------------------------
% 0.15/0.34 % (25426)Success in time 0.021 s
% 0.15/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------