TSTP Solution File: SEU798^2 by Vampire---4.8

View Problem - Process Solution

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

% Computer : n019.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:38 EDT 2024

% Result   : Theorem 0.12s 0.35s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SEU798^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.12  % 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.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 18:15:52 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TH0_THM_EQU_NAR problem
% 0.12/0.33  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.12/0.35  % (9384)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.12/0.35  % (9385)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.12/0.35  % (9386)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.35  % (9387)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.12/0.35  % (9388)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.12/0.35  % (9389)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.35  % (9390)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.12/0.35  % (9386)Instruction limit reached!
% 0.12/0.35  % (9386)------------------------------
% 0.12/0.35  % (9386)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9386)Termination reason: Unknown
% 0.12/0.35  % (9386)Termination phase: Saturation
% 0.12/0.35  % (9387)Instruction limit reached!
% 0.12/0.35  % (9387)------------------------------
% 0.12/0.35  % (9387)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9387)Termination reason: Unknown
% 0.12/0.35  % (9387)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (9387)Memory used [KB]: 5500
% 0.12/0.35  % (9387)Time elapsed: 0.003 s
% 0.12/0.35  % (9387)Instructions burned: 3 (million)
% 0.12/0.35  % (9387)------------------------------
% 0.12/0.35  % (9387)------------------------------
% 0.12/0.35  
% 0.12/0.35  % (9386)Memory used [KB]: 5500
% 0.12/0.35  % (9386)Time elapsed: 0.003 s
% 0.12/0.35  % (9386)Instructions burned: 2 (million)
% 0.12/0.35  % (9386)------------------------------
% 0.12/0.35  % (9386)------------------------------
% 0.12/0.35  % (9390)Instruction limit reached!
% 0.12/0.35  % (9390)------------------------------
% 0.12/0.35  % (9390)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9390)Termination reason: Unknown
% 0.12/0.35  % (9390)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (9390)Memory used [KB]: 5500
% 0.12/0.35  % (9390)Time elapsed: 0.003 s
% 0.12/0.35  % (9390)Instructions burned: 3 (million)
% 0.12/0.35  % (9390)------------------------------
% 0.12/0.35  % (9390)------------------------------
% 0.12/0.35  % (9383)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.12/0.35  % (9384)Instruction limit reached!
% 0.12/0.35  % (9384)------------------------------
% 0.12/0.35  % (9384)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9384)Termination reason: Unknown
% 0.12/0.35  % (9384)Termination phase: Saturation
% 0.12/0.35  % (9388)Refutation not found, incomplete strategy
% 0.12/0.35  % (9388)------------------------------
% 0.12/0.35  % (9388)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9388)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35  
% 0.12/0.35  
% 0.12/0.35  % (9388)Memory used [KB]: 5500
% 0.12/0.35  % (9388)Time elapsed: 0.003 s
% 0.12/0.35  % (9388)Instructions burned: 2 (million)
% 0.12/0.35  % (9388)------------------------------
% 0.12/0.35  % (9388)------------------------------
% 0.12/0.35  
% 0.12/0.35  % (9384)Memory used [KB]: 5500
% 0.12/0.35  % (9384)Time elapsed: 0.004 s
% 0.12/0.35  % (9384)Instructions burned: 4 (million)
% 0.12/0.35  % (9384)------------------------------
% 0.12/0.35  % (9384)------------------------------
% 0.12/0.35  % (9385)First to succeed.
% 0.12/0.35  % (9385)Refutation found. Thanks to Tanya!
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start Proof for theBenchmark
% 0.12/0.35  thf(func_def_0, type, in: $i > $i > $o).
% 0.12/0.35  thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.12/0.35  thf(func_def_4, type, funcSet: $i > $i > $i).
% 0.12/0.35  thf(func_def_5, type, injective: $i > $i > $i > $o).
% 0.12/0.35  thf(func_def_6, type, injFuncSet: $i > $i > $i).
% 0.12/0.35  thf(func_def_7, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.12/0.35  thf(func_def_20, type, ph4: !>[X0: $tType]:(X0)).
% 0.12/0.35  thf(f39,plain,(
% 0.12/0.35    $false),
% 0.12/0.35    inference(trivial_inequality_removal,[],[f38])).
% 0.12/0.35  thf(f38,plain,(
% 0.12/0.35    ($false = $true)),
% 0.12/0.35    inference(backward_demodulation,[],[f19,f37])).
% 0.12/0.35  thf(f37,plain,(
% 0.12/0.35    ((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $false)),
% 0.12/0.35    inference(trivial_inequality_removal,[],[f36])).
% 0.12/0.35  thf(f36,plain,(
% 0.12/0.35    ($false = $true) | ((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $false)),
% 0.12/0.35    inference(forward_demodulation,[],[f35,f18])).
% 0.12/0.35  thf(f18,plain,(
% 0.12/0.35    ((injective @ sK0 @ sK2 @ sK1) = $true)),
% 0.12/0.35    inference(cnf_transformation,[],[f15])).
% 0.12/0.35  thf(f15,plain,(
% 0.12/0.35    (((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $true) & ((injective @ sK0 @ sK2 @ sK1) = $true) & ((in @ sK1 @ (injFuncSet @ sK0 @ sK2)) != $true)) & (dsetconstrI = $true)),
% 0.12/0.35    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14])).
% 0.12/0.35  thf(f14,plain,(
% 0.12/0.35    ? [X0,X1,X2] : (((in @ X1 @ (funcSet @ X0 @ X2)) = $true) & ((injective @ X0 @ X2 @ X1) = $true) & ((in @ X1 @ (injFuncSet @ X0 @ X2)) != $true)) => (((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $true) & ((injective @ sK0 @ sK2 @ sK1) = $true) & ((in @ sK1 @ (injFuncSet @ sK0 @ sK2)) != $true))),
% 0.12/0.35    introduced(choice_axiom,[])).
% 0.12/0.35  thf(f13,plain,(
% 0.12/0.35    ? [X0,X1,X2] : (((in @ X1 @ (funcSet @ X0 @ X2)) = $true) & ((injective @ X0 @ X2 @ X1) = $true) & ((in @ X1 @ (injFuncSet @ X0 @ X2)) != $true)) & (dsetconstrI = $true)),
% 0.12/0.35    inference(flattening,[],[f12])).
% 0.12/0.35  thf(f12,plain,(
% 0.12/0.35    ? [X0,X1,X2] : ((((in @ X1 @ (injFuncSet @ X0 @ X2)) != $true) & ((injective @ X0 @ X2 @ X1) = $true)) & ((in @ X1 @ (funcSet @ X0 @ X2)) = $true)) & (dsetconstrI = $true)),
% 0.12/0.35    inference(ennf_transformation,[],[f7])).
% 0.12/0.35  thf(f7,plain,(
% 0.12/0.35    ~((dsetconstrI = $true) => ! [X0,X1,X2] : (((in @ X1 @ (funcSet @ X0 @ X2)) = $true) => (((injective @ X0 @ X2 @ X1) = $true) => ((in @ X1 @ (injFuncSet @ X0 @ X2)) = $true))))),
% 0.12/0.35    inference(fool_elimination,[],[f6])).
% 0.12/0.35  thf(f6,plain,(
% 0.12/0.35    ~(dsetconstrI => ! [X0,X1,X2] : ((in @ X1 @ (funcSet @ X0 @ X2)) => ((injective @ X0 @ X2 @ X1) => (in @ X1 @ (injFuncSet @ X0 @ X2)))))),
% 0.12/0.35    inference(rectify,[],[f4])).
% 0.12/0.35  thf(f4,negated_conjecture,(
% 0.12/0.35    ~(dsetconstrI => ! [X0,X5,X4] : ((in @ X5 @ (funcSet @ X0 @ X4)) => ((injective @ X0 @ X4 @ X5) => (in @ X5 @ (injFuncSet @ X0 @ X4)))))),
% 0.12/0.35    inference(negated_conjecture,[],[f3])).
% 0.12/0.35  thf(f3,conjecture,(
% 0.12/0.35    dsetconstrI => ! [X0,X5,X4] : ((in @ X5 @ (funcSet @ X0 @ X4)) => ((injective @ X0 @ X4 @ X5) => (in @ X5 @ (injFuncSet @ X0 @ X4))))),
% 0.12/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',injFuncInInjFuncSet)).
% 0.12/0.35  thf(f35,plain,(
% 0.12/0.35    ((injective @ sK0 @ sK2 @ sK1) = $false) | ((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $false)),
% 0.12/0.35    inference(trivial_inequality_removal,[],[f34])).
% 0.12/0.35  thf(f34,plain,(
% 0.12/0.35    ($true != $true) | ((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $false) | ((injective @ sK0 @ sK2 @ sK1) = $false)),
% 0.12/0.35    inference(superposition,[],[f33,f32])).
% 0.12/0.35  thf(f32,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (((in @ X1 @ (dsetconstr @ X3 @ X2)) = $true) | ($false = (in @ X1 @ X3)) | ((X2 @ X1) = $false)) )),
% 0.12/0.35    inference(binary_proxy_clausification,[],[f31])).
% 0.12/0.35  thf(f31,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : (($false = (in @ X1 @ X3)) | (((X2 @ X1) => (in @ X1 @ (dsetconstr @ X3 @ X2))) = $true)) )),
% 0.12/0.35    inference(binary_proxy_clausification,[],[f30])).
% 0.12/0.35  thf(f30,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : ((((in @ X1 @ X3) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ X3 @ X2)))) = $true)) )),
% 0.12/0.35    inference(beta_eta_normalization,[],[f29])).
% 0.12/0.35  thf(f29,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X1 @ Y0) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ X2))))) @ X3) = $true)) )),
% 0.12/0.35    inference(pi_clausification,[],[f28])).
% 0.12/0.35  thf(f28,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ Y0) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ Y0 @ X2)))))) = $true)) )),
% 0.12/0.35    inference(beta_eta_normalization,[],[f27])).
% 0.12/0.35  thf(f27,plain,(
% 0.12/0.35    ( ! [X2 : $i > $o,X1 : $i] : ((((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ Y1 @ Y0))))))) @ X2) = $true)) )),
% 0.12/0.35    inference(pi_clausification,[],[f26])).
% 0.12/0.35  thf(f26,plain,(
% 0.12/0.35    ( ! [X1 : $i] : (((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y1) => ((Y0 @ X1) => (in @ X1 @ (dsetconstr @ Y1 @ Y0)))))))) = $true)) )),
% 0.12/0.35    inference(beta_eta_normalization,[],[f25])).
% 0.12/0.35  thf(f25,plain,(
% 0.12/0.35    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1))))))))) @ X1) = $true)) )),
% 0.12/0.35    inference(pi_clausification,[],[f24])).
% 0.12/0.35  thf(f24,plain,(
% 0.12/0.35    ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ Y1)))))))))) = $true)),
% 0.12/0.35    inference(beta_eta_normalization,[],[f23])).
% 0.12/0.35  thf(f23,plain,(
% 0.12/0.35    ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))) = $true)),
% 0.12/0.35    inference(definition_unfolding,[],[f20,f16])).
% 0.12/0.35  thf(f16,plain,(
% 0.12/0.35    (dsetconstrI = $true)),
% 0.12/0.35    inference(cnf_transformation,[],[f15])).
% 0.12/0.35  thf(f20,plain,(
% 0.12/0.35    (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))))),
% 0.12/0.35    inference(cnf_transformation,[],[f9])).
% 0.12/0.35  thf(f9,plain,(
% 0.12/0.35    (dsetconstrI = (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y2) => ((Y1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y1 @ Y3)))))))))))))),
% 0.12/0.35    inference(fool_elimination,[],[f8])).
% 0.12/0.35  thf(f8,plain,(
% 0.12/0.35    (! [X0,X1 : $i > $o,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))) = dsetconstrI)),
% 0.12/0.35    inference(rectify,[],[f1])).
% 0.12/0.35  thf(f1,axiom,(
% 0.12/0.35    (! [X0,X1 : $i > $o,X2] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))) = dsetconstrI)),
% 0.12/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI)).
% 0.12/0.35  thf(f33,plain,(
% 0.12/0.35    ((in @ sK1 @ (dsetconstr @ (funcSet @ sK0 @ sK2) @ (injective @ sK0 @ sK2))) != $true)),
% 0.12/0.35    inference(beta_eta_normalization,[],[f22])).
% 0.12/0.35  thf(f22,plain,(
% 0.12/0.35    ((in @ sK1 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))) @ sK0 @ sK2)) != $true)),
% 0.12/0.35    inference(definition_unfolding,[],[f17,f21])).
% 0.12/0.35  thf(f21,plain,(
% 0.12/0.35    (injFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))))),
% 0.12/0.35    inference(cnf_transformation,[],[f11])).
% 0.12/0.35  thf(f11,plain,(
% 0.12/0.35    (injFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))))),
% 0.12/0.35    inference(fool_elimination,[],[f10])).
% 0.12/0.35  thf(f10,plain,(
% 0.12/0.35    (injFuncSet = (^[X0 : $i, X1 : $i] : (dsetconstr @ (funcSet @ X0 @ X1) @ (^[X2 : $i] : (injective @ X0 @ X1 @ X2)))))),
% 0.12/0.35    inference(rectify,[],[f2])).
% 0.12/0.35  thf(f2,axiom,(
% 0.12/0.35    (injFuncSet = (^[X0 : $i, X4 : $i] : (dsetconstr @ (funcSet @ X0 @ X4) @ (^[X5 : $i] : (injective @ X0 @ X4 @ X5)))))),
% 0.12/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',injFuncSet)).
% 0.12/0.35  thf(f17,plain,(
% 0.12/0.35    ((in @ sK1 @ (injFuncSet @ sK0 @ sK2)) != $true)),
% 0.12/0.35    inference(cnf_transformation,[],[f15])).
% 0.12/0.35  thf(f19,plain,(
% 0.12/0.35    ((in @ sK1 @ (funcSet @ sK0 @ sK2)) = $true)),
% 0.12/0.35    inference(cnf_transformation,[],[f15])).
% 0.12/0.35  % SZS output end Proof for theBenchmark
% 0.12/0.35  % (9385)------------------------------
% 0.12/0.35  % (9385)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (9385)Termination reason: Refutation
% 0.12/0.35  
% 0.12/0.35  % (9385)Memory used [KB]: 5500
% 0.12/0.35  % (9385)Time elapsed: 0.005 s
% 0.12/0.35  % (9385)Instructions burned: 4 (million)
% 0.12/0.35  % (9385)------------------------------
% 0.12/0.35  % (9385)------------------------------
% 0.12/0.35  % (9382)Success in time 0.017 s
% 0.12/0.35  % Vampire---4.8 exiting
%------------------------------------------------------------------------------