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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU518^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 : n016.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:18 EDT 2024

% Result   : Theorem 0.24s 0.42s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SEU518^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.15  % 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.39  % Computer : n016.cluster.edu
% 0.14/0.39  % Model    : x86_64 x86_64
% 0.14/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39  % Memory   : 8042.1875MB
% 0.14/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.39  % CPULimit   : 300
% 0.14/0.39  % WCLimit    : 300
% 0.14/0.39  % DateTime   : Sun May 19 17:29:23 EDT 2024
% 0.14/0.39  % CPUTime    : 
% 0.14/0.39  This is a TH0_THM_EQU_NAR problem
% 0.14/0.40  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.24/0.41  % (13658)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.24/0.41  % (13660)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.24/0.41  % (13659)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.24/0.41  % (13662)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.24/0.41  % (13661)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.24/0.41  % (13663)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.24/0.41  % (13664)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.24/0.41  % (13665)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.24/0.41  % (13661)Instruction limit reached!
% 0.24/0.41  % (13661)------------------------------
% 0.24/0.41  % (13661)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41  % (13661)Termination reason: Unknown
% 0.24/0.41  % (13661)Termination phase: Saturation
% 0.24/0.41  
% 0.24/0.41  % (13662)Instruction limit reached!
% 0.24/0.41  % (13662)------------------------------
% 0.24/0.41  % (13662)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41  % (13662)Termination reason: Unknown
% 0.24/0.41  % (13662)Termination phase: Saturation
% 0.24/0.41  
% 0.24/0.41  % (13662)Memory used [KB]: 5373
% 0.24/0.41  % (13662)Time elapsed: 0.003 s
% 0.24/0.41  % (13662)Instructions burned: 2 (million)
% 0.24/0.41  % (13662)------------------------------
% 0.24/0.41  % (13662)------------------------------
% 0.24/0.41  % (13661)Memory used [KB]: 5373
% 0.24/0.41  % (13661)Time elapsed: 0.003 s
% 0.24/0.41  % (13661)Instructions burned: 2 (million)
% 0.24/0.41  % (13661)------------------------------
% 0.24/0.41  % (13661)------------------------------
% 0.24/0.42  % (13665)Refutation not found, incomplete strategy
% 0.24/0.42  % (13665)------------------------------
% 0.24/0.42  % (13665)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42  % (13665)Termination reason: Refutation not found, incomplete strategy
% 0.24/0.42  
% 0.24/0.42  
% 0.24/0.42  % (13665)Memory used [KB]: 5500
% 0.24/0.42  % (13665)Time elapsed: 0.003 s
% 0.24/0.42  % (13665)Instructions burned: 2 (million)
% 0.24/0.42  % (13665)------------------------------
% 0.24/0.42  % (13665)------------------------------
% 0.24/0.42  % (13659)Instruction limit reached!
% 0.24/0.42  % (13659)------------------------------
% 0.24/0.42  % (13659)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42  % (13659)Termination reason: Unknown
% 0.24/0.42  % (13659)Termination phase: Saturation
% 0.24/0.42  
% 0.24/0.42  % (13659)Memory used [KB]: 5500
% 0.24/0.42  % (13659)Time elapsed: 0.005 s
% 0.24/0.42  % (13659)Instructions burned: 4 (million)
% 0.24/0.42  % (13659)------------------------------
% 0.24/0.42  % (13659)------------------------------
% 0.24/0.42  % (13658)First to succeed.
% 0.24/0.42  % (13664)Also succeeded, but the first one will report.
% 0.24/0.42  % (13658)Refutation found. Thanks to Tanya!
% 0.24/0.42  % SZS status Theorem for theBenchmark
% 0.24/0.42  % SZS output start Proof for theBenchmark
% 0.24/0.42  thf(func_def_0, type, in: $i > $i > $o).
% 0.24/0.42  thf(func_def_1, type, powerset: $i > $i).
% 0.24/0.42  thf(func_def_16, type, sK3: $i > $i > $i).
% 0.24/0.42  thf(f44,plain,(
% 0.24/0.42    $false),
% 0.24/0.42    inference(subsumption_resolution,[],[f43,f15])).
% 0.24/0.42  thf(f15,plain,(
% 0.24/0.42    ($true != (in @ sK0 @ (powerset @ sK1)))),
% 0.24/0.42    inference(cnf_transformation,[],[f11])).
% 0.24/0.42  thf(f11,plain,(
% 0.24/0.42    (($true != (in @ sK0 @ (powerset @ sK1))) & ! [X2] : (((in @ X2 @ sK1) = $true) | ((in @ X2 @ sK0) != $true))) & (powersetAx = $true)),
% 0.24/0.42    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10])).
% 0.24/0.42  thf(f10,plain,(
% 0.24/0.42    ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) & ! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true))) => (($true != (in @ sK0 @ (powerset @ sK1))) & ! [X2] : (((in @ X2 @ sK1) = $true) | ((in @ X2 @ sK0) != $true)))),
% 0.24/0.42    introduced(choice_axiom,[])).
% 0.24/0.42  thf(f9,plain,(
% 0.24/0.42    ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) & ! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true))) & (powersetAx = $true)),
% 0.24/0.42    inference(ennf_transformation,[],[f6])).
% 0.24/0.42  thf(f6,plain,(
% 0.24/0.42    ~((powersetAx = $true) => ! [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ((in @ X0 @ (powerset @ X1)) = $true)))),
% 0.24/0.42    inference(fool_elimination,[],[f5])).
% 0.24/0.42  thf(f5,plain,(
% 0.24/0.42    ~(powersetAx => ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (in @ X0 @ (powerset @ X1))))),
% 0.24/0.42    inference(rectify,[],[f3])).
% 0.24/0.42  thf(f3,negated_conjecture,(
% 0.24/0.42    ~(powersetAx => ! [X1,X0] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.24/0.42    inference(negated_conjecture,[],[f2])).
% 0.24/0.42  thf(f2,conjecture,(
% 0.24/0.42    powersetAx => ! [X1,X0] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0)))),
% 0.24/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI)).
% 0.24/0.42  thf(f43,plain,(
% 0.24/0.42    ($true = (in @ sK0 @ (powerset @ sK1)))),
% 0.24/0.42    inference(trivial_inequality_removal,[],[f42])).
% 0.24/0.42  thf(f42,plain,(
% 0.24/0.42    ($true != $true) | ($true = (in @ sK0 @ (powerset @ sK1)))),
% 0.24/0.42    inference(duplicate_literal_removal,[],[f41])).
% 0.24/0.42  thf(f41,plain,(
% 0.24/0.42    ($true != $true) | ($true = (in @ sK0 @ (powerset @ sK1))) | ($true = (in @ sK0 @ (powerset @ sK1)))),
% 0.24/0.42    inference(superposition,[],[f34,f30])).
% 0.24/0.42  thf(f30,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (($true = (in @ (sK3 @ X1 @ X2) @ X2)) | ($true = (in @ X2 @ (powerset @ X1)))) )),
% 0.24/0.42    inference(binary_proxy_clausification,[],[f28])).
% 0.24/0.42  thf(f28,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (powerset @ X1))) | (((in @ (sK3 @ X1 @ X2) @ X2) => (in @ (sK3 @ X1 @ X2) @ X1)) = $false)) )),
% 0.24/0.42    inference(beta_eta_normalization,[],[f27])).
% 0.24/0.42  thf(f27,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (powerset @ X1))) | (((^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1))) @ (sK3 @ X1 @ X2)) = $false)) )),
% 0.24/0.42    inference(sigma_clausification,[],[f22])).
% 0.24/0.42  thf(f22,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (powerset @ X1))) | ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) = $false)) )),
% 0.24/0.42    inference(binary_proxy_clausification,[],[f21])).
% 0.24/0.42  thf(f21,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (((in @ X2 @ (powerset @ X1)) = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))))) )),
% 0.24/0.42    inference(binary_proxy_clausification,[],[f20])).
% 0.24/0.42  thf(f20,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) = (in @ X2 @ (powerset @ X1))))) )),
% 0.24/0.42    inference(beta_eta_normalization,[],[f19])).
% 0.24/0.42  thf(f19,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) = (in @ Y0 @ (powerset @ X1)))) @ X2) = $true)) )),
% 0.24/0.42    inference(pi_clausification,[],[f18])).
% 0.24/0.42  thf(f18,plain,(
% 0.24/0.42    ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) = (in @ Y0 @ (powerset @ X1))))))) )),
% 0.24/0.42    inference(beta_eta_normalization,[],[f17])).
% 0.24/0.42  thf(f17,plain,(
% 0.24/0.42    ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) = (in @ Y1 @ (powerset @ Y0)))))) @ X1) = $true)) )),
% 0.24/0.42    inference(pi_clausification,[],[f16])).
% 0.24/0.42  thf(f16,plain,(
% 0.24/0.42    ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) = (in @ Y1 @ (powerset @ Y0))))))) = $true)),
% 0.24/0.42    inference(definition_unfolding,[],[f13,f12])).
% 0.24/0.42  thf(f12,plain,(
% 0.24/0.42    (powersetAx = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) = (in @ Y1 @ (powerset @ Y0))))))))),
% 0.24/0.42    inference(cnf_transformation,[],[f8])).
% 0.24/0.42  thf(f8,plain,(
% 0.24/0.42    (powersetAx = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) = (in @ Y1 @ (powerset @ Y0))))))))),
% 0.24/0.42    inference(fool_elimination,[],[f7])).
% 0.24/0.42  thf(f7,plain,(
% 0.24/0.42    (! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) <=> (in @ X0 @ (powerset @ X1))) = powersetAx)),
% 0.24/0.42    inference(rectify,[],[f1])).
% 0.24/0.42  thf(f1,axiom,(
% 0.24/0.42    (! [X1,X0] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) <=> (in @ X1 @ (powerset @ X0))) = powersetAx)),
% 0.24/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetAx)).
% 0.24/0.42  thf(f13,plain,(
% 0.24/0.42    (powersetAx = $true)),
% 0.24/0.42    inference(cnf_transformation,[],[f11])).
% 0.24/0.42  thf(f34,plain,(
% 0.24/0.42    ( ! [X0 : $i] : (((in @ (sK3 @ sK1 @ X0) @ sK0) != $true) | ($true = (in @ X0 @ (powerset @ sK1)))) )),
% 0.24/0.42    inference(trivial_inequality_removal,[],[f32])).
% 0.24/0.42  thf(f32,plain,(
% 0.24/0.42    ( ! [X0 : $i] : (($true = (in @ X0 @ (powerset @ sK1))) | ((in @ (sK3 @ sK1 @ X0) @ sK0) != $true) | ($true = $false)) )),
% 0.24/0.42    inference(superposition,[],[f14,f29])).
% 0.24/0.42  thf(f29,plain,(
% 0.24/0.42    ( ! [X2 : $i,X1 : $i] : (((in @ (sK3 @ X1 @ X2) @ X1) = $false) | ($true = (in @ X2 @ (powerset @ X1)))) )),
% 0.24/0.42    inference(binary_proxy_clausification,[],[f28])).
% 0.24/0.42  thf(f14,plain,(
% 0.24/0.42    ( ! [X2 : $i] : (((in @ X2 @ sK1) = $true) | ((in @ X2 @ sK0) != $true)) )),
% 0.24/0.42    inference(cnf_transformation,[],[f11])).
% 0.24/0.42  % SZS output end Proof for theBenchmark
% 0.24/0.42  % (13658)------------------------------
% 0.24/0.42  % (13658)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.42  % (13658)Termination reason: Refutation
% 0.24/0.42  
% 0.24/0.42  % (13658)Memory used [KB]: 5500
% 0.24/0.42  % (13658)Time elapsed: 0.006 s
% 0.24/0.42  % (13658)Instructions burned: 4 (million)
% 0.24/0.42  % (13658)------------------------------
% 0.24/0.42  % (13658)------------------------------
% 0.24/0.42  % (13657)Success in time 0.005 s
% 0.24/0.42  % Vampire---4.8 exiting
%------------------------------------------------------------------------------