TSTP Solution File: SEU818^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU818^2 : TPTP v8.2.0. Released v3.7.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 : n016.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 03:51:47 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU818^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.14 % 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.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 16:17:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.38 % (14142)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (14141)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.15/0.38 % (14140)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.15/0.38 % (14139)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.15/0.38 % (14143)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.15/0.38 % (14144)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.15/0.38 % (14145)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (14146)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.15/0.38 % (14142)Instruction limit reached!
% 0.15/0.38 % (14142)------------------------------
% 0.15/0.38 % (14142)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14142)Termination reason: Unknown
% 0.15/0.38 % (14143)Instruction limit reached!
% 0.15/0.38 % (14143)------------------------------
% 0.15/0.38 % (14143)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14142)Termination phase: Preprocessing 1
% 0.15/0.38
% 0.15/0.38 % (14142)Memory used [KB]: 1023
% 0.15/0.38 % (14142)Time elapsed: 0.004 s
% 0.15/0.38 % (14142)Instructions burned: 3 (million)
% 0.15/0.38 % (14142)------------------------------
% 0.15/0.38 % (14142)------------------------------
% 0.15/0.38 % (14143)Termination reason: Unknown
% 0.15/0.38 % (14143)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (14143)Memory used [KB]: 1023
% 0.15/0.38 % (14143)Time elapsed: 0.004 s
% 0.15/0.38 % (14143)Instructions burned: 3 (million)
% 0.15/0.38 % (14143)------------------------------
% 0.15/0.38 % (14143)------------------------------
% 0.15/0.38 % (14146)Instruction limit reached!
% 0.15/0.38 % (14146)------------------------------
% 0.15/0.38 % (14146)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14146)Termination reason: Unknown
% 0.15/0.38 % (14146)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (14146)Memory used [KB]: 1023
% 0.15/0.38 % (14146)Time elapsed: 0.003 s
% 0.15/0.38 % (14146)Instructions burned: 3 (million)
% 0.15/0.38 % (14146)------------------------------
% 0.15/0.38 % (14146)------------------------------
% 0.15/0.38 % (14140)Instruction limit reached!
% 0.15/0.38 % (14140)------------------------------
% 0.15/0.38 % (14140)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14140)Termination reason: Unknown
% 0.15/0.38 % (14140)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (14140)Memory used [KB]: 1023
% 0.15/0.38 % (14140)Time elapsed: 0.005 s
% 0.15/0.38 % (14140)Instructions burned: 5 (million)
% 0.15/0.38 % (14140)------------------------------
% 0.15/0.38 % (14140)------------------------------
% 0.15/0.39 % (14144)First to succeed.
% 0.15/0.39 % (14144)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_2, type, powerset: $i > $i).
% 0.15/0.39 thf(func_def_3, type, nonempty: $i > $o).
% 0.15/0.39 thf(func_def_4, type, subset: $i > $i > $o).
% 0.15/0.39 thf(func_def_7, type, transitiveset: $i > $o).
% 0.15/0.39 thf(func_def_8, type, stricttotalorderedByIn: $i > $o).
% 0.15/0.39 thf(func_def_9, type, wellorderedByIn: $i > $o).
% 0.15/0.39 thf(func_def_10, type, ordinal: $i > $o).
% 0.15/0.39 thf(func_def_26, type, sK0: $i > $i > $i).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f82,f52])).
% 0.15/0.39 thf(f52,plain,(
% 0.15/0.39 ((in @ sK4 @ sK3) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f38])).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 ((((in @ sK4 @ sK3) = $true) & ((subset @ sK4 @ sK3) != $true)) & ($true = (ordinal @ sK3))) & (subsetI1 = $true) & (ordinalTransSet = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f27,f37,f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ? [X0] : (? [X1] : (((in @ X1 @ X0) = $true) & ((subset @ X1 @ X0) != $true)) & ($true = (ordinal @ X0))) => (? [X1] : (((in @ X1 @ sK3) = $true) & ((subset @ X1 @ sK3) != $true)) & ($true = (ordinal @ sK3)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f37,plain,(
% 0.15/0.39 ? [X1] : (((in @ X1 @ sK3) = $true) & ((subset @ X1 @ sK3) != $true)) => (((in @ sK4 @ sK3) = $true) & ((subset @ sK4 @ sK3) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ? [X0] : (? [X1] : (((in @ X1 @ X0) = $true) & ((subset @ X1 @ X0) != $true)) & ($true = (ordinal @ X0))) & (subsetI1 = $true) & (ordinalTransSet = $true)),
% 0.15/0.39 inference(flattening,[],[f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 (? [X0] : (? [X1] : (((in @ X1 @ X0) = $true) & ((subset @ X1 @ X0) != $true)) & ($true = (ordinal @ X0))) & (ordinalTransSet = $true)) & (subsetI1 = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ~((subsetI1 = $true) => ((ordinalTransSet = $true) => ! [X0] : (($true = (ordinal @ X0)) => ! [X1] : (((in @ X1 @ X0) = $true) => ((subset @ X1 @ X0) = $true)))))),
% 0.15/0.39 inference(fool_elimination,[],[f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ~(subsetI1 => (ordinalTransSet => ! [X0] : ((ordinal @ X0) => ! [X1] : ((in @ X1 @ X0) => (subset @ X1 @ X0)))))),
% 0.15/0.39 inference(rectify,[],[f9])).
% 0.15/0.39 thf(f9,negated_conjecture,(
% 0.15/0.39 ~(subsetI1 => (ordinalTransSet => ! [X3] : ((ordinal @ X3) => ! [X1] : ((in @ X1 @ X3) => (subset @ X1 @ X3)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f8])).
% 0.15/0.39 thf(f8,conjecture,(
% 0.15/0.39 subsetI1 => (ordinalTransSet => ! [X3] : ((ordinal @ X3) => ! [X1] : ((in @ X1 @ X3) => (subset @ X1 @ X3))))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinalTransSet1)).
% 0.15/0.39 thf(f82,plain,(
% 0.15/0.39 ((in @ sK4 @ sK3) != $true)),
% 0.15/0.39 inference(subsumption_resolution,[],[f81,f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ($true = (ordinal @ sK3))),
% 0.15/0.39 inference(cnf_transformation,[],[f38])).
% 0.15/0.39 thf(f81,plain,(
% 0.15/0.39 ($true != (ordinal @ sK3)) | ((in @ sK4 @ sK3) != $true)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f80])).
% 0.15/0.39 thf(f80,plain,(
% 0.15/0.39 ($true != (ordinal @ sK3)) | ((in @ sK4 @ sK3) != $true) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f51,f78])).
% 0.15/0.39 thf(f78,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) = $true) | ($true != (ordinal @ X1)) | ((in @ X0 @ X1) != $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f77])).
% 0.15/0.39 thf(f77,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ X0 @ X1) != $true) | ($true != $true) | ($true != (ordinal @ X1)) | ((subset @ X0 @ X1) = $true)) )),
% 0.15/0.39 inference(duplicate_literal_removal,[],[f75])).
% 0.15/0.39 thf(f75,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((subset @ X0 @ X1) = $true) | ((subset @ X0 @ X1) = $true) | ($true != $true) | ((in @ X0 @ X1) != $true) | ($true != (ordinal @ X1))) )),
% 0.15/0.39 inference(superposition,[],[f74,f68])).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((subset @ X1 @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f58])).
% 0.15/0.39 thf(f58,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ X1 @ X0) = $true) | ((in @ (sK0 @ X1 @ X0) @ X1) = $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f47,f49])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 (subsetI1 = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f38])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (((in @ (sK0 @ X1 @ X0) @ X1) = $true) | ((subset @ X1 @ X0) = $true) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f35])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 (! [X0,X1] : ((((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ($true != (in @ (sK0 @ X1 @ X0) @ X0))) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | (! [X5] : (((in @ X5 @ sK2) != $true) | ($true = (in @ X5 @ sK1))) & ((subset @ sK2 @ sK1) != $true)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f32,f34,f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (((in @ (sK0 @ X1 @ X0) @ X1) = $true) & ($true != (in @ (sK0 @ X1 @ X0) @ X0))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ? [X3,X4] : (! [X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) & ((subset @ X4 @ X3) != $true)) => (! [X5] : (((in @ X5 @ sK2) != $true) | ($true = (in @ X5 @ sK1))) & ((subset @ sK2 @ sK1) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | ? [X3,X4] : (! [X5] : (((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) & ((subset @ X4 @ X3) != $true)))),
% 0.15/0.39 inference(rectify,[],[f31])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 (! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((subset @ X1 @ X0) = $true)) | (subsetI1 != $true)) & ((subsetI1 = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) & ((subset @ X1 @ X0) != $true)))),
% 0.15/0.39 inference(nnf_transformation,[],[f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) | ((subset @ X1 @ X0) = $true)) <=> (subsetI1 = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (subsetI1 = $true) <=> ! [X0,X1] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((subset @ X1 @ X0) = $true))),
% 0.15/0.39 inference(fool_elimination,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 (subsetI1 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)))),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (subsetI1 = ! [X2,X1] : (! [X0] : ((in @ X0 @ X1) => (in @ X0 @ X2)) => (subset @ X1 @ X2)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI1)).
% 0.15/0.39 thf(f74,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X0 @ X1) @ X2)) | ((in @ X2 @ X1) != $true) | ((subset @ X0 @ X1) = $true) | ($true != (ordinal @ X1))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f73])).
% 0.15/0.39 thf(f73,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X0 @ X1) @ X2)) | ($true != (ordinal @ X1)) | ($true != $true) | ((in @ X2 @ X1) != $true) | ((subset @ X0 @ X1) = $true)) )),
% 0.15/0.39 inference(superposition,[],[f69,f67])).
% 0.15/0.39 thf(f67,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ X0) = $true) | ($true != (ordinal @ X0)) | ((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f62])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true) | ($true != (ordinal @ X0)) | ($true != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f57,f48])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 (ordinalTransSet = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f38])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ X2) != $true) | ((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true) | ($true != (ordinal @ X0)) | (ordinalTransSet != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f43])).
% 0.15/0.39 thf(f43,plain,(
% 0.15/0.39 (! [X0] : (! [X1,X2] : (((in @ X1 @ X2) != $true) | ((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true)) | ($true != (ordinal @ X0))) | (ordinalTransSet != $true)) & ((ordinalTransSet = $true) | ((((in @ sK6 @ sK7) = $true) & ((in @ sK6 @ sK5) != $true) & ((in @ sK7 @ sK5) = $true)) & ((ordinal @ sK5) = $true)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f40,f42,f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ? [X3] : (? [X4,X5] : (((in @ X4 @ X5) = $true) & ((in @ X4 @ X3) != $true) & ((in @ X5 @ X3) = $true)) & ((ordinal @ X3) = $true)) => (? [X5,X4] : (((in @ X4 @ X5) = $true) & ((in @ X4 @ sK5) != $true) & ($true = (in @ X5 @ sK5))) & ((ordinal @ sK5) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 ? [X5,X4] : (((in @ X4 @ X5) = $true) & ((in @ X4 @ sK5) != $true) & ($true = (in @ X5 @ sK5))) => (((in @ sK6 @ sK7) = $true) & ((in @ sK6 @ sK5) != $true) & ((in @ sK7 @ sK5) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 (! [X0] : (! [X1,X2] : (((in @ X1 @ X2) != $true) | ((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true)) | ($true != (ordinal @ X0))) | (ordinalTransSet != $true)) & ((ordinalTransSet = $true) | ? [X3] : (? [X4,X5] : (((in @ X4 @ X5) = $true) & ((in @ X4 @ X3) != $true) & ((in @ X5 @ X3) = $true)) & ((ordinal @ X3) = $true)))),
% 0.15/0.39 inference(rectify,[],[f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 (! [X0] : (! [X1,X2] : (((in @ X1 @ X2) != $true) | ((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true)) | ($true != (ordinal @ X0))) | (ordinalTransSet != $true)) & ((ordinalTransSet = $true) | ? [X0] : (? [X1,X2] : (((in @ X1 @ X2) = $true) & ((in @ X1 @ X0) != $true) & ((in @ X2 @ X0) = $true)) & ($true = (ordinal @ X0))))),
% 0.15/0.39 inference(nnf_transformation,[],[f29])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ! [X0] : (! [X1,X2] : (((in @ X1 @ X2) != $true) | ((in @ X1 @ X0) = $true) | ((in @ X2 @ X0) != $true)) | ($true != (ordinal @ X0))) <=> (ordinalTransSet = $true)),
% 0.15/0.39 inference(flattening,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 (ordinalTransSet = $true) <=> ! [X0] : (! [X1,X2] : ((((in @ X1 @ X0) = $true) | ((in @ X1 @ X2) != $true)) | ((in @ X2 @ X0) != $true)) | ($true != (ordinal @ X0)))),
% 0.15/0.39 inference(ennf_transformation,[],[f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 (ordinalTransSet = $true) <=> ! [X0] : (($true = (ordinal @ X0)) => ! [X1,X2] : (((in @ X2 @ X0) = $true) => (((in @ X1 @ X2) = $true) => ((in @ X1 @ X0) = $true))))),
% 0.15/0.39 inference(fool_elimination,[],[f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 (! [X0] : ((ordinal @ X0) => ! [X1,X2] : ((in @ X2 @ X0) => ((in @ X1 @ X2) => (in @ X1 @ X0)))) = ordinalTransSet)),
% 0.15/0.39 inference(rectify,[],[f7])).
% 0.15/0.39 thf(f7,axiom,(
% 0.15/0.39 (! [X3] : ((ordinal @ X3) => ! [X0,X1] : ((in @ X1 @ X3) => ((in @ X0 @ X1) => (in @ X0 @ X3)))) = ordinalTransSet)),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinalTransSet)).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ((subset @ X1 @ X0) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f59])).
% 0.15/0.39 thf(f59,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ X1 @ X0) = $true) | ($true != (in @ (sK0 @ X1 @ X0) @ X0))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f46,f49])).
% 0.15/0.39 thf(f46,plain,(
% 0.15/0.39 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ((subset @ X1 @ X0) = $true) | (subsetI1 != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f35])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ((subset @ sK4 @ sK3) != $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f38])).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (14144)------------------------------
% 0.15/0.39 % (14144)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (14144)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14144)Memory used [KB]: 5500
% 0.15/0.39 % (14144)Time elapsed: 0.009 s
% 0.15/0.39 % (14144)Instructions burned: 7 (million)
% 0.15/0.39 % (14144)------------------------------
% 0.15/0.39 % (14144)------------------------------
% 0.15/0.39 % (14138)Success in time 0.022 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------