TSTP Solution File: SEU500^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU500^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n022.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:10 EDT 2024

% Result   : Theorem 0.21s 0.43s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU500^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 15:20:23 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.39  % (30875)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.14/0.39  % (30874)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.14/0.39  % (30876)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.14/0.39  % (30877)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39  % (30879)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.14/0.39  % (30878)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.14/0.39  % (30880)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39  % (30877)Instruction limit reached!
% 0.14/0.39  % (30877)------------------------------
% 0.14/0.39  % (30877)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (30877)Termination reason: Unknown
% 0.14/0.39  % (30877)Termination phase: shuffling
% 0.14/0.39  
% 0.14/0.39  % (30878)Instruction limit reached!
% 0.14/0.39  % (30878)------------------------------
% 0.14/0.39  % (30878)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (30878)Termination reason: Unknown
% 0.14/0.39  % (30878)Termination phase: shuffling
% 0.14/0.39  
% 0.14/0.39  % (30878)Memory used [KB]: 1023
% 0.14/0.39  % (30878)Time elapsed: 0.004 s
% 0.14/0.39  % (30878)Instructions burned: 2 (million)
% 0.14/0.39  % (30878)------------------------------
% 0.14/0.39  % (30878)------------------------------
% 0.14/0.39  % (30881)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.14/0.39  % (30877)Memory used [KB]: 1023
% 0.14/0.39  % (30877)Time elapsed: 0.004 s
% 0.14/0.39  % (30877)Instructions burned: 2 (million)
% 0.14/0.39  % (30877)------------------------------
% 0.14/0.39  % (30877)------------------------------
% 0.14/0.40  % (30875)Instruction limit reached!
% 0.14/0.40  % (30875)------------------------------
% 0.14/0.40  % (30875)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (30875)Termination reason: Unknown
% 0.14/0.40  % (30875)Termination phase: shuffling
% 0.14/0.40  
% 0.14/0.40  % (30875)Memory used [KB]: 1023
% 0.14/0.40  % (30875)Time elapsed: 0.006 s
% 0.14/0.40  % (30875)Instructions burned: 4 (million)
% 0.14/0.40  % (30875)------------------------------
% 0.14/0.40  % (30875)------------------------------
% 0.14/0.40  % (30881)Instruction limit reached!
% 0.14/0.40  % (30881)------------------------------
% 0.14/0.40  % (30881)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (30881)Termination reason: Unknown
% 0.14/0.40  % (30881)Termination phase: shuffling
% 0.14/0.40  
% 0.14/0.40  % (30881)Memory used [KB]: 1023
% 0.14/0.40  % (30881)Time elapsed: 0.006 s
% 0.14/0.40  % (30881)Instructions burned: 3 (million)
% 0.14/0.40  % (30881)------------------------------
% 0.14/0.40  % (30881)------------------------------
% 0.21/0.41  % (30880)Instruction limit reached!
% 0.21/0.41  % (30880)------------------------------
% 0.21/0.41  % (30880)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41  % (30880)Termination reason: Unknown
% 0.21/0.41  % (30880)Termination phase: Property scanning
% 0.21/0.41  
% 0.21/0.41  % (30880)Memory used [KB]: 1279
% 0.21/0.41  % (30880)Time elapsed: 0.019 s
% 0.21/0.41  % (30880)Instructions burned: 19 (million)
% 0.21/0.41  % (30880)------------------------------
% 0.21/0.41  % (30880)------------------------------
% 0.21/0.42  % (30883)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.21/0.42  % (30876)Instruction limit reached!
% 0.21/0.42  % (30876)------------------------------
% 0.21/0.42  % (30876)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42  % (30876)Termination reason: Unknown
% 0.21/0.42  % (30876)Termination phase: Saturation
% 0.21/0.42  
% 0.21/0.42  % (30876)Memory used [KB]: 5756
% 0.21/0.42  % (30876)Time elapsed: 0.026 s
% 0.21/0.42  % (30876)Instructions burned: 27 (million)
% 0.21/0.42  % (30876)------------------------------
% 0.21/0.42  % (30876)------------------------------
% 0.21/0.42  % (30882)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.21/0.42  % (30884)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.21/0.42  % (30885)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.21/0.42  % (30884)Instruction limit reached!
% 0.21/0.42  % (30884)------------------------------
% 0.21/0.42  % (30884)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42  % (30884)Termination reason: Unknown
% 0.21/0.42  % (30884)Termination phase: shuffling
% 0.21/0.42  
% 0.21/0.42  % (30884)Memory used [KB]: 1023
% 0.21/0.42  % (30884)Time elapsed: 0.005 s
% 0.21/0.42  % (30884)Instructions burned: 3 (million)
% 0.21/0.42  % (30884)------------------------------
% 0.21/0.42  % (30884)------------------------------
% 0.21/0.42  % (30883)Instruction limit reached!
% 0.21/0.42  % (30883)------------------------------
% 0.21/0.42  % (30883)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42  % (30883)Termination reason: Unknown
% 0.21/0.42  % (30883)Termination phase: Function definition elimination
% 0.21/0.42  
% 0.21/0.42  % (30883)Memory used [KB]: 1279
% 0.21/0.42  % (30883)Time elapsed: 0.010 s
% 0.21/0.42  % (30883)Instructions burned: 15 (million)
% 0.21/0.42  % (30883)------------------------------
% 0.21/0.42  % (30883)------------------------------
% 0.21/0.42  % (30874)First to succeed.
% 0.21/0.43  % (30874)Refutation found. Thanks to Tanya!
% 0.21/0.43  % SZS status Theorem for theBenchmark
% 0.21/0.43  % SZS output start Proof for theBenchmark
% 0.21/0.43  thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.43  thf(func_def_1, type, exu: ($i > $o) > $o).
% 0.21/0.43  thf(func_def_6, type, setadjoin: $i > $i > $i).
% 0.21/0.43  thf(func_def_8, type, powerset: $i > $i).
% 0.21/0.43  thf(func_def_10, type, setunion: $i > $i).
% 0.21/0.43  thf(func_def_19, type, descr: ($i > $o) > $i).
% 0.21/0.43  thf(func_def_21, type, dsetconstr: $i > ($i > $o) > $i).
% 0.21/0.43  thf(func_def_26, type, prop2set: $o > $i).
% 0.21/0.43  thf(func_def_46, type, sK3: $i > $i).
% 0.21/0.43  thf(func_def_47, type, sK4: $i > $i > $i).
% 0.21/0.43  thf(func_def_48, type, sK5: $i > $i > $i).
% 0.21/0.43  thf(func_def_49, type, sK6: $i > $i > $i).
% 0.21/0.43  thf(func_def_50, type, sK7: $i > $i > $i > $i).
% 0.21/0.43  thf(func_def_51, type, sK8: ($i > $o) > $i > $i).
% 0.21/0.43  thf(func_def_52, type, sK9: $i > $i).
% 0.21/0.43  thf(func_def_53, type, sK10: $i > $i > $i).
% 0.21/0.43  thf(func_def_54, type, sK11: $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_55, type, sK12: $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_56, type, sK13: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_57, type, sK14: $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_58, type, sK15: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_59, type, sK16: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_60, type, sK17: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_61, type, sK18: $i > $i > ($i > $i > $o) > $i).
% 0.21/0.43  thf(func_def_62, type, sK19: $i > $i).
% 0.21/0.43  thf(func_def_63, type, sK20: $i > $i > $i).
% 0.21/0.43  thf(func_def_64, type, sK21: $i > $i > $i).
% 0.21/0.43  thf(func_def_65, type, ph22: !>[X0: $tType]:(X0)).
% 0.21/0.43  thf(f411,plain,(
% 0.21/0.43    $false),
% 0.21/0.43    inference(subsumption_resolution,[],[f407,f85])).
% 0.21/0.43  thf(f85,plain,(
% 0.21/0.43    (sK1 != $true)),
% 0.21/0.43    inference(cnf_transformation,[],[f60])).
% 0.21/0.43  thf(f60,plain,(
% 0.21/0.43    (dsetconstrER = $true) & (emptysetAx = $true) & (omegaIndAx = $true) & (replAx = $true) & (setunionAx = $true) & (dsetconstrEL = $true) & (wellorderingAx = $true) & (omegaSAx = $true) & (setextAx = $true) & (((in @ sK0 @ (prop2set @ sK1)) = $true) & (sK1 != $true)) & (omega0Ax = $true) & (exuE1 = $true) & (powersetAx = $true) & (setadjoinAx = $true) & (foundationAx = $true) & (dsetconstrI = $true) & (descrp = $true)),
% 0.21/0.43    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f58,f59])).
% 0.21/0.43  thf(f59,plain,(
% 0.21/0.43    ? [X0,X1 : $o] : (($true = (in @ X0 @ (prop2set @ X1))) & ($true != X1)) => (((in @ sK0 @ (prop2set @ sK1)) = $true) & (sK1 != $true))),
% 0.21/0.43    introduced(choice_axiom,[])).
% 0.21/0.43  thf(f58,plain,(
% 0.21/0.43    (dsetconstrER = $true) & (emptysetAx = $true) & (omegaIndAx = $true) & (replAx = $true) & (setunionAx = $true) & (dsetconstrEL = $true) & (wellorderingAx = $true) & (omegaSAx = $true) & (setextAx = $true) & ? [X0,X1 : $o] : (($true = (in @ X0 @ (prop2set @ X1))) & ($true != X1)) & (omega0Ax = $true) & (exuE1 = $true) & (powersetAx = $true) & (setadjoinAx = $true) & (foundationAx = $true) & (dsetconstrI = $true) & (descrp = $true)),
% 0.21/0.43    inference(flattening,[],[f57])).
% 0.21/0.43  thf(f57,plain,(
% 0.21/0.43    (((((((((((((((? [X0,X1 : $o] : (($true = (in @ X0 @ (prop2set @ X1))) & ($true != X1)) & (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.21/0.43    inference(ennf_transformation,[],[f41])).
% 0.21/0.43  thf(f41,plain,(
% 0.21/0.43    ~((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) => ! [X0,X1 : $o] : (($true = (in @ X0 @ (prop2set @ X1))) => ($true = X1))))))))))))))))))),
% 0.21/0.43    inference(fool_elimination,[],[f40])).
% 0.21/0.43  thf(f40,plain,(
% 0.21/0.43    ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => ! [X0,X1 : $o] : ((in @ X0 @ (prop2set @ X1)) => X1)))))))))))))))))),
% 0.21/0.43    inference(rectify,[],[f20])).
% 0.21/0.43  thf(f20,negated_conjecture,(
% 0.21/0.43    ~(setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => ! [X1,X0 : $o] : ((in @ X1 @ (prop2set @ X0)) => X0)))))))))))))))))),
% 0.21/0.43    inference(negated_conjecture,[],[f19])).
% 0.21/0.43  thf(f19,conjecture,(
% 0.21/0.43    setextAx => (emptysetAx => (setadjoinAx => (powersetAx => (setunionAx => (omega0Ax => (omegaSAx => (omegaIndAx => (replAx => (foundationAx => (wellorderingAx => (descrp => (dsetconstrI => (dsetconstrEL => (dsetconstrER => (exuE1 => ! [X1,X0 : $o] : ((in @ X1 @ (prop2set @ X0)) => X0))))))))))))))))),
% 0.21/0.43    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop2setE)).
% 0.21/0.43  thf(f407,plain,(
% 0.21/0.43    (sK1 = $true)),
% 0.21/0.43    inference(beta_eta_normalization,[],[f406])).
% 0.21/0.43  thf(f406,plain,(
% 0.21/0.43    ($true = ((^[Y0 : $i]: (sK1)) @ sK0))),
% 0.21/0.43    inference(trivial_inequality_removal,[],[f402])).
% 0.21/0.43  thf(f402,plain,(
% 0.21/0.43    ($true = ((^[Y0 : $i]: (sK1)) @ sK0)) | ($false = $true)),
% 0.21/0.43    inference(superposition,[],[f234,f390])).
% 0.21/0.43  thf(f390,plain,(
% 0.21/0.43    ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($false = (in @ X2 @ (dsetconstr @ X1 @ X3))) | ((X3 @ X2) = $true)) )),
% 0.21/0.43    inference(binary_proxy_clausification,[],[f389])).
% 0.21/0.43  thf(f389,plain,(
% 0.21/0.43    ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : (($true = ((in @ X2 @ (dsetconstr @ X1 @ X3)) => (X3 @ X2)))) )),
% 0.21/0.43    inference(beta_eta_normalization,[],[f388])).
% 0.21/0.43  thf(f388,plain,(
% 0.21/0.43    ( ! [X2 : $i,X3 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: ((in @ X2 @ (dsetconstr @ X1 @ Y0)) => (Y0 @ X2))) @ X3) = $true)) )),
% 0.21/0.43    inference(pi_clausification,[],[f387])).
% 0.21/0.43  thf(f387,plain,(
% 0.21/0.43    ( ! [X2 : $i,X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((in @ X2 @ (dsetconstr @ X1 @ Y0)) => (Y0 @ X2)))) = $true)) )),
% 0.21/0.43    inference(beta_eta_normalization,[],[f386])).
% 0.21/0.43  thf(f386,plain,(
% 0.21/0.43    ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ (dsetconstr @ X1 @ Y1)) => (Y1 @ Y0))))) @ X2))) )),
% 0.21/0.43    inference(pi_clausification,[],[f385])).
% 0.21/0.43  thf(f385,plain,(
% 0.21/0.43    ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((in @ Y0 @ (dsetconstr @ X1 @ Y1)) => (Y1 @ Y0)))))) = $true)) )),
% 0.21/0.43    inference(beta_eta_normalization,[],[f384])).
% 0.21/0.43  thf(f384,plain,(
% 0.21/0.43    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (Y2 @ Y1))))))) @ X1) = $true)) )),
% 0.21/0.43    inference(pi_clausification,[],[f383])).
% 0.21/0.43  thf(f383,plain,(
% 0.21/0.43    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ Y2)) => (Y2 @ Y1)))))))) = $true)),
% 0.21/0.43    inference(beta_eta_normalization,[],[f116])).
% 0.21/0.43  thf(f116,plain,(
% 0.21/0.43    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))) = $true)),
% 0.21/0.43    inference(definition_unfolding,[],[f96,f95])).
% 0.21/0.43  thf(f95,plain,(
% 0.21/0.43    (dsetconstrER = $true)),
% 0.21/0.43    inference(cnf_transformation,[],[f60])).
% 0.21/0.43  thf(f96,plain,(
% 0.21/0.43    (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))))),
% 0.21/0.43    inference(cnf_transformation,[],[f51])).
% 0.21/0.43  thf(f51,plain,(
% 0.21/0.43    (dsetconstrER = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((in @ Y1 @ (dsetconstr @ Y0 @ (^[Y3 : $i]: (Y2 @ Y3)))) => (Y2 @ Y1)))))))))),
% 0.21/0.43    inference(fool_elimination,[],[f50])).
% 0.21/0.43  thf(f50,plain,(
% 0.21/0.43    (dsetconstrER = ! [X0 : $i > $o,X1,X2] : ((in @ X1 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X0 @ X3)))) => (X0 @ X1)))),
% 0.21/0.43    inference(rectify,[],[f16])).
% 0.21/0.43  thf(f16,axiom,(
% 0.21/0.43    (dsetconstrER = ! [X0 : $i > $o,X1,X3] : ((in @ X1 @ (dsetconstr @ X3 @ (^[X2 : $i] : (X0 @ X2)))) => (X0 @ X1)))),
% 0.21/0.43    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.21/0.43  thf(f234,plain,(
% 0.21/0.43    ((in @ sK0 @ (dsetconstr @ (powerset @ emptyset) @ (^[Y0 : $i]: (sK1)))) = $true)),
% 0.21/0.43    inference(beta_eta_normalization,[],[f108])).
% 0.21/0.43  thf(f108,plain,(
% 0.21/0.43    ((in @ sK0 @ ((^[Y0 : $o]: (dsetconstr @ (powerset @ emptyset) @ (^[Y1 : $i]: (Y0)))) @ sK1)) = $true)),
% 0.21/0.43    inference(definition_unfolding,[],[f86,f68])).
% 0.21/0.43  thf(f68,plain,(
% 0.21/0.43    (prop2set = (^[Y0 : $o]: (dsetconstr @ (powerset @ emptyset) @ (^[Y1 : $i]: (Y0)))))),
% 0.21/0.43    inference(cnf_transformation,[],[f54])).
% 0.21/0.43  thf(f54,plain,(
% 0.21/0.43    (prop2set = (^[Y0 : $o]: (dsetconstr @ (powerset @ emptyset) @ (^[Y1 : $i]: (Y0)))))),
% 0.21/0.43    inference(fool_elimination,[],[f18])).
% 0.21/0.43  thf(f18,axiom,(
% 0.21/0.43    (prop2set = (^[X0 : $o] : (dsetconstr @ (powerset @ emptyset) @ (^[X1 : $i] : (X0)))))),
% 0.21/0.43    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop2set)).
% 0.21/0.43  thf(f86,plain,(
% 0.21/0.43    ((in @ sK0 @ (prop2set @ sK1)) = $true)),
% 0.21/0.43    inference(cnf_transformation,[],[f60])).
% 0.21/0.43  % SZS output end Proof for theBenchmark
% 0.21/0.43  % (30874)------------------------------
% 0.21/0.43  % (30874)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43  % (30874)Termination reason: Refutation
% 0.21/0.43  
% 0.21/0.43  % (30874)Memory used [KB]: 5884
% 0.21/0.43  % (30874)Time elapsed: 0.036 s
% 0.21/0.43  % (30874)Instructions burned: 43 (million)
% 0.21/0.43  % (30874)------------------------------
% 0.21/0.43  % (30874)------------------------------
% 0.21/0.43  % (30873)Success in time 0.055 s
% 0.21/0.43  % Vampire---4.8 exiting
%------------------------------------------------------------------------------