TSTP Solution File: SEU513^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU513^1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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:49:15 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.12 % Problem : SEU513^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.14 % 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.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:33:08 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a TH0_THM_EQU_NAR problem
% 0.13/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.38 % (24883)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.38 % (24882)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.22/0.38 % (24887)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.22/0.38 % (24886)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.38 % (24884)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.22/0.38 % (24883)Instruction limit reached!
% 0.22/0.38 % (24883)------------------------------
% 0.22/0.38 % (24883)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (24883)Termination reason: Unknown
% 0.22/0.38 % (24883)Termination phase: shuffling
% 0.22/0.38
% 0.22/0.38 % (24883)Memory used [KB]: 1023
% 0.22/0.38 % (24883)Time elapsed: 0.003 s
% 0.22/0.38 % (24883)Instructions burned: 4 (million)
% 0.22/0.38 % (24883)------------------------------
% 0.22/0.38 % (24883)------------------------------
% 0.22/0.38 % (24885)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.22/0.38 % (24887)Instruction limit reached!
% 0.22/0.38 % (24887)------------------------------
% 0.22/0.38 % (24887)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (24887)Termination reason: Unknown
% 0.22/0.38 % (24887)Termination phase: shuffling
% 0.22/0.38
% 0.22/0.38 % (24887)Memory used [KB]: 1023
% 0.22/0.38 % (24887)Time elapsed: 0.003 s
% 0.22/0.38 % (24887)Instructions burned: 3 (million)
% 0.22/0.38 % (24887)------------------------------
% 0.22/0.38 % (24887)------------------------------
% 0.22/0.38 % (24880)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.22/0.38 % (24884)Instruction limit reached!
% 0.22/0.38 % (24884)------------------------------
% 0.22/0.38 % (24884)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (24884)Termination reason: Unknown
% 0.22/0.38 % (24884)Termination phase: shuffling
% 0.22/0.38
% 0.22/0.38 % (24884)Memory used [KB]: 1023
% 0.22/0.38 % (24884)Time elapsed: 0.003 s
% 0.22/0.38 % (24884)Instructions burned: 3 (million)
% 0.22/0.38 % (24884)------------------------------
% 0.22/0.38 % (24884)------------------------------
% 0.22/0.38 % (24881)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.22/0.38 % (24881)Instruction limit reached!
% 0.22/0.38 % (24881)------------------------------
% 0.22/0.38 % (24881)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (24881)Termination reason: Unknown
% 0.22/0.38 % (24881)Termination phase: shuffling
% 0.22/0.38
% 0.22/0.38 % (24881)Memory used [KB]: 1151
% 0.22/0.38 % (24881)Time elapsed: 0.005 s
% 0.22/0.38 % (24881)Instructions burned: 5 (million)
% 0.22/0.38 % (24881)------------------------------
% 0.22/0.38 % (24881)------------------------------
% 0.22/0.39 % (24886)Instruction limit reached!
% 0.22/0.39 % (24886)------------------------------
% 0.22/0.39 % (24886)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (24886)Termination reason: Unknown
% 0.22/0.39 % (24886)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (24886)Memory used [KB]: 1407
% 0.22/0.39 % (24886)Time elapsed: 0.010 s
% 0.22/0.39 % (24886)Instructions burned: 19 (million)
% 0.22/0.39 % (24886)------------------------------
% 0.22/0.39 % (24886)------------------------------
% 0.22/0.39 % (24882)Instruction limit reached!
% 0.22/0.39 % (24882)------------------------------
% 0.22/0.39 % (24882)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (24882)Termination reason: Unknown
% 0.22/0.39 % (24882)Termination phase: Saturation
% 0.22/0.39
% 0.22/0.39 % (24882)Memory used [KB]: 5756
% 0.22/0.39 % (24882)Time elapsed: 0.013 s
% 0.22/0.39 % (24882)Instructions burned: 27 (million)
% 0.22/0.39 % (24882)------------------------------
% 0.22/0.39 % (24882)------------------------------
% 0.22/0.39 % (24889)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.39 % (24890)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.39 % (24885)First to succeed.
% 0.22/0.39 % (24890)Instruction limit reached!
% 0.22/0.39 % (24890)------------------------------
% 0.22/0.39 % (24890)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (24890)Termination reason: Unknown
% 0.22/0.39 % (24890)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (24890)Memory used [KB]: 1023
% 0.22/0.39 % (24890)Time elapsed: 0.003 s
% 0.22/0.39 % (24890)Instructions burned: 4 (million)
% 0.22/0.39 % (24890)------------------------------
% 0.22/0.39 % (24890)------------------------------
% 0.22/0.39 % (24888)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 % (24885)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_0, type, in: $i > $i > $o).
% 0.22/0.40 thf(func_def_1, type, exu: ($i > $o) > $o).
% 0.22/0.40 thf(func_def_6, type, setadjoin: $i > $i > $i).
% 0.22/0.40 thf(func_def_8, type, powerset: $i > $i).
% 0.22/0.40 thf(func_def_10, type, setunion: $i > $i).
% 0.22/0.40 thf(func_def_19, type, descr: ($i > $o) > $i).
% 0.22/0.40 thf(func_def_21, type, dsetconstr: $i > ($i > $o) > $i).
% 0.22/0.40 thf(func_def_26, type, prop2set: $o > $i).
% 0.22/0.40 thf(func_def_36, type, nonempty: $i > $o).
% 0.22/0.40 thf(func_def_53, type, sP0: $i > $i > $o).
% 0.22/0.40 thf(func_def_54, type, sP1: $i > $o).
% 0.22/0.40 thf(func_def_55, type, sP2: $i > $i > $o).
% 0.22/0.40 thf(func_def_56, type, sP3: $i > $i > $o).
% 0.22/0.40 thf(func_def_58, type, sK5: $i > $o).
% 0.22/0.40 thf(func_def_64, type, sK11: $i > $i > $i).
% 0.22/0.40 thf(func_def_68, type, sK15: $i > $o).
% 0.22/0.40 thf(func_def_71, type, sK18: $i > $i > $i).
% 0.22/0.40 thf(func_def_72, type, sK19: $i > $i > $i).
% 0.22/0.40 thf(func_def_73, type, sK20: $i > $i > $i).
% 0.22/0.40 thf(func_def_74, type, sK21: $i > $i > $i).
% 0.22/0.40 thf(func_def_75, type, sK22: $i > $i > $i > $i).
% 0.22/0.40 thf(func_def_76, type, sK23: $i > $i).
% 0.22/0.40 thf(func_def_77, type, sK24: $i > $i).
% 0.22/0.40 thf(func_def_78, type, sK25: $i > $i).
% 0.22/0.40 thf(func_def_79, type, sK26: $i > $i).
% 0.22/0.40 thf(func_def_80, type, sK27: $i > $i > $i > $i).
% 0.22/0.40 thf(func_def_81, type, sK28: $i > $i > $i > $i).
% 0.22/0.40 thf(func_def_82, type, sK29: $i > $i > $i).
% 0.22/0.40 thf(func_def_83, type, sK30: $i > $i > $i).
% 0.22/0.40 thf(func_def_84, type, sK31: $i > $i > $i).
% 0.22/0.40 thf(func_def_86, type, sK33: $i > $i).
% 0.22/0.40 thf(func_def_87, type, sK34: $i > $i).
% 0.22/0.40 thf(func_def_88, type, sK35: $i > $i).
% 0.22/0.40 thf(func_def_89, type, sK36: $i > $i > $i).
% 0.22/0.40 thf(func_def_93, type, sK40: $i > $i).
% 0.22/0.40 thf(func_def_94, type, sK41: $i > $i).
% 0.22/0.40 thf(func_def_97, type, sK44: $i > $i).
% 0.22/0.40 thf(func_def_99, type, sK46: $i > $o).
% 0.22/0.40 thf(func_def_102, type, sK49: $i > $i).
% 0.22/0.40 thf(func_def_105, type, sK52: $i > $i > $i).
% 0.22/0.40 thf(func_def_110, type, sK57: $i > $o).
% 0.22/0.40 thf(func_def_111, type, sK58: $i > $i).
% 0.22/0.40 thf(func_def_112, type, sK59: ($i > $o) > $i).
% 0.22/0.40 thf(func_def_113, type, sK60: $i > $o).
% 0.22/0.40 thf(func_def_118, type, sK65: $i > $i > $i).
% 0.22/0.40 thf(func_def_119, type, sK66: $i > $i > $i).
% 0.22/0.40 thf(func_def_125, type, sK72: $i > $o).
% 0.22/0.40 thf(func_def_129, type, sK76: $i > $i).
% 0.22/0.40 thf(func_def_132, type, sK79: $i > $i > $o).
% 0.22/0.40 thf(func_def_133, type, sK80: $i > $i).
% 0.22/0.40 thf(func_def_134, type, sK81: $i > $i).
% 0.22/0.40 thf(func_def_135, type, sK82: ($i > $i > $o) > $i > $i).
% 0.22/0.40 thf(func_def_136, type, sK83: $i > ($i > $i > $o) > $i > $i).
% 0.22/0.40 thf(func_def_137, type, sK84: ($i > $i > $o) > $i > $i).
% 0.22/0.40 thf(func_def_138, type, sK85: $i > $i).
% 0.22/0.40 thf(func_def_141, type, sK88: ($i > $o) > $i).
% 0.22/0.40 thf(func_def_142, type, sK89: $i > $o).
% 0.22/0.40 thf(func_def_144, type, ph91: !>[X0: $tType]:(X0)).
% 0.22/0.40 thf(f626,plain,(
% 0.22/0.40 $false),
% 0.22/0.40 inference(subsumption_resolution,[],[f415,f608])).
% 0.22/0.40 thf(f608,plain,(
% 0.22/0.40 ( ! [X4 : $i,X5 : $i] : (((in @ X5 @ (setadjoin @ X5 @ X4)) = $true)) )),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f567])).
% 0.22/0.40 thf(f567,plain,(
% 0.22/0.40 ( ! [X4 : $i,X5 : $i] : (($true != $true) | ((in @ X5 @ (setadjoin @ X5 @ X4)) = $true)) )),
% 0.22/0.40 inference(equality_resolution,[],[f542])).
% 0.22/0.40 thf(f542,plain,(
% 0.22/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ (setadjoin @ X3 @ X4)) = $true) | (X3 != X5) | ($true != $true)) )),
% 0.22/0.40 inference(definition_unfolding,[],[f429,f421])).
% 0.22/0.40 thf(f421,plain,(
% 0.22/0.40 (setadjoinAx = $true)),
% 0.22/0.40 inference(cnf_transformation,[],[f132])).
% 0.22/0.40 thf(f132,plain,(
% 0.22/0.40 (omegaSAx = $true) & (exuE3e = $true) & (omegaIndAx = $true) & (noeltsimpempty = $true) & (emptyI = $true) & (wellorderingAx = $true) & (setadjoinAx = $true) & (emptysetimpfalse = $true) & (emptysetAx = $true) & (setunionAx = $true) & (powersetAx = $true) & (descrp = $true) & ((in @ emptyset @ (setadjoin @ emptyset @ emptyset)) != $true) & (nonemptyI = $true) & (dsetconstrER = $true) & (dsetconstrEL = $true) & (replAx = $true) & (exuE1 = $true) & (notinemptyset = $true) & (setadjoinIL = $true) & (nonemptyI1 = $true) & (prop2setE = $true) & (omega0Ax = $true) & (nonemptyE1 = $true) & (foundationAx = $true) & (setextAx = $true) & (setbeta = $true) & (dsetconstrI = $true) & (emptysetE = $true) & (setext = $true)),
% 0.22/0.40 inference(flattening,[],[f131])).
% 0.22/0.40 thf(f131,plain,(
% 0.22/0.40 ((((((((((((((((((((((((((((((in @ emptyset @ (setadjoin @ emptyset @ emptyset)) != $true) & (setadjoinIL = $true)) & (nonemptyI1 = $true)) & (nonemptyI = $true)) & (nonemptyE1 = $true)) & (setbeta = $true)) & (noeltsimpempty = $true)) & (emptyI = $true)) & (setext = $true)) & (exuE3e = $true)) & (notinemptyset = $true)) & (emptysetimpfalse = $true)) & (emptysetE = $true)) & (prop2setE = $true)) & (exuE1 = $true)) & (dsetconstrER = $true)) & (dsetconstrEL = $true)) & (dsetconstrI = $true)) & (descrp = $true)) & (wellorderingAx = $true)) & (foundationAx = $true)) & (replAx = $true)) & (omegaIndAx = $true)) & (omegaSAx = $true)) & (omega0Ax = $true)) & (setunionAx = $true)) & (powersetAx = $true)) & (setadjoinAx = $true)) & (emptysetAx = $true)) & (setextAx = $true)),
% 0.22/0.40 inference(ennf_transformation,[],[f76])).
% 0.22/0.40 thf(f76,plain,(
% 0.22/0.40 ~((setextAx = $true) => ((emptysetAx = $true) => ((setadjoinAx = $true) => ((powersetAx = $true) => ((setunionAx = $true) => ((omega0Ax = $true) => ((omegaSAx = $true) => ((omegaIndAx = $true) => ((replAx = $true) => ((foundationAx = $true) => ((wellorderingAx = $true) => ((descrp = $true) => ((dsetconstrI = $true) => ((dsetconstrEL = $true) => ((dsetconstrER = $true) => ((exuE1 = $true) => ((prop2setE = $true) => ((emptysetE = $true) => ((emptysetimpfalse = $true) => ((notinemptyset = $true) => ((exuE3e = $true) => ((setext = $true) => ((emptyI = $true) => ((noeltsimpempty = $true) => ((setbeta = $true) => ((nonemptyE1 = $true) => ((nonemptyI = $true) => ((nonemptyI1 = $true) => ((setadjoinIL = $true) => ((in @ emptyset @ (setadjoin @ emptyset @ emptyset)) = $true))))))))))))))))))))))))))))))),
% 0.22/0.40 inference(fool_elimination,[],[f75])).
% 0.22/0.40 thf(f75,plain,(
% 0.22/0.40 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (in @ emptyset @ (setadjoin @ emptyset @ emptyset)))))))))))))))))))))))))))))))),
% 0.22/0.40 inference(rectify,[],[f34])).
% 0.22/0.40 thf(f34,negated_conjecture,(
% 0.22/0.40 ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (in @ emptyset @ (setadjoin @ emptyset @ emptyset)))))))))))))))))))))))))))))))),
% 0.22/0.40 inference(negated_conjecture,[],[f33])).
% 0.22/0.40 thf(f33,conjecture,(
% 0.22/0.40 setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => (prop2setE => (emptysetE => (emptysetimpfalse => (notinemptyset => (exuE3e => (setext => (emptyI => (noeltsimpempty => (setbeta => (nonemptyE1 => (nonemptyI => (nonemptyI1 => (setadjoinIL => (in @ emptyset @ (setadjoin @ emptyset @ emptyset))))))))))))))))))))))))))))))),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyinunitempty)).
% 0.22/0.40 thf(f429,plain,(
% 0.22/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ (setadjoin @ X3 @ X4)) = $true) | (X3 != X5) | (setadjoinAx != $true)) )),
% 0.22/0.40 inference(cnf_transformation,[],[f260])).
% 0.22/0.40 thf(f260,plain,(
% 0.22/0.40 ((setadjoinAx = $true) | (((((in @ sK69 @ sK68) != $true) & (sK69 != sK67)) | ((in @ sK69 @ (setadjoin @ sK67 @ sK68)) != $true)) & (((in @ sK69 @ sK68) = $true) | (sK69 = sK67) | ((in @ sK69 @ (setadjoin @ sK67 @ sK68)) = $true)))) & (! [X3,X4,X5] : ((((in @ X5 @ (setadjoin @ X3 @ X4)) = $true) | (((in @ X5 @ X4) != $true) & (X3 != X5))) & (((in @ X5 @ X4) = $true) | (X3 = X5) | ((in @ X5 @ (setadjoin @ X3 @ X4)) != $true))) | (setadjoinAx != $true))),
% 0.22/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK67,sK68,sK69])],[f258,f259])).
% 0.22/0.40 thf(f259,plain,(
% 0.22/0.40 ? [X0,X1,X2] : (((((in @ X2 @ X1) != $true) & (X0 != X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true)) & (((in @ X2 @ X1) = $true) | (X0 = X2) | ((in @ X2 @ (setadjoin @ X0 @ X1)) = $true))) => (((((in @ sK69 @ sK68) != $true) & (sK69 != sK67)) | ((in @ sK69 @ (setadjoin @ sK67 @ sK68)) != $true)) & (((in @ sK69 @ sK68) = $true) | (sK69 = sK67) | ((in @ sK69 @ (setadjoin @ sK67 @ sK68)) = $true)))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f258,plain,(
% 0.22/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : (((((in @ X2 @ X1) != $true) & (X0 != X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true)) & (((in @ X2 @ X1) = $true) | (X0 = X2) | ((in @ X2 @ (setadjoin @ X0 @ X1)) = $true)))) & (! [X3,X4,X5] : ((((in @ X5 @ (setadjoin @ X3 @ X4)) = $true) | (((in @ X5 @ X4) != $true) & (X3 != X5))) & (((in @ X5 @ X4) = $true) | (X3 = X5) | ((in @ X5 @ (setadjoin @ X3 @ X4)) != $true))) | (setadjoinAx != $true))),
% 0.22/0.40 inference(rectify,[],[f257])).
% 0.22/0.40 thf(f257,plain,(
% 0.22/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : (((((in @ X2 @ X1) != $true) & (X0 != X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true)) & (((in @ X2 @ X1) = $true) | (X0 = X2) | ((in @ X2 @ (setadjoin @ X0 @ X1)) = $true)))) & (! [X0,X1,X2] : ((((in @ X2 @ (setadjoin @ X0 @ X1)) = $true) | (((in @ X2 @ X1) != $true) & (X0 != X2))) & (((in @ X2 @ X1) = $true) | (X0 = X2) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true))) | (setadjoinAx != $true))),
% 0.22/0.40 inference(flattening,[],[f256])).
% 0.22/0.40 thf(f256,plain,(
% 0.22/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : (((((in @ X2 @ X1) != $true) & (X0 != X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true)) & ((((in @ X2 @ X1) = $true) | (X0 = X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) = $true)))) & (! [X0,X1,X2] : ((((in @ X2 @ (setadjoin @ X0 @ X1)) = $true) | (((in @ X2 @ X1) != $true) & (X0 != X2))) & ((((in @ X2 @ X1) = $true) | (X0 = X2)) | ((in @ X2 @ (setadjoin @ X0 @ X1)) != $true))) | (setadjoinAx != $true))),
% 0.22/0.40 inference(nnf_transformation,[],[f49])).
% 0.22/0.40 thf(f49,plain,(
% 0.22/0.40 (setadjoinAx = $true) <=> ! [X0,X1,X2] : (((in @ X2 @ (setadjoin @ X0 @ X1)) = $true) <=> (((in @ X2 @ X1) = $true) | (X0 = X2)))),
% 0.22/0.40 inference(fool_elimination,[],[f48])).
% 0.22/0.40 thf(f48,plain,(
% 0.22/0.40 (setadjoinAx = ! [X0,X1,X2] : ((in @ X2 @ (setadjoin @ X0 @ X1)) <=> ((in @ X2 @ X1) | (X0 = X2))))),
% 0.22/0.40 inference(rectify,[],[f4])).
% 0.22/0.40 thf(f4,axiom,(
% 0.22/0.40 (setadjoinAx = ! [X1,X3,X2] : ((in @ X2 @ (setadjoin @ X1 @ X3)) <=> ((in @ X2 @ X3) | (X1 = X2))))),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinAx)).
% 0.22/0.40 thf(f415,plain,(
% 0.22/0.40 ((in @ emptyset @ (setadjoin @ emptyset @ emptyset)) != $true)),
% 0.22/0.40 inference(cnf_transformation,[],[f132])).
% 0.22/0.40 % SZS output end Proof for theBenchmark
% 0.22/0.40 % (24885)------------------------------
% 0.22/0.40 % (24885)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (24885)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (24885)Memory used [KB]: 6012
% 0.22/0.40 % (24885)Time elapsed: 0.018 s
% 0.22/0.40 % (24885)Instructions burned: 30 (million)
% 0.22/0.40 % (24885)------------------------------
% 0.22/0.40 % (24885)------------------------------
% 0.22/0.40 % (24879)Success in time 0.03 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------