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

View Problem - Process Solution

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

% Computer : n018.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:26 EDT 2024

% Result   : Theorem 0.20s 0.38s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU535^2 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n018.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 17:20:53 EDT 2024
% 0.14/0.35  % 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.20/0.37  % (12113)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.38  % (12110)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.20/0.38  % (12112)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 (3000ds/27Mi)
% 0.20/0.38  % (12111)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.20/0.38  % (12115)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 (3000ds/275Mi)
% 0.20/0.38  % (12117)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.20/0.38  % (12114)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 (3000ds/2Mi)
% 0.20/0.38  % (12113)Instruction limit reached!
% 0.20/0.38  % (12113)------------------------------
% 0.20/0.38  % (12113)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (12113)Termination reason: Unknown
% 0.20/0.38  % (12113)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (12113)Memory used [KB]: 5500
% 0.20/0.38  % (12113)Time elapsed: 0.004 s
% 0.20/0.38  % (12113)Instructions burned: 2 (million)
% 0.20/0.38  % (12113)------------------------------
% 0.20/0.38  % (12113)------------------------------
% 0.20/0.38  % (12116)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.38  % (12114)Instruction limit reached!
% 0.20/0.38  % (12114)------------------------------
% 0.20/0.38  % (12114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (12114)Termination reason: Unknown
% 0.20/0.38  % (12114)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (12114)Memory used [KB]: 5373
% 0.20/0.38  % (12114)Time elapsed: 0.003 s
% 0.20/0.38  % (12114)Instructions burned: 2 (million)
% 0.20/0.38  % (12114)------------------------------
% 0.20/0.38  % (12114)------------------------------
% 0.20/0.38  % (12110)First to succeed.
% 0.20/0.38  % (12117)Refutation not found, incomplete strategy
% 0.20/0.38  % (12117)------------------------------
% 0.20/0.38  % (12117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (12117)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38  
% 0.20/0.38  
% 0.20/0.38  % (12117)Memory used [KB]: 5500
% 0.20/0.38  % (12117)Time elapsed: 0.004 s
% 0.20/0.38  % (12117)Instructions burned: 2 (million)
% 0.20/0.38  % (12117)------------------------------
% 0.20/0.38  % (12117)------------------------------
% 0.20/0.38  % (12111)Also succeeded, but the first one will report.
% 0.20/0.38  % (12110)Refutation found. Thanks to Tanya!
% 0.20/0.38  % SZS status Theorem for theBenchmark
% 0.20/0.38  % SZS output start Proof for theBenchmark
% 0.20/0.38  thf(func_def_0, type, in: $i > $i > $o).
% 0.20/0.38  thf(func_def_11, type, sK1: $i > $o).
% 0.20/0.38  thf(f41,plain,(
% 0.20/0.38    $false),
% 0.20/0.38    inference(avatar_sat_refutation,[],[f28,f34,f40])).
% 0.20/0.38  thf(f40,plain,(
% 0.20/0.38    ~spl2_1),
% 0.20/0.38    inference(avatar_contradiction_clause,[],[f39])).
% 0.20/0.38  thf(f39,plain,(
% 0.20/0.38    $false | ~spl2_1),
% 0.20/0.38    inference(trivial_inequality_removal,[],[f35])).
% 0.20/0.38  thf(f35,plain,(
% 0.20/0.38    ($false = $true) | ~spl2_1),
% 0.20/0.38    inference(superposition,[],[f24,f13])).
% 0.20/0.38  thf(f13,plain,(
% 0.20/0.38    ((in @ sK0 @ emptyset) = $true)),
% 0.20/0.38    inference(cnf_transformation,[],[f11])).
% 0.20/0.38  thf(f11,plain,(
% 0.20/0.38    (emptysetE = $true) & (((in @ sK0 @ emptyset) = $true) & ((sK1 @ sK0) != $true))),
% 0.20/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10])).
% 0.20/0.38  thf(f10,plain,(
% 0.20/0.38    ? [X0,X1 : $i > $o] : (((in @ X0 @ emptyset) = $true) & ((X1 @ X0) != $true)) => (((in @ sK0 @ emptyset) = $true) & ((sK1 @ sK0) != $true))),
% 0.20/0.38    introduced(choice_axiom,[])).
% 0.20/0.38  thf(f9,plain,(
% 0.20/0.38    (emptysetE = $true) & ? [X0,X1 : $i > $o] : (((in @ X0 @ emptyset) = $true) & ((X1 @ X0) != $true))),
% 0.20/0.38    inference(ennf_transformation,[],[f6])).
% 0.20/0.38  thf(f6,plain,(
% 0.20/0.38    ~((emptysetE = $true) => ! [X0,X1 : $i > $o] : (((in @ X0 @ emptyset) = $true) => ((X1 @ X0) = $true)))),
% 0.20/0.38    inference(fool_elimination,[],[f5])).
% 0.20/0.38  thf(f5,plain,(
% 0.20/0.38    ~(emptysetE => ! [X0,X1 : $i > $o] : ((in @ X0 @ emptyset) => (X1 @ X0)))),
% 0.20/0.38    inference(rectify,[],[f3])).
% 0.20/0.38  thf(f3,negated_conjecture,(
% 0.20/0.38    ~(emptysetE => ! [X0,X1 : $i > $o] : ((in @ X0 @ emptyset) => (X1 @ X0)))),
% 0.20/0.38    inference(negated_conjecture,[],[f2])).
% 0.20/0.38  thf(f2,conjecture,(
% 0.20/0.38    emptysetE => ! [X0,X1 : $i > $o] : ((in @ X0 @ emptyset) => (X1 @ X0))),
% 0.20/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',vacuousDall)).
% 0.20/0.38  thf(f24,plain,(
% 0.20/0.38    ( ! [X1 : $i] : (($false = (in @ X1 @ emptyset))) ) | ~spl2_1),
% 0.20/0.38    inference(avatar_component_clause,[],[f23])).
% 0.20/0.38  thf(f23,plain,(
% 0.20/0.38    spl2_1 <=> ! [X1] : ($false = (in @ X1 @ emptyset))),
% 0.20/0.38    introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.20/0.38  thf(f34,plain,(
% 0.20/0.38    ~spl2_2),
% 0.20/0.38    inference(avatar_contradiction_clause,[],[f33])).
% 0.20/0.38  thf(f33,plain,(
% 0.20/0.38    $false | ~spl2_2),
% 0.20/0.38    inference(equality_resolution,[],[f32])).
% 0.20/0.38  thf(f32,plain,(
% 0.20/0.38    ( ! [X0 : $o] : (($false != X0)) ) | ~spl2_2),
% 0.20/0.38    inference(superposition,[],[f4,f27])).
% 0.20/0.38  thf(f27,plain,(
% 0.20/0.38    ( ! [X2 : $o] : (($true = X2)) ) | ~spl2_2),
% 0.20/0.38    inference(avatar_component_clause,[],[f26])).
% 0.20/0.38  thf(f26,plain,(
% 0.20/0.38    spl2_2 <=> ! [X2 : $o] : ($true = X2)),
% 0.20/0.38    introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.20/0.38  thf(f4,plain,(
% 0.20/0.38    ($false != $true)),
% 0.20/0.38    introduced(fool_axiom,[])).
% 0.20/0.38  thf(f28,plain,(
% 0.20/0.38    spl2_1 | spl2_2),
% 0.20/0.38    inference(avatar_split_clause,[],[f21,f26,f23])).
% 0.20/0.38  thf(f21,plain,(
% 0.20/0.38    ( ! [X2 : $o,X1 : $i] : (($false = (in @ X1 @ emptyset)) | ($true = X2)) )),
% 0.20/0.38    inference(beta_eta_normalization,[],[f20])).
% 0.20/0.38  thf(f20,plain,(
% 0.20/0.38    ( ! [X2 : $o,X1 : $i] : (($false = (in @ X1 @ emptyset)) | (((^[Y0 : $o]: (Y0)) @ X2) = $true)) )),
% 0.20/0.38    inference(pi_clausification,[],[f19])).
% 0.20/0.38  thf(f19,plain,(
% 0.20/0.38    ( ! [X1 : $i] : (((!! @ $o @ (^[Y0 : $o]: (Y0))) = $true) | ($false = (in @ X1 @ emptyset))) )),
% 0.20/0.38    inference(binary_proxy_clausification,[],[f18])).
% 0.20/0.38  thf(f18,plain,(
% 0.20/0.38    ( ! [X1 : $i] : ((((in @ X1 @ emptyset) => (!! @ $o @ (^[Y0 : $o]: (Y0)))) = $true)) )),
% 0.20/0.38    inference(beta_eta_normalization,[],[f17])).
% 0.20/0.38  thf(f17,plain,(
% 0.20/0.38    ( ! [X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))) @ X1) = $true)) )),
% 0.20/0.38    inference(pi_clausification,[],[f16])).
% 0.20/0.38  thf(f16,plain,(
% 0.20/0.38    ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))) = $true)),
% 0.20/0.38    inference(definition_unfolding,[],[f15,f14])).
% 0.20/0.38  thf(f14,plain,(
% 0.20/0.38    (emptysetE = $true)),
% 0.20/0.38    inference(cnf_transformation,[],[f11])).
% 0.20/0.38  thf(f15,plain,(
% 0.20/0.38    (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 0.20/0.38    inference(cnf_transformation,[],[f8])).
% 0.20/0.38  thf(f8,plain,(
% 0.20/0.38    (emptysetE = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1)))))))),
% 0.20/0.38    inference(fool_elimination,[],[f7])).
% 0.20/0.38  thf(f7,plain,(
% 0.20/0.38    (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.38    inference(rectify,[],[f1])).
% 0.20/0.38  thf(f1,axiom,(
% 0.20/0.38    (emptysetE = ! [X0] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE)).
% 0.20/0.38  % SZS output end Proof for theBenchmark
% 0.20/0.38  % (12110)------------------------------
% 0.20/0.38  % (12110)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (12110)Termination reason: Refutation
% 0.20/0.38  
% 0.20/0.38  % (12110)Memory used [KB]: 5500
% 0.20/0.38  % (12110)Time elapsed: 0.005 s
% 0.20/0.38  % (12110)Instructions burned: 2 (million)
% 0.20/0.38  % (12110)------------------------------
% 0.20/0.38  % (12110)------------------------------
% 0.20/0.38  % (12109)Success in time 0.004 s
% 0.20/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------