TSTP Solution File: SEU713^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU713^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 : n014.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:50:58 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU713^2 : 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.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 17:08:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.38 % (10513)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (10512)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.15/0.38 % (10507)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.15/0.38 % (10514)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.15/0.38 % (10513)First to succeed.
% 0.15/0.38 % (10514)Instruction limit reached!
% 0.15/0.38 % (10514)------------------------------
% 0.15/0.38 % (10514)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10514)Termination reason: Unknown
% 0.15/0.38 % (10514)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (10514)Memory used [KB]: 1023
% 0.15/0.38 % (10514)Time elapsed: 0.004 s
% 0.15/0.38 % (10514)Instructions burned: 3 (million)
% 0.15/0.38 % (10514)------------------------------
% 0.15/0.38 % (10514)------------------------------
% 0.15/0.39 % (10512)Also succeeded, but the first one will report.
% 0.15/0.39 % (10513)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.39 thf(func_def_5, type, setminus: $i > $i > $i).
% 0.15/0.39 thf(func_def_20, type, sK11: $i > $i > $i).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f84,f41])).
% 0.15/0.39 thf(f41,plain,(
% 0.15/0.39 ($true != (in @ (setminus @ sK1 @ sK2) @ (powerset @ sK0)))),
% 0.15/0.39 inference(cnf_transformation,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ((((in @ sK2 @ (powerset @ sK0)) = $true) & ($true != (in @ (setminus @ sK1 @ sK2) @ (powerset @ sK0)))) & ((in @ sK1 @ (powerset @ sK0)) = $true)) & (powersetI = $true) & (setminusEL = $true) & (powersetE = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f22,f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ($true != (in @ (setminus @ X1 @ X2) @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (((in @ X2 @ (powerset @ sK0)) = $true) & ((in @ (setminus @ sK1 @ X2) @ (powerset @ sK0)) != $true)) & ((in @ sK1 @ (powerset @ sK0)) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 ? [X2] : (((in @ X2 @ (powerset @ sK0)) = $true) & ((in @ (setminus @ sK1 @ X2) @ (powerset @ sK0)) != $true)) => (((in @ sK2 @ (powerset @ sK0)) = $true) & ($true != (in @ (setminus @ sK1 @ sK2) @ (powerset @ sK0))))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ($true != (in @ (setminus @ X1 @ X2) @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true)) & (powersetI = $true) & (setminusEL = $true) & (powersetE = $true)),
% 0.15/0.39 inference(flattening,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ((? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X0)) = $true) & ($true != (in @ (setminus @ X1 @ X2) @ (powerset @ X0)))) & ((in @ X1 @ (powerset @ X0)) = $true)) & (setminusEL = $true)) & (powersetE = $true)) & (powersetI = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 ~((powersetI = $true) => ((powersetE = $true) => ((setminusEL = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ($true = (in @ (setminus @ X1 @ X2) @ (powerset @ X0))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 ~(powersetI => (powersetE => (setminusEL => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (setminus @ X1 @ X2) @ (powerset @ X0)))))))),
% 0.15/0.39 inference(rectify,[],[f5])).
% 0.15/0.39 thf(f5,negated_conjecture,(
% 0.15/0.39 ~(powersetI => (powersetE => (setminusEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (in @ (setminus @ X3 @ X4) @ (powerset @ X0)))))))),
% 0.15/0.39 inference(negated_conjecture,[],[f4])).
% 0.15/0.39 thf(f4,conjecture,(
% 0.15/0.39 powersetI => (powersetE => (setminusEL => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (in @ (setminus @ X3 @ X4) @ (powerset @ X0))))))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusT_lem)).
% 0.15/0.39 thf(f84,plain,(
% 0.15/0.39 ($true = (in @ (setminus @ sK1 @ sK2) @ (powerset @ sK0)))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f83])).
% 0.15/0.39 thf(f83,plain,(
% 0.15/0.39 ($true = (in @ (setminus @ sK1 @ sK2) @ (powerset @ sK0))) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f67,f82])).
% 0.15/0.39 thf(f82,plain,(
% 0.15/0.39 ($true = (in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ sK0))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f81])).
% 0.15/0.39 thf(f81,plain,(
% 0.15/0.39 ($true != $true) | ($true = (in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ sK0))),
% 0.15/0.39 inference(superposition,[],[f78,f80])).
% 0.15/0.39 thf(f80,plain,(
% 0.15/0.39 ((in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ sK1) = $true)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f79])).
% 0.15/0.39 thf(f79,plain,(
% 0.15/0.39 ((in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ sK1) = $true) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f68,f70])).
% 0.15/0.39 thf(f70,plain,(
% 0.15/0.39 ((in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ (setminus @ sK1 @ sK2)) = $true)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f69])).
% 0.15/0.39 thf(f69,plain,(
% 0.15/0.39 ((in @ (sK11 @ (setminus @ sK1 @ sK2) @ sK0) @ (setminus @ sK1 @ sK2)) = $true) | ($true != $true)),
% 0.15/0.39 inference(superposition,[],[f41,f66])).
% 0.15/0.39 thf(f66,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK11 @ X4 @ X3) @ X4) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f64])).
% 0.15/0.39 thf(f64,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ (sK11 @ X4 @ X3) @ X4) = $true) | ($true != $true) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 0.15/0.39 inference(definition_unfolding,[],[f50,f39])).
% 0.15/0.39 thf(f39,plain,(
% 0.15/0.39 (powersetI = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f23])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK11 @ X4 @ X3) @ X4) = $true) | (powersetI != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f36])).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 ((powersetI = $true) | (($true != (in @ sK10 @ (powerset @ sK9))) & ! [X2] : (($true = (in @ X2 @ sK9)) | ((in @ X2 @ sK10) != $true)))) & (! [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) | (((in @ (sK11 @ X4 @ X3) @ X3) != $true) & ((in @ (sK11 @ X4 @ X3) @ X4) = $true))) | (powersetI != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f33,f35,f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true))) => (($true != (in @ sK10 @ (powerset @ sK9))) & ! [X2] : (($true = (in @ X2 @ sK9)) | ((in @ X2 @ sK10) != $true)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ! [X3,X4] : (? [X5] : (((in @ X5 @ X3) != $true) & ($true = (in @ X5 @ X4))) => (((in @ (sK11 @ X4 @ X3) @ X3) != $true) & ((in @ (sK11 @ X4 @ X3) @ X4) = $true)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) & ! [X2] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)))) & (! [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) | ? [X5] : (((in @ X5 @ X3) != $true) & ($true = (in @ X5 @ X4)))) | (powersetI != $true))),
% 0.15/0.39 inference(rectify,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ((powersetI = $true) | ? [X1,X0] : (((in @ X0 @ (powerset @ X1)) != $true) & ! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)))) & (! [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) | (powersetI != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 (powersetI = $true) <=> ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true)))),
% 0.15/0.39 inference(ennf_transformation,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 ! [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ((in @ X0 @ (powerset @ X1)) = $true)) <=> (powersetI = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 (powersetI = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (in @ X0 @ (powerset @ X1))))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (powersetI = ! [X1,X0] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetI)).
% 0.15/0.39 thf(f68,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (setminus @ X2 @ X0)) != $true) | ((in @ X1 @ X2) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f54])).
% 0.15/0.39 thf(f54,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ((in @ X1 @ X2) = $true) | ((in @ X1 @ (setminus @ X2 @ X0)) != $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f45,f38])).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 (setminusEL = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f23])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ X2) = $true) | ((in @ X1 @ (setminus @ X2 @ X0)) != $true) | (setminusEL != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 (! [X0,X1,X2] : (((in @ X1 @ X2) = $true) | ((in @ X1 @ (setminus @ X2 @ X0)) != $true)) | (setminusEL != $true)) & ((setminusEL = $true) | (($true != (in @ sK4 @ sK5)) & ((in @ sK4 @ (setminus @ sK5 @ sK3)) = $true)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f25,f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ? [X3,X4,X5] : (((in @ X4 @ X5) != $true) & ((in @ X4 @ (setminus @ X5 @ X3)) = $true)) => (($true != (in @ sK4 @ sK5)) & ((in @ sK4 @ (setminus @ sK5 @ sK3)) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 (! [X0,X1,X2] : (((in @ X1 @ X2) = $true) | ((in @ X1 @ (setminus @ X2 @ X0)) != $true)) | (setminusEL != $true)) & ((setminusEL = $true) | ? [X3,X4,X5] : (((in @ X4 @ X5) != $true) & ((in @ X4 @ (setminus @ X5 @ X3)) = $true)))),
% 0.15/0.39 inference(rectify,[],[f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 (! [X1,X2,X0] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ (setminus @ X0 @ X1)) != $true)) | (setminusEL != $true)) & ((setminusEL = $true) | ? [X1,X2,X0] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ (setminus @ X0 @ X1)) = $true)))),
% 0.15/0.39 inference(nnf_transformation,[],[f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ! [X1,X2,X0] : (((in @ X2 @ X0) = $true) | ((in @ X2 @ (setminus @ X0 @ X1)) != $true)) <=> (setminusEL = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ! [X0,X1,X2] : (((in @ X2 @ (setminus @ X0 @ X1)) = $true) => ((in @ X2 @ X0) = $true)) <=> (setminusEL = $true)),
% 0.15/0.39 inference(fool_elimination,[],[f13])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 (setminusEL = ! [X0,X1,X2] : ((in @ X2 @ (setminus @ X0 @ X1)) => (in @ X2 @ X0)))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,axiom,(
% 0.15/0.39 (setminusEL = ! [X0,X1,X2] : ((in @ X2 @ (setminus @ X0 @ X1)) => (in @ X2 @ X0)))),
% 0.15/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminusEL)).
% 0.15/0.39 thf(f78,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (($true != (in @ X0 @ sK1)) | ($true = (in @ X0 @ sK0))) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f73])).
% 0.15/0.39 thf(f73,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (($true != $true) | ($true != (in @ X0 @ sK1)) | ($true = (in @ X0 @ sK0))) )),
% 0.15/0.39 inference(superposition,[],[f65,f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ((in @ sK1 @ (powerset @ sK0)) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f23])).
% 0.15/0.39 thf(f65,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f57])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ((in @ X0 @ (powerset @ X1)) != $true) | ((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f49,f37])).
% 0.15/0.39 thf(f37,plain,(
% 0.15/0.39 (powersetE = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f23])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X0 @ (powerset @ X1)) != $true) | (powersetE != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f31])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 (! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X0 @ (powerset @ X1)) != $true)) | (powersetE != $true)) & ((powersetE = $true) | (((in @ sK8 @ sK7) != $true) & ($true = (in @ sK8 @ sK6)) & ((in @ sK6 @ (powerset @ sK7)) = $true)))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f29,f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ? [X3,X4,X5] : (($true != (in @ X5 @ X4)) & ((in @ X5 @ X3) = $true) & ((in @ X3 @ (powerset @ X4)) = $true)) => (((in @ sK8 @ sK7) != $true) & ($true = (in @ sK8 @ sK6)) & ((in @ sK6 @ (powerset @ sK7)) = $true))),
% 0.22/0.39 introduced(choice_axiom,[])).
% 0.22/0.39 thf(f29,plain,(
% 0.22/0.39 (! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X0 @ (powerset @ X1)) != $true)) | (powersetE != $true)) & ((powersetE = $true) | ? [X3,X4,X5] : (($true != (in @ X5 @ X4)) & ((in @ X5 @ X3) = $true) & ((in @ X3 @ (powerset @ X4)) = $true)))),
% 0.22/0.39 inference(rectify,[],[f28])).
% 0.22/0.39 thf(f28,plain,(
% 0.22/0.39 (! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X0 @ (powerset @ X1)) != $true)) | (powersetE != $true)) & ((powersetE = $true) | ? [X0,X1,X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true) & ((in @ X0 @ (powerset @ X1)) = $true)))),
% 0.22/0.39 inference(nnf_transformation,[],[f20])).
% 0.22/0.39 thf(f20,plain,(
% 0.22/0.39 ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true) | ((in @ X0 @ (powerset @ X1)) != $true)) <=> (powersetE = $true)),
% 0.22/0.39 inference(flattening,[],[f19])).
% 0.22/0.39 thf(f19,plain,(
% 0.22/0.39 (powersetE = $true) <=> ! [X1,X0,X2] : ((((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) | ((in @ X0 @ (powerset @ X1)) != $true))),
% 0.22/0.39 inference(ennf_transformation,[],[f8])).
% 0.22/0.39 thf(f8,plain,(
% 0.22/0.39 (powersetE = $true) <=> ! [X1,X0,X2] : (((in @ X0 @ (powerset @ X1)) = $true) => (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)))),
% 0.22/0.39 inference(fool_elimination,[],[f7])).
% 0.22/0.39 thf(f7,plain,(
% 0.22/0.39 (powersetE = ! [X0,X1,X2] : ((in @ X0 @ (powerset @ X1)) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 0.22/0.39 inference(rectify,[],[f2])).
% 0.22/0.39 thf(f2,axiom,(
% 0.22/0.39 (powersetE = ! [X1,X0,X2] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.22/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetE)).
% 0.22/0.39 thf(f67,plain,(
% 0.22/0.39 ( ! [X3 : $i,X4 : $i] : (((in @ (sK11 @ X4 @ X3) @ X3) != $true) | ($true = (in @ X4 @ (powerset @ X3)))) )),
% 0.22/0.39 inference(trivial_inequality_removal,[],[f63])).
% 0.22/0.39 thf(f63,plain,(
% 0.22/0.39 ( ! [X3 : $i,X4 : $i] : (($true != $true) | ($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK11 @ X4 @ X3) @ X3) != $true)) )),
% 0.22/0.39 inference(definition_unfolding,[],[f51,f39])).
% 0.22/0.39 thf(f51,plain,(
% 0.22/0.39 ( ! [X3 : $i,X4 : $i] : (($true = (in @ X4 @ (powerset @ X3))) | ((in @ (sK11 @ X4 @ X3) @ X3) != $true) | (powersetI != $true)) )),
% 0.22/0.39 inference(cnf_transformation,[],[f36])).
% 0.22/0.39 % SZS output end Proof for theBenchmark
% 0.22/0.39 % (10513)------------------------------
% 0.22/0.39 % (10513)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (10513)Termination reason: Refutation
% 0.22/0.39
% 0.22/0.39 % (10513)Memory used [KB]: 5500
% 0.22/0.39 % (10513)Time elapsed: 0.007 s
% 0.22/0.39 % (10513)Instructions burned: 7 (million)
% 0.22/0.39 % (10513)------------------------------
% 0.22/0.39 % (10513)------------------------------
% 0.22/0.39 % (10506)Success in time 0.019 s
% 0.22/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------