TSTP Solution File: SEU512^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEU512^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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 : Mon Jun 24 15:40:56 EDT 2024
% Result : Theorem 0.19s 0.40s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU512^1 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.12 % Command : run_vampire %s %d THM
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 13:27:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.36 This is a TH0_THM_EQU_NAR problem
% 0.19/0.36 Running higher-order theorem proving
% 0.19/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.19/0.38 % (12132)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.19/0.38 % (12133)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.19/0.38 % (12134)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.38 % (12131)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.19/0.38 % (12136)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.19/0.38 % (12135)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.19/0.38 % (12137)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.38 % (12134)Instruction limit reached!
% 0.19/0.38 % (12134)------------------------------
% 0.19/0.38 % (12134)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.38 % (12134)Termination reason: Unknown
% 0.19/0.38 % (12135)Instruction limit reached!
% 0.19/0.38 % (12135)------------------------------
% 0.19/0.38 % (12135)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.38 % (12135)Termination reason: Unknown
% 0.19/0.38 % (12135)Termination phase: shuffling
% 0.19/0.38
% 0.19/0.38 % (12135)Memory used [KB]: 1023
% 0.19/0.38 % (12135)Time elapsed: 0.003 s
% 0.19/0.38 % (12135)Instructions burned: 3 (million)
% 0.19/0.38 % (12135)------------------------------
% 0.19/0.38 % (12135)------------------------------
% 0.19/0.38 % (12134)Termination phase: shuffling
% 0.19/0.38
% 0.19/0.38 % (12134)Memory used [KB]: 1023
% 0.19/0.38 % (12134)Time elapsed: 0.004 s
% 0.19/0.38 % (12134)Instructions burned: 3 (million)
% 0.19/0.38 % (12134)------------------------------
% 0.19/0.38 % (12134)------------------------------
% 0.19/0.38 % (12132)Instruction limit reached!
% 0.19/0.38 % (12132)------------------------------
% 0.19/0.38 % (12132)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.38 % (12132)Termination reason: Unknown
% 0.19/0.38 % (12132)Termination phase: shuffling
% 0.19/0.38
% 0.19/0.38 % (12132)Memory used [KB]: 1151
% 0.19/0.38 % (12132)Time elapsed: 0.005 s
% 0.19/0.38 % (12132)Instructions burned: 5 (million)
% 0.19/0.38 % (12132)------------------------------
% 0.19/0.38 % (12132)------------------------------
% 0.19/0.39 % (12137)Instruction limit reached!
% 0.19/0.39 % (12137)------------------------------
% 0.19/0.39 % (12137)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39 % (12137)Termination reason: Unknown
% 0.19/0.39 % (12137)Termination phase: Property scanning
% 0.19/0.39
% 0.19/0.39 % (12137)Memory used [KB]: 1407
% 0.19/0.39 % (12137)Time elapsed: 0.013 s
% 0.19/0.39 % (12137)Instructions burned: 19 (million)
% 0.19/0.39 % (12137)------------------------------
% 0.19/0.39 % (12137)------------------------------
% 0.19/0.39 % (12133)Instruction limit reached!
% 0.19/0.39 % (12133)------------------------------
% 0.19/0.39 % (12133)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39 % (12133)Termination reason: Unknown
% 0.19/0.39 % (12133)Termination phase: Saturation
% 0.19/0.39
% 0.19/0.39 % (12133)Memory used [KB]: 5756
% 0.19/0.39 % (12133)Time elapsed: 0.017 s
% 0.19/0.39 % (12133)Instructions burned: 28 (million)
% 0.19/0.39 % (12133)------------------------------
% 0.19/0.39 % (12133)------------------------------
% 0.19/0.40 % (12138)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.19/0.40 % (12139)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.19/0.40 % (12136)First to succeed.
% 0.19/0.40 % (12140)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.19/0.40 % (12138)Instruction limit reached!
% 0.19/0.40 % (12138)------------------------------
% 0.19/0.40 % (12138)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.40 % (12138)Termination reason: Unknown
% 0.19/0.40 % (12138)Termination phase: shuffling
% 0.19/0.40
% 0.19/0.40 % (12138)Memory used [KB]: 1023
% 0.19/0.40 % (12138)Time elapsed: 0.004 s
% 0.19/0.40 % (12138)Instructions burned: 4 (million)
% 0.19/0.40 % (12138)------------------------------
% 0.19/0.40 % (12138)------------------------------
% 0.19/0.40 % (12136)Refutation found. Thanks to Tanya!
% 0.19/0.40 % SZS status Theorem for theBenchmark
% 0.19/0.40 % SZS output start Proof for theBenchmark
% 0.19/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.19/0.40 thf(func_def_1, type, exu: ($i > $o) > $o).
% 0.19/0.40 thf(func_def_6, type, setadjoin: $i > $i > $i).
% 0.19/0.40 thf(func_def_8, type, powerset: $i > $i).
% 0.19/0.40 thf(func_def_10, type, setunion: $i > $i).
% 0.19/0.40 thf(func_def_19, type, descr: ($i > $o) > $i).
% 0.19/0.40 thf(func_def_21, type, dsetconstr: $i > ($i > $o) > $i).
% 0.19/0.40 thf(func_def_26, type, prop2set: $o > $i).
% 0.19/0.40 thf(func_def_36, type, nonempty: $i > $o).
% 0.19/0.40 thf(func_def_52, type, sP0: $i > $i > $o).
% 0.19/0.40 thf(func_def_53, type, sP1: $i > $o).
% 0.19/0.40 thf(func_def_54, type, sP2: $i > $i > $o).
% 0.19/0.40 thf(func_def_55, type, sP3: $i > $i > $o).
% 0.19/0.40 thf(func_def_59, type, sK7: $i > $i > $i).
% 0.19/0.40 thf(func_def_60, type, sK8: $i > $i > $i).
% 0.19/0.40 thf(func_def_61, type, sK9: $i > $i > $i).
% 0.19/0.40 thf(func_def_62, type, sK10: $i > $i > $i).
% 0.19/0.40 thf(func_def_63, type, sK11: $i > $i > $i > $i).
% 0.19/0.40 thf(func_def_64, type, sK12: $i > $i).
% 0.19/0.40 thf(func_def_65, type, sK13: $i > $i).
% 0.19/0.40 thf(func_def_66, type, sK14: $i > $i).
% 0.19/0.40 thf(func_def_67, type, sK15: $i > $i).
% 0.19/0.40 thf(func_def_68, type, sK16: $i > $i > $i > $i).
% 0.19/0.40 thf(func_def_69, type, sK17: $i > $i > $i > $i).
% 0.19/0.40 thf(func_def_70, type, sK18: $i > $i > $i).
% 0.19/0.40 thf(func_def_71, type, sK19: $i > $i > $i).
% 0.19/0.40 thf(func_def_72, type, sK20: $i > $i > $i).
% 0.19/0.40 thf(func_def_74, type, sK22: $i > $i).
% 0.19/0.40 thf(func_def_75, type, sK23: $i > $i).
% 0.19/0.40 thf(func_def_76, type, sK24: $i > $i).
% 0.19/0.40 thf(func_def_77, type, sK25: $i > $i > $i).
% 0.19/0.40 thf(func_def_79, type, sK27: $i > $o).
% 0.19/0.40 thf(func_def_83, type, sK31: $i > $i > $i).
% 0.19/0.40 thf(func_def_84, type, sK32: $i > $i > $o).
% 0.19/0.40 thf(func_def_86, type, sK34: $i > $i).
% 0.19/0.40 thf(func_def_87, type, sK35: $i > $i).
% 0.19/0.40 thf(func_def_88, type, sK36: $i > ($i > $i > $o) > $i).
% 0.19/0.40 thf(func_def_89, type, sK37: $i > ($i > $i > $o) > $i).
% 0.19/0.40 thf(func_def_90, type, sK38: $i > $i > ($i > $i > $o) > $i).
% 0.19/0.40 thf(func_def_91, type, sK39: $i > $i).
% 0.19/0.40 thf(func_def_97, type, sK45: $i > $o).
% 0.19/0.40 thf(func_def_104, type, sK52: $i > $o).
% 0.19/0.40 thf(func_def_110, type, sK58: $i > $o).
% 0.19/0.40 thf(func_def_112, type, sK60: $i > $i).
% 0.19/0.40 thf(func_def_114, type, sK62: $i > $i).
% 0.19/0.40 thf(func_def_116, type, sK64: $i > $o).
% 0.19/0.40 thf(func_def_117, type, sK65: ($i > $o) > $i).
% 0.19/0.40 thf(func_def_118, type, sK66: $i > $i > $i).
% 0.19/0.40 thf(func_def_119, type, sK67: $i > $i > $i).
% 0.19/0.40 thf(func_def_122, type, sK70: $i > $i).
% 0.19/0.40 thf(func_def_124, type, sK72: $i > $i).
% 0.19/0.40 thf(func_def_129, type, sK77: $i > $i).
% 0.19/0.40 thf(func_def_131, type, sK79: $i > $i > $i).
% 0.19/0.40 thf(func_def_135, type, sK83: ($i > $o) > $i).
% 0.19/0.40 thf(func_def_136, type, sK84: $i > $o).
% 0.19/0.40 thf(func_def_137, type, sK85: $i > $i).
% 0.19/0.40 thf(func_def_140, type, sK88: $i > $o).
% 0.19/0.40 thf(func_def_143, type, ph91: !>[X0: $tType]:(X0)).
% 0.19/0.40 thf(f623,plain,(
% 0.19/0.40 $false),
% 0.19/0.40 inference(subsumption_resolution,[],[f420,f610])).
% 0.19/0.40 thf(f610,plain,(
% 0.19/0.40 ( ! [X3 : $i,X5 : $i] : (($true = (in @ X5 @ (setadjoin @ X5 @ X3)))) )),
% 0.19/0.40 inference(trivial_inequality_removal,[],[f557])).
% 0.19/0.40 thf(f557,plain,(
% 0.19/0.40 ( ! [X3 : $i,X5 : $i] : (($true = (in @ X5 @ (setadjoin @ X5 @ X3))) | ($true != $true)) )),
% 0.19/0.40 inference(equality_resolution,[],[f491])).
% 0.19/0.40 thf(f491,plain,(
% 0.19/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ X5 @ (setadjoin @ X4 @ X3))) | (X4 != X5) | ($true != $true)) )),
% 0.19/0.40 inference(definition_unfolding,[],[f360,f423])).
% 0.19/0.40 thf(f423,plain,(
% 0.19/0.40 (setadjoinAx = $true)),
% 0.19/0.40 inference(cnf_transformation,[],[f264])).
% 0.19/0.40 thf(f264,plain,(
% 0.19/0.40 (dsetconstrEL = $true) & (emptysetAx = $true) & (emptysetimpfalse = $true) & (setext = $true) & (prop2setE = $true) & (nonemptyI1 = $true) & (descrp = $true) & (omegaIndAx = $true) & (setextAx = $true) & (setbeta = $true) & (setunionAx = $true) & (dsetconstrER = $true) & (setadjoinAx = $true) & (wellorderingAx = $true) & (replAx = $true) & ($true != (in @ sK74 @ (setadjoin @ sK74 @ sK75))) & (dsetconstrI = $true) & (nonemptyE1 = $true) & (omegaSAx = $true) & (notinemptyset = $true) & (omega0Ax = $true) & (exuE3e = $true) & (nonemptyI = $true) & (emptyI = $true) & (foundationAx = $true) & (exuE1 = $true) & (powersetAx = $true) & (emptysetE = $true) & (noeltsimpempty = $true)),
% 0.19/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK74,sK75])],[f114,f263])).
% 0.19/0.40 thf(f263,plain,(
% 0.19/0.40 ? [X0,X1] : ($true != (in @ X0 @ (setadjoin @ X0 @ X1))) => ($true != (in @ sK74 @ (setadjoin @ sK74 @ sK75)))),
% 0.19/0.40 introduced(choice_axiom,[])).
% 0.19/0.40 thf(f114,plain,(
% 0.19/0.40 (dsetconstrEL = $true) & (emptysetAx = $true) & (emptysetimpfalse = $true) & (setext = $true) & (prop2setE = $true) & (nonemptyI1 = $true) & (descrp = $true) & (omegaIndAx = $true) & (setextAx = $true) & (setbeta = $true) & (setunionAx = $true) & (dsetconstrER = $true) & (setadjoinAx = $true) & (wellorderingAx = $true) & (replAx = $true) & ? [X0,X1] : ($true != (in @ X0 @ (setadjoin @ X0 @ X1))) & (dsetconstrI = $true) & (nonemptyE1 = $true) & (omegaSAx = $true) & (notinemptyset = $true) & (omega0Ax = $true) & (exuE3e = $true) & (nonemptyI = $true) & (emptyI = $true) & (foundationAx = $true) & (exuE1 = $true) & (powersetAx = $true) & (emptysetE = $true) & (noeltsimpempty = $true)),
% 0.19/0.40 inference(flattening,[],[f113])).
% 0.19/0.40 thf(f113,plain,(
% 0.19/0.40 (((((((((((((((((((((((((((? [X0,X1] : ($true != (in @ X0 @ (setadjoin @ X0 @ X1))) & (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.19/0.40 inference(ennf_transformation,[],[f93])).
% 0.19/0.40 thf(f93,plain,(
% 0.19/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) => ! [X0,X1] : ($true = (in @ X0 @ (setadjoin @ X0 @ X1)))))))))))))))))))))))))))))))),
% 0.19/0.40 inference(fool_elimination,[],[f92])).
% 0.19/0.40 thf(f92,plain,(
% 0.19/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 => ! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1))))))))))))))))))))))))))))))),
% 0.19/0.40 inference(rectify,[],[f33])).
% 0.19/0.40 thf(f33,negated_conjecture,(
% 0.19/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 => ! [X1,X2] : (in @ X1 @ (setadjoin @ X1 @ X2))))))))))))))))))))))))))))))),
% 0.19/0.40 inference(negated_conjecture,[],[f32])).
% 0.19/0.40 thf(f32,conjecture,(
% 0.19/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 => ! [X1,X2] : (in @ X1 @ (setadjoin @ X1 @ X2)))))))))))))))))))))))))))))),
% 0.19/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL)).
% 0.19/0.40 thf(f360,plain,(
% 0.19/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true = (in @ X5 @ (setadjoin @ X4 @ X3))) | (X4 != X5) | (setadjoinAx != $true)) )),
% 0.19/0.40 inference(cnf_transformation,[],[f204])).
% 0.19/0.40 thf(f204,plain,(
% 0.19/0.40 ((setadjoinAx = $true) | ((($true != (in @ sK44 @ (setadjoin @ sK43 @ sK42))) | (($true != (in @ sK44 @ sK42)) & (sK44 != sK43))) & (($true = (in @ sK44 @ (setadjoin @ sK43 @ sK42))) | ($true = (in @ sK44 @ sK42)) | (sK44 = sK43)))) & (! [X3,X4,X5] : ((($true = (in @ X5 @ X3)) | (X4 = X5) | ($true != (in @ X5 @ (setadjoin @ X4 @ X3)))) & (($true = (in @ X5 @ (setadjoin @ X4 @ X3))) | (($true != (in @ X5 @ X3)) & (X4 != X5)))) | (setadjoinAx != $true))),
% 0.19/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK42,sK43,sK44])],[f202,f203])).
% 0.19/0.40 thf(f203,plain,(
% 0.19/0.40 ? [X0,X1,X2] : ((($true != (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | ($true = (in @ X2 @ X0)) | (X1 = X2))) => ((($true != (in @ sK44 @ (setadjoin @ sK43 @ sK42))) | (($true != (in @ sK44 @ sK42)) & (sK44 != sK43))) & (($true = (in @ sK44 @ (setadjoin @ sK43 @ sK42))) | ($true = (in @ sK44 @ sK42)) | (sK44 = sK43)))),
% 0.19/0.40 introduced(choice_axiom,[])).
% 0.19/0.40 thf(f202,plain,(
% 0.19/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : ((($true != (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | ($true = (in @ X2 @ X0)) | (X1 = X2)))) & (! [X3,X4,X5] : ((($true = (in @ X5 @ X3)) | (X4 = X5) | ($true != (in @ X5 @ (setadjoin @ X4 @ X3)))) & (($true = (in @ X5 @ (setadjoin @ X4 @ X3))) | (($true != (in @ X5 @ X3)) & (X4 != X5)))) | (setadjoinAx != $true))),
% 0.19/0.40 inference(rectify,[],[f201])).
% 0.19/0.40 thf(f201,plain,(
% 0.19/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : ((($true != (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | ($true = (in @ X2 @ X0)) | (X1 = X2)))) & (! [X0,X1,X2] : ((($true = (in @ X2 @ X0)) | (X1 = X2) | ($true != (in @ X2 @ (setadjoin @ X1 @ X0)))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2)))) | (setadjoinAx != $true))),
% 0.19/0.40 inference(flattening,[],[f200])).
% 0.19/0.40 thf(f200,plain,(
% 0.19/0.40 ((setadjoinAx = $true) | ? [X0,X1,X2] : ((($true != (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true = (in @ X2 @ X0)) | (X1 = X2))))) & (! [X0,X1,X2] : (((($true = (in @ X2 @ X0)) | (X1 = X2)) | ($true != (in @ X2 @ (setadjoin @ X1 @ X0)))) & (($true = (in @ X2 @ (setadjoin @ X1 @ X0))) | (($true != (in @ X2 @ X0)) & (X1 != X2)))) | (setadjoinAx != $true))),
% 0.19/0.40 inference(nnf_transformation,[],[f40])).
% 0.19/0.40 thf(f40,plain,(
% 0.19/0.40 (setadjoinAx = $true) <=> ! [X0,X1,X2] : ((($true = (in @ X2 @ X0)) | (X1 = X2)) <=> ($true = (in @ X2 @ (setadjoin @ X1 @ X0))))),
% 0.19/0.40 inference(fool_elimination,[],[f39])).
% 0.19/0.40 thf(f39,plain,(
% 0.19/0.40 (! [X0,X1,X2] : ((in @ X2 @ (setadjoin @ X1 @ X0)) <=> ((X1 = X2) | (in @ X2 @ X0))) = setadjoinAx)),
% 0.19/0.40 inference(rectify,[],[f4])).
% 0.19/0.40 thf(f4,axiom,(
% 0.19/0.40 (! [X3,X1,X2] : ((in @ X2 @ (setadjoin @ X1 @ X3)) <=> ((X1 = X2) | (in @ X2 @ X3))) = setadjoinAx)),
% 0.19/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinAx)).
% 0.19/0.40 thf(f420,plain,(
% 0.19/0.40 ($true != (in @ sK74 @ (setadjoin @ sK74 @ sK75)))),
% 0.19/0.40 inference(cnf_transformation,[],[f264])).
% 0.19/0.40 % SZS output end Proof for theBenchmark
% 0.19/0.40 % (12136)------------------------------
% 0.19/0.40 % (12136)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.40 % (12136)Termination reason: Refutation
% 0.19/0.40
% 0.19/0.40 % (12136)Memory used [KB]: 6012
% 0.19/0.40 % (12136)Time elapsed: 0.021 s
% 0.19/0.40 % (12136)Instructions burned: 30 (million)
% 0.19/0.40 % (12136)------------------------------
% 0.19/0.40 % (12136)------------------------------
% 0.19/0.40 % (12130)Success in time 0.024 s
%------------------------------------------------------------------------------