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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU502^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 : n028.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:11 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SEU502^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13  % 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.14/0.33  % Computer : n028.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Sun May 19 15:38:23 EDT 2024
% 0.14/0.33  % CPUTime    : 
% 0.14/0.33  This is a TH0_THM_EQU_NAR problem
% 0.14/0.34  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.14/0.35  % (16512)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.35  % (16512)Refutation not found, incomplete strategy
% 0.14/0.35  % (16512)------------------------------
% 0.14/0.35  % (16512)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.35  % (16512)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  % (16512)Memory used [KB]: 5500
% 0.14/0.35  % (16512)Time elapsed: 0.002 s
% 0.14/0.35  % (16512)Instructions burned: 2 (million)
% 0.14/0.35  % (16512)------------------------------
% 0.14/0.35  % (16512)------------------------------
% 0.14/0.35  % (16506)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 (3000ds/4Mi)
% 0.14/0.35  % (16506)First to succeed.
% 0.14/0.35  % (16506)Refutation found. Thanks to Tanya!
% 0.14/0.35  % SZS status Theorem for theBenchmark
% 0.14/0.35  % SZS output start Proof for theBenchmark
% 0.14/0.35  thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.35  thf(f39,plain,(
% 0.14/0.35    $false),
% 0.14/0.35    inference(avatar_sat_refutation,[],[f29,f35,f38])).
% 0.14/0.35  thf(f38,plain,(
% 0.14/0.35    ~spl1_1),
% 0.14/0.35    inference(avatar_contradiction_clause,[],[f37])).
% 0.14/0.35  thf(f37,plain,(
% 0.14/0.35    $false | ~spl1_1),
% 0.14/0.35    inference(trivial_inequality_removal,[],[f36])).
% 0.14/0.35  thf(f36,plain,(
% 0.14/0.35    ($false = $true) | ~spl1_1),
% 0.14/0.35    inference(backward_demodulation,[],[f14,f25])).
% 0.14/0.35  thf(f25,plain,(
% 0.14/0.35    ( ! [X1 : $i] : (($false = (in @ X1 @ emptyset))) ) | ~spl1_1),
% 0.14/0.35    inference(avatar_component_clause,[],[f24])).
% 0.14/0.35  thf(f24,plain,(
% 0.14/0.35    spl1_1 <=> ! [X1] : ($false = (in @ X1 @ emptyset))),
% 0.14/0.35    introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.14/0.35  thf(f14,plain,(
% 0.14/0.35    ($true = (in @ sK0 @ emptyset))),
% 0.14/0.35    inference(cnf_transformation,[],[f13])).
% 0.14/0.35  thf(f13,plain,(
% 0.14/0.35    (emptysetE = $true) & ($true = (in @ sK0 @ emptyset))),
% 0.14/0.35    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12])).
% 0.14/0.35  thf(f12,plain,(
% 0.14/0.35    ? [X0] : ((in @ X0 @ emptyset) = $true) => ($true = (in @ sK0 @ emptyset))),
% 0.14/0.35    introduced(choice_axiom,[])).
% 0.14/0.35  thf(f11,plain,(
% 0.14/0.35    (emptysetE = $true) & ? [X0] : ((in @ X0 @ emptyset) = $true)),
% 0.14/0.35    inference(ennf_transformation,[],[f10])).
% 0.14/0.35  thf(f10,plain,(
% 0.14/0.35    ~((emptysetE = $true) => ! [X0] : ((in @ X0 @ emptyset) != $true))),
% 0.14/0.35    inference(flattening,[],[f9])).
% 0.14/0.35  thf(f9,plain,(
% 0.14/0.35    ~((emptysetE = $true) => ! [X0] : ~((in @ X0 @ emptyset) = $true))),
% 0.14/0.35    inference(true_and_false_elimination,[],[f8])).
% 0.14/0.35  thf(f8,plain,(
% 0.14/0.35    ~((emptysetE = $true) => ! [X0] : (((in @ X0 @ emptyset) = $true) => $false))),
% 0.14/0.35    inference(fool_elimination,[],[f7])).
% 0.14/0.35  thf(f7,plain,(
% 0.14/0.35    ~(emptysetE => ! [X0] : ((in @ X0 @ emptyset) => $false))),
% 0.14/0.35    inference(rectify,[],[f3])).
% 0.14/0.35  thf(f3,negated_conjecture,(
% 0.14/0.35    ~(emptysetE => ! [X0] : ((in @ X0 @ emptyset) => $false))),
% 0.14/0.35    inference(negated_conjecture,[],[f2])).
% 0.14/0.35  thf(f2,conjecture,(
% 0.14/0.35    emptysetE => ! [X0] : ((in @ X0 @ emptyset) => $false)),
% 0.14/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetimpfalse)).
% 0.14/0.35  thf(f35,plain,(
% 0.14/0.35    ~spl1_2),
% 0.14/0.35    inference(avatar_contradiction_clause,[],[f34])).
% 0.14/0.35  thf(f34,plain,(
% 0.14/0.35    $false | ~spl1_2),
% 0.14/0.35    inference(equality_resolution,[],[f33])).
% 0.14/0.35  thf(f33,plain,(
% 0.14/0.35    ( ! [X0 : $o] : (($false != X0)) ) | ~spl1_2),
% 0.14/0.35    inference(superposition,[],[f4,f28])).
% 0.14/0.35  thf(f28,plain,(
% 0.14/0.35    ( ! [X2 : $o] : (($true = X2)) ) | ~spl1_2),
% 0.14/0.35    inference(avatar_component_clause,[],[f27])).
% 0.14/0.35  thf(f27,plain,(
% 0.14/0.35    spl1_2 <=> ! [X2 : $o] : ($true = X2)),
% 0.14/0.35    introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.14/0.35  thf(f4,plain,(
% 0.14/0.35    ($false != $true)),
% 0.14/0.35    introduced(fool_axiom,[])).
% 0.14/0.35  thf(f29,plain,(
% 0.14/0.35    spl1_1 | spl1_2),
% 0.14/0.35    inference(avatar_split_clause,[],[f22,f27,f24])).
% 0.14/0.35  thf(f22,plain,(
% 0.14/0.35    ( ! [X2 : $o,X1 : $i] : (($true = X2) | ($false = (in @ X1 @ emptyset))) )),
% 0.14/0.35    inference(beta_eta_normalization,[],[f21])).
% 0.14/0.35  thf(f21,plain,(
% 0.14/0.35    ( ! [X2 : $o,X1 : $i] : (($true = ((^[Y0 : $o]: (Y0)) @ X2)) | ($false = (in @ X1 @ emptyset))) )),
% 0.14/0.35    inference(pi_clausification,[],[f20])).
% 0.14/0.35  thf(f20,plain,(
% 0.14/0.35    ( ! [X1 : $i] : (($true = (!! @ $o @ (^[Y0 : $o]: (Y0)))) | ($false = (in @ X1 @ emptyset))) )),
% 0.14/0.35    inference(binary_proxy_clausification,[],[f19])).
% 0.14/0.35  thf(f19,plain,(
% 0.14/0.35    ( ! [X1 : $i] : (($true = ((in @ X1 @ emptyset) => (!! @ $o @ (^[Y0 : $o]: (Y0)))))) )),
% 0.14/0.35    inference(beta_eta_normalization,[],[f18])).
% 0.14/0.35  thf(f18,plain,(
% 0.14/0.35    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))) @ X1))) )),
% 0.14/0.35    inference(pi_clausification,[],[f17])).
% 0.14/0.35  thf(f17,plain,(
% 0.14/0.35    ($true = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 0.14/0.35    inference(definition_unfolding,[],[f16,f15])).
% 0.14/0.35  thf(f15,plain,(
% 0.14/0.35    (emptysetE = $true)),
% 0.14/0.35    inference(cnf_transformation,[],[f13])).
% 0.14/0.35  thf(f16,plain,(
% 0.14/0.35    (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 0.14/0.35    inference(cnf_transformation,[],[f6])).
% 0.14/0.35  thf(f6,plain,(
% 0.14/0.35    (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 0.14/0.35    inference(fool_elimination,[],[f5])).
% 0.14/0.35  thf(f5,plain,(
% 0.14/0.35    (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.14/0.35    inference(rectify,[],[f1])).
% 0.14/0.35  thf(f1,axiom,(
% 0.14/0.35    (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.14/0.35    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.14/0.35  % SZS output end Proof for theBenchmark
% 0.14/0.35  % (16506)------------------------------
% 0.14/0.35  % (16506)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.35  % (16506)Termination reason: Refutation
% 0.14/0.35  
% 0.14/0.35  % (16506)Memory used [KB]: 5500
% 0.14/0.35  % (16506)Time elapsed: 0.003 s
% 0.14/0.35  % (16506)Instructions burned: 2 (million)
% 0.14/0.35  % (16506)------------------------------
% 0.14/0.35  % (16506)------------------------------
% 0.14/0.35  % (16504)Success in time 0.005 s
% 0.14/0.35  % Vampire---4.8 exiting
%------------------------------------------------------------------------------