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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU743^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 : 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:51:11 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SEU743^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.12  % 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.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 16:35:53 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TH0_THM_EQU_NAR problem
% 0.12/0.33  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.12/0.34  % (28348)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.12/0.34  % (28348)Instruction limit reached!
% 0.12/0.34  % (28348)------------------------------
% 0.12/0.34  % (28348)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34  % (28348)Termination reason: Unknown
% 0.12/0.34  % (28348)Termination phase: Property scanning
% 0.12/0.34  
% 0.12/0.34  % (28348)Memory used [KB]: 1023
% 0.12/0.34  % (28348)Time elapsed: 0.002 s
% 0.12/0.34  % (28348)Instructions burned: 2 (million)
% 0.12/0.34  % (28348)------------------------------
% 0.12/0.34  % (28348)------------------------------
% 0.12/0.34  % (28344)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.12/0.35  % (28346)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.12/0.35  % (28350)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.35  % (28349)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.12/0.35  % (28347)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.35  % (28347)Instruction limit reached!
% 0.12/0.35  % (28347)------------------------------
% 0.12/0.35  % (28347)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (28347)Termination reason: Unknown
% 0.12/0.35  % (28347)Termination phase: shuffling
% 0.12/0.35  
% 0.12/0.35  % (28347)Memory used [KB]: 895
% 0.12/0.35  % (28347)Time elapsed: 0.002 s
% 0.12/0.35  % (28347)Instructions burned: 2 (million)
% 0.12/0.35  % (28347)------------------------------
% 0.12/0.35  % (28347)------------------------------
% 0.12/0.35  % (28351)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.12/0.35  % (28345)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.12/0.35  % (28351)Instruction limit reached!
% 0.12/0.35  % (28351)------------------------------
% 0.12/0.35  % (28351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (28351)Termination reason: Unknown
% 0.12/0.35  % (28351)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (28351)Memory used [KB]: 5500
% 0.12/0.35  % (28351)Time elapsed: 0.003 s
% 0.12/0.35  % (28351)Instructions burned: 5 (million)
% 0.12/0.35  % (28351)------------------------------
% 0.12/0.35  % (28351)------------------------------
% 0.12/0.35  % (28345)Instruction limit reached!
% 0.12/0.35  % (28345)------------------------------
% 0.12/0.35  % (28345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (28345)Termination reason: Unknown
% 0.12/0.35  % (28345)Termination phase: Property scanning
% 0.12/0.35  
% 0.12/0.35  % (28345)Memory used [KB]: 1023
% 0.12/0.35  % (28345)Time elapsed: 0.004 s
% 0.12/0.35  % (28345)Instructions burned: 4 (million)
% 0.12/0.35  % (28345)------------------------------
% 0.12/0.35  % (28345)------------------------------
% 0.12/0.36  % (28350)Instruction limit reached!
% 0.12/0.36  % (28350)------------------------------
% 0.12/0.36  % (28350)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36  % (28350)Termination reason: Unknown
% 0.12/0.36  % (28350)Termination phase: Saturation
% 0.12/0.36  
% 0.12/0.36  % (28350)Memory used [KB]: 5628
% 0.12/0.36  % (28350)Time elapsed: 0.012 s
% 0.12/0.36  % (28350)Instructions burned: 19 (million)
% 0.12/0.36  % (28350)------------------------------
% 0.12/0.36  % (28350)------------------------------
% 0.12/0.36  % (28352)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.12/0.36  % (28346)Instruction limit reached!
% 0.12/0.36  % (28346)------------------------------
% 0.12/0.36  % (28346)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36  % (28346)Termination reason: Unknown
% 0.12/0.36  % (28346)Termination phase: Saturation
% 0.12/0.36  
% 0.12/0.36  % (28346)Memory used [KB]: 5628
% 0.12/0.36  % (28346)Time elapsed: 0.014 s
% 0.12/0.36  % (28346)Instructions burned: 28 (million)
% 0.12/0.36  % (28346)------------------------------
% 0.12/0.36  % (28346)------------------------------
% 0.12/0.36  % (28353)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.12/0.37  % (28353)Instruction limit reached!
% 0.12/0.37  % (28353)------------------------------
% 0.12/0.37  % (28353)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28353)Termination reason: Unknown
% 0.12/0.37  % (28353)Termination phase: Saturation
% 0.12/0.37  
% 0.12/0.37  % (28353)Memory used [KB]: 5628
% 0.12/0.37  % (28353)Time elapsed: 0.007 s
% 0.12/0.37  % (28353)Instructions burned: 16 (million)
% 0.12/0.37  % (28353)------------------------------
% 0.12/0.37  % (28353)------------------------------
% 0.12/0.37  % (28355)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.12/0.37  % (28357)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.12/0.37  % (28356)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.12/0.37  % (28356)Instruction limit reached!
% 0.12/0.37  % (28356)------------------------------
% 0.12/0.37  % (28356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28356)Termination reason: Unknown
% 0.12/0.37  % (28356)Termination phase: Saturation
% 0.12/0.37  
% 0.12/0.37  % (28356)Memory used [KB]: 1023
% 0.12/0.37  % (28356)Time elapsed: 0.005 s
% 0.12/0.37  % (28356)Instructions burned: 7 (million)
% 0.12/0.37  % (28356)------------------------------
% 0.12/0.37  % (28356)------------------------------
% 0.12/0.37  % (28349)First to succeed.
% 0.12/0.37  % (28358)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.12/0.37  % (28354)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.12/0.37  % (28354)Instruction limit reached!
% 0.12/0.37  % (28354)------------------------------
% 0.12/0.37  % (28354)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28354)Termination reason: Unknown
% 0.12/0.37  % (28354)Termination phase: Property scanning
% 0.12/0.37  
% 0.12/0.37  % (28354)Memory used [KB]: 1023
% 0.12/0.37  % (28354)Time elapsed: 0.003 s
% 0.12/0.37  % (28354)Instructions burned: 3 (million)
% 0.12/0.37  % (28354)------------------------------
% 0.12/0.37  % (28354)------------------------------
% 0.12/0.37  % (28358)Instruction limit reached!
% 0.12/0.37  % (28358)------------------------------
% 0.12/0.37  % (28358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28358)Termination reason: Unknown
% 0.12/0.37  % (28358)Termination phase: Twee Goal Transformation
% 0.12/0.37  
% 0.12/0.37  % (28358)Memory used [KB]: 1023
% 0.12/0.37  % (28358)Time elapsed: 0.003 s
% 0.12/0.37  % (28358)Instructions burned: 5 (million)
% 0.12/0.37  % (28358)------------------------------
% 0.12/0.37  % (28358)------------------------------
% 0.12/0.38  % (28352)Instruction limit reached!
% 0.12/0.38  % (28352)------------------------------
% 0.12/0.38  % (28352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.38  % (28352)Termination reason: Unknown
% 0.12/0.38  % (28352)Termination phase: Saturation
% 0.12/0.38  
% 0.12/0.38  % (28352)Memory used [KB]: 5756
% 0.12/0.38  % (28352)Time elapsed: 0.021 s
% 0.12/0.38  % (28352)Instructions burned: 39 (million)
% 0.12/0.38  % (28352)------------------------------
% 0.12/0.38  % (28352)------------------------------
% 0.12/0.38  % (28357)Instruction limit reached!
% 0.12/0.38  % (28357)------------------------------
% 0.12/0.38  % (28357)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.38  % (28357)Termination reason: Unknown
% 0.12/0.38  % (28357)Termination phase: Saturation
% 0.12/0.38  
% 0.12/0.38  % (28357)Memory used [KB]: 5884
% 0.12/0.38  % (28357)Time elapsed: 0.010 s
% 0.12/0.38  % (28357)Instructions burned: 18 (million)
% 0.12/0.38  % (28357)------------------------------
% 0.12/0.38  % (28357)------------------------------
% 0.12/0.38  % (28349)Refutation found. Thanks to Tanya!
% 0.12/0.38  % SZS status Theorem for theBenchmark
% 0.12/0.38  % SZS output start Proof for theBenchmark
% 0.12/0.38  thf(func_def_0, type, in: $i > $i > $o).
% 0.12/0.38  thf(func_def_1, type, powerset: $i > $i).
% 0.12/0.38  thf(func_def_2, type, binunion: $i > $i > $i).
% 0.12/0.38  thf(func_def_3, type, binintersect: $i > $i > $i).
% 0.12/0.38  thf(func_def_14, type, sK3: $i > $i > $i > $i).
% 0.12/0.38  thf(f188,plain,(
% 0.12/0.38    $false),
% 0.12/0.38    inference(subsumption_resolution,[],[f187,f72])).
% 0.12/0.38  thf(f72,plain,(
% 0.12/0.38    ($true = (in @ sK14 @ (powerset @ sK13)))),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f48,plain,(
% 0.12/0.38    (binintersectT_lem = $true) & (binunionT_lem = $true) & (inIntersectImpInIntersectUnions = $true) & (powersetTI1 = $true) & (($true = (in @ sK12 @ (powerset @ sK13))) & ((((in @ sK15 @ (powerset @ sK13)) = $true) & ((in @ (binintersect @ sK12 @ sK14) @ (powerset @ (binintersect @ (binunion @ sK12 @ sK15) @ (binunion @ sK14 @ sK15)))) != $true)) & ($true = (in @ sK14 @ (powerset @ sK13)))))),
% 0.12/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f44,f47,f46,f45])).
% 0.12/0.38  thf(f45,plain,(
% 0.12/0.38    ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (? [X3] : (((in @ X3 @ (powerset @ X1)) = $true) & ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X3) @ (binunion @ X2 @ X3)))) != $true)) & ($true = (in @ X2 @ (powerset @ X1))))) => (($true = (in @ sK12 @ (powerset @ sK13))) & ? [X2] : (? [X3] : (($true = (in @ X3 @ (powerset @ sK13))) & ($true != (in @ (binintersect @ sK12 @ X2) @ (powerset @ (binintersect @ (binunion @ sK12 @ X3) @ (binunion @ X2 @ X3)))))) & ($true = (in @ X2 @ (powerset @ sK13)))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f46,plain,(
% 0.12/0.38    ? [X2] : (? [X3] : (($true = (in @ X3 @ (powerset @ sK13))) & ($true != (in @ (binintersect @ sK12 @ X2) @ (powerset @ (binintersect @ (binunion @ sK12 @ X3) @ (binunion @ X2 @ X3)))))) & ($true = (in @ X2 @ (powerset @ sK13)))) => (? [X3] : (($true = (in @ X3 @ (powerset @ sK13))) & ($true != (in @ (binintersect @ sK12 @ sK14) @ (powerset @ (binintersect @ (binunion @ sK12 @ X3) @ (binunion @ sK14 @ X3)))))) & ($true = (in @ sK14 @ (powerset @ sK13))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f47,plain,(
% 0.12/0.38    ? [X3] : (($true = (in @ X3 @ (powerset @ sK13))) & ($true != (in @ (binintersect @ sK12 @ sK14) @ (powerset @ (binintersect @ (binunion @ sK12 @ X3) @ (binunion @ sK14 @ X3)))))) => (((in @ sK15 @ (powerset @ sK13)) = $true) & ((in @ (binintersect @ sK12 @ sK14) @ (powerset @ (binintersect @ (binunion @ sK12 @ sK15) @ (binunion @ sK14 @ sK15)))) != $true))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f44,plain,(
% 0.12/0.38    (binintersectT_lem = $true) & (binunionT_lem = $true) & (inIntersectImpInIntersectUnions = $true) & (powersetTI1 = $true) & ? [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (? [X3] : (((in @ X3 @ (powerset @ X1)) = $true) & ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X3) @ (binunion @ X2 @ X3)))) != $true)) & ($true = (in @ X2 @ (powerset @ X1)))))),
% 0.12/0.38    inference(rectify,[],[f25])).
% 0.12/0.38  thf(f25,plain,(
% 0.12/0.38    (binintersectT_lem = $true) & (binunionT_lem = $true) & (inIntersectImpInIntersectUnions = $true) & (powersetTI1 = $true) & ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (? [X3] : (((in @ X3 @ (powerset @ X0)) = $true) & ($true != (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3)))))) & ((in @ X2 @ (powerset @ X0)) = $true)))),
% 0.12/0.38    inference(flattening,[],[f24])).
% 0.12/0.38  thf(f24,plain,(
% 0.12/0.38    (((? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (? [X3] : (((in @ X3 @ (powerset @ X0)) = $true) & ($true != (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3)))))) & ((in @ X2 @ (powerset @ X0)) = $true))) & (inIntersectImpInIntersectUnions = $true)) & (powersetTI1 = $true)) & (binunionT_lem = $true)) & (binintersectT_lem = $true)),
% 0.12/0.38    inference(ennf_transformation,[],[f13])).
% 0.12/0.38  thf(f13,plain,(
% 0.12/0.38    ~((binintersectT_lem = $true) => ((binunionT_lem = $true) => ((powersetTI1 = $true) => ((inIntersectImpInIntersectUnions = $true) => ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ (powerset @ X0)) = $true) => ($true = (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))))))))))))),
% 0.12/0.38    inference(fool_elimination,[],[f12])).
% 0.12/0.38  thf(f12,plain,(
% 0.12/0.38    ~(binintersectT_lem => (binunionT_lem => (powersetTI1 => (inIntersectImpInIntersectUnions => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3)))))))))))),
% 0.12/0.38    inference(rectify,[],[f6])).
% 0.12/0.38  thf(f6,negated_conjecture,(
% 0.12/0.38    ~(binintersectT_lem => (binunionT_lem => (powersetTI1 => (inIntersectImpInIntersectUnions => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X4) @ (binunion @ X2 @ X4)))))))))))),
% 0.12/0.38    inference(negated_conjecture,[],[f5])).
% 0.12/0.38  thf(f5,conjecture,(
% 0.12/0.38    binintersectT_lem => (binunionT_lem => (powersetTI1 => (inIntersectImpInIntersectUnions => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ (binintersect @ (binunion @ X1 @ X4) @ (binunion @ X2 @ X4))))))))))),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersectInPowersetIntersectUnions)).
% 0.12/0.38  thf(f187,plain,(
% 0.12/0.38    ($true != (in @ sK14 @ (powerset @ sK13)))),
% 0.12/0.38    inference(subsumption_resolution,[],[f186,f75])).
% 0.12/0.38  thf(f75,plain,(
% 0.12/0.38    ($true = (in @ sK12 @ (powerset @ sK13)))),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f186,plain,(
% 0.12/0.38    ($true != (in @ sK12 @ (powerset @ sK13))) | ($true != (in @ sK14 @ (powerset @ sK13)))),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f184])).
% 0.12/0.38  thf(f184,plain,(
% 0.12/0.38    ($true != (in @ sK12 @ (powerset @ sK13))) | ($true != (in @ sK14 @ (powerset @ sK13))) | ($true != $true)),
% 0.12/0.38    inference(superposition,[],[f178,f74])).
% 0.12/0.38  thf(f74,plain,(
% 0.12/0.38    ((in @ sK15 @ (powerset @ sK13)) = $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f178,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (($true != (in @ sK15 @ (powerset @ X0))) | ($true != (in @ sK14 @ (powerset @ X0))) | ((in @ sK12 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(subsumption_resolution,[],[f177,f111])).
% 0.12/0.38  thf(f111,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f102])).
% 0.12/0.38  thf(f102,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (powerset @ X0)) != $true) | ((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) = $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(definition_unfolding,[],[f83,f78])).
% 0.12/0.38  thf(f78,plain,(
% 0.12/0.38    (binunionT_lem = $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f83,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | (binunionT_lem != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f53])).
% 0.12/0.38  thf(f53,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) | (binunionT_lem != $true)) & ((binunionT_lem = $true) | (($true = (in @ sK17 @ (powerset @ sK16))) & (((in @ (binunion @ sK17 @ sK18) @ (powerset @ sK16)) != $true) & ($true = (in @ sK18 @ (powerset @ sK16))))))),
% 0.12/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK16,sK17,sK18])],[f50,f52,f51])).
% 0.12/0.38  thf(f51,plain,(
% 0.12/0.38    ? [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) & ? [X5] : (($true != (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) & ($true = (in @ X5 @ (powerset @ X3))))) => (($true = (in @ sK17 @ (powerset @ sK16))) & ? [X5] : (($true != (in @ (binunion @ sK17 @ X5) @ (powerset @ sK16))) & ($true = (in @ X5 @ (powerset @ sK16)))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f52,plain,(
% 0.12/0.38    ? [X5] : (($true != (in @ (binunion @ sK17 @ X5) @ (powerset @ sK16))) & ($true = (in @ X5 @ (powerset @ sK16)))) => (((in @ (binunion @ sK17 @ sK18) @ (powerset @ sK16)) != $true) & ($true = (in @ sK18 @ (powerset @ sK16))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f50,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binunion @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) | (binunionT_lem != $true)) & ((binunionT_lem = $true) | ? [X3,X4] : (($true = (in @ X4 @ (powerset @ X3))) & ? [X5] : (($true != (in @ (binunion @ X4 @ X5) @ (powerset @ X3))) & ($true = (in @ X5 @ (powerset @ X3))))))),
% 0.12/0.38    inference(rectify,[],[f49])).
% 0.12/0.38  thf(f49,plain,(
% 0.12/0.38    (! [X1,X0] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) | (binunionT_lem != $true)) & ((binunionT_lem = $true) | ? [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) & ? [X2] : (($true != (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) & ($true = (in @ X2 @ (powerset @ X1))))))),
% 0.12/0.38    inference(nnf_transformation,[],[f22])).
% 0.12/0.38  thf(f22,plain,(
% 0.12/0.38    ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) <=> (binunionT_lem = $true)),
% 0.12/0.38    inference(ennf_transformation,[],[f15])).
% 0.12/0.38  thf(f15,plain,(
% 0.12/0.38    (binunionT_lem = $true) <=> ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (($true = (in @ X2 @ (powerset @ X1))) => ($true = (in @ (binunion @ X0 @ X2) @ (powerset @ X1)))))),
% 0.12/0.38    inference(fool_elimination,[],[f14])).
% 0.12/0.38  thf(f14,plain,(
% 0.12/0.38    (! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => (in @ (binunion @ X0 @ X2) @ (powerset @ X1)))) = binunionT_lem)),
% 0.12/0.38    inference(rectify,[],[f2])).
% 0.12/0.38  thf(f2,axiom,(
% 0.12/0.38    (! [X1,X0] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binunion @ X1 @ X2) @ (powerset @ X0)))) = binunionT_lem)),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionT_lem)).
% 0.12/0.38  thf(f177,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (($true != (in @ (binunion @ sK14 @ sK15) @ (powerset @ X0))) | ((in @ sK12 @ (powerset @ X0)) != $true) | ($true != (in @ sK15 @ (powerset @ X0))) | ($true != (in @ sK14 @ (powerset @ X0)))) )),
% 0.12/0.38    inference(subsumption_resolution,[],[f175,f111])).
% 0.12/0.38  thf(f175,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (($true != (in @ (binunion @ sK12 @ sK15) @ (powerset @ X0))) | ($true != (in @ sK15 @ (powerset @ X0))) | ($true != (in @ (binunion @ sK14 @ sK15) @ (powerset @ X0))) | ($true != (in @ sK14 @ (powerset @ X0))) | ((in @ sK12 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f172])).
% 0.12/0.38  thf(f172,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (($true != (in @ sK14 @ (powerset @ X0))) | ($true != $true) | ((in @ sK12 @ (powerset @ X0)) != $true) | ($true != (in @ sK15 @ (powerset @ X0))) | ($true != (in @ (binunion @ sK12 @ sK15) @ (powerset @ X0))) | ($true != (in @ (binunion @ sK14 @ sK15) @ (powerset @ X0)))) )),
% 0.12/0.38    inference(superposition,[],[f162,f110])).
% 0.12/0.38  thf(f110,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))) | ((in @ X0 @ (powerset @ X1)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f91])).
% 0.12/0.38  thf(f91,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ($true != (in @ X2 @ (powerset @ X1))) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != $true)) )),
% 0.12/0.38    inference(definition_unfolding,[],[f64,f79])).
% 0.12/0.38  thf(f79,plain,(
% 0.12/0.38    (binintersectT_lem = $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f64,plain,(
% 0.12/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (powerset @ X1)) != $true) | ($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))) | (binintersectT_lem != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f36])).
% 0.12/0.38  thf(f36,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | (((in @ sK4 @ (powerset @ sK5)) = $true) & (((in @ (binintersect @ sK4 @ sK6) @ (powerset @ sK5)) != $true) & ($true = (in @ sK6 @ (powerset @ sK5))))))),
% 0.12/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f33,f35,f34])).
% 0.12/0.38  thf(f34,plain,(
% 0.12/0.38    ? [X3,X4] : (($true = (in @ X3 @ (powerset @ X4))) & ? [X5] : (($true != (in @ (binintersect @ X3 @ X5) @ (powerset @ X4))) & ($true = (in @ X5 @ (powerset @ X4))))) => (((in @ sK4 @ (powerset @ sK5)) = $true) & ? [X5] : (((in @ (binintersect @ sK4 @ X5) @ (powerset @ sK5)) != $true) & ((in @ X5 @ (powerset @ sK5)) = $true)))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f35,plain,(
% 0.12/0.38    ? [X5] : (((in @ (binintersect @ sK4 @ X5) @ (powerset @ sK5)) != $true) & ((in @ X5 @ (powerset @ sK5)) = $true)) => (((in @ (binintersect @ sK4 @ sK6) @ (powerset @ sK5)) != $true) & ($true = (in @ sK6 @ (powerset @ sK5))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f33,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X0 @ (powerset @ X1)) != $true) | ! [X2] : (($true = (in @ (binintersect @ X0 @ X2) @ (powerset @ X1))) | ($true != (in @ X2 @ (powerset @ X1))))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X3,X4] : (($true = (in @ X3 @ (powerset @ X4))) & ? [X5] : (($true != (in @ (binintersect @ X3 @ X5) @ (powerset @ X4))) & ($true = (in @ X5 @ (powerset @ X4))))))),
% 0.12/0.38    inference(rectify,[],[f32])).
% 0.12/0.38  thf(f32,plain,(
% 0.12/0.38    (! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) | (binintersectT_lem != $true)) & ((binintersectT_lem = $true) | ? [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) != $true) & ((in @ X2 @ (powerset @ X0)) = $true))))),
% 0.12/0.38    inference(nnf_transformation,[],[f23])).
% 0.12/0.38  thf(f23,plain,(
% 0.12/0.38    ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true))) <=> (binintersectT_lem = $true)),
% 0.12/0.38    inference(ennf_transformation,[],[f17])).
% 0.12/0.38  thf(f17,plain,(
% 0.12/0.38    (binintersectT_lem = $true) <=> ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ((in @ (binintersect @ X1 @ X2) @ (powerset @ X0)) = $true)))),
% 0.12/0.38    inference(fool_elimination,[],[f16])).
% 0.12/0.38  thf(f16,plain,(
% 0.12/0.38    (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ X0)))) = binintersectT_lem)),
% 0.12/0.38    inference(rectify,[],[f1])).
% 0.12/0.38  thf(f1,axiom,(
% 0.12/0.38    (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (in @ (binintersect @ X1 @ X2) @ (powerset @ X0)))) = binintersectT_lem)),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectT_lem)).
% 0.12/0.38  thf(f162,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (((in @ (binintersect @ (binunion @ sK12 @ sK15) @ (binunion @ sK14 @ sK15)) @ (powerset @ X0)) != $true) | ($true != (in @ sK14 @ (powerset @ X0))) | ($true != (in @ sK15 @ (powerset @ X0))) | ((in @ sK12 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f161])).
% 0.12/0.38  thf(f161,plain,(
% 0.12/0.38    ( ! [X0 : $i] : (($true != (in @ sK15 @ (powerset @ X0))) | ((in @ sK12 @ (powerset @ X0)) != $true) | ((in @ (binintersect @ (binunion @ sK12 @ sK15) @ (binunion @ sK14 @ sK15)) @ (powerset @ X0)) != $true) | ($true != $true) | ($true != (in @ sK14 @ (powerset @ X0)))) )),
% 0.12/0.38    inference(superposition,[],[f73,f160])).
% 0.12/0.38  thf(f160,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X2 @ (powerset @ X3))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ X1 @ (powerset @ X3))) | ($true != (in @ X0 @ (powerset @ X3)))) )),
% 0.12/0.38    inference(subsumption_resolution,[],[f156,f110])).
% 0.12/0.38  thf(f156,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ X1 @ (powerset @ X3))) | ($true != (in @ X0 @ (powerset @ X3))) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X2 @ (powerset @ X3)))) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f155])).
% 0.12/0.38  thf(f155,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (in @ X2 @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ X1 @ (powerset @ X3))) | ($true != (in @ X0 @ (powerset @ X3)))) )),
% 0.12/0.38    inference(duplicate_literal_removal,[],[f152])).
% 0.12/0.38  thf(f152,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ($true != (in @ X1 @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X2 @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != $true) | ($true != (in @ X0 @ (powerset @ X3))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3)))) )),
% 0.12/0.38    inference(superposition,[],[f137,f106])).
% 0.12/0.38  thf(f106,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X5)) | ($true = (in @ X4 @ (powerset @ X6))) | ($true != (in @ X4 @ (powerset @ X5))) | ((in @ X6 @ (powerset @ X5)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f88])).
% 0.12/0.38  thf(f88,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (powerset @ X5))) | ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X5)) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true = (in @ X4 @ (powerset @ X6))) | ($true != $true)) )),
% 0.12/0.38    inference(definition_unfolding,[],[f56,f76])).
% 0.12/0.38  thf(f76,plain,(
% 0.12/0.38    (powersetTI1 = $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f56,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X5)) | ($true = (in @ X4 @ (powerset @ X6))) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true != (in @ X4 @ (powerset @ X5))) | (powersetTI1 != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f31])).
% 0.12/0.38  thf(f31,plain,(
% 0.12/0.38    ((powersetTI1 = $true) | ((! [X3] : (((in @ X3 @ sK1) != $true) | ($true = (in @ X3 @ sK2)) | ($true != (in @ X3 @ sK0))) & ($true != (in @ sK0 @ (powerset @ sK2))) & ((in @ sK2 @ (powerset @ sK1)) = $true)) & ($true = (in @ sK0 @ (powerset @ sK1))))) & (! [X4,X5] : (! [X6] : ((($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X5)) & ($true != (in @ (sK3 @ X6 @ X5 @ X4) @ X6)) & ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4))) | ($true = (in @ X4 @ (powerset @ X6))) | ((in @ X6 @ (powerset @ X5)) != $true)) | ($true != (in @ X4 @ (powerset @ X5)))) | (powersetTI1 != $true))),
% 0.12/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f27,f30,f29,f28])).
% 0.12/0.38  thf(f28,plain,(
% 0.12/0.38    ? [X0,X1] : (? [X2] : (! [X3] : (((in @ X3 @ X1) != $true) | ((in @ X3 @ X2) = $true) | ((in @ X3 @ X0) != $true)) & ((in @ X0 @ (powerset @ X2)) != $true) & ($true = (in @ X2 @ (powerset @ X1)))) & ((in @ X0 @ (powerset @ X1)) = $true)) => (? [X2] : (! [X3] : (((in @ X3 @ sK1) != $true) | ((in @ X3 @ X2) = $true) | ($true != (in @ X3 @ sK0))) & ($true != (in @ sK0 @ (powerset @ X2))) & ((in @ X2 @ (powerset @ sK1)) = $true)) & ($true = (in @ sK0 @ (powerset @ sK1))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f29,plain,(
% 0.12/0.38    ? [X2] : (! [X3] : (((in @ X3 @ sK1) != $true) | ((in @ X3 @ X2) = $true) | ($true != (in @ X3 @ sK0))) & ($true != (in @ sK0 @ (powerset @ X2))) & ((in @ X2 @ (powerset @ sK1)) = $true)) => (! [X3] : (((in @ X3 @ sK1) != $true) | ($true = (in @ X3 @ sK2)) | ($true != (in @ X3 @ sK0))) & ($true != (in @ sK0 @ (powerset @ sK2))) & ((in @ sK2 @ (powerset @ sK1)) = $true))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f30,plain,(
% 0.12/0.38    ! [X4,X5,X6] : (? [X7] : (((in @ X7 @ X5) = $true) & ($true != (in @ X7 @ X6)) & ((in @ X7 @ X4) = $true)) => (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X5)) & ($true != (in @ (sK3 @ X6 @ X5 @ X4) @ X6)) & ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f27,plain,(
% 0.12/0.38    ((powersetTI1 = $true) | ? [X0,X1] : (? [X2] : (! [X3] : (((in @ X3 @ X1) != $true) | ((in @ X3 @ X2) = $true) | ((in @ X3 @ X0) != $true)) & ((in @ X0 @ (powerset @ X2)) != $true) & ($true = (in @ X2 @ (powerset @ X1)))) & ((in @ X0 @ (powerset @ X1)) = $true))) & (! [X4,X5] : (! [X6] : (? [X7] : (((in @ X7 @ X5) = $true) & ($true != (in @ X7 @ X6)) & ((in @ X7 @ X4) = $true)) | ($true = (in @ X4 @ (powerset @ X6))) | ((in @ X6 @ (powerset @ X5)) != $true)) | ($true != (in @ X4 @ (powerset @ X5)))) | (powersetTI1 != $true))),
% 0.12/0.38    inference(rectify,[],[f26])).
% 0.12/0.38  thf(f26,plain,(
% 0.12/0.38    ((powersetTI1 = $true) | ? [X1,X0] : (? [X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ((in @ X3 @ X2) = $true) | ((in @ X3 @ X1) != $true)) & ((in @ X1 @ (powerset @ X2)) != $true) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true))) & (! [X1,X0] : (! [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true)) | ((in @ X1 @ (powerset @ X2)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true)) | (powersetTI1 != $true))),
% 0.12/0.38    inference(nnf_transformation,[],[f19])).
% 0.12/0.38  thf(f19,plain,(
% 0.12/0.38    (powersetTI1 = $true) <=> ! [X1,X0] : (! [X2] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true)) | ((in @ X1 @ (powerset @ X2)) = $true) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.12/0.38    inference(flattening,[],[f18])).
% 0.12/0.38  thf(f18,plain,(
% 0.12/0.38    (powersetTI1 = $true) <=> ! [X1,X0] : (! [X2] : ((((in @ X1 @ (powerset @ X2)) = $true) | ? [X3] : ((((in @ X3 @ X2) != $true) & ((in @ X3 @ X1) = $true)) & ((in @ X3 @ X0) = $true))) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.12/0.38    inference(ennf_transformation,[],[f9])).
% 0.12/0.38  thf(f9,plain,(
% 0.12/0.38    (powersetTI1 = $true) <=> ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => (! [X3] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ X1) = $true) => ((in @ X3 @ X2) = $true))) => ((in @ X1 @ (powerset @ X2)) = $true))))),
% 0.12/0.38    inference(fool_elimination,[],[f8])).
% 0.12/0.38  thf(f8,plain,(
% 0.12/0.38    (powersetTI1 = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (in @ X1 @ (powerset @ X2))))))),
% 0.12/0.38    inference(rectify,[],[f3])).
% 0.12/0.38  thf(f3,axiom,(
% 0.12/0.38    (powersetTI1 = ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => (! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (in @ X1 @ (powerset @ X2))))))),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetTI1)).
% 0.12/0.38  thf(f137,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ (binintersect @ X0 @ X2)) @ X4) != $true) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X2 @ (powerset @ X4))) | ((in @ X1 @ (powerset @ X4)) != $true) | ($true != (in @ X0 @ (powerset @ X4)))) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f136])).
% 0.12/0.38  thf(f136,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X0 @ (powerset @ X4))) | ((in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ (binintersect @ X0 @ X2)) @ X4) != $true) | ($true != $true) | ((in @ X1 @ (powerset @ X4)) != $true) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ($true != (in @ X2 @ (powerset @ X4))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3)))) )),
% 0.12/0.38    inference(duplicate_literal_removal,[],[f132])).
% 0.12/0.38  thf(f132,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true != (in @ X0 @ (powerset @ X4))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ X2 @ (powerset @ X4))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ((in @ (binintersect @ X0 @ X2) @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3))) | ((in @ X1 @ (powerset @ X4)) != $true) | ((in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ (binintersect @ X0 @ X2)) @ X4) != $true) | ($true != $true) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ($true != (in @ (binintersect @ X0 @ X2) @ (powerset @ X3)))) )),
% 0.12/0.38    inference(superposition,[],[f129,f108])).
% 0.12/0.38  thf(f108,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true != (in @ X4 @ (powerset @ X5))) | ($true = (in @ X4 @ (powerset @ X6)))) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f90])).
% 0.12/0.38  thf(f90,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true != (in @ X4 @ (powerset @ X5))) | ($true = (in @ X4 @ (powerset @ X6))) | ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true != $true)) )),
% 0.12/0.38    inference(definition_unfolding,[],[f54,f76])).
% 0.12/0.38  thf(f54,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ($true = (in @ X4 @ (powerset @ X6))) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true != (in @ X4 @ (powerset @ X5))) | (powersetTI1 != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f31])).
% 0.12/0.38  thf(f129,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i,X5 : $i] : (((in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ X4) @ (binintersect @ X0 @ X2)) != $true) | ((in @ X4 @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ((in @ X2 @ (powerset @ X5)) != $true) | ($true != (in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ X4) @ X5)) | ($true != (in @ X4 @ (powerset @ X3))) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3))) | ((in @ X1 @ (powerset @ X5)) != $true) | ($true != (in @ X0 @ (powerset @ X5)))) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f128])).
% 0.12/0.38  thf(f128,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i,X5 : $i] : (($true != $true) | ($true != (in @ X4 @ (powerset @ X3))) | ($true != (in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ X4) @ X5)) | ((in @ X2 @ (powerset @ X5)) != $true) | ($true != (in @ X0 @ (powerset @ X5))) | ((in @ X4 @ (powerset @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)))) = $true) | ((in @ X1 @ (powerset @ X5)) != $true) | ((in @ (sK3 @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ X3 @ X4) @ (binintersect @ X0 @ X2)) != $true) | ($true != (in @ (binintersect @ (binunion @ X0 @ X1) @ (binunion @ X2 @ X1)) @ (powerset @ X3)))) )),
% 0.12/0.38    inference(superposition,[],[f107,f109])).
% 0.12/0.38  thf(f109,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true) | ($true != (in @ X4 @ X0)) | ((in @ X3 @ (powerset @ X0)) != $true) | ((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f95])).
% 0.12/0.38  thf(f95,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true) | ((in @ X2 @ (powerset @ X0)) != $true) | ((in @ X3 @ (powerset @ X0)) != $true) | ((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != $true) | ((in @ X1 @ (powerset @ X0)) != $true)) )),
% 0.12/0.38    inference(definition_unfolding,[],[f71,f77])).
% 0.12/0.38  thf(f77,plain,(
% 0.12/0.38    (inIntersectImpInIntersectUnions = $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  thf(f71,plain,(
% 0.12/0.38    ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i,X4 : $i] : (((in @ X1 @ (powerset @ X0)) != $true) | ((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true) | ((in @ X3 @ (powerset @ X0)) != $true) | ((in @ X2 @ (powerset @ X0)) != $true) | (inIntersectImpInIntersectUnions != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f43])).
% 0.12/0.38  thf(f43,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (! [X3] : (! [X4] : (((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true)) | ((in @ X3 @ (powerset @ X0)) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true))) | (inIntersectImpInIntersectUnions != $true)) & ((inIntersectImpInIntersectUnions = $true) | (((in @ sK8 @ (powerset @ sK7)) = $true) & (((((in @ sK11 @ (binintersect @ sK8 @ sK9)) = $true) & ($true = (in @ sK11 @ sK7)) & ((in @ sK11 @ (binintersect @ (binunion @ sK8 @ sK10) @ (binunion @ sK9 @ sK10))) != $true)) & ((in @ sK10 @ (powerset @ sK7)) = $true)) & ($true = (in @ sK9 @ (powerset @ sK7))))))),
% 0.12/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11])],[f38,f42,f41,f40,f39])).
% 0.12/0.38  thf(f39,plain,(
% 0.12/0.38    ? [X5,X6] : (((in @ X6 @ (powerset @ X5)) = $true) & ? [X7] : (? [X8] : (? [X9] : (($true = (in @ X9 @ (binintersect @ X6 @ X7))) & ($true = (in @ X9 @ X5)) & ($true != (in @ X9 @ (binintersect @ (binunion @ X6 @ X8) @ (binunion @ X7 @ X8))))) & ((in @ X8 @ (powerset @ X5)) = $true)) & ((in @ X7 @ (powerset @ X5)) = $true))) => (((in @ sK8 @ (powerset @ sK7)) = $true) & ? [X7] : (? [X8] : (? [X9] : (((in @ X9 @ (binintersect @ sK8 @ X7)) = $true) & ((in @ X9 @ sK7) = $true) & ($true != (in @ X9 @ (binintersect @ (binunion @ sK8 @ X8) @ (binunion @ X7 @ X8))))) & ((in @ X8 @ (powerset @ sK7)) = $true)) & ((in @ X7 @ (powerset @ sK7)) = $true)))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f40,plain,(
% 0.12/0.38    ? [X7] : (? [X8] : (? [X9] : (((in @ X9 @ (binintersect @ sK8 @ X7)) = $true) & ((in @ X9 @ sK7) = $true) & ($true != (in @ X9 @ (binintersect @ (binunion @ sK8 @ X8) @ (binunion @ X7 @ X8))))) & ((in @ X8 @ (powerset @ sK7)) = $true)) & ((in @ X7 @ (powerset @ sK7)) = $true)) => (? [X8] : (? [X9] : (((in @ X9 @ (binintersect @ sK8 @ sK9)) = $true) & ((in @ X9 @ sK7) = $true) & ((in @ X9 @ (binintersect @ (binunion @ sK8 @ X8) @ (binunion @ sK9 @ X8))) != $true)) & ((in @ X8 @ (powerset @ sK7)) = $true)) & ($true = (in @ sK9 @ (powerset @ sK7))))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f41,plain,(
% 0.12/0.38    ? [X8] : (? [X9] : (((in @ X9 @ (binintersect @ sK8 @ sK9)) = $true) & ((in @ X9 @ sK7) = $true) & ((in @ X9 @ (binintersect @ (binunion @ sK8 @ X8) @ (binunion @ sK9 @ X8))) != $true)) & ((in @ X8 @ (powerset @ sK7)) = $true)) => (? [X9] : (((in @ X9 @ (binintersect @ sK8 @ sK9)) = $true) & ((in @ X9 @ sK7) = $true) & ((in @ X9 @ (binintersect @ (binunion @ sK8 @ sK10) @ (binunion @ sK9 @ sK10))) != $true)) & ((in @ sK10 @ (powerset @ sK7)) = $true))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f42,plain,(
% 0.12/0.38    ? [X9] : (((in @ X9 @ (binintersect @ sK8 @ sK9)) = $true) & ((in @ X9 @ sK7) = $true) & ((in @ X9 @ (binintersect @ (binunion @ sK8 @ sK10) @ (binunion @ sK9 @ sK10))) != $true)) => (((in @ sK11 @ (binintersect @ sK8 @ sK9)) = $true) & ($true = (in @ sK11 @ sK7)) & ((in @ sK11 @ (binintersect @ (binunion @ sK8 @ sK10) @ (binunion @ sK9 @ sK10))) != $true))),
% 0.12/0.38    introduced(choice_axiom,[])).
% 0.12/0.38  thf(f38,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (! [X3] : (! [X4] : (((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true)) | ((in @ X3 @ (powerset @ X0)) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true))) | (inIntersectImpInIntersectUnions != $true)) & ((inIntersectImpInIntersectUnions = $true) | ? [X5,X6] : (((in @ X6 @ (powerset @ X5)) = $true) & ? [X7] : (? [X8] : (? [X9] : (($true = (in @ X9 @ (binintersect @ X6 @ X7))) & ($true = (in @ X9 @ X5)) & ($true != (in @ X9 @ (binintersect @ (binunion @ X6 @ X8) @ (binunion @ X7 @ X8))))) & ((in @ X8 @ (powerset @ X5)) = $true)) & ((in @ X7 @ (powerset @ X5)) = $true))))),
% 0.12/0.38    inference(rectify,[],[f37])).
% 0.12/0.38  thf(f37,plain,(
% 0.12/0.38    (! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (! [X3] : (! [X4] : (((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true)) | ((in @ X3 @ (powerset @ X0)) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true))) | (inIntersectImpInIntersectUnions != $true)) & ((inIntersectImpInIntersectUnions = $true) | ? [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) & ? [X2] : (? [X3] : (? [X4] : (((in @ X4 @ (binintersect @ X1 @ X2)) = $true) & ($true = (in @ X4 @ X0)) & ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) != $true)) & ((in @ X3 @ (powerset @ X0)) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true))))),
% 0.12/0.38    inference(nnf_transformation,[],[f21])).
% 0.12/0.38  thf(f21,plain,(
% 0.12/0.38    ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) != $true) | ! [X2] : (! [X3] : (! [X4] : (((in @ X4 @ (binintersect @ X1 @ X2)) != $true) | ($true != (in @ X4 @ X0)) | ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true)) | ((in @ X3 @ (powerset @ X0)) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true))) <=> (inIntersectImpInIntersectUnions = $true)),
% 0.12/0.38    inference(flattening,[],[f20])).
% 0.12/0.38  thf(f20,plain,(
% 0.12/0.38    (inIntersectImpInIntersectUnions = $true) <=> ! [X0,X1] : (! [X2] : (! [X3] : (! [X4] : ((((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true) | ((in @ X4 @ (binintersect @ X1 @ X2)) != $true)) | ($true != (in @ X4 @ X0))) | ((in @ X3 @ (powerset @ X0)) != $true)) | ((in @ X2 @ (powerset @ X0)) != $true)) | ((in @ X1 @ (powerset @ X0)) != $true))),
% 0.12/0.38    inference(ennf_transformation,[],[f11])).
% 0.12/0.38  thf(f11,plain,(
% 0.12/0.38    (inIntersectImpInIntersectUnions = $true) <=> ! [X0,X1] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3] : (((in @ X3 @ (powerset @ X0)) = $true) => ! [X4] : (($true = (in @ X4 @ X0)) => (((in @ X4 @ (binintersect @ X1 @ X2)) = $true) => ((in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3))) = $true))))))),
% 0.12/0.38    inference(fool_elimination,[],[f10])).
% 0.12/0.38  thf(f10,plain,(
% 0.12/0.38    (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ X0) => ((in @ X4 @ (binintersect @ X1 @ X2)) => (in @ X4 @ (binintersect @ (binunion @ X1 @ X3) @ (binunion @ X2 @ X3)))))))) = inIntersectImpInIntersectUnions)),
% 0.12/0.38    inference(rectify,[],[f4])).
% 0.12/0.38  thf(f4,axiom,(
% 0.12/0.38    (! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X3] : ((in @ X3 @ X0) => ((in @ X3 @ (binintersect @ X1 @ X2)) => (in @ X3 @ (binintersect @ (binunion @ X1 @ X4) @ (binunion @ X2 @ X4)))))))) = inIntersectImpInIntersectUnions)),
% 0.12/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inIntersectImpInIntersectUnions)).
% 0.12/0.38  thf(f107,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true != (in @ (sK3 @ X6 @ X5 @ X4) @ X6)) | ($true = (in @ X4 @ (powerset @ X6))) | ($true != (in @ X4 @ (powerset @ X5))) | ((in @ X6 @ (powerset @ X5)) != $true)) )),
% 0.12/0.38    inference(trivial_inequality_removal,[],[f89])).
% 0.12/0.38  thf(f89,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (((in @ X6 @ (powerset @ X5)) != $true) | ($true != $true) | ($true != (in @ (sK3 @ X6 @ X5 @ X4) @ X6)) | ($true != (in @ X4 @ (powerset @ X5))) | ($true = (in @ X4 @ (powerset @ X6)))) )),
% 0.12/0.38    inference(definition_unfolding,[],[f55,f76])).
% 0.12/0.38  thf(f55,plain,(
% 0.12/0.38    ( ! [X6 : $i,X4 : $i,X5 : $i] : (($true != (in @ (sK3 @ X6 @ X5 @ X4) @ X6)) | ($true = (in @ X4 @ (powerset @ X6))) | ((in @ X6 @ (powerset @ X5)) != $true) | ($true != (in @ X4 @ (powerset @ X5))) | (powersetTI1 != $true)) )),
% 0.12/0.38    inference(cnf_transformation,[],[f31])).
% 0.12/0.38  thf(f73,plain,(
% 0.12/0.38    ((in @ (binintersect @ sK12 @ sK14) @ (powerset @ (binintersect @ (binunion @ sK12 @ sK15) @ (binunion @ sK14 @ sK15)))) != $true)),
% 0.12/0.38    inference(cnf_transformation,[],[f48])).
% 0.12/0.38  % SZS output end Proof for theBenchmark
% 0.12/0.38  % (28349)------------------------------
% 0.12/0.38  % (28349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.38  % (28349)Termination reason: Refutation
% 0.12/0.38  
% 0.12/0.38  % (28349)Memory used [KB]: 5756
% 0.12/0.38  % (28349)Time elapsed: 0.033 s
% 0.12/0.38  % (28349)Instructions burned: 54 (million)
% 0.12/0.38  % (28349)------------------------------
% 0.12/0.38  % (28349)------------------------------
% 0.12/0.38  % (28343)Success in time 0.039 s
% 0.12/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------