TSTP Solution File: SEU716^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU716^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 : n005.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:59 EDT 2024
% Result : Theorem 0.16s 0.37s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU716^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.16/0.34 % Computer : n005.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sun May 19 17:24:08 EDT 2024
% 0.16/0.34 % CPUTime :
% 0.16/0.34 This is a TH0_THM_EQU_NAR problem
% 0.16/0.35 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.16/0.36 % (24946)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.16/0.36 % (24946)Instruction limit reached!
% 0.16/0.36 % (24946)------------------------------
% 0.16/0.36 % (24946)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (24946)Termination reason: Unknown
% 0.16/0.36 % (24946)Termination phase: Saturation
% 0.16/0.36
% 0.16/0.36 % (24946)Memory used [KB]: 895
% 0.16/0.36 % (24946)Time elapsed: 0.002 s
% 0.16/0.36 % (24946)Instructions burned: 3 (million)
% 0.16/0.36 % (24946)------------------------------
% 0.16/0.36 % (24946)------------------------------
% 0.16/0.37 % (24944)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.16/0.37 % (24947)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.16/0.37 % (24943)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.16/0.37 % (24949)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.16/0.37 % (24948)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.37 % (24942)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.16/0.37 % (24949)Instruction limit reached!
% 0.16/0.37 % (24949)------------------------------
% 0.16/0.37 % (24949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (24949)Termination reason: Unknown
% 0.16/0.37 % (24949)Termination phase: Saturation
% 0.16/0.37
% 0.16/0.37 % (24949)Memory used [KB]: 5500
% 0.16/0.37 % (24949)Time elapsed: 0.004 s
% 0.16/0.37 % (24949)Instructions burned: 3 (million)
% 0.16/0.37 % (24949)------------------------------
% 0.16/0.37 % (24949)------------------------------
% 0.16/0.37 % (24945)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.37 % (24943)Instruction limit reached!
% 0.16/0.37 % (24943)------------------------------
% 0.16/0.37 % (24943)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (24943)Termination reason: Unknown
% 0.16/0.37 % (24943)Termination phase: Saturation
% 0.16/0.37
% 0.16/0.37 % (24943)Memory used [KB]: 5500
% 0.16/0.37 % (24945)Instruction limit reached!
% 0.16/0.37 % (24945)------------------------------
% 0.16/0.37 % (24945)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (24943)Time elapsed: 0.005 s
% 0.16/0.37 % (24943)Instructions burned: 5 (million)
% 0.16/0.37 % (24943)------------------------------
% 0.16/0.37 % (24943)------------------------------
% 0.16/0.37 % (24945)Termination reason: Unknown
% 0.16/0.37 % (24945)Termination phase: Preprocessing 2
% 0.16/0.37
% 0.16/0.37 % (24945)Memory used [KB]: 895
% 0.16/0.37 % (24945)Time elapsed: 0.003 s
% 0.16/0.37 % (24945)Instructions burned: 2 (million)
% 0.16/0.37 % (24945)------------------------------
% 0.16/0.37 % (24945)------------------------------
% 0.16/0.37 % (24951)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.16/0.37 % (24948)First to succeed.
% 0.16/0.37 % (24948)Refutation found. Thanks to Tanya!
% 0.16/0.37 % SZS status Theorem for theBenchmark
% 0.16/0.37 % SZS output start Proof for theBenchmark
% 0.16/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.16/0.37 thf(func_def_1, type, powerset: $i > $i).
% 0.16/0.37 thf(func_def_4, type, subset: $i > $i > $o).
% 0.16/0.37 thf(func_def_14, type, sK6: $i > $i > $i).
% 0.16/0.37 thf(f69,plain,(
% 0.16/0.37 $false),
% 0.16/0.37 inference(subsumption_resolution,[],[f67,f35])).
% 0.16/0.37 thf(f35,plain,(
% 0.16/0.37 ($true != (subset @ sK3 @ sK5))),
% 0.16/0.37 inference(cnf_transformation,[],[f23])).
% 0.16/0.37 thf(f23,plain,(
% 0.16/0.37 (powersetE = $true) & (subsetI2 = $true) & ((! [X3] : (($true != (in @ X3 @ sK3)) | ($true != (in @ X3 @ sK4)) | ($true = (in @ X3 @ sK5))) & ($true != (subset @ sK3 @ sK5)) & ($true = (in @ sK5 @ (powerset @ sK4)))) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.16/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f13,f22,f21])).
% 0.16/0.37 thf(f21,plain,(
% 0.16/0.37 ? [X0,X1] : (? [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ($true != (in @ X3 @ X1)) | ((in @ X3 @ X2) = $true)) & ($true != (subset @ X0 @ X2)) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) => (? [X2] : (! [X3] : (($true != (in @ X3 @ sK3)) | ($true != (in @ X3 @ sK4)) | ((in @ X3 @ X2) = $true)) & ($true != (subset @ sK3 @ X2)) & ((in @ X2 @ (powerset @ sK4)) = $true)) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.16/0.37 introduced(choice_axiom,[])).
% 0.16/0.37 thf(f22,plain,(
% 0.16/0.37 ? [X2] : (! [X3] : (($true != (in @ X3 @ sK3)) | ($true != (in @ X3 @ sK4)) | ((in @ X3 @ X2) = $true)) & ($true != (subset @ sK3 @ X2)) & ((in @ X2 @ (powerset @ sK4)) = $true)) => (! [X3] : (($true != (in @ X3 @ sK3)) | ($true != (in @ X3 @ sK4)) | ($true = (in @ X3 @ sK5))) & ($true != (subset @ sK3 @ sK5)) & ($true = (in @ sK5 @ (powerset @ sK4))))),
% 0.16/0.37 introduced(choice_axiom,[])).
% 0.16/0.37 thf(f13,plain,(
% 0.16/0.37 (powersetE = $true) & (subsetI2 = $true) & ? [X0,X1] : (? [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ($true != (in @ X3 @ X1)) | ((in @ X3 @ X2) = $true)) & ($true != (subset @ X0 @ X2)) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1))))),
% 0.16/0.37 inference(flattening,[],[f12])).
% 0.16/0.37 thf(f12,plain,(
% 0.16/0.37 (? [X0,X1] : (? [X2] : ((($true != (subset @ X0 @ X2)) & ! [X3] : ((((in @ X3 @ X2) = $true) | ((in @ X3 @ X0) != $true)) | ($true != (in @ X3 @ X1)))) & ($true = (in @ X2 @ (powerset @ X1)))) & ($true = (in @ X0 @ (powerset @ X1)))) & (subsetI2 = $true)) & (powersetE = $true)),
% 0.16/0.37 inference(ennf_transformation,[],[f7])).
% 0.16/0.37 thf(f7,plain,(
% 0.16/0.37 ~((powersetE = $true) => ((subsetI2 = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => (! [X3] : (($true = (in @ X3 @ X1)) => (((in @ X3 @ X0) = $true) => ((in @ X3 @ X2) = $true))) => ($true = (subset @ X0 @ X2)))))))),
% 0.16/0.37 inference(fool_elimination,[],[f6])).
% 0.16/0.37 thf(f6,plain,(
% 0.16/0.37 ~(powersetE => (subsetI2 => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (! [X3] : ((in @ X3 @ X1) => ((in @ X3 @ X0) => (in @ X3 @ X2))) => (subset @ X0 @ X2))))))),
% 0.16/0.37 inference(rectify,[],[f4])).
% 0.16/0.37 thf(f4,negated_conjecture,(
% 0.16/0.37 ~(powersetE => (subsetI2 => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ X3) => (in @ X2 @ X4))) => (subset @ X3 @ X4))))))),
% 0.16/0.37 inference(negated_conjecture,[],[f3])).
% 0.16/0.37 thf(f3,conjecture,(
% 0.16/0.37 powersetE => (subsetI2 => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ X3) => (in @ X2 @ X4))) => (subset @ X3 @ X4)))))),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetTI)).
% 0.16/0.37 thf(f67,plain,(
% 0.16/0.37 ($true = (subset @ sK3 @ sK5))),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f65])).
% 0.16/0.37 thf(f65,plain,(
% 0.16/0.37 ($true != $true) | ($true = (subset @ sK3 @ sK5))),
% 0.16/0.37 inference(superposition,[],[f52,f64])).
% 0.16/0.37 thf(f64,plain,(
% 0.16/0.37 ((in @ (sK6 @ sK3 @ sK5) @ sK5) = $true)),
% 0.16/0.37 inference(subsumption_resolution,[],[f63,f55])).
% 0.16/0.37 thf(f55,plain,(
% 0.16/0.37 ($true = (in @ (sK6 @ sK3 @ sK5) @ sK3))),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f54])).
% 0.16/0.37 thf(f54,plain,(
% 0.16/0.37 ($true != $true) | ($true = (in @ (sK6 @ sK3 @ sK5) @ sK3))),
% 0.16/0.37 inference(superposition,[],[f35,f53])).
% 0.16/0.37 thf(f53,plain,(
% 0.16/0.37 ( ! [X0 : $i,X1 : $i] : (((subset @ X1 @ X0) = $true) | ($true = (in @ (sK6 @ X1 @ X0) @ X1))) )),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f47])).
% 0.16/0.37 thf(f47,plain,(
% 0.16/0.37 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK6 @ X1 @ X0) @ X1)) | ($true != $true) | ((subset @ X1 @ X0) = $true)) )),
% 0.16/0.37 inference(definition_unfolding,[],[f42,f37])).
% 0.16/0.37 thf(f37,plain,(
% 0.16/0.37 (subsetI2 = $true)),
% 0.16/0.37 inference(cnf_transformation,[],[f23])).
% 0.16/0.37 thf(f42,plain,(
% 0.16/0.37 ( ! [X0 : $i,X1 : $i] : (((subset @ X1 @ X0) = $true) | ($true = (in @ (sK6 @ X1 @ X0) @ X1)) | (subsetI2 != $true)) )),
% 0.16/0.37 inference(cnf_transformation,[],[f28])).
% 0.16/0.37 thf(f28,plain,(
% 0.16/0.37 (! [X0,X1] : (((subset @ X1 @ X0) = $true) | (($true = (in @ (sK6 @ X1 @ X0) @ X1)) & ($true != (in @ (sK6 @ X1 @ X0) @ X0)))) | (subsetI2 != $true)) & ((subsetI2 = $true) | (($true != (subset @ sK8 @ sK7)) & ! [X5] : (((in @ X5 @ sK8) != $true) | ((in @ X5 @ sK7) = $true))))),
% 0.16/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f25,f27,f26])).
% 0.16/0.37 thf(f26,plain,(
% 0.16/0.37 ! [X0,X1] : (? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (($true = (in @ (sK6 @ X1 @ X0) @ X1)) & ($true != (in @ (sK6 @ X1 @ X0) @ X0))))),
% 0.16/0.37 introduced(choice_axiom,[])).
% 0.16/0.37 thf(f27,plain,(
% 0.16/0.37 ? [X3,X4] : (($true != (subset @ X4 @ X3)) & ! [X5] : (($true != (in @ X5 @ X4)) | ((in @ X5 @ X3) = $true))) => (($true != (subset @ sK8 @ sK7)) & ! [X5] : (((in @ X5 @ sK8) != $true) | ((in @ X5 @ sK7) = $true)))),
% 0.16/0.37 introduced(choice_axiom,[])).
% 0.16/0.37 thf(f25,plain,(
% 0.16/0.37 (! [X0,X1] : (((subset @ X1 @ X0) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X3,X4] : (($true != (subset @ X4 @ X3)) & ! [X5] : (($true != (in @ X5 @ X4)) | ((in @ X5 @ X3) = $true))))),
% 0.16/0.37 inference(rectify,[],[f24])).
% 0.16/0.37 thf(f24,plain,(
% 0.16/0.37 (! [X0,X1] : (((subset @ X1 @ X0) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X0,X1] : (((subset @ X1 @ X0) != $true) & ! [X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true))))),
% 0.16/0.37 inference(nnf_transformation,[],[f16])).
% 0.16/0.37 thf(f16,plain,(
% 0.16/0.37 ! [X0,X1] : (((subset @ X1 @ X0) = $true) | ? [X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) <=> (subsetI2 = $true)),
% 0.16/0.37 inference(ennf_transformation,[],[f9])).
% 0.16/0.37 thf(f9,plain,(
% 0.16/0.37 (subsetI2 = $true) <=> ! [X1,X0] : (! [X2] : (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)) => ((subset @ X1 @ X0) = $true))),
% 0.16/0.37 inference(fool_elimination,[],[f8])).
% 0.16/0.37 thf(f8,plain,(
% 0.16/0.37 (! [X0,X1] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)) = subsetI2)),
% 0.16/0.37 inference(rectify,[],[f2])).
% 0.16/0.37 thf(f2,axiom,(
% 0.16/0.37 (! [X1,X0] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)) = subsetI2)),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2)).
% 0.16/0.37 thf(f63,plain,(
% 0.16/0.37 ((in @ (sK6 @ sK3 @ sK5) @ sK5) = $true) | ($true != (in @ (sK6 @ sK3 @ sK5) @ sK3))),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f62])).
% 0.16/0.37 thf(f62,plain,(
% 0.16/0.37 ($true != (in @ (sK6 @ sK3 @ sK5) @ sK3)) | ((in @ (sK6 @ sK3 @ sK5) @ sK5) = $true) | ($true != $true)),
% 0.16/0.37 inference(superposition,[],[f36,f61])).
% 0.16/0.37 thf(f61,plain,(
% 0.16/0.37 ((in @ (sK6 @ sK3 @ sK5) @ sK4) = $true)),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f60])).
% 0.16/0.37 thf(f60,plain,(
% 0.16/0.37 ($true != $true) | ((in @ (sK6 @ sK3 @ sK5) @ sK4) = $true)),
% 0.16/0.37 inference(superposition,[],[f59,f55])).
% 0.16/0.37 thf(f59,plain,(
% 0.16/0.37 ( ! [X0 : $i] : (($true != (in @ X0 @ sK3)) | ($true = (in @ X0 @ sK4))) )),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f56])).
% 0.16/0.37 thf(f56,plain,(
% 0.16/0.37 ( ! [X0 : $i] : (($true != $true) | ($true != (in @ X0 @ sK3)) | ($true = (in @ X0 @ sK4))) )),
% 0.16/0.37 inference(superposition,[],[f51,f33])).
% 0.16/0.37 thf(f33,plain,(
% 0.16/0.37 ((in @ sK3 @ (powerset @ sK4)) = $true)),
% 0.16/0.37 inference(cnf_transformation,[],[f23])).
% 0.16/0.37 thf(f51,plain,(
% 0.16/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X3 @ (powerset @ X4))) | ((in @ X5 @ X3) != $true) | ($true = (in @ X5 @ X4))) )),
% 0.16/0.37 inference(trivial_inequality_removal,[],[f46])).
% 0.16/0.37 thf(f46,plain,(
% 0.16/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ($true != (in @ X3 @ (powerset @ X4))) | ($true = (in @ X5 @ X4)) | ((in @ X5 @ X3) != $true)) )),
% 0.16/0.37 inference(definition_unfolding,[],[f29,f38])).
% 0.16/0.37 thf(f38,plain,(
% 0.16/0.37 (powersetE = $true)),
% 0.16/0.37 inference(cnf_transformation,[],[f23])).
% 0.16/0.37 thf(f29,plain,(
% 0.16/0.37 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X5 @ X3) != $true) | ($true = (in @ X5 @ X4)) | ($true != (in @ X3 @ (powerset @ X4))) | (powersetE != $true)) )),
% 0.16/0.37 inference(cnf_transformation,[],[f20])).
% 0.16/0.37 thf(f20,plain,(
% 0.16/0.37 ((powersetE = $true) | (((in @ sK2 @ sK0) = $true) & ($true != (in @ sK2 @ sK1)) & ($true = (in @ sK0 @ (powerset @ sK1))))) & (! [X3,X4,X5] : (((in @ X5 @ X3) != $true) | ($true = (in @ X5 @ X4)) | ($true != (in @ X3 @ (powerset @ X4)))) | (powersetE != $true))),
% 0.16/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f19])).
% 0.16/0.37 thf(f19,plain,(
% 0.16/0.37 ? [X0,X1,X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1)))) => (((in @ sK2 @ sK0) = $true) & ($true != (in @ sK2 @ sK1)) & ($true = (in @ sK0 @ (powerset @ sK1))))),
% 0.16/0.37 introduced(choice_axiom,[])).
% 0.16/0.37 thf(f18,plain,(
% 0.16/0.37 ((powersetE = $true) | ? [X0,X1,X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1))))) & (! [X3,X4,X5] : (((in @ X5 @ X3) != $true) | ($true = (in @ X5 @ X4)) | ($true != (in @ X3 @ (powerset @ X4)))) | (powersetE != $true))),
% 0.16/0.37 inference(rectify,[],[f17])).
% 0.16/0.37 thf(f17,plain,(
% 0.16/0.37 ((powersetE = $true) | ? [X0,X1,X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true) & ($true = (in @ X0 @ (powerset @ X1))))) & (! [X0,X1,X2] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true) | ($true != (in @ X0 @ (powerset @ X1)))) | (powersetE != $true))),
% 0.16/0.37 inference(nnf_transformation,[],[f15])).
% 0.16/0.37 thf(f15,plain,(
% 0.16/0.37 (powersetE = $true) <=> ! [X0,X1,X2] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true) | ($true != (in @ X0 @ (powerset @ X1))))),
% 0.16/0.37 inference(flattening,[],[f14])).
% 0.16/0.37 thf(f14,plain,(
% 0.16/0.37 ! [X1,X2,X0] : ((((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true)) | ($true != (in @ X0 @ (powerset @ X1)))) <=> (powersetE = $true)),
% 0.16/0.38 inference(ennf_transformation,[],[f11])).
% 0.16/0.38 thf(f11,plain,(
% 0.16/0.38 ! [X1,X2,X0] : (($true = (in @ X0 @ (powerset @ X1))) => (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true))) <=> (powersetE = $true)),
% 0.16/0.38 inference(fool_elimination,[],[f10])).
% 0.16/0.38 thf(f10,plain,(
% 0.16/0.38 (! [X0,X1,X2] : ((in @ X0 @ (powerset @ X1)) => ((in @ X2 @ X0) => (in @ X2 @ X1))) = powersetE)),
% 0.16/0.38 inference(rectify,[],[f1])).
% 0.16/0.38 thf(f1,axiom,(
% 0.16/0.38 (! [X1,X0,X2] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))) = powersetE)),
% 0.16/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetE)).
% 0.16/0.38 thf(f36,plain,(
% 0.16/0.38 ( ! [X3 : $i] : (($true != (in @ X3 @ sK4)) | ($true = (in @ X3 @ sK5)) | ($true != (in @ X3 @ sK3))) )),
% 0.16/0.38 inference(cnf_transformation,[],[f23])).
% 0.16/0.38 thf(f52,plain,(
% 0.16/0.38 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK6 @ X1 @ X0) @ X0)) | ((subset @ X1 @ X0) = $true)) )),
% 0.16/0.38 inference(trivial_inequality_removal,[],[f48])).
% 0.16/0.38 thf(f48,plain,(
% 0.16/0.38 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((subset @ X1 @ X0) = $true) | ($true != (in @ (sK6 @ X1 @ X0) @ X0))) )),
% 0.16/0.38 inference(definition_unfolding,[],[f41,f37])).
% 0.16/0.38 thf(f41,plain,(
% 0.16/0.38 ( ! [X0 : $i,X1 : $i] : (((subset @ X1 @ X0) = $true) | ($true != (in @ (sK6 @ X1 @ X0) @ X0)) | (subsetI2 != $true)) )),
% 0.16/0.38 inference(cnf_transformation,[],[f28])).
% 0.16/0.38 % SZS output end Proof for theBenchmark
% 0.16/0.38 % (24948)------------------------------
% 0.16/0.38 % (24948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (24948)Termination reason: Refutation
% 0.16/0.38
% 0.16/0.38 % (24948)Memory used [KB]: 5500
% 0.16/0.38 % (24948)Time elapsed: 0.009 s
% 0.16/0.38 % (24948)Instructions burned: 5 (million)
% 0.16/0.38 % (24948)------------------------------
% 0.16/0.38 % (24948)------------------------------
% 0.16/0.38 % (24941)Success in time 0.015 s
% 0.16/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------