%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU598^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:30:15 AM UTC 2026
% Result : Theorem 0.32s 0.40s
% Output : Refutation 0.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU598^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.25 % Computer : n004.cluster.edu
% 0.13/0.25 % Model : x86_64 x86_64
% 0.13/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.25 % Memory : 8046.5625MB
% 0.13/0.25 % OS : Linux 6.8.0-71-generic
% 0.13/0.25 % CPULimit : 300
% 0.13/0.25 % WCLimit : 300
% 0.13/0.25 % DateTime : Tue Sep 29 13:56:07 UTC 2026
% 0.13/0.26 % CPUTime :
% 0.13/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running higher-order theorem proving
% 0.26/0.33 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.32/0.40 % (1325378)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.32/0.40 % (1325386)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3166152098:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.32/0.40 % (1325389)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.32/0.40 % (1325389)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.32/0.40 % (1325385)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=522394435:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.32/0.40 % (1325384)lrs+10_16_si=on:nwc=1.5:random_seed=1213799068:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.32/0.40 % (1325383)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=389250046:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.32/0.40 % (1325389)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1628945628:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.32/0.40 % (1325387)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=819921912:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.32/0.40 % (1325388)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4064029071:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.32/0.40 % (1325385)Refutation not found, incomplete strategy
% 0.32/0.40 % (1325385)------------------------------
% 0.32/0.40 % (1325385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.40 % (1325385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.40 % (1325385)CaDiCaL version: 2.1.3
% 0.32/0.40 % (1325385)Termination reason: Refutation not found, incomplete strategy
% 0.32/0.40 % (1325385)Time elapsed: 0.004 s
% 0.32/0.40 % (1325385)Peak memory usage: 12 MB
% 0.32/0.40 % (1325385)Instructions burned: 3 (million)
% 0.32/0.40 % (1325385)------------------------------
% 0.32/0.40 % (1325385)------------------------------
% 0.32/0.40 % (1325386) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1325378-1325386"...
% 0.32/0.40 % (1325386)...printing done.
% 0.32/0.40 % (1325383) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1325378-1325383"...
% 0.32/0.40 % (1325386)Refutation found. Thanks to Tanya!
% 0.32/0.40 % SZS status Theorem for theBenchmark
% 0.32/0.40 % SZS output start Proof for theBenchmark
% 0.32/0.40 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.32/0.40 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.32/0.40 thf(func_def_1, type, subset: ($i > $i > $o)).
% 0.32/0.40 thf(func_def_2, type, subsetI1: $o).
% 0.32/0.40 thf(func_def_4, type, subsetE: $o).
% 0.32/0.40 thf(func_def_5, type, setextsub: $o).
% 0.32/0.40 thf(func_def_6, type, binintersect: ($i > $i > $i)).
% 0.32/0.40 thf(func_def_7, type, binintersectI: $o).
% 0.32/0.40 thf(func_def_8, type, binintersectRsub: $o).
% 0.32/0.40 thf(func_def_25, type, sK14: ($i > $i > $i)).
% 0.32/0.40 thf(f1,axiom,(
% 0.32/0.40 (subsetI1 = ! [X1 : $i,X0 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1)).
% 0.32/0.40 thf(f2,axiom,(
% 0.32/0.40 (subsetE = ! [X1 : $i,X0 : $i,X2 : $i] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE)).
% 0.32/0.40 thf(f3,axiom,(
% 0.32/0.40 (setextsub = ! [X0 : $i,X1 : $i] : ((subset @ X0 @ X1) => ((subset @ X1 @ X0) => (X0 = X1))))),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setextsub)).
% 0.32/0.40 thf(f4,axiom,(
% 0.32/0.40 (binintersectI = ! [X2 : $i,X0 : $i,X1 : $i] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ (binintersect @ X0 @ X1)))))),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectI)).
% 0.32/0.40 thf(f5,axiom,(
% 0.32/0.40 (! [X1 : $i,X0 : $i] : (subset @ (binintersect @ X0 @ X1) @ X1) = binintersectRsub)),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectRsub)).
% 0.32/0.40 thf(f6,conjecture,(
% 0.32/0.40 subsetI1 => (subsetE => (setextsub => (binintersectI => (binintersectRsub => ! [X0 : $i,X1 : $i] : ((subset @ X1 @ X0) => (((binintersect @ X0 @ X1)) = X1))))))),
% 0.32/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset4)).
% 0.32/0.40 thf(f7,negated_conjecture,(
% 0.32/0.40 ~(subsetI1 => (subsetE => (setextsub => (binintersectI => (binintersectRsub => ! [X0 : $i,X1 : $i] : ((subset @ X1 @ X0) => (((binintersect @ X0 @ X1)) = X1)))))))),
% 0.32/0.40 inference(negated_conjecture,[status(cth)],[f6])).
% 0.32/0.40 thf(f8,plain,(
% 0.32/0.40 (binintersectI = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ X1) => ((in @ X0 @ X2) => (in @ X0 @ (binintersect @ X1 @ X2)))))),
% 0.32/0.40 inference(rectify,[],[f4])).
% 0.32/0.40 thf(f9,plain,(
% 0.32/0.40 (binintersectI = $true) <=> ! [X1 : $i,X2 : $i,X0 : $i] : (($true = ((in @ X0 @ X1))) => (($true = ((in @ X0 @ X2))) => ($true = ((in @ X0 @ (binintersect @ X1 @ X2))))))),
% 0.32/0.40 inference(fool_elimination,[],[f8])).
% 0.32/0.40 thf(f10,plain,(
% 0.32/0.40 ~(subsetI1 => (subsetE => (setextsub => (binintersectI => (binintersectRsub => ! [X0 : $i,X1 : $i] : ((subset @ X1 @ X0) => (((binintersect @ X0 @ X1)) = X1)))))))),
% 0.32/0.40 inference(rectify,[],[f7])).
% 0.32/0.40 thf(f11,plain,(
% 0.32/0.40 ~((subsetI1 = $true) => ((subsetE = $true) => ((setextsub = $true) => ((binintersectI = $true) => ((binintersectRsub = $true) => ! [X0 : $i,X1 : $i] : ((((subset @ X1 @ X0)) = $true) => (((binintersect @ X0 @ X1)) = X1)))))))),
% 0.32/0.40 inference(fool_elimination,[],[f10])).
% 0.32/0.40 thf(f12,plain,(
% 0.32/0.40 (! [X0 : $i,X1 : $i] : (subset @ (binintersect @ X1 @ X0) @ X0) = binintersectRsub)),
% 0.32/0.40 inference(rectify,[],[f5])).
% 0.32/0.40 thf(f13,plain,(
% 0.32/0.40 (binintersectRsub = $true) <=> ! [X1 : $i,X0 : $i] : ($true = ((subset @ (binintersect @ X1 @ X0) @ X0)))),
% 0.32/0.40 inference(fool_elimination,[],[f12])).
% 0.32/0.40 thf(f14,plain,(
% 0.32/0.40 (setextsub = ! [X0 : $i,X1 : $i] : ((subset @ X0 @ X1) => ((subset @ X1 @ X0) => (X0 = X1))))),
% 0.32/0.40 inference(rectify,[],[f3])).
% 0.32/0.40 thf(f15,plain,(
% 0.32/0.40 (setextsub = $true) <=> ! [X1 : $i,X0 : $i] : ((((subset @ X0 @ X1)) = $true) => ((((subset @ X1 @ X0)) = $true) => (X0 = X1)))),
% 0.32/0.40 inference(fool_elimination,[],[f14])).
% 0.32/0.40 thf(f16,plain,(
% 0.32/0.40 (subsetI1 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)))),
% 0.32/0.40 inference(rectify,[],[f1])).
% 0.32/0.40 thf(f17,plain,(
% 0.32/0.40 ! [X1 : $i,X0 : $i] : (! [X2 : $i] : ((((in @ X2 @ X1)) = $true) => (((in @ X2 @ X0)) = $true)) => (((subset @ X1 @ X0)) = $true)) <=> (subsetI1 = $true)),
% 0.32/0.40 inference(fool_elimination,[],[f16])).
% 0.32/0.40 thf(f18,plain,(
% 0.32/0.40 (subsetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((subset @ X1 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.32/0.40 inference(rectify,[],[f2])).
% 0.32/0.40 thf(f19,plain,(
% 0.32/0.40 (subsetE = $true) <=> ! [X2 : $i,X0 : $i,X1 : $i] : ((((subset @ X1 @ X0)) = $true) => ((((in @ X2 @ X1)) = $true) => (((in @ X2 @ X0)) = $true)))),
% 0.32/0.40 inference(fool_elimination,[],[f18])).
% 0.32/0.40 thf(f20,plain,(
% 0.32/0.40 ((((? [X1 : $i,X0 : $i] : ((((binintersect @ X0 @ X1)) != X1) & (((subset @ X1 @ X0)) = $true)) & (binintersectRsub = $true)) & (binintersectI = $true)) & (setextsub = $true)) & (subsetE = $true)) & (subsetI1 = $true)),
% 0.32/0.40 inference(ennf_transformation,[],[f11])).
% 0.32/0.40 thf(f21,plain,(
% 0.32/0.40 (binintersectI = $true) & ? [X1 : $i,X0 : $i] : ((((binintersect @ X0 @ X1)) != X1) & (((subset @ X1 @ X0)) = $true)) & (subsetI1 = $true) & (binintersectRsub = $true) & (subsetE = $true) & (setextsub = $true)),
% 0.32/0.40 inference(flattening,[],[f20])).
% 0.32/0.40 thf(f22,plain,(
% 0.32/0.40 (binintersectI = $true) <=> ! [X1 : $i,X2 : $i,X0 : $i] : ((($true = ((in @ X0 @ (binintersect @ X1 @ X2)))) | ($true != ((in @ X0 @ X2)))) | ($true != ((in @ X0 @ X1))))),
% 0.32/0.40 inference(ennf_transformation,[],[f9])).
% 0.32/0.40 thf(f23,plain,(
% 0.32/0.40 (binintersectI = $true) <=> ! [X0 : $i,X1 : $i,X2 : $i] : (($true != ((in @ X0 @ X2))) | ($true = ((in @ X0 @ (binintersect @ X1 @ X2)))) | ($true != ((in @ X0 @ X1))))),
% 0.32/0.40 inference(flattening,[],[f22])).
% 0.32/0.40 thf(f24,plain,(
% 0.32/0.40 (subsetE = $true) <=> ! [X2 : $i,X0 : $i,X1 : $i] : (((((in @ X2 @ X0)) = $true) | (((in @ X2 @ X1)) != $true)) | (((subset @ X1 @ X0)) != $true))),
% 0.32/0.40 inference(ennf_transformation,[],[f19])).
% 0.32/0.40 thf(f25,plain,(
% 0.32/0.40 ! [X2 : $i,X0 : $i,X1 : $i] : ((((subset @ X1 @ X0)) != $true) | (((in @ X2 @ X1)) != $true) | (((in @ X2 @ X0)) = $true)) <=> (subsetE = $true)),
% 0.32/0.40 inference(flattening,[],[f24])).
% 0.32/0.40 thf(f26,plain,(
% 0.32/0.40 (setextsub = $true) <=> ! [X1 : $i,X0 : $i] : (((X0 = X1) | (((subset @ X1 @ X0)) != $true)) | (((subset @ X0 @ X1)) != $true))),
% 0.32/0.40 inference(ennf_transformation,[],[f15])).
% 0.32/0.40 thf(f27,plain,(
% 0.32/0.40 (setextsub = $true) <=> ! [X1 : $i,X0 : $i] : ((X0 = X1) | (((subset @ X1 @ X0)) != $true) | (((subset @ X0 @ X1)) != $true))),
% 0.32/0.40 inference(flattening,[],[f26])).
% 0.32/0.40 thf(f28,plain,(
% 0.32/0.40 (subsetI1 = $true) <=> ! [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) != $true)))),
% 0.32/0.40 inference(ennf_transformation,[],[f17])).
% 0.32/0.40 thf(f29,plain,(
% 0.32/0.40 (! [X2 : $i,X0 : $i,X1 : $i] : ((((subset @ X1 @ X0)) != $true) | (((in @ X2 @ X1)) != $true) | (((in @ X2 @ X0)) = $true)) | (subsetE != $true)) & ((subsetE = $true) | ? [X2 : $i,X0 : $i,X1 : $i] : ((((subset @ X1 @ X0)) = $true) & (((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) != $true)))),
% 0.32/0.40 inference(nnf_transformation,[],[f25])).
% 0.32/0.40 thf(f30,plain,(
% 0.32/0.40 (! [X0 : $i,X1 : $i,X2 : $i] : ((((subset @ X2 @ X1)) != $true) | ($true != ((in @ X0 @ X2))) | ($true = ((in @ X0 @ X1)))) | (subsetE != $true)) & ((subsetE = $true) | ? [X3 : $i,X4 : $i,X5 : $i] : ((((subset @ X5 @ X4)) = $true) & ($true = ((in @ X3 @ X5))) & (((in @ X3 @ X4)) != $true)))),
% 0.32/0.40 inference(rectify,[],[f29])).
% 0.32/0.40 thf(f31,plain,(
% 0.32/0.40 (! [X0 : $i,X1 : $i,X2 : $i] : ((((subset @ X2 @ X1)) != $true) | ($true != ((in @ X0 @ X2))) | ($true = ((in @ X0 @ X1)))) | (subsetE != $true)) & ((subsetE = $true) | (($true = ((subset @ sK2 @ sK1))) & (((in @ sK0 @ sK2)) = $true) & ($true != ((in @ sK0 @ sK1)))))),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X5,sK2)],[f30])).
% 0.32/0.40 thf(f32,plain,(
% 0.32/0.40 ((binintersectRsub = $true) | ? [X1 : $i,X0 : $i] : ($true != ((subset @ (binintersect @ X1 @ X0) @ X0)))) & (! [X1 : $i,X0 : $i] : ($true = ((subset @ (binintersect @ X1 @ X0) @ X0))) | (binintersectRsub != $true))),
% 0.32/0.40 inference(nnf_transformation,[],[f13])).
% 0.32/0.40 thf(f33,plain,(
% 0.32/0.40 ((binintersectRsub = $true) | ? [X0 : $i,X1 : $i] : (((subset @ (binintersect @ X0 @ X1) @ X1)) != $true)) & (! [X2 : $i,X3 : $i] : (((subset @ (binintersect @ X2 @ X3) @ X3)) = $true) | (binintersectRsub != $true))),
% 0.32/0.40 inference(rectify,[],[f32])).
% 0.32/0.40 thf(f34,plain,(
% 0.32/0.40 ((binintersectRsub = $true) | ($true != ((subset @ (binintersect @ sK3 @ sK4) @ sK4)))) & (! [X2 : $i,X3 : $i] : (((subset @ (binintersect @ X2 @ X3) @ X3)) = $true) | (binintersectRsub != $true))),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f33])).
% 0.32/0.40 thf(f35,plain,(
% 0.32/0.40 ((binintersectI = $true) | ? [X0 : $i,X1 : $i,X2 : $i] : (($true = ((in @ X0 @ X2))) & ($true != ((in @ X0 @ (binintersect @ X1 @ X2)))) & ($true = ((in @ X0 @ X1))))) & (! [X0 : $i,X1 : $i,X2 : $i] : (($true != ((in @ X0 @ X2))) | ($true = ((in @ X0 @ (binintersect @ X1 @ X2)))) | ($true != ((in @ X0 @ X1)))) | (binintersectI != $true))),
% 0.32/0.40 inference(nnf_transformation,[],[f23])).
% 0.32/0.40 thf(f36,plain,(
% 0.32/0.40 ((binintersectI = $true) | ? [X0 : $i,X1 : $i,X2 : $i] : (($true = ((in @ X0 @ X2))) & ($true != ((in @ X0 @ (binintersect @ X1 @ X2)))) & ($true = ((in @ X0 @ X1))))) & (! [X3 : $i,X4 : $i,X5 : $i] : (($true != ((in @ X3 @ X5))) | (((in @ X3 @ (binintersect @ X4 @ X5))) = $true) | (((in @ X3 @ X4)) != $true)) | (binintersectI != $true))),
% 0.32/0.40 inference(rectify,[],[f35])).
% 0.32/0.40 thf(f37,plain,(
% 0.32/0.40 ((binintersectI = $true) | ((((in @ sK5 @ sK7)) = $true) & ($true != ((in @ sK5 @ (binintersect @ sK6 @ sK7)))) & ($true = ((in @ sK5 @ sK6))))) & (! [X3 : $i,X4 : $i,X5 : $i] : (($true != ((in @ X3 @ X5))) | (((in @ X3 @ (binintersect @ X4 @ X5))) = $true) | (((in @ X3 @ X4)) != $true)) | (binintersectI != $true))),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f36])).
% 0.32/0.40 thf(f38,plain,(
% 0.32/0.40 ((setextsub = $true) | ? [X1 : $i,X0 : $i] : ((X0 != X1) & (((subset @ X1 @ X0)) = $true) & (((subset @ X0 @ X1)) = $true))) & (! [X1 : $i,X0 : $i] : ((X0 = X1) | (((subset @ X1 @ X0)) != $true) | (((subset @ X0 @ X1)) != $true)) | (setextsub != $true))),
% 0.32/0.40 inference(nnf_transformation,[],[f27])).
% 0.32/0.40 thf(f39,plain,(
% 0.32/0.40 ((setextsub = $true) | ? [X0 : $i,X1 : $i] : ((X0 != X1) & (((subset @ X0 @ X1)) = $true) & (((subset @ X1 @ X0)) = $true))) & (! [X2 : $i,X3 : $i] : ((X2 = X3) | ($true != ((subset @ X2 @ X3))) | (((subset @ X3 @ X2)) != $true)) | (setextsub != $true))),
% 0.32/0.40 inference(rectify,[],[f38])).
% 0.32/0.40 thf(f40,plain,(
% 0.32/0.40 ((setextsub = $true) | ((sK9 != sK8) & (((subset @ sK8 @ sK9)) = $true) & (((subset @ sK9 @ sK8)) = $true))) & (! [X2 : $i,X3 : $i] : ((X2 = X3) | ($true != ((subset @ X2 @ X3))) | (((subset @ X3 @ X2)) != $true)) | (setextsub != $true))),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f39])).
% 0.32/0.40 thf(f41,plain,(
% 0.32/0.40 (binintersectI = $true) & ? [X0 : $i,X1 : $i] : ((((binintersect @ X1 @ X0)) != X0) & (((subset @ X0 @ X1)) = $true)) & (subsetI1 = $true) & (binintersectRsub = $true) & (subsetE = $true) & (setextsub = $true)),
% 0.32/0.40 inference(rectify,[],[f21])).
% 0.32/0.40 thf(f42,plain,(
% 0.32/0.40 (binintersectI = $true) & ((((binintersect @ sK11 @ sK10)) != sK10) & (((subset @ sK10 @ sK11)) = $true)) & (subsetI1 = $true) & (binintersectRsub = $true) & (subsetE = $true) & (setextsub = $true)),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f41])).
% 0.32/0.40 thf(f43,plain,(
% 0.32/0.40 ((subsetI1 = $true) | ? [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) != $true) & ! [X2 : $i] : ((((in @ X2 @ X1)) != $true) | (((in @ X2 @ X0)) = $true)))) & (! [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) != $true))) | (subsetI1 != $true))),
% 0.32/0.40 inference(nnf_transformation,[],[f28])).
% 0.32/0.40 thf(f44,plain,(
% 0.32/0.40 ((subsetI1 = $true) | ? [X0 : $i,X1 : $i] : ((((subset @ X0 @ X1)) != $true) & ! [X2 : $i] : ((((in @ X2 @ X0)) != $true) | (((in @ X2 @ X1)) = $true)))) & (! [X3 : $i,X4 : $i] : (($true = ((subset @ X3 @ X4))) | ? [X5 : $i] : (($true = ((in @ X5 @ X3))) & ($true != ((in @ X5 @ X4))))) | (subsetI1 != $true))),
% 0.32/0.40 inference(rectify,[],[f43])).
% 0.32/0.40 thf(f45,plain,(
% 0.32/0.40 ((subsetI1 = $true) | (($true != ((subset @ sK12 @ sK13))) & ! [X2 : $i] : (($true != ((in @ X2 @ sK12))) | ($true = ((in @ X2 @ sK13)))))) & (! [X3 : $i,X4 : $i] : (($true = ((subset @ X3 @ X4))) | (($true = ((in @ (sK14 @ X4 @ X3) @ X3))) & (((in @ (sK14 @ X4 @ X3) @ X4)) != $true))) | (subsetI1 != $true))),
% 0.32/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,vAPP]),skolemize(X0,sK12),skolemize(X1,sK13),skolemize(X5,sK14 @ X4 @ X3)],[f44])).
% 0.32/0.40 thf(f49,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((in @ X0 @ X2))) | (subsetE != $true) | ($true = ((in @ X0 @ X1))) | (((subset @ X2 @ X1)) != $true)) )),
% 0.32/0.40 inference(cnf_transformation,[],[f31])).
% 0.32/0.40 thf(f50,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i] : ((((subset @ (binintersect @ X2 @ X3) @ X3)) = $true) | (binintersectRsub != $true)) )),
% 0.32/0.40 inference(cnf_transformation,[],[f34])).
% 0.32/0.40 thf(f52,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != ((in @ X3 @ X5))) | (((in @ X3 @ X4)) != $true) | (binintersectI != $true) | (((in @ X3 @ (binintersect @ X4 @ X5))) = $true)) )),
% 0.32/0.40 inference(cnf_transformation,[],[f37])).
% 0.32/0.40 thf(f56,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i] : ((((subset @ X3 @ X2)) != $true) | (X2 = X3) | ($true != ((subset @ X2 @ X3))) | (setextsub != $true)) )),
% 0.32/0.40 inference(cnf_transformation,[],[f40])).
% 0.32/0.40 thf(f60,plain,(
% 0.32/0.40 (setextsub = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f61,plain,(
% 0.32/0.40 (subsetE = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f62,plain,(
% 0.32/0.40 (binintersectRsub = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f63,plain,(
% 0.32/0.40 (subsetI1 = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f64,plain,(
% 0.32/0.40 (((subset @ sK10 @ sK11)) = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f65,plain,(
% 0.32/0.40 (((binintersect @ sK11 @ sK10)) != sK10)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f66,plain,(
% 0.32/0.40 (binintersectI = $true)),
% 0.32/0.40 inference(cnf_transformation,[],[f42])).
% 0.32/0.40 thf(f67,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i] : ((subsetI1 != $true) | ($true = ((subset @ X3 @ X4))) | (((in @ (sK14 @ X4 @ X3) @ X4)) != $true)) )),
% 0.32/0.40 inference(cnf_transformation,[],[f45])).
% 0.32/0.40 thf(f68,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i] : ((subsetI1 != $true) | ($true = ((subset @ X3 @ X4))) | ($true = ((in @ (sK14 @ X4 @ X3) @ X3)))) )),
% 0.32/0.40 inference(cnf_transformation,[],[f45])).
% 0.32/0.40 thf(f73,definition,(
% 0.32/0.40 spl15_1 <=> (subsetI1 = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition])).
% 0.32/0.40 thf(f77,definition,(
% 0.32/0.40 spl15_2 <=> ! [X4 : $i,X3 : $i] : (($true = ((subset @ X3 @ X4))) | (((in @ (sK14 @ X4 @ X3) @ X4)) != $true))),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition])).
% 0.32/0.40 thf(f78,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i] : ((((in @ (sK14 @ X4 @ X3) @ X4)) != $true) | ($true = ((subset @ X3 @ X4)))) ) | ~spl15_2),
% 0.32/0.40 inference(avatar_component_clause,[],[f77])).
% 0.32/0.40 thf(f79,plain,(
% 0.32/0.40 ~spl15_1 | spl15_2),
% 0.32/0.40 inference(avatar_split_clause,[],[f67,f77,f73])).
% 0.32/0.40 thf(f81,definition,(
% 0.32/0.40 spl15_3 <=> (setextsub = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_3])],[avatar_definition])).
% 0.32/0.40 thf(f84,plain,(
% 0.32/0.40 spl15_3),
% 0.32/0.40 inference(avatar_split_clause,[],[f60,f81])).
% 0.32/0.40 thf(f85,plain,(
% 0.32/0.40 spl15_1),
% 0.32/0.40 inference(avatar_split_clause,[],[f63,f73])).
% 0.32/0.40 thf(f91,definition,(
% 0.32/0.40 spl15_5 <=> (binintersectRsub = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_5])],[avatar_definition])).
% 0.32/0.40 thf(f96,definition,(
% 0.32/0.40 spl15_6 <=> (subsetE = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_6])],[avatar_definition])).
% 0.32/0.40 thf(f99,plain,(
% 0.32/0.40 spl15_6),
% 0.32/0.40 inference(avatar_split_clause,[],[f61,f96])).
% 0.32/0.40 thf(f106,definition,(
% 0.32/0.40 spl15_8 <=> ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((in @ X0 @ X2))) | (((subset @ X2 @ X1)) != $true) | ($true = ((in @ X0 @ X1))))),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_8])],[avatar_definition])).
% 0.32/0.40 thf(f107,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = ((in @ X0 @ X1))) | (((subset @ X2 @ X1)) != $true) | ($true != ((in @ X0 @ X2)))) ) | ~spl15_8),
% 0.32/0.40 inference(avatar_component_clause,[],[f106])).
% 0.32/0.40 thf(f108,plain,(
% 0.32/0.40 ~spl15_6 | spl15_8),
% 0.32/0.40 inference(avatar_split_clause,[],[f49,f106,f96])).
% 0.32/0.40 thf(f110,definition,(
% 0.32/0.40 spl15_9 <=> ! [X2 : $i,X3 : $i] : ((((subset @ X3 @ X2)) != $true) | ($true != ((subset @ X2 @ X3))) | (X2 = X3))),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_9])],[avatar_definition])).
% 0.32/0.40 thf(f111,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i] : (($true != ((subset @ X2 @ X3))) | (((subset @ X3 @ X2)) != $true) | (X2 = X3)) ) | ~spl15_9),
% 0.32/0.40 inference(avatar_component_clause,[],[f110])).
% 0.32/0.40 thf(f112,plain,(
% 0.32/0.40 spl15_9 | ~spl15_3),
% 0.32/0.40 inference(avatar_split_clause,[],[f56,f81,f110])).
% 0.32/0.40 thf(f114,definition,(
% 0.32/0.40 spl15_10 <=> (binintersectI = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_10])],[avatar_definition])).
% 0.32/0.40 thf(f117,plain,(
% 0.32/0.40 spl15_10),
% 0.32/0.40 inference(avatar_split_clause,[],[f66,f114])).
% 0.32/0.40 thf(f119,definition,(
% 0.32/0.40 spl15_11 <=> ! [X2 : $i,X3 : $i] : (((subset @ (binintersect @ X2 @ X3) @ X3)) = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_11])],[avatar_definition])).
% 0.32/0.40 thf(f120,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i] : ((((subset @ (binintersect @ X2 @ X3) @ X3)) = $true)) ) | ~spl15_11),
% 0.32/0.40 inference(avatar_component_clause,[],[f119])).
% 0.32/0.40 thf(f121,plain,(
% 0.32/0.40 spl15_11 | ~spl15_5),
% 0.32/0.40 inference(avatar_split_clause,[],[f50,f91,f119])).
% 0.32/0.40 thf(f123,definition,(
% 0.32/0.40 spl15_12 <=> (((subset @ sK10 @ sK11)) = $true)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_12])],[avatar_definition])).
% 0.32/0.40 thf(f125,plain,(
% 0.32/0.40 (((subset @ sK10 @ sK11)) = $true) | ~spl15_12),
% 0.32/0.40 inference(avatar_component_clause,[],[f123])).
% 0.32/0.40 thf(f126,plain,(
% 0.32/0.40 spl15_12),
% 0.32/0.40 inference(avatar_split_clause,[],[f64,f123])).
% 0.32/0.40 thf(f138,definition,(
% 0.32/0.40 spl15_15 <=> ! [X4 : $i,X5 : $i,X3 : $i] : (($true != ((in @ X3 @ X5))) | (((in @ X3 @ (binintersect @ X4 @ X5))) = $true) | (((in @ X3 @ X4)) != $true))),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_15])],[avatar_definition])).
% 0.32/0.40 thf(f139,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i,X5 : $i] : ((((in @ X3 @ (binintersect @ X4 @ X5))) = $true) | (((in @ X3 @ X4)) != $true) | ($true != ((in @ X3 @ X5)))) ) | ~spl15_15),
% 0.32/0.40 inference(avatar_component_clause,[],[f138])).
% 0.32/0.40 thf(f140,plain,(
% 0.32/0.40 spl15_15 | ~spl15_10),
% 0.32/0.40 inference(avatar_split_clause,[],[f52,f114,f138])).
% 0.32/0.40 thf(f151,definition,(
% 0.32/0.40 spl15_18 <=> (((binintersect @ sK11 @ sK10)) = sK10)),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_18])],[avatar_definition])).
% 0.32/0.40 thf(f153,plain,(
% 0.32/0.40 (((binintersect @ sK11 @ sK10)) != sK10) | spl15_18),
% 0.32/0.40 inference(avatar_component_clause,[],[f151])).
% 0.32/0.40 thf(f154,plain,(
% 0.32/0.40 ~spl15_18),
% 0.32/0.40 inference(avatar_split_clause,[],[f65,f151])).
% 0.32/0.40 thf(f156,definition,(
% 0.32/0.40 spl15_19 <=> ! [X4 : $i,X3 : $i] : (($true = ((subset @ X3 @ X4))) | ($true = ((in @ (sK14 @ X4 @ X3) @ X3))))),
% 0.32/0.40 introduced(definition,[new_symbols(definition,[spl15_19])],[avatar_definition])).
% 0.32/0.40 thf(f157,plain,(
% 0.32/0.40 ( ! [X3 : $i,X4 : $i] : (($true = ((in @ (sK14 @ X4 @ X3) @ X3))) | ($true = ((subset @ X3 @ X4)))) ) | ~spl15_19),
% 0.32/0.40 inference(avatar_component_clause,[],[f156])).
% 0.32/0.40 thf(f158,plain,(
% 0.32/0.40 spl15_19 | ~spl15_1),
% 0.32/0.40 inference(avatar_split_clause,[],[f68,f73,f156])).
% 0.32/0.40 thf(f189,plain,(
% 0.32/0.40 spl15_5),
% 0.32/0.40 inference(avatar_split_clause,[],[f62,f91])).
% 0.32/0.40 thf(f196,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : ((((subset @ X1 @ (binintersect @ X0 @ X1))) != $true) | (((binintersect @ X0 @ X1)) = X1) | ($true != $true)) ) | (~spl15_9 | ~spl15_11)),
% 0.32/0.40 inference(superposition,[],[f111,f120])).
% 0.32/0.40 thf(f198,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : ((((subset @ X1 @ (binintersect @ X0 @ X1))) != $true) | (((binintersect @ X0 @ X1)) = X1)) ) | (~spl15_9 | ~spl15_11)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f196])).
% 0.32/0.40 thf(f213,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true) | ($true != ((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X0))) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true)) ) | (~spl15_2 | ~spl15_15)),
% 0.32/0.40 inference(superposition,[],[f78,f139])).
% 0.32/0.40 thf(f214,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X0))) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_15)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f213])).
% 0.32/0.40 thf(f222,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((((subset @ X2 @ (binintersect @ X0 @ X1))) = $true) | ($true != $true) | ($true != ((subset @ X3 @ X0))) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X3)) != $true) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15)),
% 0.32/0.40 inference(superposition,[],[f214,f107])).
% 0.32/0.40 thf(f225,plain,(
% 0.32/0.40 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : ((((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X3)) != $true) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true) | ($true != ((subset @ X3 @ X0)))) ) | (~spl15_2 | ~spl15_8 | ~spl15_15)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f222])).
% 0.32/0.40 thf(f246,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true) | (((subset @ X2 @ X0)) != $true) | ($true != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(superposition,[],[f225,f157])).
% 0.32/0.40 thf(f251,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | (((subset @ X2 @ X0)) != $true) | (((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(duplicate_literal_removal,[],[f246])).
% 0.32/0.40 thf(f252,plain,(
% 0.32/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((in @ (sK14 @ (binintersect @ X0 @ X1) @ X2) @ X1)) != $true) | (((subset @ X2 @ X0)) != $true) | (((subset @ X2 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f251])).
% 0.32/0.40 thf(f310,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((subset @ X1 @ X0)) != $true) | (((subset @ X1 @ (binintersect @ X0 @ X1))) = $true) | (((subset @ X1 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(superposition,[],[f252,f157])).
% 0.32/0.40 thf(f315,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((subset @ X1 @ X0)) != $true) | (((subset @ X1 @ (binintersect @ X0 @ X1))) = $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(duplicate_literal_removal,[],[f310])).
% 0.32/0.40 thf(f316,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : ((((subset @ X1 @ (binintersect @ X0 @ X1))) = $true) | (((subset @ X1 @ X0)) != $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f315])).
% 0.32/0.40 thf(f405,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((binintersect @ X1 @ X0)) = X0) | (((subset @ X0 @ X1)) != $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(superposition,[],[f198,f316])).
% 0.32/0.40 thf(f411,plain,(
% 0.32/0.40 ( ! [X0 : $i,X1 : $i] : ((((binintersect @ X1 @ X0)) = X0) | (((subset @ X0 @ X1)) != $true)) ) | (~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_15 | ~spl15_19)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f405])).
% 0.32/0.40 thf(f462,plain,(
% 0.32/0.40 (sK10 != sK10) | (((subset @ sK10 @ sK11)) != $true) | (~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_15 | spl15_18 | ~spl15_19)),
% 0.32/0.40 inference(superposition,[],[f153,f411])).
% 0.32/0.40 thf(f492,plain,(
% 0.32/0.40 (((subset @ sK10 @ sK11)) != $true) | (~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_15 | spl15_18 | ~spl15_19)),
% 0.32/0.40 inference(trivial_inequality_removal,[],[f462])).
% 0.32/0.40 thf(f496,plain,(
% 0.32/0.40 $false | (~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_12 | ~spl15_15 | spl15_18 | ~spl15_19)),
% 0.32/0.40 inference(forward_subsumption_resolution,[],[f492,f125])).
% 0.32/0.40 thf(f497,plain,(
% 0.32/0.40 ~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_12 | ~spl15_15 | spl15_18 | ~spl15_19),
% 0.32/0.40 inference(avatar_contradiction_clause,[],[f496])).
% 0.32/0.40 cnf(s1, plain, ~spl15_1 | spl15_2, inference(sat_conversion,[],[f79])).
% 0.32/0.40 cnf(s2, plain, spl15_3, inference(sat_conversion,[],[f84])).
% 0.32/0.40 cnf(s3, plain, spl15_1, inference(sat_conversion,[],[f85])).
% 0.32/0.40 cnf(s5, plain, spl15_6, inference(sat_conversion,[],[f99])).
% 0.32/0.40 cnf(s7, plain, ~spl15_6 | spl15_8, inference(sat_conversion,[],[f108])).
% 0.32/0.40 cnf(s8, plain, ~spl15_3 | spl15_9, inference(sat_conversion,[],[f112])).
% 0.32/0.40 cnf(s9, plain, spl15_10, inference(sat_conversion,[],[f117])).
% 0.32/0.40 cnf(s10, plain, ~spl15_5 | spl15_11, inference(sat_conversion,[],[f121])).
% 0.32/0.40 cnf(s11, plain, spl15_12, inference(sat_conversion,[],[f126])).
% 0.32/0.40 cnf(s14, plain, ~spl15_10 | spl15_15, inference(sat_conversion,[],[f140])).
% 0.32/0.40 cnf(s17, plain, ~spl15_18, inference(sat_conversion,[],[f154])).
% 0.32/0.40 cnf(s18, plain, ~spl15_1 | spl15_19, inference(sat_conversion,[],[f158])).
% 0.32/0.40 cnf(s25, plain, spl15_5, inference(sat_conversion,[],[f189])).
% 0.32/0.40 cnf(s27, plain, ~spl15_2 | ~spl15_8 | ~spl15_9 | ~spl15_11 | ~spl15_12 | ~spl15_15 | spl15_18 | ~spl15_19, inference(sat_conversion,[],[f497])).
% 0.32/0.40 cnf(s28, plain, spl15_11, inference(rat,[],[s10,s25])).
% 0.32/0.40 cnf(s29, plain, spl15_15, inference(rat,[],[s14,s9])).
% 0.32/0.40 cnf(s30, plain, spl15_8, inference(rat,[],[s7,s5])).
% 0.32/0.40 cnf(s31, plain, spl15_19, inference(rat,[],[s18,s3])).
% 0.32/0.40 cnf(s32, plain, spl15_9, inference(rat,[],[s8,s2])).
% 0.32/0.40 cnf(s33, plain, ~spl15_2, inference(rat,[],[s27,s31,s17,s29,s11,s28,s30,s32])).
% 0.32/0.40 cnf(s34, plain, $false, inference(rat,[],[s1,s33,s3])).
% 0.32/0.40 thf(f501,plain,(
% 0.32/0.40 $false),
% 0.32/0.40 inference(avatar_sat_refutation,[],[s34])).
% 0.32/0.40 % SZS output end Proof for theBenchmark
% 0.32/0.40 % (1325386)------------------------------
% 0.32/0.40 % (1325386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.40 % (1325386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.40 % (1325386)CaDiCaL version: 2.1.3
% 0.32/0.40 % (1325386)Termination reason: Refutation
% 0.32/0.40 % (1325386)Time elapsed: 0.025 s
% 0.32/0.40 % (1325386)Peak memory usage: 13 MB
% 0.32/0.40 % (1325386)Instructions burned: 48 (million)
% 0.32/0.40 % (1325378)Success in time 0.06 s
% 0.32/0.40 % Vampire exiting
%------------------------------------------------------------------------------